Compact wakeup scheduling in wireless sensor networks

Junchao Ma, Wei Lou

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review


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.
Original languageEnglish
Title of host publication2010 IEEE Global Telecommunications Conference, GLOBECOM 2010
Publication statusPublished - 1 Dec 2010
Event53rd IEEE Global Communications Conference, GLOBECOM 2010 - Miami, FL, United States
Duration: 6 Dec 201010 Dec 2010


Conference53rd IEEE Global Communications Conference, GLOBECOM 2010
Country/TerritoryUnited States
CityMiami, FL

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'Compact wakeup scheduling in wireless sensor networks'. Together they form a unique fingerprint.

Cite this