Efficient Routing with Reduced Routing Overhead and Retransmission of Manet

Megha Sharma; Shivani Rohilla; Manish Bhardwaj

doi:doi:10.11648/j.ajnc.s.2015040301.15

| Peer-Reviewed

Efficient Routing with Reduced Routing Overhead and Retransmission of Manet

Megha Sharma, Shivani Rohilla, Manish Bhardwaj

Published in American Journal of Networks and Communications (Volume 4, Issue 3-1)

Received: 22 December 2014 Accepted: 25 December 2014 Published: 28 January 2015

Views: Downloads:

Download PDF

Share This Article

Twitter
Linked In
Facebook

Abstract

Adhoc network is a collection of mobile nodes that dynamically form a temporary network and are capable of communicating with each other without the use of a network infrastructure. In manet nodes can change location and configure itself, the mobility of nodes causes continuous link breakage due to which frequent path failure occur and route discovery is required. The fundamental construction for a route discoveries is broadcasting in which the receiver node blindly rebroadcast the first received route request packet unless it has route to the destination. The routing overhead associated with route discovery is very high which leads to poor packet delivery ratio and a high delay to be victorious this type of routing overhead we are proposing the new technique using NCPR. To intended NCPR method is used to determine the rebroadcast order and obtain the more precise additional coverage ratio by sensing neighbor coverage knowledge. We can also define connectivity factor to provide node density adaptation. By combining the additional coverage ratio and connectivity factor, rebroadcast probability is determined. The approach can signify improvement in routing performance and decrease the routing overhead by decreasing the number of retransmission.

Published in	American Journal of Networks and Communications (Volume 4, Issue 3-1) This article belongs to the Special Issue Ad Hoc Networks
DOI	10.11648/j.ajnc.s.2015040301.15
Page(s)	22-26
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), 2015. Published by Science Publishing Group

Keywords

Mobile Adhoc Networks, Neighbor Coverage Network Connectivity, Probabilistic Rebroadcast, Routing Overhead

References

