Route Research for Ad Hoc Network

Zhengxi Wei

doi:doi:10.11648/j.ajnc.20140306.11

| Peer-Reviewed

Route Research for Ad Hoc Network

Zhengxi Wei

Published in American Journal of Networks and Communications (Volume 3, Issue 6)

Received: 29 November 2014 Accepted: 7 December 2014 Published: 18 December 2014

Views: Downloads:

Download PDF

Share This Article

Twitter
Linked In
Facebook

Abstract

Routing delivery is one of the key techniques in mobile ad hoc network, which involves many aspects such as topology update, routing exchange and so on. In this paper, we firstly apply routing tree to describe the complete topology of ad hoc network, and then store the information of routing tree into every node’s routing table. Sparse routing tree, as a pruned tree, is used to exchange topology information, which reduces the header length of intranet packets. By multicasting packets in the intranet, the precious bandwidth over wireless link is saved greatly. We finally present a routing algorithm to select a most economical path among potential routing paths.

Published in	American Journal of Networks and Communications (Volume 3, Issue 6)
DOI	10.11648/j.ajnc.20140306.11
Page(s)	73-76
Creative Commons	This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.
Copyright	Copyright © The Author(s), 2014. Published by Science Publishing Group

Keywords

Source Directed Route, Routing Tree, Topology Update, Ad Hoc Network

References

[1]	Royer Em, Chai_Keong T. A review of current routing protocols for ad hoc mobile wireless network[J]. IEEE Personal Communications, 1999, 6(2): 46-55.
[2]	Perkins C, Bhagwat P. Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers[Z]. ACM SICOMM’94, London, 1994. 234-244.
[3]	Murthy S, Garcia-Lunes-Aceves J. An efficient routing protocol for wireless networks[J]. ACM Balzer Mobile Networks and Applications Journal, Special Issue on Routing in Mobile Communications Networks, 1996, 1(2): 183-197.
[4]	Johnson DB, Maltz DA.. Dynamic Source Routing in Ad Hoc Wireless Networks. New York: Kluwer Academic Publishers, 1996. 153~181.
[5]	Perkins C, Royer E. Ad-Hoc on Demand Distance Vector Routing[Z]. The 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, 1999. 90-100.
[6]	MIL-STD-188-220B[S]. Department of Defense, Washington, 1998.
[7]	YAN WEI-min,WU Wei-min. Data Structure[M], Second Edition, Beijing: Tsinghua University Publishing Company, 2000.

Cite This Article

Plain Text BibTeX RIS

APA Style

Zhengxi Wei. (2014). Route Research for Ad Hoc Network. American Journal of Networks and Communications, 3(6), 73-76. https://doi.org/10.11648/j.ajnc.20140306.11

Copy | Download

ACS Style

Zhengxi Wei. Route Research for Ad Hoc Network. Am. J. Netw. Commun. 2014, 3(6), 73-76. doi: 10.11648/j.ajnc.20140306.11

Copy | Download

AMA Style

Zhengxi Wei. Route Research for Ad Hoc Network. Am J Netw Commun. 2014;3(6):73-76. doi: 10.11648/j.ajnc.20140306.11

Copy | Download

