Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/6836
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorMa, J-
dc.creatorLou, W-
dc.date.accessioned2014-12-11T08:25:55Z-
dc.date.available2014-12-11T08:25:55Z-
dc.identifier.issn1550-1329-
dc.identifier.urihttp://hdl.handle.net/10397/6836-
dc.language.isoenen_US
dc.publisherSage Publications, Inc.en_US
dc.rightsCopyright © 2012 Junchao Ma and Wei Lou. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.en_US
dc.subjectActive stateen_US
dc.subjectArbitrary graphsen_US
dc.subjectCommunication graphsen_US
dc.subjectEnergy wastagesen_US
dc.subjectGrid graphsen_US
dc.subjectGrid topologyen_US
dc.subjectIdle listeningen_US
dc.subjectNP completeen_US
dc.subjectOptimum numberen_US
dc.subjectPolynomial-time algorithmsen_US
dc.subjectScheduling problemen_US
dc.subjectSleep stateen_US
dc.subjectState transitionsen_US
dc.subjectTheoretical resulten_US
dc.subjectTime slotsen_US
dc.subjectWireless sensor network (WSNs)en_US
dc.titleInterference-free wakeup scheduling with consecutive constraints in wireless sensor networksen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.volume2012-
dc.identifier.doi10.1155/2012/525909-
dcterms.abstractWakeup scheduling has been widely used in wireless sensor networks (WSNs), for it can reduce the energy wastage caused by the idle listening state. In a traditional wakeup scheduling, sensor nodes start up numerous times 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 interference-free 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 it is NP-complete to decide whether a valid compact wakeup scheduling exists for an arbitrary graph. In particular, tree and grid topologies, which are commonly used in WSNs, have valid compact wakeup schedulings. We propose polynomial-time algorithms using the optimum number of time slots in a period for trees and grid graphs. Simulations further validate our theoretical results.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationInternational journal of distributed sensor networks, v. 2012, 525909, p. 1-17-
dcterms.isPartOfInternational journal of distributed sensor networks-
dcterms.issued2012-
dc.identifier.isiWOS:000301420000001-
dc.identifier.scopus2-s2.0-84858122126-
dc.identifier.eissn1550-1477-
dc.identifier.rosgroupidr61454-
dc.description.ros2011-2012 > Academic research: refereed > Publication in refereed journal-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Ma_Interference-Free_Wireless_Sensor.pdf2.25 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

94
Last Week
0
Last month
Citations as of Jun 26, 2022

Downloads

99
Citations as of Jun 26, 2022

SCOPUSTM   
Citations

2
Last Week
0
Last month
0
Citations as of Jun 23, 2022

Google ScholarTM

Check

Altmetric


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