[1]	C. Perkins, E. Belding-Royer, and S. Das, Ad Hoc On-Demand Distance Vector (AODV) Routing, IETF RFC 3561, 2003.
[2]	D. Johnson, Y. Hu, and D. Maltz, The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR) for IPv4, IETF RFC 4728, vol. 15, pp. 153-181, 2007.
[3]	H. AlAamri, M. Abolhasan, and T. Wysocki, “On Optimising Route Discovery in Absence of Previous Route Information in MANETs,” Proc. IEEE Vehicular Technology Conf. (VTC), pp. 1-5, 2009.
[4]	X. Wu, H.R. Sadjadpour, and J.J. Garcia-Luna-Aceves, “Routing Overhead as a Function of Node Mobility: Modeling Framework and Implications on Proactive Routing,” Proc. IEEE Int’l Conf. Mobile Ad Hoc and Sensor Systems (MASS ’07), pp. 1- 9, 2007.
[5]	S.Y. Ni, Y.C. Tseng, Y.S. Chen, and J.P. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Proc. ACM/IEEE Mob iCom, pp. 151-162, 1999.
[6]	A. Mohammed, M. Ould-Khaoua, L.M. Mackenzie, C. Perkins, and J.D. Abdulai, “Probabilistic Counter-Based Route Discovery for Mobile Ad Hoc Networks,” Proc. Int’l Conf. Wireless Comm. And Mobile Computing: Connecting the World Wirelessly (IWCMC ’09), pp. 1335-1339, 2009.
[7]	B. Williams and T. Camp, “Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks,” Proc. ACM MobiHoc, pp. 194- 205, 2002.
[8]	J. Kim, Q. Zhang, and D.P. Agrawal, “Probabilistic Broadcasting Based on Coverage Area and Neighbor Confirmation in Mobile Ad Hoc Networks,” Proc. IEEE GlobeCom, 2004.
[9]	J.D. Abdulai, M. Ould-Khaoua, and L.M. Mackenzie, “Improving Probabilistic Route Discovery in Mobile Ad Hoc Networks,” Proc. IEEE Conf. Local Computer Networks, pp. 739-746, 2007.
[10]	Z. Haas, J.Y. Halpern, and L. Li, “Gossip-Based Ad Hoc Routing,” Proc. IEEE INFOCOM, vol. 21, pp. 1707-1716, 2002.
[11]	W. Peng and X. Lu, “On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks,” Proc. ACM MobiHoc, pp. 129-130, 2000.
[12]	J.D. Abdulai, M. Ould-Khaoua, L.M. Mackenzie, and A. Mohammed, “Neighbour Coverage: A Dynamic Probabilistic Route Discovery for Mobile Ad Hoc Networks,” Proc. Int’l Symp. Performance Evaluation of Computer and Telecomm. Systems (SPECTS’08), pp. 165-172, 2008.
[13]	J. Chen, Y.Z. Lee, H. Zhou, M. Gerla, and Y. Shu, “Robust Ad Hoc Routing for Lossy Wireless Environment,” Proc. IEEE Conf. Military Comm. (MILCOM ’06), pp. 1-7, 2006.
[14]	A. Keshavarz-Haddady, V. Ribeirox, and R. Riedi, “DRB and DCCB: Efficient and Robust Dynamic Broadcast for Ad Hoc and Sensor Networks,” Proc. IEEE Comm. Soc. Conf. Sensor, Mesh, and Ad Hoc Comm. and networks (SECON ’07), pp. 253-262, 2007.
[15]	F. Stann, J. Heidemann, R. Shroff, and M.Z. Murtaza, “RBP: Robust Broadcast Propagation in Wireless Networks,” Proc. Int’l Conf. Embedded Networked Sensor Systems (SenSys ’06), pp. 85-98, 2006.
[16]	F. Xue and P.R. Kumar, “The Number of Neighbors Needed for Connectivity of Wireless Networks,” Wireless Networks, vol. 10, no. 2, pp. 169-181, 2004.
[17]	X.M. Zhang, E.B. Wang, J.J. Xia, and D.K. Sung, “An Estimated Distance Based Routing Protocol for Mobile Ad Hoc Networks,” IEEE Trans. Vehicular Technology, vol. 60, no. 7, pp. 3473-3484, Sept. 2011.
[18]	Y.-C. Tseng, S.-Y. Ni, Y.-S.Chen, and J.-P. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Wireless Networks, vol. 8, nos. 2/3, pp. 153-167, Mar.-May 2002.
[19]	http://moment.cs.ucsb.edu/AODV/aodv.html
[20]	http://www.cs.cmu.edu/~dmaltz/dsr.html Ambarish R. Bhuyar et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 5 (1) , 2014,390-393

Cite This Article

Plain Text BibTeX RIS

APA Style

Megha Sharma, Shivani Rohilla, Manish Bhardwaj. (2015). Efficient Routing with Reduced Routing Overhead and Retransmission of Manet. American Journal of Networks and Communications, 4(3-1), 22-26. https://doi.org/10.11648/j.ajnc.s.2015040301.15

Copy | Download

ACS Style

Megha Sharma; Shivani Rohilla; Manish Bhardwaj. Efficient Routing with Reduced Routing Overhead and Retransmission of Manet. Am. J. Netw. Commun. 2015, 4(3-1), 22-26. doi: 10.11648/j.ajnc.s.2015040301.15

Copy | Download

AMA Style

Megha Sharma, Shivani Rohilla, Manish Bhardwaj. Efficient Routing with Reduced Routing Overhead and Retransmission of Manet. Am J Netw Commun. 2015;4(3-1):22-26. doi: 10.11648/j.ajnc.s.2015040301.15

Copy | Download

