Broadcasting with Randomized Network Coding in Dense Wireless Ad Hoc Networks

In this paper, we consider the broadcast storm problem in dense wireless ad hoc networks where interference among densely populated wireless nodes causes significant packet loss. To resolve the problem, we apply randomized network coding (RNC) to the networks. RNC is a completely different approach from existing techniques to resolve the problem, and it reduces the number of outstanding packets in the networks by encoding several packets into a single packet. RNC is a kind of linear network coding, and it is suited to wireless ad hoc networks because it can be implemented in a completely distributed manner. We describe a procedure for implementing the wireless ad hoc broadcasting with RNC. Further, with several simulation scenarios, we provide some insights on the relationship between the system parameters and performance and find that there is the optimal length of coding vectors for RNC in terms of packet loss probability. We also show a guideline for the parameter setting to resolve the broadcast storm problem successfully.

[1]  Muriel Médard,et al.  Codecast: a network-coding-based ad hoc multicast protocol , 2006, IEEE Wireless Communications.

[2]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[3]  Christina Fragouli,et al.  Low-complexity energy-efficient broadcasting in wireless ad-hoc networks using network coding , 2005 .

[4]  Baochun Li,et al.  How Practical is Network Coding? , 2006, 200614th IEEE International Workshop on Quality of Service.

[5]  Mostafa Ammar,et al.  Multicasting in delay tolerant networks: semantic models and routing algorithms , 2005, WDTN '05.

[6]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[7]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[8]  Takahiro Matsuda,et al.  Performance evaluation of new multicast architecture with network coding , 2003 .

[9]  Muriel Médard,et al.  Simplified random network codes for multicast networks , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[10]  Wei Peng,et al.  On the reduction of broadcast redundancy in mobile ad hoc networks , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[11]  Jörg Widmer,et al.  Network coding for efficient communication in extreme networks , 2005, WDTN '05.

[12]  G. Neglia,et al.  On the Benefits of Random Linear Coding for Unicast Applications in Disruption Tolerant Networks , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[13]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[14]  Anis Laouiti,et al.  Multipoint relaying for flooding broadcast messages in mobile wireless networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[15]  Rabin K. Patra,et al.  Using redundancy to cope with failures in a delay tolerant network , 2005, SIGCOMM '05.

[16]  Yan Shi,et al.  Relative degree adaptive flooding broadcast algorithm for ad hoc networks , 2005, IEEE Transactions on Broadcasting.