Open Access Open Access  Restricted Access Subscription or Fee Access

Efficient Broadcasting in Wireless Adhoc Network

S. Vijaya, V. Sharmila, K. Sindhiya


Broadcasting is a commonly used feature in wireless ad hoc networks. It is a common operation for route establishment and for sending control and emergency messages. The primary goal of broadcasting is to successfully reduce the number of transmissions that are required to achieve full delivery with energy consumption using local broadcast algorithm. In static approach, using the local topology information, the local algorithm determines the status of each node and also the priority function. Using this approach it is not possible to achieve the good approximation factor to the optimum solution. The hybrid local broadcast algorithm based on dynamic approach is proposed for guarantee with full delivery and successful approximation to the optimum solution without considering the node position. In dynamic approach the position of the node is determined “on-the-fly” based on local topology information. So, it is possible to get the good approximation factor to the optimum solution. The position information is the solution for getting good approximation factor. But in some applications it may not be possible to get position information because of the sheer nature of ad hoc networks that allow mobility cause dynamic, unpredicted and frequent topology changes. In those situations also the proposed local broadcast algorithm can achieve both full delivery and a constant approximation to the optimum solution in which the status of each node is decided “on-the-fly” (i.e. reactive protocol).

Full Text:



Alia Sabri and Khalil Al-Shqeerat., “A Hybrid LAR-1DNDP Route Discovery Algorithm for MobileAdhoc Networks," IJCSNS International Journal of Computer Science and Network Security, vol.11, No.8, pp. 31-40 August 2011.

Parma Nand and Dr. S.C. Sharma, “Analytical Study of Broadcast in Mobile Adhoc Network,” International Journal of Computer Applications (0975 – 8887) vol 19– No.8, April 2011.

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.

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.

Ramalakshmi R and Radhakrishnan S,” IMPROVING ROUTE DISCOVERY USING STABLE CONNECTED DOMINATING SET IN MANETS,” International journal on applications of graph theory in wireless ad hoc networks and sensor networks(GRAPH-HOC) Vol.4, No.1, March 2012.

M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., 1990.

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.

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.

J. Wu and F. Dai, “Broadcasting in Ad Hoc Networks Based on Self-Pruning,” Proc. IEEE INFOCOM, pp. 2240-2250, 2003.

Wilson Woon and Kwan L Yeung,” Self-Pruning Broadcasting for Mobile Ad Hoc Networks,” IEEE GLOBECOM, 2009.

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.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.