Interference-aware gossiping scheduling in uncoordinated duty-cycled multi-hop wireless networks

Authors:
Xianlong Jiao;Wei Lou;Xiaodong Wang;Junchao Ma;Jiannong Cao;Xingming Zhou
Affiliations:
School of Computer, National University of Defense and Technology, Changsha, China and Department of Computing, The Hong Kong Polytechnic University, Kowloon, Hong Kong;Department of Computing, The Hong Kong Polytechnic University, Kowloon, Hong Kong;School of Computer, National University of Defense and Technology, Changsha, China;Department of Computing, The Hong Kong Polytechnic University, Kowloon, Hong Kong;Department of Computing, The Hong Kong Polytechnic University, Kowloon, Hong Kong;School of Computer, National University of Defense and Technology, Changsha, China
Venue:
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Year:
2010

Citing 11
Cited 0

The broadcast storm problem in a mobile ad hoc network

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Fast broadcasting and gossiping in radio networks

Journal of Algorithms
On adaptive deterministic gossiping in ad hoc radio networks

Information Processing Letters
A Randomized Algorithm for Gossiping in Radio Networks

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Minimizing broadcast latency and redundancy in ad hoc networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Minimum-latency gossiping in multi-hop wireless networks

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Broadcast Scheduling in Interference Environment

IEEE Transactions on Mobile Computing
Opportunistic flooding in low-duty-cycle wireless sensor networks with unreliable links

Proceedings of the 15th annual international conference on Mobile computing and networking
Minimum-Latency Schedulings for Group Communications in Multi-channel Multihop Wireless Networks

WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Sleeping schedule-aware minimum latency broadcast in wireless ad hoc networks

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Duty-Cycle-Aware Minimum Latency Broadcast Scheduling in Multi-hop Wireless Networks

ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.