Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/28741
Title: Interference-aware gossiping scheduling in uncoordinated duty-cycled multi-hop wireless networks
Authors: Jiao, X
Lou, W 
Wang, X
Ma, J
Cao, J 
Zhou, X
Keywords: Duty cycle
Gossiping scheduling
Interference
Multi-hop wireless networks
Issue Date: 2010
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), 2010, v. 6221 LNCS, p. 192-202 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
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 , α 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.
Description: 5th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2010, Beijing, 15-17 August 2010
URI: http://hdl.handle.net/10397/28741
ISBN: 3642146538
9783642146534
ISSN: 0302-9743
EISSN: 1611-3349
DOI: 10.1007/978-3-642-14654-1_24
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

3
Last Week
0
Last month
0
Citations as of Aug 18, 2017

Page view(s)

43
Last Week
3
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.