@article{10.11648/j.ajnc.20140306.11,
  author = {Zhengxi Wei},
  title = {Route Research for Ad Hoc Network},
  journal = {American Journal of Networks and Communications},
  volume = {3},
  number = {6},
  pages = {73-76},
  doi = {10.11648/j.ajnc.20140306.11},
  url = {https://doi.org/10.11648/j.ajnc.20140306.11},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ajnc.20140306.11},
  abstract = {Routing delivery is one of the key techniques in mobile ad hoc network, which involves many aspects such as topology update, routing exchange and so on. In this paper, we firstly apply routing tree to describe the complete topology of ad hoc network, and then store the information of routing tree into every node’s routing table. Sparse routing tree, as a pruned tree, is used to exchange topology information, which reduces the header length of intranet packets. By multicasting packets in the intranet, the precious bandwidth over wireless link is saved greatly. We finally present a routing algorithm to select a most economical path among potential routing paths.},
 year = {2014}
}

Copy | Download

TY  - JOUR
T1  - Route Research for Ad Hoc Network
AU  - Zhengxi Wei
Y1  - 2014/12/18
PY  - 2014
N1  - https://doi.org/10.11648/j.ajnc.20140306.11
DO  - 10.11648/j.ajnc.20140306.11
T2  - American Journal of Networks and Communications
JF  - American Journal of Networks and Communications
JO  - American Journal of Networks and Communications
SP  - 73
EP  - 76
PB  - Science Publishing Group
SN  - 2326-8964
UR  - https://doi.org/10.11648/j.ajnc.20140306.11
AB  - Routing delivery is one of the key techniques in mobile ad hoc network, which involves many aspects such as topology update, routing exchange and so on. In this paper, we firstly apply routing tree to describe the complete topology of ad hoc network, and then store the information of routing tree into every node’s routing table. Sparse routing tree, as a pruned tree, is used to exchange topology information, which reduces the header length of intranet packets. By multicasting packets in the intranet, the precious bandwidth over wireless link is saved greatly. We finally present a routing algorithm to select a most economical path among potential routing paths.
VL  - 3
IS  - 6
ER  -

Copy | Download

Author Information

Zhengxi Wei

School of Computer Science, Sichuan University of Science & Engineering, Zigong Sichuan 643000, PR China

Download PDF

Sections

Plain Text BibTeX RIS

APA Style

Zhengxi Wei. (2014). Route Research for Ad Hoc Network. American Journal of Networks and Communications, 3(6), 73-76. https://doi.org/10.11648/j.ajnc.20140306.11

Copy | Download

ACS Style

Zhengxi Wei. Route Research for Ad Hoc Network. Am. J. Netw. Commun. 2014, 3(6), 73-76. doi: 10.11648/j.ajnc.20140306.11

Copy | Download

AMA Style

Zhengxi Wei. Route Research for Ad Hoc Network. Am J Netw Commun. 2014;3(6):73-76. doi: 10.11648/j.ajnc.20140306.11

Copy | Download

@article{10.11648/j.ajnc.20140306.11,
  author = {Zhengxi Wei},
  title = {Route Research for Ad Hoc Network},
  journal = {American Journal of Networks and Communications},
  volume = {3},
  number = {6},
  pages = {73-76},
  doi = {10.11648/j.ajnc.20140306.11},
  url = {https://doi.org/10.11648/j.ajnc.20140306.11},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ajnc.20140306.11},
  abstract = {Routing delivery is one of the key techniques in mobile ad hoc network, which involves many aspects such as topology update, routing exchange and so on. In this paper, we firstly apply routing tree to describe the complete topology of ad hoc network, and then store the information of routing tree into every node’s routing table. Sparse routing tree, as a pruned tree, is used to exchange topology information, which reduces the header length of intranet packets. By multicasting packets in the intranet, the precious bandwidth over wireless link is saved greatly. We finally present a routing algorithm to select a most economical path among potential routing paths.},
 year = {2014}
}

Copy | Download

TY  - JOUR
T1  - Route Research for Ad Hoc Network
AU  - Zhengxi Wei
Y1  - 2014/12/18
PY  - 2014
N1  - https://doi.org/10.11648/j.ajnc.20140306.11
DO  - 10.11648/j.ajnc.20140306.11
T2  - American Journal of Networks and Communications
JF  - American Journal of Networks and Communications
JO  - American Journal of Networks and Communications
SP  - 73
EP  - 76
PB  - Science Publishing Group
SN  - 2326-8964
UR  - https://doi.org/10.11648/j.ajnc.20140306.11
AB  - Routing delivery is one of the key techniques in mobile ad hoc network, which involves many aspects such as topology update, routing exchange and so on. In this paper, we firstly apply routing tree to describe the complete topology of ad hoc network, and then store the information of routing tree into every node’s routing table. Sparse routing tree, as a pruned tree, is used to exchange topology information, which reduces the header length of intranet packets. By multicasting packets in the intranet, the precious bandwidth over wireless link is saved greatly. We finally present a routing algorithm to select a most economical path among potential routing paths.
VL  - 3
IS  - 6
ER  -

Copy | Download