WSN  Vol.9 No.2 , February 2017
Improved Self-Pruning for Broadcasting in Ad Hoc Wireless Networks
ABSTRACT
Reducing number of forwarding nodes is the main focus of any broadcasting algorithm designed for ad-hoc wireless networks. All reliable broadcasting techniques can be broadly classified under proactive and reactive approaches. In proactive approach, a node selects a subset of its neighbors as forwarding node and announces the forwarding node list in the packet header during broadcast. On the other hand, no such forwarding list is generated in reactive approach. Rather, a node (cognitively) determines by itself whether to forward the packet or not based on neighbor information. Dominant pruning and Self-pruning are two example techniques that fall under proactive and reactive approach respectively. Between the two methods, dominant pruning shows better performance than self-pruning in reducing number of forwarding nodes as they work with extended neighbor knowledge. However, appended forwarding node list increases message overhead and consumes more bandwidth. As a result, the approach becomes non-scalable in large networks. In this paper, we propose a reactive broadcasting technique based on self-pruning. The proposed approach dubbed as “Improved Self-pruning based Broadcasting (ISB)” algorithm completes the broadcast with smaller packet header (i.e., with no overhead) but uses extended neighbor knowledge. Simulation results show that ISB outperforms dominant pruning and self-pruning. Furthermore, as the network gets more spread and denser, ISB works remarkably well.
Cite this paper
Rab, R. , Sagar, S. , Sakib, N. , Haque, A. , Islam, M. and Rahman, A. (2017) Improved Self-Pruning for Broadcasting in Ad Hoc Wireless Networks. Wireless Sensor Network, 9, 73-86. doi: 10.4236/wsn.2017.92004.
References
[1]   (2016) Wireless Ad Hoc Network.
https://en.wikipedia.org/wiki/Wireless_ad_hoc_network

[2]   Guha, S. and Khuller, S. (1998) Approximation Algorithms for Connected Dominating Sets. Algorithmica, 20, 374-387.
https://doi.org/10.1007/PL00009201

[3]   Wu, J. and Dai, F. (2003) Broadcasting in Ad Hoc Networks Based on Self-Pruning. International Journal of Foundations of Computer Science, 14, 201-221.

[4]   Ni, S.-Y., Tseng, Y.-C., Chen, Y.-S. and Sheu, J.-P. (1999) The Broadcast Storm Problem in a Mobile Ad Hoc Network. Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking, MobiCom’99, ACM, 151-162.

[5]   Peng, W. and Lu, X.C. (2000) On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks. Proceedings of First Annual Workshop Mobile and Ad Hoc Networking and Computing (MOBIHOC), 129-130.

[6]   Lim, H. and Kim, C. (2000) Multicast Tree Construction and Flooding in Wireless Ad Hoc Networks. Proceedings of the 3rd ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems, ACM, 61-68.
https://doi.org/10.1145/346855.346865

[7]   Lou, W. and Wu, J. (2002) On Reducing Broadcast Redundancy in Ad-Hoc Wireless Networks. IEEE Transaction on Mobile Computing, 1, 111-123.
https://doi.org/10.1109/TMC.2002.1038347

[8]   Lim, H. and Kim, C. (2001) Flooding in Wireless Ad Hoc Networks. Computer Communications, 24, 353-363.

[9]   Rahman, A. and Gburzynski, P. (2006) MAC-Assisted Broadcast Speedup in Ad-Hoc Wireless Networks. Proceedings of International Wireless Communications and Mobile Computing (IWCMC), 923-928.
https://doi.org/10.1145/1143549.1143734

 
 
Top