CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Analytical Study of Broadcast in Mobile Adhoc Network

by Parma Nand, S.C. Sharma
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 19 - Number 8
Year of Publication: 2011
Authors: Parma Nand, S.C. Sharma
10.5120/2384-3152

Parma Nand, S.C. Sharma . Analytical Study of Broadcast in Mobile Adhoc Network. International Journal of Computer Applications. 19, 8 ( April 2011), 7-12. DOI=10.5120/2384-3152

@article{ 10.5120/2384-3152,
author = { Parma Nand, S.C. Sharma },
title = { Analytical Study of Broadcast in Mobile Adhoc Network },
journal = { International Journal of Computer Applications },
issue_date = { April 2011 },
volume = { 19 },
number = { 8 },
month = { April },
year = { 2011 },
issn = { 0975-8887 },
pages = { 7-12 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume19/number8/2384-3152/ },
doi = { 10.5120/2384-3152 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:06:25.687735+05:30
%A Parma Nand
%A S.C. Sharma
%T Analytical Study of Broadcast in Mobile Adhoc Network
%J International Journal of Computer Applications
%@ 0975-8887
%V 19
%N 8
%P 7-12
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Mobile Adhoc Network (MANET) is a set of self-configuring mobile hosts, equipped with a CSMA/CA (carrier sense multiple access with collision avoidance) transceiver, that may communicate, move freely independently and any time without any base station support. The broadcasting is inevitable operation in MANET and commonly used for route discovering. The flooding technique used normally for broadcast leads to redundant rebroadcasting and causes Broadcast Storm problem. This paper analyses this problem and techniques reported to handle it briefly. These techniques control redundant messages, which in turn lessen channel contention, packet collision and other similar network related problems. In this paper broadcast overhead and link breakage due to broadcasting is analyzed comparatively over Dynamic MANET On-demand (DYMO) and Source Tree Adaptive Routing (STAR) protocols with varying mobility using Qualnet network simulator.

References
  1. Ian D. Chakeres and Charles E. Perkins, “Dynamic MANET on demand (DYMO) routing protocol”. Internet- Draft Version 06, IETF, October 2006.
  2. J.J. Garcia-Luna-Aceves, M. Spohn, “Source-Tree Adaptive Routing in Wireless Networks”, Proceedings of the 7th Annual IEEE international conference on Network Protocols, Toronto, Canada. Oct 31- Nov 3, 1999. http://www.ieee-icnp.org/1999/ papers/1999-29.pdf.
  3. S.Y. Ni, Y.C. Tseng, Y.S. Chen, J.P. Sheu, “The broadcast storm problem in a mobile ad hoc network”, Proceedings of the 1999 Fifth Annual ACM/IEEE International Conference on Mobile Computing and Networking, IEEE Computer Society, New York, Aug 1999, pp. 151–162.
  4. W. Peng, X. Lu, Poster, “On the reduction of broadcast redundancy in mobile ad hoc networks”, Proceedings of the First ACM International Symposium on Mobile Ad hoc Networking and Computing, MOBIHOC, Boston, MA, 2000, pp 129–130.
  5. Y. Tseng, S. Ni, E. Shih, “Adaptive approaches to relieving broadcast storms in a wireless multihop mobile adhoc network”, IEEE Trans. Computers, v 52 (5), May 2003, pp 545–557.
  6. C.-K. Toh. Ad hoc Mobile Wireless Networks: Protocols and Systems[M]. Prentice Hall 2005.
  7. B. Williams, T. Camp, “Comparison of broadcasting techniques for mobile ad hoc networks”, Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC 2002), pp. 194–205.
  8. Y. Sasson, D. Cavin, A. Schiper, “Probabilistic broadcast for flooding in wireless mobile ad hoc networks”, EPFL Technical Report IC/2002/54, Swiss Federal Institute of Technology(EPFL), 2002.
  9. J. Spencer, Ten Lectures on the Probabilistic Method, Conference Board of the Mathematical Sciences, Regional Conference Series, AMS and MAA, 1987.
  10. Dariusz Kowalski, Andrzej Pelc, “Broadcasting in undirected ad hoc radio networks”, Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing, (PODC 2003), Boston, MA, USA, July13–16, 2003, pp. 73–82.
  11. Qi Zhang, Dharma P. Agrawal, “Dynamic probabilistic broadcasting in MANETs”, Journal of Parallel and Distributed Computing v 65(2), Feb 2005, pp 220-233.
  12. Qing Huang, Yong Bai, Lan Chen, “Efficient lightweight broadcasting protocols for multihop adhoc network”s, The 17th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC'06), Sept 2006, pp 1-5.
  13. Stefan Pleisch, Mahesh Balakrishnan,Ken Birman, Robbert van Renesse, “MISTRAL: Efficient flooding in mobile ad-hoc networks”, 7th ACM International Symposium on Mobile Ad Hoc Networking & Computing, Florence Italy, 2006, pp 1-12.
  14. Benoit Garbinato, Adrian Holzer, François Vessaz, “Context-aware broadcasting approaches in mobile adhoc networks”, Computer Networks: The International Journal of Computer and Telecommunications Networking v54 (7), May 2010, pp 1210-1228.
  15. Rendong Bai, Mukesh Singhal, “Salvaging route reply for on-demand routing protocols in mobile adhoc networks”, International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems, 2005, pp 53-62.
  16. Jie Wu , Fei Dai, Efficient “Broadcasting with Guaranteed Coverage in Mobile Ad Hoc Networks”, IEEE Transactions on Mobile Computing, 2005, pp 1-35.
  17. Z. Haas, J. Halpern, L. Li, “Gossip-based adhoc routing”, Proceedings of the IEEE INFOCOM, IEEE Computer Society, New York, 2002.
  18. H. Lim, C. Kim, “Multicast tree construction and flooding in wireless ad hoc networks” Proceedings of the ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM 2000), Boston, MA, 2000, pp. 61–68.
  19. J. Wu, H. Li, “A dominating-set-based routing scheme in ad hoc wireless networks”, Wireless Networks Telecomm. Systems Journal (special issue) 3, 2001, pp. 63–84.
  20. Yassein, M.B., Khaoua, M.O., et al.: “Improving route discovery in on-demand routing protocols using local topology information in MANETs”, Proceedings of the ACM international workshop on Performance monitoring, measurement, and evaluation of heterogeneous wireless and wired networks, Terromolinos, Spain, ACM Press, New York 2006, pp. 95–99.
  21. Abdalla M. Hanashi, Aamir Siddique, Irfan Awan, Mike Woodward, “Performance evaluation of dynamic probabilistic broadcasting for flooding in mobile ad hoc networks”, Journal: Simulation Modelling Practice and Theory Simulation Modelling Practice and Theory 17 2009, pp 364–375.
  22. IEEE, 1997, Wireless LAN Medium Access Control (MAC) and Physical layer (PHY) Specifications, IEEE Std. 802.11.
Index Terms

Computer Science
Information Sciences

Keywords

Adhoc networks MANET Routing protocols Route discovery

Powered by PhDFocusTM