Interference-Aware Gossiping Scheduling in Uncoordinated Duty-Cycled Multi-hop Wireless Networks

Gossiping is to broadcast the message of every node to all the other nodes in multi-hop wireless networks (MWNs). This operation plays an important role and is widely used in MWNs. Interference-aware gossiping scheduling (IAGS) aims to provide an interference-free scheduling for gossiping with the minimum latency. Previous work on IAGS mostly assumes that nodes are always active, and thus is not suitable for duty-cycled scenarios. In this paper, we investigate the IAGS problem in uncoordinated duty-cycled multi-hop wireless networks (IAGS-UDC problem) under protocol interference model and unbounded-size message model. We prove that the IAGS-UDC problem is NP-hard. We propose a novel approximation algorithm called MILD for this problem. The MILD algorithm achieves an approximation ratio of 3β2(Δ + 6)|T|, where β is ⌈2/3(α + 2)⌉,α denotes the ratio of the interference radius to the transmission radius, Δ denotes the maximum node degree of the network, and |T| denotes the number of time-slots in a scheduling period. Moreover, the number of transmissions scheduled by the MILD algorithm is at most 3 times as large as the minimum number of transmissions.

[1]  Hongwei Du,et al.  Minimum-latency gossiping in multi-hop wireless networks , 2008, MobiHoc '08.

[2]  Srinivasan Parthasarathy,et al.  Minimizing broadcast latency and redundancy in ad hoc networks , 2008, TNET.

[3]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[4]  Yunghsiang Sam Han,et al.  Broadcast Scheduling in Interference Environment , 2008, IEEE Transactions on Mobile Computing.

[5]  Wojciech Rytter,et al.  Fast broadcasting and gossiping in radio networks , 2002, J. Algorithms.

[6]  R. Gandhi,et al.  Approximation Algorithms for Data Broadcast in Wireless Networks , 2012, IEEE INFOCOM 2009.

[7]  Jiannong Cao,et al.  Sleeping Schedule-Aware Minimum Latency Broadcast in Wireless Ad Hoc Networks , 2009, 2009 IEEE International Conference on Communications.

[8]  Imrich Chlamtac,et al.  On Broadcasting in Radio Networks - Problem Analysis and Protocol Design , 1985, IEEE Transactions on Communications.

[9]  Xiaodong Wang,et al.  Duty-Cycle-Aware Minimum Latency Broadcast Scheduling in Multi-hop Wireless Networks , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[10]  Hai Liu,et al.  Minimum-Latency Schedulings for Group Communications in Multi-channel Multihop Wireless Networks , 2009, WASA.

[11]  Andrzej Lingas,et al.  On adaptive deterministic gossiping in ad hoc radio networks , 2002, SODA '02.

[12]  Feng Wang,et al.  Duty-Cycle-Aware Broadcast in Wireless Sensor Networks , 2009, IEEE INFOCOM 2009.

[13]  Wojciech Rytter,et al.  A Randomized Algorithm for Gossiping in Radio Networks , 2001, COCOON.