Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/24976
Title: Fast group communication scheduling in duty-cycled multihop wireless sensor networks
Authors: Xu, X
Cao, J 
Wan, PJ
Issue Date: 2012
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), 2012, v. 7405 LNCS, p. 197-205 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
Abstract: We study group communication scheduling in duty-cycled multi-hop wireless sensor networks. Assume that time is divided into time-slots and we group multiple consecutive time-slots into periods. Each node can transmit data at any time-slot while it only wakes up at its active time-slot of every period and thus be allowed to receive data. Under the protocol interference model, we investigate four group communication patterns, i.e., broadcast, data aggregation, data gathering, and gossiping. For each pattern, we develop a delay efficient scheduling algorithm which greatly improve the current state-of-the-art algorithm. Additionally, we propose a novel and efficient design to coherently couple the wireless interference requirement and duty cycle requirement.
Description: 7th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2012, Yellow Mountains, 8-10 August 2012
URI: http://hdl.handle.net/10397/24976
ISBN: 9783642318689
ISSN: 0302-9743
EISSN: 1611-3349
DOI: 10.1007/978-3-642-31869-6_17
Appears in Collections:Conference Paper

SFX Query Show full item record

SCOPUSTM   
Citations

4
Last Week
0
Last month
0
Citations as of Dec 9, 2017

Page view(s)

41
Last Week
1
Last month
Citations as of Dec 10, 2017

Google ScholarTM

Check

Altmetric


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