On Coverage and Capacity for Disaster Area Wireless Networks Using Mobile Relays

<p/< <p<Public safety organizations increasingly rely on wireless technology to provide effective communications during emergency and disaster response operations. This paper presents a comprehensive study on dynamic placement of relay nodes (RNs) in a disaster area wireless network. It...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Guo Wenxuan [verfasserIn] Huang Xinming [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2009

Übergeordnetes Werk:	In: EURASIP Journal on Wireless Communications and Networking - SpringerOpen, 2004, (2009), 1, p 251314
Übergeordnetes Werk:	year:2009 ; number:1, p 251314

Links:	Link aufrufen Link aufrufen Journal toc Journal toc

Katalog-ID:	DOAJ011912995

Internformat


LEADER	01000caa a22002652 4500
001	DOAJ011912995
003	DE-627
005	20230310041008.0
007	cr uuu---uuuuu
008	230225s2009 xx \|\|\|\|\|o 00\| \|\|eng c
035			\|a (DE-627)DOAJ011912995
035			\|a (DE-599)DOAJ0fefe5a0f206429da2de8fd758e01b05
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
050		0	\|a TK5101-6720
050		0	\|a TK7800-8360
100	0		\|a Guo Wenxuan \|e verfasserin \|4 aut
245	1	0	\|a On Coverage and Capacity for Disaster Area Wireless Networks Using Mobile Relays
264		1	\|c 2009
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a <p/< <p<Public safety organizations increasingly rely on wireless technology to provide effective communications during emergency and disaster response operations. This paper presents a comprehensive study on dynamic placement of relay nodes (RNs) in a disaster area wireless network. It is based on our prior work of mobility model that characterizes the spatial movement of the first responders as mobile nodes (MNs) during their operations. We first investigate the COverage-oriented Relay Placement (CORP) problem that is to maximize the total number of MNs connected with the relays. Considering the network throughput, we then study the CApacity-oriented Relay Placement (CARP) problem that is to maximize the aggregated data rate of all MNs. For both coverage and capacity studies, we provide each the optimal and the greedy algorithms with computational complexity analysis. Furthermore, simulation results are presented to compare the performance between the greedy and the optimal solutions for the CORP and CARP problems, respectively. It is shown that the greedy algorithms can achieve near optimal performance but at significantly lower computational complexity.</p<
653		0	\|a Telecommunication
653		0	\|a Electronics
700	0		\|a Huang Xinming \|e verfasserin \|4 aut
773	0	8	\|i In \|t EURASIP Journal on Wireless Communications and Networking \|d SpringerOpen, 2004 \|g (2009), 1, p 251314 \|w (DE-627)47265151X \|w (DE-600)2168613-0 \|x 16871499 \|7 nnns
773	1	8	\|g year:2009 \|g number:1, p 251314
856	4	0	\|u https://doaj.org/article/0fefe5a0f206429da2de8fd758e01b05 \|z kostenfrei
856	4	0	\|u http://jwcn.eurasipjournals.com/content/2009/251314 \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/1687-1472 \|y Journal toc \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/1687-1499 \|y Journal toc \|z kostenfrei
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_DOAJ
912			\|a GBV_ILN_11
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_39
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_95
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_151
912			\|a GBV_ILN_161
912			\|a GBV_ILN_170
912			\|a GBV_ILN_206
912			\|a GBV_ILN_213
912			\|a GBV_ILN_230
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_702
912			\|a GBV_ILN_2001
912			\|a GBV_ILN_2003
912			\|a GBV_ILN_2005
912			\|a GBV_ILN_2006
912			\|a GBV_ILN_2008
912			\|a GBV_ILN_2009
912			\|a GBV_ILN_2010
912			\|a GBV_ILN_2011
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_2015
912			\|a GBV_ILN_2020
912			\|a GBV_ILN_2021
912			\|a GBV_ILN_2025
912			\|a GBV_ILN_2031
912			\|a GBV_ILN_2038
912			\|a GBV_ILN_2044
912			\|a GBV_ILN_2048
912			\|a GBV_ILN_2050
912			\|a GBV_ILN_2055
912			\|a GBV_ILN_2056
912			\|a GBV_ILN_2057
912			\|a GBV_ILN_2061
912			\|a GBV_ILN_2108
912			\|a GBV_ILN_2111
912			\|a GBV_ILN_2113
912			\|a GBV_ILN_2119
912			\|a GBV_ILN_2190
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4326
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4700
951			\|a AR
952			\|j 2009 \|e 1, p 251314

Indexfelder

author_variant	g w gw h x hx
matchkey_str	article:16871499:2009----::noeaencpctfriatrraieesewr
hierarchy_sort_str	2009
callnumber-subject-code	TK
publishDate	2009
allfields	(DE-627)DOAJ011912995 (DE-599)DOAJ0fefe5a0f206429da2de8fd758e01b05 DE-627 ger DE-627 rakwb eng TK5101-6720 TK7800-8360 Guo Wenxuan verfasserin aut On Coverage and Capacity for Disaster Area Wireless Networks Using Mobile Relays 2009 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier <p/< <p<Public safety organizations increasingly rely on wireless technology to provide effective communications during emergency and disaster response operations. This paper presents a comprehensive study on dynamic placement of relay nodes (RNs) in a disaster area wireless network. It is based on our prior work of mobility model that characterizes the spatial movement of the first responders as mobile nodes (MNs) during their operations. We first investigate the COverage-oriented Relay Placement (CORP) problem that is to maximize the total number of MNs connected with the relays. Considering the network throughput, we then study the CApacity-oriented Relay Placement (CARP) problem that is to maximize the aggregated data rate of all MNs. For both coverage and capacity studies, we provide each the optimal and the greedy algorithms with computational complexity analysis. Furthermore, simulation results are presented to compare the performance between the greedy and the optimal solutions for the CORP and CARP problems, respectively. It is shown that the greedy algorithms can achieve near optimal performance but at significantly lower computational complexity.</p< Telecommunication Electronics Huang Xinming verfasserin aut In EURASIP Journal on Wireless Communications and Networking SpringerOpen, 2004 (2009), 1, p 251314 (DE-627)47265151X (DE-600)2168613-0 16871499 nnns year:2009 number:1, p 251314 https://doaj.org/article/0fefe5a0f206429da2de8fd758e01b05 kostenfrei http://jwcn.eurasipjournals.com/content/2009/251314 kostenfrei https://doaj.org/toc/1687-1472 Journal toc kostenfrei https://doaj.org/toc/1687-1499 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2031 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2061 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2113 GBV_ILN_2119 GBV_ILN_2190 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2009 1, p 251314
spelling	(DE-627)DOAJ011912995 (DE-599)DOAJ0fefe5a0f206429da2de8fd758e01b05 DE-627 ger DE-627 rakwb eng TK5101-6720 TK7800-8360 Guo Wenxuan verfasserin aut On Coverage and Capacity for Disaster Area Wireless Networks Using Mobile Relays 2009 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier <p/< <p<Public safety organizations increasingly rely on wireless technology to provide effective communications during emergency and disaster response operations. This paper presents a comprehensive study on dynamic placement of relay nodes (RNs) in a disaster area wireless network. It is based on our prior work of mobility model that characterizes the spatial movement of the first responders as mobile nodes (MNs) during their operations. We first investigate the COverage-oriented Relay Placement (CORP) problem that is to maximize the total number of MNs connected with the relays. Considering the network throughput, we then study the CApacity-oriented Relay Placement (CARP) problem that is to maximize the aggregated data rate of all MNs. For both coverage and capacity studies, we provide each the optimal and the greedy algorithms with computational complexity analysis. Furthermore, simulation results are presented to compare the performance between the greedy and the optimal solutions for the CORP and CARP problems, respectively. It is shown that the greedy algorithms can achieve near optimal performance but at significantly lower computational complexity.</p< Telecommunication Electronics Huang Xinming verfasserin aut In EURASIP Journal on Wireless Communications and Networking SpringerOpen, 2004 (2009), 1, p 251314 (DE-627)47265151X (DE-600)2168613-0 16871499 nnns year:2009 number:1, p 251314 https://doaj.org/article/0fefe5a0f206429da2de8fd758e01b05 kostenfrei http://jwcn.eurasipjournals.com/content/2009/251314 kostenfrei https://doaj.org/toc/1687-1472 Journal toc kostenfrei https://doaj.org/toc/1687-1499 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2031 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2061 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2113 GBV_ILN_2119 GBV_ILN_2190 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2009 1, p 251314
allfields_unstemmed	(DE-627)DOAJ011912995 (DE-599)DOAJ0fefe5a0f206429da2de8fd758e01b05 DE-627 ger DE-627 rakwb eng TK5101-6720 TK7800-8360 Guo Wenxuan verfasserin aut On Coverage and Capacity for Disaster Area Wireless Networks Using Mobile Relays 2009 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier <p/< <p<Public safety organizations increasingly rely on wireless technology to provide effective communications during emergency and disaster response operations. This paper presents a comprehensive study on dynamic placement of relay nodes (RNs) in a disaster area wireless network. It is based on our prior work of mobility model that characterizes the spatial movement of the first responders as mobile nodes (MNs) during their operations. We first investigate the COverage-oriented Relay Placement (CORP) problem that is to maximize the total number of MNs connected with the relays. Considering the network throughput, we then study the CApacity-oriented Relay Placement (CARP) problem that is to maximize the aggregated data rate of all MNs. For both coverage and capacity studies, we provide each the optimal and the greedy algorithms with computational complexity analysis. Furthermore, simulation results are presented to compare the performance between the greedy and the optimal solutions for the CORP and CARP problems, respectively. It is shown that the greedy algorithms can achieve near optimal performance but at significantly lower computational complexity.</p< Telecommunication Electronics Huang Xinming verfasserin aut In EURASIP Journal on Wireless Communications and Networking SpringerOpen, 2004 (2009), 1, p 251314 (DE-627)47265151X (DE-600)2168613-0 16871499 nnns year:2009 number:1, p 251314 https://doaj.org/article/0fefe5a0f206429da2de8fd758e01b05 kostenfrei http://jwcn.eurasipjournals.com/content/2009/251314 kostenfrei https://doaj.org/toc/1687-1472 Journal toc kostenfrei https://doaj.org/toc/1687-1499 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2031 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2061 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2113 GBV_ILN_2119 GBV_ILN_2190 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2009 1, p 251314
allfieldsGer	(DE-627)DOAJ011912995 (DE-599)DOAJ0fefe5a0f206429da2de8fd758e01b05 DE-627 ger DE-627 rakwb eng TK5101-6720 TK7800-8360 Guo Wenxuan verfasserin aut On Coverage and Capacity for Disaster Area Wireless Networks Using Mobile Relays 2009 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier <p/< <p<Public safety organizations increasingly rely on wireless technology to provide effective communications during emergency and disaster response operations. This paper presents a comprehensive study on dynamic placement of relay nodes (RNs) in a disaster area wireless network. It is based on our prior work of mobility model that characterizes the spatial movement of the first responders as mobile nodes (MNs) during their operations. We first investigate the COverage-oriented Relay Placement (CORP) problem that is to maximize the total number of MNs connected with the relays. Considering the network throughput, we then study the CApacity-oriented Relay Placement (CARP) problem that is to maximize the aggregated data rate of all MNs. For both coverage and capacity studies, we provide each the optimal and the greedy algorithms with computational complexity analysis. Furthermore, simulation results are presented to compare the performance between the greedy and the optimal solutions for the CORP and CARP problems, respectively. It is shown that the greedy algorithms can achieve near optimal performance but at significantly lower computational complexity.</p< Telecommunication Electronics Huang Xinming verfasserin aut In EURASIP Journal on Wireless Communications and Networking SpringerOpen, 2004 (2009), 1, p 251314 (DE-627)47265151X (DE-600)2168613-0 16871499 nnns year:2009 number:1, p 251314 https://doaj.org/article/0fefe5a0f206429da2de8fd758e01b05 kostenfrei http://jwcn.eurasipjournals.com/content/2009/251314 kostenfrei https://doaj.org/toc/1687-1472 Journal toc kostenfrei https://doaj.org/toc/1687-1499 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2031 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2061 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2113 GBV_ILN_2119 GBV_ILN_2190 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2009 1, p 251314
allfieldsSound	(DE-627)DOAJ011912995 (DE-599)DOAJ0fefe5a0f206429da2de8fd758e01b05 DE-627 ger DE-627 rakwb eng TK5101-6720 TK7800-8360 Guo Wenxuan verfasserin aut On Coverage and Capacity for Disaster Area Wireless Networks Using Mobile Relays 2009 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier <p/< <p<Public safety organizations increasingly rely on wireless technology to provide effective communications during emergency and disaster response operations. This paper presents a comprehensive study on dynamic placement of relay nodes (RNs) in a disaster area wireless network. It is based on our prior work of mobility model that characterizes the spatial movement of the first responders as mobile nodes (MNs) during their operations. We first investigate the COverage-oriented Relay Placement (CORP) problem that is to maximize the total number of MNs connected with the relays. Considering the network throughput, we then study the CApacity-oriented Relay Placement (CARP) problem that is to maximize the aggregated data rate of all MNs. For both coverage and capacity studies, we provide each the optimal and the greedy algorithms with computational complexity analysis. Furthermore, simulation results are presented to compare the performance between the greedy and the optimal solutions for the CORP and CARP problems, respectively. It is shown that the greedy algorithms can achieve near optimal performance but at significantly lower computational complexity.</p< Telecommunication Electronics Huang Xinming verfasserin aut In EURASIP Journal on Wireless Communications and Networking SpringerOpen, 2004 (2009), 1, p 251314 (DE-627)47265151X (DE-600)2168613-0 16871499 nnns year:2009 number:1, p 251314 https://doaj.org/article/0fefe5a0f206429da2de8fd758e01b05 kostenfrei http://jwcn.eurasipjournals.com/content/2009/251314 kostenfrei https://doaj.org/toc/1687-1472 Journal toc kostenfrei https://doaj.org/toc/1687-1499 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2031 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2061 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2113 GBV_ILN_2119 GBV_ILN_2190 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2009 1, p 251314
language	English
source	In EURASIP Journal on Wireless Communications and Networking (2009), 1, p 251314 year:2009 number:1, p 251314
sourceStr	In EURASIP Journal on Wireless Communications and Networking (2009), 1, p 251314 year:2009 number:1, p 251314
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	Telecommunication Electronics
isfreeaccess_bool	true
container_title	EURASIP Journal on Wireless Communications and Networking
authorswithroles_txt_mv	Guo Wenxuan @@aut@@ Huang Xinming @@aut@@
publishDateDaySort_date	2009-01-01T00:00:00Z
hierarchy_top_id	47265151X
id	DOAJ011912995
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ011912995</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230310041008.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230225s2009 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ011912995</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ0fefe5a0f206429da2de8fd758e01b05</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK5101-6720</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK7800-8360</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Guo Wenxuan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On Coverage and Capacity for Disaster Area Wireless Networks Using Mobile Relays</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2009</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a"><p/< <p<Public safety organizations increasingly rely on wireless technology to provide effective communications during emergency and disaster response operations. This paper presents a comprehensive study on dynamic placement of relay nodes (RNs) in a disaster area wireless network. It is based on our prior work of mobility model that characterizes the spatial movement of the first responders as mobile nodes (MNs) during their operations. We first investigate the COverage-oriented Relay Placement (CORP) problem that is to maximize the total number of MNs connected with the relays. Considering the network throughput, we then study the CApacity-oriented Relay Placement (CARP) problem that is to maximize the aggregated data rate of all MNs. For both coverage and capacity studies, we provide each the optimal and the greedy algorithms with computational complexity analysis. Furthermore, simulation results are presented to compare the performance between the greedy and the optimal solutions for the CORP and CARP problems, respectively. It is shown that the greedy algorithms can achieve near optimal performance but at significantly lower computational complexity.</p<</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Telecommunication</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electronics</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Huang Xinming</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">EURASIP Journal on Wireless Communications and Networking</subfield><subfield code="d">SpringerOpen, 2004</subfield><subfield code="g">(2009), 1, p 251314</subfield><subfield code="w">(DE-627)47265151X</subfield><subfield code="w">(DE-600)2168613-0</subfield><subfield code="x">16871499</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">year:2009</subfield><subfield code="g">number:1, p 251314</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/0fefe5a0f206429da2de8fd758e01b05</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://jwcn.eurasipjournals.com/content/2009/251314</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1687-1472</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1687-1499</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2031</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2119</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="j">2009</subfield><subfield code="e">1, p 251314</subfield></datafield></record></collection>
callnumber-first	T - Technology
author	Guo Wenxuan
spellingShingle	Guo Wenxuan misc TK5101-6720 misc TK7800-8360 misc Telecommunication misc Electronics On Coverage and Capacity for Disaster Area Wireless Networks Using Mobile Relays
authorStr	Guo Wenxuan
ppnlink_with_tag_str_mv	@@773@@(DE-627)47265151X
format	electronic Article
delete_txt_mv	keep
author_role	aut aut
collection	DOAJ
remote_str	true
callnumber-label	TK5101-6720
illustrated	Not Illustrated
issn	16871499
topic_title	TK5101-6720 TK7800-8360 On Coverage and Capacity for Disaster Area Wireless Networks Using Mobile Relays
topic	misc TK5101-6720 misc TK7800-8360 misc Telecommunication misc Electronics
topic_unstemmed	misc TK5101-6720 misc TK7800-8360 misc Telecommunication misc Electronics
topic_browse	misc TK5101-6720 misc TK7800-8360 misc Telecommunication misc Electronics
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	EURASIP Journal on Wireless Communications and Networking
hierarchy_parent_id	47265151X
hierarchy_top_title	EURASIP Journal on Wireless Communications and Networking
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)47265151X (DE-600)2168613-0
title	On Coverage and Capacity for Disaster Area Wireless Networks Using Mobile Relays
ctrlnum	(DE-627)DOAJ011912995 (DE-599)DOAJ0fefe5a0f206429da2de8fd758e01b05
title_full	On Coverage and Capacity for Disaster Area Wireless Networks Using Mobile Relays
author_sort	Guo Wenxuan
journal	EURASIP Journal on Wireless Communications and Networking
journalStr	EURASIP Journal on Wireless Communications and Networking
callnumber-first-code	T
lang_code	eng
isOA_bool	true
recordtype	marc
publishDateSort	2009
contenttype_str_mv	txt
author_browse	Guo Wenxuan Huang Xinming
class	TK5101-6720 TK7800-8360
format_se	Elektronische Aufsätze
author-letter	Guo Wenxuan
author2-role	verfasserin
title_sort	on coverage and capacity for disaster area wireless networks using mobile relays
callnumber	TK5101-6720
title_auth	On Coverage and Capacity for Disaster Area Wireless Networks Using Mobile Relays
abstract	<p/< <p<Public safety organizations increasingly rely on wireless technology to provide effective communications during emergency and disaster response operations. This paper presents a comprehensive study on dynamic placement of relay nodes (RNs) in a disaster area wireless network. It is based on our prior work of mobility model that characterizes the spatial movement of the first responders as mobile nodes (MNs) during their operations. We first investigate the COverage-oriented Relay Placement (CORP) problem that is to maximize the total number of MNs connected with the relays. Considering the network throughput, we then study the CApacity-oriented Relay Placement (CARP) problem that is to maximize the aggregated data rate of all MNs. For both coverage and capacity studies, we provide each the optimal and the greedy algorithms with computational complexity analysis. Furthermore, simulation results are presented to compare the performance between the greedy and the optimal solutions for the CORP and CARP problems, respectively. It is shown that the greedy algorithms can achieve near optimal performance but at significantly lower computational complexity.</p<
abstractGer	<p/< <p<Public safety organizations increasingly rely on wireless technology to provide effective communications during emergency and disaster response operations. This paper presents a comprehensive study on dynamic placement of relay nodes (RNs) in a disaster area wireless network. It is based on our prior work of mobility model that characterizes the spatial movement of the first responders as mobile nodes (MNs) during their operations. We first investigate the COverage-oriented Relay Placement (CORP) problem that is to maximize the total number of MNs connected with the relays. Considering the network throughput, we then study the CApacity-oriented Relay Placement (CARP) problem that is to maximize the aggregated data rate of all MNs. For both coverage and capacity studies, we provide each the optimal and the greedy algorithms with computational complexity analysis. Furthermore, simulation results are presented to compare the performance between the greedy and the optimal solutions for the CORP and CARP problems, respectively. It is shown that the greedy algorithms can achieve near optimal performance but at significantly lower computational complexity.</p<
abstract_unstemmed	<p/< <p<Public safety organizations increasingly rely on wireless technology to provide effective communications during emergency and disaster response operations. This paper presents a comprehensive study on dynamic placement of relay nodes (RNs) in a disaster area wireless network. It is based on our prior work of mobility model that characterizes the spatial movement of the first responders as mobile nodes (MNs) during their operations. We first investigate the COverage-oriented Relay Placement (CORP) problem that is to maximize the total number of MNs connected with the relays. Considering the network throughput, we then study the CApacity-oriented Relay Placement (CARP) problem that is to maximize the aggregated data rate of all MNs. For both coverage and capacity studies, we provide each the optimal and the greedy algorithms with computational complexity analysis. Furthermore, simulation results are presented to compare the performance between the greedy and the optimal solutions for the CORP and CARP problems, respectively. It is shown that the greedy algorithms can achieve near optimal performance but at significantly lower computational complexity.</p<
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2031 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2061 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2113 GBV_ILN_2119 GBV_ILN_2190 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700
container_issue	1, p 251314
title_short	On Coverage and Capacity for Disaster Area Wireless Networks Using Mobile Relays
url	https://doaj.org/article/0fefe5a0f206429da2de8fd758e01b05 http://jwcn.eurasipjournals.com/content/2009/251314 https://doaj.org/toc/1687-1472 https://doaj.org/toc/1687-1499
remote_bool	true
author2	Huang Xinming
author2Str	Huang Xinming
ppnlink	47265151X
callnumber-subject	TK - Electrical and Nuclear Engineering
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
callnumber-a	TK5101-6720
up_date	2024-07-03T22:51:26.063Z
_version_	1803600093315596288
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ011912995</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230310041008.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230225s2009 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ011912995</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ0fefe5a0f206429da2de8fd758e01b05</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK5101-6720</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK7800-8360</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Guo Wenxuan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On Coverage and Capacity for Disaster Area Wireless Networks Using Mobile Relays</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2009</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a"><p/< <p<Public safety organizations increasingly rely on wireless technology to provide effective communications during emergency and disaster response operations. This paper presents a comprehensive study on dynamic placement of relay nodes (RNs) in a disaster area wireless network. It is based on our prior work of mobility model that characterizes the spatial movement of the first responders as mobile nodes (MNs) during their operations. We first investigate the COverage-oriented Relay Placement (CORP) problem that is to maximize the total number of MNs connected with the relays. Considering the network throughput, we then study the CApacity-oriented Relay Placement (CARP) problem that is to maximize the aggregated data rate of all MNs. For both coverage and capacity studies, we provide each the optimal and the greedy algorithms with computational complexity analysis. Furthermore, simulation results are presented to compare the performance between the greedy and the optimal solutions for the CORP and CARP problems, respectively. It is shown that the greedy algorithms can achieve near optimal performance but at significantly lower computational complexity.</p<</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Telecommunication</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electronics</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Huang Xinming</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">EURASIP Journal on Wireless Communications and Networking</subfield><subfield code="d">SpringerOpen, 2004</subfield><subfield code="g">(2009), 1, p 251314</subfield><subfield code="w">(DE-627)47265151X</subfield><subfield code="w">(DE-600)2168613-0</subfield><subfield code="x">16871499</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">year:2009</subfield><subfield code="g">number:1, p 251314</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/0fefe5a0f206429da2de8fd758e01b05</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://jwcn.eurasipjournals.com/content/2009/251314</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1687-1472</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1687-1499</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2031</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2119</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="j">2009</subfield><subfield code="e">1, p 251314</subfield></datafield></record></collection>
score	7.401785

Nicht das Richtige dabei?

Schreiben Sie uns!

On Coverage and Capacity for Disaster Area Wireless Networks Using Mobile Relays

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?