Please use this identifier to cite or link to this item:
Title: Compact wakeup scheduling in wireless sensor networks
Authors: Ma, J
Lou, W 
Keywords: Scheduling
Telecommunication network topology
Wireless sensor networks
Issue Date: 2010
Publisher: IEEE
Source: 2010 IEEE Global Telecommunications Conference GLOBECOM 2010 : 6-10 December 2010, Miami, Florida, USA, p. 1-5 How to cite?
Abstract: In a traditional wakeup scheduling, sensor nodes start up numerous times to communicate in a period, thus consuming extra energy due to state transitions (e.g. from the sleep state to the active state). In this paper, we address a novel wakeup scheduling problem called compact wakeup scheduling, in which a node needs to wake up only once to communicate bidirectionally with all its neighbors. However, not all communication graphs have valid compact wakeup schedulings, and thus we focus on tree and grid topologies that have valid compact wakeup schedulings. We propose polynomial-time algorithms using the optimum number of time slots in a period for tree and grid topologies.
ISBN: 978-1-4244-5636-9
978-1-4244-5637-6 (E-ISBN)
ISSN: 1930-529X
DOI: 10.1109/GLOCOM.2010.5683587
Appears in Collections:Conference Paper

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

Page view(s)

Last Week
Last month
Citations as of Feb 18, 2019

Google ScholarTM



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