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
An adaptive energy-efficient MAC protocol for wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Distributed construction of connected dominating set in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Latency of wireless sensor networks with uncoordinated power saving mechanisms
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Power conservation and quality of surveillance in target tracking sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Faster communication in known topology radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Asynchronous random sleeping for sensor networks
ACM Transactions on Sensor Networks (TOSN)
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
| Hi-index | 0.00 |
Gossiping, which broadcasts the message of every node to all the other nodes, is an important operation in multi-hop wireless networks. Interference-aware gossiping scheduling (IAGS) aims to find 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 two novel algorithms, called MILD and MILD-R, for this problem with an approximation ratio of at most 3@b^2(@D+6)|T|, where @b is 23(@a+2), @a denotes the ratio of the interference radius to the transmission radius, @D denotes the maximum node degree of the network, and |T| denotes the number of time slots in a scheduling period. The total numbers of transmissions scheduled by both two algorithms are at most three times as large as the minimum total number of transmissions. Extensive simulations are conducted to evaluate the performance of our algorithms.