Proposal and Its Evaluation of Neighbors Based Routing for ad hoc networks

In ad hoc networks, due to the mobility of nodes, communication links are unstable and restricted. As such, an efficient routing protocol is needed in order to solve these problems. In the present paper, we propose a neighbors based routing (NBR) protocol by constructing paths in an area in which a...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Kentaro Aburada [verfasserIn] Hisaaki Yamaba [verfasserIn] Shinichiro Kubota [verfasserIn] Tetsuro Katayama [verfasserIn] Mirang Park [verfasserIn] Naonobu Okazaki [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2015

Schlagwörter:	Ad hoc networks Routing Protocol Route Repair AODV-BR

Übergeordnetes Werk:	In: Journal of Robotics, Networking and Artificial Life (JRNAL) - Atlantis Press, 2017, 2(2015), 2
Übergeordnetes Werk:	volume:2 ; year:2015 ; number:2

Links:	Link aufrufen Link aufrufen Link aufrufen Journal toc

DOI / URN:	10.2991/jrnal.2015.2.2.12

Katalog-ID:	DOAJ060339721

Internformat


LEADER	01000caa a22002652 4500
001	DOAJ060339721
003	DE-627
005	20230502155639.0
007	cr uuu---uuuuu
008	230228s2015 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.2991/jrnal.2015.2.2.12 \|2 doi
035			\|a (DE-627)DOAJ060339721
035			\|a (DE-599)DOAJ63a97e79e735401cb2e4b721c0d626db
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
100	0		\|a Kentaro Aburada \|e verfasserin \|4 aut
245	1	0	\|a Proposal and Its Evaluation of Neighbors Based Routing for ad hoc networks
264		1	\|c 2015
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a In ad hoc networks, due to the mobility of nodes, communication links are unstable and restricted. As such, an efficient routing protocol is needed in order to solve these problems. In the present paper, we propose a neighbors based routing (NBR) protocol by constructing paths in an area in which a large number of nodes exists. Simulations confirm that the proposed protocol has higher connectivity and a lower control overhead than existing protocols in topologies in which nodes move.
650		4	\|a Ad hoc networks
650		4	\|a Routing Protocol
650		4	\|a Route Repair
650		4	\|a AODV-BR
653		0	\|a Technology
653		0	\|a T
700	0		\|a Hisaaki Yamaba \|e verfasserin \|4 aut
700	0		\|a Shinichiro Kubota \|e verfasserin \|4 aut
700	0		\|a Tetsuro Katayama \|e verfasserin \|4 aut
700	0		\|a Mirang Park \|e verfasserin \|4 aut
700	0		\|a Naonobu Okazaki \|e verfasserin \|4 aut
773	0	8	\|i In \|t Journal of Robotics, Networking and Artificial Life (JRNAL) \|d Atlantis Press, 2017 \|g 2(2015), 2 \|w (DE-627)1005552487 \|x 23526386 \|7 nnns
773	1	8	\|g volume:2 \|g year:2015 \|g number:2
856	4	0	\|u https://doi.org/10.2991/jrnal.2015.2.2.12 \|z kostenfrei
856	4	0	\|u https://doaj.org/article/63a97e79e735401cb2e4b721c0d626db \|z kostenfrei
856	4	0	\|u https://www.atlantis-press.com/article/25840.pdf \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/2352-6386 \|y Journal toc \|z kostenfrei
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_DOAJ
912			\|a SSG-OLC-PHA
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_31
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_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_2014
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			\|d 2 \|j 2015 \|e 2

Indexfelder

author_variant	k a ka h y hy s k sk t k tk m p mp n o no
matchkey_str	article:23526386:2015----::rpslnisvlainfegbrbsdot
hierarchy_sort_str	2015
publishDate	2015
allfields	10.2991/jrnal.2015.2.2.12 doi (DE-627)DOAJ060339721 (DE-599)DOAJ63a97e79e735401cb2e4b721c0d626db DE-627 ger DE-627 rakwb eng Kentaro Aburada verfasserin aut Proposal and Its Evaluation of Neighbors Based Routing for ad hoc networks 2015 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In ad hoc networks, due to the mobility of nodes, communication links are unstable and restricted. As such, an efficient routing protocol is needed in order to solve these problems. In the present paper, we propose a neighbors based routing (NBR) protocol by constructing paths in an area in which a large number of nodes exists. Simulations confirm that the proposed protocol has higher connectivity and a lower control overhead than existing protocols in topologies in which nodes move. Ad hoc networks Routing Protocol Route Repair AODV-BR Technology T Hisaaki Yamaba verfasserin aut Shinichiro Kubota verfasserin aut Tetsuro Katayama verfasserin aut Mirang Park verfasserin aut Naonobu Okazaki verfasserin aut In Journal of Robotics, Networking and Artificial Life (JRNAL) Atlantis Press, 2017 2(2015), 2 (DE-627)1005552487 23526386 nnns volume:2 year:2015 number:2 https://doi.org/10.2991/jrnal.2015.2.2.12 kostenfrei https://doaj.org/article/63a97e79e735401cb2e4b721c0d626db kostenfrei https://www.atlantis-press.com/article/25840.pdf kostenfrei https://doaj.org/toc/2352-6386 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 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_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 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 2 2015 2
spelling	10.2991/jrnal.2015.2.2.12 doi (DE-627)DOAJ060339721 (DE-599)DOAJ63a97e79e735401cb2e4b721c0d626db DE-627 ger DE-627 rakwb eng Kentaro Aburada verfasserin aut Proposal and Its Evaluation of Neighbors Based Routing for ad hoc networks 2015 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In ad hoc networks, due to the mobility of nodes, communication links are unstable and restricted. As such, an efficient routing protocol is needed in order to solve these problems. In the present paper, we propose a neighbors based routing (NBR) protocol by constructing paths in an area in which a large number of nodes exists. Simulations confirm that the proposed protocol has higher connectivity and a lower control overhead than existing protocols in topologies in which nodes move. Ad hoc networks Routing Protocol Route Repair AODV-BR Technology T Hisaaki Yamaba verfasserin aut Shinichiro Kubota verfasserin aut Tetsuro Katayama verfasserin aut Mirang Park verfasserin aut Naonobu Okazaki verfasserin aut In Journal of Robotics, Networking and Artificial Life (JRNAL) Atlantis Press, 2017 2(2015), 2 (DE-627)1005552487 23526386 nnns volume:2 year:2015 number:2 https://doi.org/10.2991/jrnal.2015.2.2.12 kostenfrei https://doaj.org/article/63a97e79e735401cb2e4b721c0d626db kostenfrei https://www.atlantis-press.com/article/25840.pdf kostenfrei https://doaj.org/toc/2352-6386 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 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_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 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 2 2015 2
allfields_unstemmed	10.2991/jrnal.2015.2.2.12 doi (DE-627)DOAJ060339721 (DE-599)DOAJ63a97e79e735401cb2e4b721c0d626db DE-627 ger DE-627 rakwb eng Kentaro Aburada verfasserin aut Proposal and Its Evaluation of Neighbors Based Routing for ad hoc networks 2015 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In ad hoc networks, due to the mobility of nodes, communication links are unstable and restricted. As such, an efficient routing protocol is needed in order to solve these problems. In the present paper, we propose a neighbors based routing (NBR) protocol by constructing paths in an area in which a large number of nodes exists. Simulations confirm that the proposed protocol has higher connectivity and a lower control overhead than existing protocols in topologies in which nodes move. Ad hoc networks Routing Protocol Route Repair AODV-BR Technology T Hisaaki Yamaba verfasserin aut Shinichiro Kubota verfasserin aut Tetsuro Katayama verfasserin aut Mirang Park verfasserin aut Naonobu Okazaki verfasserin aut In Journal of Robotics, Networking and Artificial Life (JRNAL) Atlantis Press, 2017 2(2015), 2 (DE-627)1005552487 23526386 nnns volume:2 year:2015 number:2 https://doi.org/10.2991/jrnal.2015.2.2.12 kostenfrei https://doaj.org/article/63a97e79e735401cb2e4b721c0d626db kostenfrei https://www.atlantis-press.com/article/25840.pdf kostenfrei https://doaj.org/toc/2352-6386 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 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_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 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 2 2015 2
allfieldsGer	10.2991/jrnal.2015.2.2.12 doi (DE-627)DOAJ060339721 (DE-599)DOAJ63a97e79e735401cb2e4b721c0d626db DE-627 ger DE-627 rakwb eng Kentaro Aburada verfasserin aut Proposal and Its Evaluation of Neighbors Based Routing for ad hoc networks 2015 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In ad hoc networks, due to the mobility of nodes, communication links are unstable and restricted. As such, an efficient routing protocol is needed in order to solve these problems. In the present paper, we propose a neighbors based routing (NBR) protocol by constructing paths in an area in which a large number of nodes exists. Simulations confirm that the proposed protocol has higher connectivity and a lower control overhead than existing protocols in topologies in which nodes move. Ad hoc networks Routing Protocol Route Repair AODV-BR Technology T Hisaaki Yamaba verfasserin aut Shinichiro Kubota verfasserin aut Tetsuro Katayama verfasserin aut Mirang Park verfasserin aut Naonobu Okazaki verfasserin aut In Journal of Robotics, Networking and Artificial Life (JRNAL) Atlantis Press, 2017 2(2015), 2 (DE-627)1005552487 23526386 nnns volume:2 year:2015 number:2 https://doi.org/10.2991/jrnal.2015.2.2.12 kostenfrei https://doaj.org/article/63a97e79e735401cb2e4b721c0d626db kostenfrei https://www.atlantis-press.com/article/25840.pdf kostenfrei https://doaj.org/toc/2352-6386 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 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_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 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 2 2015 2
allfieldsSound	10.2991/jrnal.2015.2.2.12 doi (DE-627)DOAJ060339721 (DE-599)DOAJ63a97e79e735401cb2e4b721c0d626db DE-627 ger DE-627 rakwb eng Kentaro Aburada verfasserin aut Proposal and Its Evaluation of Neighbors Based Routing for ad hoc networks 2015 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In ad hoc networks, due to the mobility of nodes, communication links are unstable and restricted. As such, an efficient routing protocol is needed in order to solve these problems. In the present paper, we propose a neighbors based routing (NBR) protocol by constructing paths in an area in which a large number of nodes exists. Simulations confirm that the proposed protocol has higher connectivity and a lower control overhead than existing protocols in topologies in which nodes move. Ad hoc networks Routing Protocol Route Repair AODV-BR Technology T Hisaaki Yamaba verfasserin aut Shinichiro Kubota verfasserin aut Tetsuro Katayama verfasserin aut Mirang Park verfasserin aut Naonobu Okazaki verfasserin aut In Journal of Robotics, Networking and Artificial Life (JRNAL) Atlantis Press, 2017 2(2015), 2 (DE-627)1005552487 23526386 nnns volume:2 year:2015 number:2 https://doi.org/10.2991/jrnal.2015.2.2.12 kostenfrei https://doaj.org/article/63a97e79e735401cb2e4b721c0d626db kostenfrei https://www.atlantis-press.com/article/25840.pdf kostenfrei https://doaj.org/toc/2352-6386 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 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_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 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 2 2015 2
language	English
source	In Journal of Robotics, Networking and Artificial Life (JRNAL) 2(2015), 2 volume:2 year:2015 number:2
sourceStr	In Journal of Robotics, Networking and Artificial Life (JRNAL) 2(2015), 2 volume:2 year:2015 number:2
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	Ad hoc networks Routing Protocol Route Repair AODV-BR Technology T
isfreeaccess_bool	true
container_title	Journal of Robotics, Networking and Artificial Life (JRNAL)
authorswithroles_txt_mv	Kentaro Aburada @@aut@@ Hisaaki Yamaba @@aut@@ Shinichiro Kubota @@aut@@ Tetsuro Katayama @@aut@@ Mirang Park @@aut@@ Naonobu Okazaki @@aut@@
publishDateDaySort_date	2015-01-01T00:00:00Z
hierarchy_top_id	1005552487
id	DOAJ060339721
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">DOAJ060339721</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502155639.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230228s2015 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.2991/jrnal.2015.2.2.12</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ060339721</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ63a97e79e735401cb2e4b721c0d626db</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="100" ind1="0" ind2=" "><subfield code="a">Kentaro Aburada</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proposal and Its Evaluation of Neighbors Based Routing for ad hoc networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</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">In ad hoc networks, due to the mobility of nodes, communication links are unstable and restricted. As such, an efficient routing protocol is needed in order to solve these problems. In the present paper, we propose a neighbors based routing (NBR) protocol by constructing paths in an area in which a large number of nodes exists. Simulations confirm that the proposed protocol has higher connectivity and a lower control overhead than existing protocols in topologies in which nodes move.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ad hoc networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Routing Protocol</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Route Repair</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">AODV-BR</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Technology</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">T</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Hisaaki Yamaba</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Shinichiro Kubota</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Tetsuro Katayama</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Mirang Park</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Naonobu Okazaki</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">Journal of Robotics, Networking and Artificial Life (JRNAL)</subfield><subfield code="d">Atlantis Press, 2017</subfield><subfield code="g">2(2015), 2</subfield><subfield code="w">(DE-627)1005552487</subfield><subfield code="x">23526386</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:2</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:2</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.2991/jrnal.2015.2.2.12</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/63a97e79e735401cb2e4b721c0d626db</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.atlantis-press.com/article/25840.pdf</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2352-6386</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">SSG-OLC-PHA</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_31</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_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_2014</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="d">2</subfield><subfield code="j">2015</subfield><subfield code="e">2</subfield></datafield></record></collection>
author	Kentaro Aburada
spellingShingle	Kentaro Aburada misc Ad hoc networks misc Routing Protocol misc Route Repair misc AODV-BR misc Technology misc T Proposal and Its Evaluation of Neighbors Based Routing for ad hoc networks
authorStr	Kentaro Aburada
ppnlink_with_tag_str_mv	@@773@@(DE-627)1005552487
format	electronic Article
delete_txt_mv	keep
author_role	aut aut aut aut aut aut
collection	DOAJ
remote_str	true
illustrated	Not Illustrated
issn	23526386
topic_title	Proposal and Its Evaluation of Neighbors Based Routing for ad hoc networks Ad hoc networks Routing Protocol Route Repair AODV-BR
topic	misc Ad hoc networks misc Routing Protocol misc Route Repair misc AODV-BR misc Technology misc T
topic_unstemmed	misc Ad hoc networks misc Routing Protocol misc Route Repair misc AODV-BR misc Technology misc T
topic_browse	misc Ad hoc networks misc Routing Protocol misc Route Repair misc AODV-BR misc Technology misc T
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Journal of Robotics, Networking and Artificial Life (JRNAL)
hierarchy_parent_id	1005552487
hierarchy_top_title	Journal of Robotics, Networking and Artificial Life (JRNAL)
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)1005552487
title	Proposal and Its Evaluation of Neighbors Based Routing for ad hoc networks
ctrlnum	(DE-627)DOAJ060339721 (DE-599)DOAJ63a97e79e735401cb2e4b721c0d626db
title_full	Proposal and Its Evaluation of Neighbors Based Routing for ad hoc networks
author_sort	Kentaro Aburada
journal	Journal of Robotics, Networking and Artificial Life (JRNAL)
journalStr	Journal of Robotics, Networking and Artificial Life (JRNAL)
lang_code	eng
isOA_bool	true
recordtype	marc
publishDateSort	2015
contenttype_str_mv	txt
author_browse	Kentaro Aburada Hisaaki Yamaba Shinichiro Kubota Tetsuro Katayama Mirang Park Naonobu Okazaki
container_volume	2
format_se	Elektronische Aufsätze
author-letter	Kentaro Aburada
doi_str_mv	10.2991/jrnal.2015.2.2.12
author2-role	verfasserin
title_sort	proposal and its evaluation of neighbors based routing for ad hoc networks
title_auth	Proposal and Its Evaluation of Neighbors Based Routing for ad hoc networks
abstract	In ad hoc networks, due to the mobility of nodes, communication links are unstable and restricted. As such, an efficient routing protocol is needed in order to solve these problems. In the present paper, we propose a neighbors based routing (NBR) protocol by constructing paths in an area in which a large number of nodes exists. Simulations confirm that the proposed protocol has higher connectivity and a lower control overhead than existing protocols in topologies in which nodes move.
abstractGer	In ad hoc networks, due to the mobility of nodes, communication links are unstable and restricted. As such, an efficient routing protocol is needed in order to solve these problems. In the present paper, we propose a neighbors based routing (NBR) protocol by constructing paths in an area in which a large number of nodes exists. Simulations confirm that the proposed protocol has higher connectivity and a lower control overhead than existing protocols in topologies in which nodes move.
abstract_unstemmed	In ad hoc networks, due to the mobility of nodes, communication links are unstable and restricted. As such, an efficient routing protocol is needed in order to solve these problems. In the present paper, we propose a neighbors based routing (NBR) protocol by constructing paths in an area in which a large number of nodes exists. Simulations confirm that the proposed protocol has higher connectivity and a lower control overhead than existing protocols in topologies in which nodes move.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 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_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 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	2
title_short	Proposal and Its Evaluation of Neighbors Based Routing for ad hoc networks
url	https://doi.org/10.2991/jrnal.2015.2.2.12 https://doaj.org/article/63a97e79e735401cb2e4b721c0d626db https://www.atlantis-press.com/article/25840.pdf https://doaj.org/toc/2352-6386
remote_bool	true
author2	Hisaaki Yamaba Shinichiro Kubota Tetsuro Katayama Mirang Park Naonobu Okazaki
author2Str	Hisaaki Yamaba Shinichiro Kubota Tetsuro Katayama Mirang Park Naonobu Okazaki
ppnlink	1005552487
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
doi_str	10.2991/jrnal.2015.2.2.12
up_date	2024-07-03T14:22:04.358Z
_version_	1803568047052554240
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">DOAJ060339721</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502155639.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230228s2015 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.2991/jrnal.2015.2.2.12</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ060339721</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ63a97e79e735401cb2e4b721c0d626db</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="100" ind1="0" ind2=" "><subfield code="a">Kentaro Aburada</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proposal and Its Evaluation of Neighbors Based Routing for ad hoc networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</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">In ad hoc networks, due to the mobility of nodes, communication links are unstable and restricted. As such, an efficient routing protocol is needed in order to solve these problems. In the present paper, we propose a neighbors based routing (NBR) protocol by constructing paths in an area in which a large number of nodes exists. Simulations confirm that the proposed protocol has higher connectivity and a lower control overhead than existing protocols in topologies in which nodes move.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ad hoc networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Routing Protocol</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Route Repair</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">AODV-BR</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Technology</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">T</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Hisaaki Yamaba</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Shinichiro Kubota</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Tetsuro Katayama</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Mirang Park</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Naonobu Okazaki</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">Journal of Robotics, Networking and Artificial Life (JRNAL)</subfield><subfield code="d">Atlantis Press, 2017</subfield><subfield code="g">2(2015), 2</subfield><subfield code="w">(DE-627)1005552487</subfield><subfield code="x">23526386</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:2</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:2</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.2991/jrnal.2015.2.2.12</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/63a97e79e735401cb2e4b721c0d626db</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.atlantis-press.com/article/25840.pdf</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2352-6386</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">SSG-OLC-PHA</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_31</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_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_2014</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="d">2</subfield><subfield code="j">2015</subfield><subfield code="e">2</subfield></datafield></record></collection>
score	7.399659

Nicht das Richtige dabei?

Schreiben Sie uns!

Proposal and Its Evaluation of Neighbors Based Routing for ad hoc networks

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?