Research Article
An Appraisal of Energetic Rebroadcast Probability using Neighbor-Coverage Knowledge for Reducing Routing Problem in MANET
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 81 - Issue 17 |
| Published: November 2013 |
| Authors: Gowri. A, Lavanya. M |
10.5120/14218-2467
|
Gowri. A, Lavanya. M . An Appraisal of Energetic Rebroadcast Probability using Neighbor-Coverage Knowledge for Reducing Routing Problem in MANET. International Journal of Computer Applications. 81, 17 (November 2013), 32-36. DOI=10.5120/14218-2467
@article{ 10.5120/14218-2467,
author = { Gowri. A,Lavanya. M },
title = { An Appraisal of Energetic Rebroadcast Probability using Neighbor-Coverage Knowledge for Reducing Routing Problem in MANET },
journal = { International Journal of Computer Applications },
year = { 2013 },
volume = { 81 },
number = { 17 },
pages = { 32-36 },
doi = { 10.5120/14218-2467 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2013
%A Gowri. A
%A Lavanya. M
%T An Appraisal of Energetic Rebroadcast Probability using Neighbor-Coverage Knowledge for Reducing Routing Problem in MANET%T
%J International Journal of Computer Applications
%V 81
%N 17
%P 32-36
%R 10.5120/14218-2467
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Broadcasting is a vital process in ad hoc network whereby a source node sends the same packet to all the nodes in the network. A mobile node blindly rebroadcasts the first established route request packet unless it has a route to the endpoint or target resource, and thus it causes the broadcast storm delinquent. This broadcast storm problem will create the serious severance, disputation, and collision in a route discovery. Many approaches have been proposed method a Dynamic rebroadcast probability using neighbor coverage knowledge, the rebroadcast delay to determine the order and probability is set by merging the surplus coverage ratio and connectivity factor. The neighbor based coverage approach combines the advantages of the neighbor coverage knowledge and probable mechanism, which can expressively decrease the number of retransmission process so as to condense the routing overhead, and can also the routing performance.
References
- C. Perkins, E. Belding-Royer, and S. Das, Ad Hoc On-Demand Distance Vector (AODV) Routing, IETF RFC 3561, 2003.
- 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
- H. AlAamri, M. Abolhasan, and T. Wysocki, "On Optimizing Route Discovery in Absence of Previous Route Information in MANETs," Proc. IEEE Vehicular Technology Conf. (VTC), pp. 1-5, 2009
- 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 MobiCom, pp. 151-162, 1999.
- 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.
- 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.
- Z. Haas, J. Y. Halpern, and L. Li, "Gossip-Based Ad Hoc Routing," Proc. IEEE INFOCOM, vol. 21, pp. 1707-1716, 2002.
- W. Peng and X. Lu, "On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks," Proc. ACM MobiHoc, pp. 129-130, 2000.
- J. D. Abdulai, M. Ould-Khaoua, L. M. Mackenzie, and A. Mo- hammed, "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.
- 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.
Index Terms
Keywords