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

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Results and Performance Analysis of Local Broadcast Algorithms in Wireless Ad hoc Networks: Reducing the Number of Transmissions

by Rathi Varsha G., V.R. Chirchi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 124 - Number 5
Year of Publication: 2015
Authors: Rathi Varsha G., V.R. Chirchi
10.5120/ijca2015905488

Rathi Varsha G., V.R. Chirchi . Results and Performance Analysis of Local Broadcast Algorithms in Wireless Ad hoc Networks: Reducing the Number of Transmissions. International Journal of Computer Applications. 124, 5 ( August 2015), 31-36. DOI=10.5120/ijca2015905488

@article{ 10.5120/ijca2015905488,
author = { Rathi Varsha G., V.R. Chirchi },
title = { Results and Performance Analysis of Local Broadcast Algorithms in Wireless Ad hoc Networks: Reducing the Number of Transmissions },
journal = { International Journal of Computer Applications },
issue_date = { August 2015 },
volume = { 124 },
number = { 5 },
month = { August },
year = { 2015 },
issn = { 0975-8887 },
pages = { 31-36 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume124/number5/22101-2015905488/ },
doi = { 10.5120/ijca2015905488 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:13:36.052128+05:30
%A Rathi Varsha G.
%A V.R. Chirchi
%T Results and Performance Analysis of Local Broadcast Algorithms in Wireless Ad hoc Networks: Reducing the Number of Transmissions
%J International Journal of Computer Applications
%@ 0975-8887
%V 124
%N 5
%P 31-36
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Among Many fundamental communication primitives in wireless ad hoc network, flooding in wireless ad hoc network reduces the number of transmission in network and it plays a significant role in which every node transmits the message after receiving it for the first time. To successfully reducing the number of transmissions of broadcast that are required to achieve full delivery and constant approximation to the optimum solution without using exact position information of node. This paper presents two main approaches such as static and dynamic to broadcast algorithm in wireless ad hoc network. In static approach node status depends on local topology and priority function of node using this approach it can’t guarantee both full delivery and constant approximation if node exact position information isn’t available. On other hand in dynamic approach if node exact position information is available or not they can achieve both full delivery and constant approximation to their optimum solution using their partial 2-hop hybrid algorithm.

References
  1. S. Ni, Y. Tseng, Y. Chen, and J. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Proc. ACM MobiCom, pp. 151-162, 1999.
  2. D.Y. Sassoon and A. Schiper, “Probabilistic Broadcast for Flooding in Wireless Mobile Ad Hoc Networks,” Proc. IEEE Wireless Comm. and Networking Conf., pp. 1124-1130, 2003.
  3. H. Liu, P. Wan, X. Jia, X. Liu, and F. Yao, “Efficient Flooding Scheme Based on 1-Hop Information in Mobile Ad Hoc Networks,” Proc. IEEE INFOCOM, 2006.
  4. M. Khabbazian and V.K. Bhargava, “Efficient Broadcasting in Mobile Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 8, no. 2, pp. 231-245, Feb. 2009.
  5. W. Peng and X. Lu, “On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks,” Proc. ACM MobiHoc, pp. 129-2000.
  6. Y. CAI, K. Hua, and A. Phillips, “Leveraging 1-Hop Neighborhood Knowledge for Efficient Flooding in Wireless Ad Hoc Networks,” Proc. IEEE Int’l Performance, Computing, and Comm. Conf. (IPCCC’05), pp. 347-354, 2005.
  7. M. Khabbazian and V.K. Bhargava, “Localized Broadcasting with Guaranteed Delivery and Bounded Transmission Redundancy,” IEEE Trans. Computers, vol. 57, no. 8, pp. 1072-1086, Aug. 2008.
  8. J. Wu and F. Dai, “Broadcasting in Ad Hoc Networks Based on Self-Pruning,” Proc. IEEE INFOCOM, pp. 2240-2250, 2003.
  9. J. Wu and W. Lou, “Forward-Node-Set-Based Broadcast in Clustered Mobile Ad Hoc Networks,” Wireless Comm. and Mobile Computing, vol. 3, no. 2, pp. 155-173, 2003.
  10. J. Wu and F. Dai, “A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks,” IEEE Trans. Computers, vol. 53, no. 10, pp. 1343-1354, Oct. 2004.
  11. Z. Haas, J. Halpern, and L. Li, “Gossip-Based Ad Hoc Routing,”Proc. IEEE INFOCOM, pp. 1707-1716, 2002.
  12. J. Wu, W. Lou, and F. Dai, “Extended Multipoint Relays to Determine Connected Dominating Sets in Manets,” IEEE Trans. Computers, vol. 55, no. 3, pp. 334-347, Mar. 2006.
  13. Y. Chen and J.L. Welch, “Location-Based Broadcasting for Dense Mobile Ad Hoc Networks,” Proc. ACM Int’l Symp. Modeling, Analysis and Simulation of Wireless and Mobile Systems, pp. 63-70, 2005.
  14. I. Stojmenovic, M. Seddigh, and J. Zunic, “Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 1, pp. 14-25, Jan. 2002.
  15. A. Keshavarz-Haddad, V. Ribeiro, and R. Riedi, “DRB and DCCB: Efficient and Robust Dynamic Broadcast for Ad Hoc and Sensor Networks,” Proc. IEEE Fourth Ann. Comm. Soc. Conf. Sensor, Mesh and Ad Hoc Comm. and Networks (SECON ’07), pp. 253-262, 2007.
  16. P. Wan, K. Alzoubi, and O. Frieder, “Distributed Construction of Connected Dominating Set in wireless Ad hoc Networks,” Proc. IEEE INFOCOM, vol. 3, pp. 1597-1604, 2002.
Index Terms

Computer Science
Information Sciences

Keywords

Ad hoc network Broadcasting Connected Dominating Set (CDS) Constant Approximation.

Powered by PhDFocusTM