Enhancing Performance of Duo Coverage Broadcasting in MANET
DOI:
https://doi.org/10.51983/ajcst-2012.1.1.1670Keywords:
Broadcast, double dominating set, forwarding node, mobile ad hoc networks (MANETs), performance evaluation, reliabilityAbstract
In today’s developing environment in the field of Mobile Ad hoc Network, broadcast reliability plays vital role. In MANET when the forwarding nodes are not carefully designated, they are prone to the broadcast storm. To avoid the problem of broadcast storm, the Double Coverage Broadcasting (DCB) algorithm is introduced. The proposed scheme increases the delivery ratio though the redundancy is reduced. Other factors under consideration is that the proposed scheme has high delivery ratio, low forwarding ratio, low overhead and low end-to-end delay for a broadcast operation under a high transmission error rate. Among the 1-hop neighbours of the sender, only selected forwarding nodes retransmit the broadcasting the message. Forwarding nodes are selected in such a way that 1) the sender’s 2-hop neighbours are covered and 2) the sender’s 1-hop neighbours are either forwarding nodes or nonforwarding nodes covered by at least two forwarding neighbours. The retransmissions of the forwarding nodes are received by the sender as the confirmation of their reception of the packet. The nonforwarding 1-hop neighbours of the sender do not acknowledge the reception of the broadcast. If the sender does not detect all its forwarding nodes’ retransmissions, it will resend the packet until the maximum number of retries is reached.
References
B. Williams and T. Camp, “Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks,” Proc. Mobi Hoc ’02, pp. 194-205, Jun. 2002.
C.S.Liao and G.J. Chang, “k-Tuple Domination in Graphs,”Information Processing Letters, vol. 87, no. 1, pp.45-50, 2003.
F. Harary and T. Haynes, “Double Domination in Graphs,”ARS Combinatoria, vol. 55, pp. 201-213, 2000.
H. Koubaa and E. Fleury, “On the Performance of Double Domination in Ad Hoc Networks,” Proc. IFIP Ann. Mediterranean Ad Hoc Networking Workshop (Medhoc), June 2003.
H. Lim and C. Kim, “Flooding in Wireless Ad Hoc Networks,” Computer Comm. J., vol. 24, nos. 3-4, pp. 353- 363, 2001.
J. Harant and M.A. Henning, “On Double Domination in Graphs,” Discussiones Math., Graph Theory, vol. 25, pp. 29-34, 2005.
J. Wu and F. Dai, “A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks,” Proc. EEE Int’l Conf. Distributed Computer Systems (ICDCS ’03), pp. 460-468, May 2003.
J. Wu and F. Dai, “Mobility Management and Its Applications in Efficient Broadcasting in Mobile Ad Hoc Networks,” Proc. IEEE INFOCOM ’04, Mar.2004.
M. Impett, M.S. Corson, and V. Park, “A Receiver-Oriented Approach to Reliable Broadcast Ad Hoc etworks,” Proc. Wireless Comm. and Networking Conf. (WCNC ’00), vol. 1, pp. 117-122, Sept. 2000.
M. Satratzemi and K. Tsouros, “Double Domination Algorithms inGraphs,” Proc. Hellenic European Conf. Math. and Informatics (HERMIS), vol. 55, pp. 201-213, 2000.
P. Jacquet, A. Laouiti, P. Minet, P. Muhlethaler, A. Qayyum, and L. Viennot, “Optimized Link State Routing Protocol,” draft-ietfmanet-olsr-07.txt, Nov. 2002.
R. Chandra, V. Ramasubramanian, and K.P. Birman, “Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-HocNetworks,” Proc. IEEE Int’l Conf. Distributed Computer Systems (ICDCS ’01), pp. 275-283, Apr. 2001.
S. Ni, Y. Tseng, Y. Chen, and J. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Proc.ACM/IEEE MobiCom ’99, pp. 151- 162, Aug. 1999.
S. Pleisch, M. Balakrishnan, K. Birman, and R. Renesse, “MISTRAL: Efficient Flooding in Mobile Ad Hoc Networks,” Proc. ACM MobiHoc ’06, May 2006.
S.-T. Shue, Y. Tsai, and J. Chen, “A Highly Reliable Broadcast Scheme for IEEE 802.11 Multi-Hop Ad Hoc Networks,” Proc. IEEE Int’l Conf. Comm. (ICC ’02), vol. 1, pp. 610-615, Apr. - May 2002.
Wei Lou, Jie Wu, “Towards Broadcast Reliability in Mobile Ad hoc Networks with Double Coverage,”IEEE Transaction on Mobile Computing, vol.6, no.2, February 2007.
W. Lou and J. Wu, “A Reliable Broadcast Algorithm with Selected Acknowledge mentsin Mobile Ad Hoc Networks,” Proc GLOBECOM ’03, Dec. 2003.
W. Lou and J. Wu, “On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks,” IEEE Trans. Mobile Computing, vol. 1,no. 2, pp. 111-123, Apr.-June 2002.
W. Peng and X. Lu, “AHBP: An Efficient Broadcast Protocol for Mobile Ad Hoc Networks,” J.Computer Science and Technology, vol. 16,no. 2, pp.114-125, Mar. 2001.
W. Peng and X. Lu, “Efficient Broadcast in Mobile Ad Hoc Networks Using Connected Dominating Sets,” J.
Software, vol. 12, no. 4, pp. 529-536, 2001.
Z.J. Haas, J.Y. Halpern, and L. Li, “Gossip-Based Ad Hoc Routing,” Proc. INFOCOM ’02, vol. 3, pp. 707-1716 , June 2002
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2012 The Research Publication
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