@article{10.11648/j.ajnc.s.2015040301.15,
  author = {Megha Sharma and Shivani Rohilla and Manish Bhardwaj},
  title = {Efficient Routing with Reduced Routing Overhead and Retransmission of Manet},
  journal = {American Journal of Networks and Communications},
  volume = {4},
  number = {3-1},
  pages = {22-26},
  doi = {10.11648/j.ajnc.s.2015040301.15},
  url = {https://doi.org/10.11648/j.ajnc.s.2015040301.15},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ajnc.s.2015040301.15},
  abstract = {Adhoc network is a collection of mobile nodes that dynamically form a temporary network and are capable of communicating with each other without the use of a network infrastructure. In manet nodes can change location and configure itself, the mobility of nodes causes continuous link breakage due to which frequent path failure occur and route discovery is required. The fundamental construction for a route discoveries is broadcasting in which the receiver node blindly rebroadcast the first received route request packet unless it has route to the destination. The routing overhead associated with route discovery is very high which leads to poor packet delivery ratio and a high delay to be victorious this type of routing overhead we are  proposing the new technique using NCPR. To intended NCPR method is used to determine the rebroadcast order and obtain the more precise additional coverage ratio by sensing neighbor coverage knowledge. We can also define connectivity factor to provide node density adaptation. By combining the additional coverage ratio and connectivity factor, rebroadcast probability is determined. The approach can signify improvement in routing performance and decrease the routing overhead by decreasing the number of retransmission.},
 year = {2015}
}

Copy | Download

TY  - JOUR
T1  - Efficient Routing with Reduced Routing Overhead and Retransmission of Manet
AU  - Megha Sharma
AU  - Shivani Rohilla
AU  - Manish Bhardwaj
Y1  - 2015/01/28
PY  - 2015
N1  - https://doi.org/10.11648/j.ajnc.s.2015040301.15
DO  - 10.11648/j.ajnc.s.2015040301.15
T2  - American Journal of Networks and Communications
JF  - American Journal of Networks and Communications
JO  - American Journal of Networks and Communications
SP  - 22
EP  - 26
PB  - Science Publishing Group
SN  - 2326-8964
UR  - https://doi.org/10.11648/j.ajnc.s.2015040301.15
AB  - Adhoc network is a collection of mobile nodes that dynamically form a temporary network and are capable of communicating with each other without the use of a network infrastructure. In manet nodes can change location and configure itself, the mobility of nodes causes continuous link breakage due to which frequent path failure occur and route discovery is required. The fundamental construction for a route discoveries is broadcasting in which the receiver node blindly rebroadcast the first received route request packet unless it has route to the destination. The routing overhead associated with route discovery is very high which leads to poor packet delivery ratio and a high delay to be victorious this type of routing overhead we are  proposing the new technique using NCPR. To intended NCPR method is used to determine the rebroadcast order and obtain the more precise additional coverage ratio by sensing neighbor coverage knowledge. We can also define connectivity factor to provide node density adaptation. By combining the additional coverage ratio and connectivity factor, rebroadcast probability is determined. The approach can signify improvement in routing performance and decrease the routing overhead by decreasing the number of retransmission.
VL  - 4
IS  - 3-1
ER  -

Copy | Download

Author Information

Megha Sharma

Department of Computer science and Engineering, SRM University, NCR Campus, Modinagar, Ghaziabad, India
Shivani Rohilla

Department of Computer science and Engineering, SRM University, NCR Campus, Modinagar, Ghaziabad, India
Manish Bhardwaj

Department of Computer science and Engineering, SRM University, NCR Campus, Modinagar, Ghaziabad, India

Download PDF

Sections

Plain Text BibTeX RIS

APA Style

Megha Sharma, Shivani Rohilla, Manish Bhardwaj. (2015). Efficient Routing with Reduced Routing Overhead and Retransmission of Manet. American Journal of Networks and Communications, 4(3-1), 22-26. https://doi.org/10.11648/j.ajnc.s.2015040301.15

Copy | Download

ACS Style

Megha Sharma; Shivani Rohilla; Manish Bhardwaj. Efficient Routing with Reduced Routing Overhead and Retransmission of Manet. Am. J. Netw. Commun. 2015, 4(3-1), 22-26. doi: 10.11648/j.ajnc.s.2015040301.15

Copy | Download

AMA Style

Megha Sharma, Shivani Rohilla, Manish Bhardwaj. Efficient Routing with Reduced Routing Overhead and Retransmission of Manet. Am J Netw Commun. 2015;4(3-1):22-26. doi: 10.11648/j.ajnc.s.2015040301.15

Copy | Download

@article{10.11648/j.ajnc.s.2015040301.15,
  author = {Megha Sharma and Shivani Rohilla and Manish Bhardwaj},
  title = {Efficient Routing with Reduced Routing Overhead and Retransmission of Manet},
  journal = {American Journal of Networks and Communications},
  volume = {4},
  number = {3-1},
  pages = {22-26},
  doi = {10.11648/j.ajnc.s.2015040301.15},
  url = {https://doi.org/10.11648/j.ajnc.s.2015040301.15},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ajnc.s.2015040301.15},
  abstract = {Adhoc network is a collection of mobile nodes that dynamically form a temporary network and are capable of communicating with each other without the use of a network infrastructure. In manet nodes can change location and configure itself, the mobility of nodes causes continuous link breakage due to which frequent path failure occur and route discovery is required. The fundamental construction for a route discoveries is broadcasting in which the receiver node blindly rebroadcast the first received route request packet unless it has route to the destination. The routing overhead associated with route discovery is very high which leads to poor packet delivery ratio and a high delay to be victorious this type of routing overhead we are  proposing the new technique using NCPR. To intended NCPR method is used to determine the rebroadcast order and obtain the more precise additional coverage ratio by sensing neighbor coverage knowledge. We can also define connectivity factor to provide node density adaptation. By combining the additional coverage ratio and connectivity factor, rebroadcast probability is determined. The approach can signify improvement in routing performance and decrease the routing overhead by decreasing the number of retransmission.},
 year = {2015}
}

Copy | Download

TY  - JOUR
T1  - Efficient Routing with Reduced Routing Overhead and Retransmission of Manet
AU  - Megha Sharma
AU  - Shivani Rohilla
AU  - Manish Bhardwaj
Y1  - 2015/01/28
PY  - 2015
N1  - https://doi.org/10.11648/j.ajnc.s.2015040301.15
DO  - 10.11648/j.ajnc.s.2015040301.15
T2  - American Journal of Networks and Communications
JF  - American Journal of Networks and Communications
JO  - American Journal of Networks and Communications
SP  - 22
EP  - 26
PB  - Science Publishing Group
SN  - 2326-8964
UR  - https://doi.org/10.11648/j.ajnc.s.2015040301.15
AB  - Adhoc network is a collection of mobile nodes that dynamically form a temporary network and are capable of communicating with each other without the use of a network infrastructure. In manet nodes can change location and configure itself, the mobility of nodes causes continuous link breakage due to which frequent path failure occur and route discovery is required. The fundamental construction for a route discoveries is broadcasting in which the receiver node blindly rebroadcast the first received route request packet unless it has route to the destination. The routing overhead associated with route discovery is very high which leads to poor packet delivery ratio and a high delay to be victorious this type of routing overhead we are  proposing the new technique using NCPR. To intended NCPR method is used to determine the rebroadcast order and obtain the more precise additional coverage ratio by sensing neighbor coverage knowledge. We can also define connectivity factor to provide node density adaptation. By combining the additional coverage ratio and connectivity factor, rebroadcast probability is determined. The approach can signify improvement in routing performance and decrease the routing overhead by decreasing the number of retransmission.
VL  - 4
IS  - 3-1
ER  -

Copy | Download