Sleep scheduling with expected common coverage in wireless sensor networks

dc.citation.epage40en_US
dc.citation.issueNumber1en_US
dc.citation.spage19en_US
dc.citation.volumeNumber17en_US
dc.contributor.authorBulut, E.en_US
dc.contributor.authorKorpeoglu, I.en_US
dc.date.accessioned2016-02-08T09:55:01Z
dc.date.available2016-02-08T09:55:01Z
dc.date.issued2011en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.description.abstractSleep scheduling, which is putting some sensor nodes into sleep mode without harming network functionality, is a common method to reduce energy consumption in dense wireless sensor networks. This paper proposes a distributed and energy efficient sleep scheduling and routing scheme that can be used to extend the lifetime of a sensor network while maintaining a user defined coverage and connectivity. The scheme can activate and deactivate the three basic units of a sensor node (sensing, processing, and communication units) independently. The paper also provides a probabilistic method to estimate how much the sensing area of a node is covered by other active nodes in its neighborhood. The method is utilized by the proposed scheduling and routing scheme to reduce the control message overhead while deciding the next modes (full-active, semi-active, inactive/sleeping) of sensor nodes. We evaluated our estimation method and scheduling scheme via simulation experiments and compared our scheme also with another scheme. The results validate our probabilistic method for coverage estimation and show that our sleep scheduling and routing scheme can significantly increase the network lifetime while keeping the message complexity low and preserving both connectivity and coverage. © 2010 Springer Science+Business Media, LLC.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T09:55:01Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2011en
dc.identifier.doi10.1007/s11276-010-0262-2en_US
dc.identifier.issn1022-0038en_US
dc.identifier.urihttp://hdl.handle.net/11693/22067en_US
dc.language.isoEnglishen_US
dc.publisherSpringer New York LLCen_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/s11276-010-0262-2en_US
dc.source.titleWireless Networks: the journal of mobile communication, computation and informationen_US
dc.subjectDistributed algorithmsen_US
dc.subjectNetwork protocolsen_US
dc.subjectSleep schedulingen_US
dc.subjectWireless ad hoc and sensor networksen_US
dc.titleSleep scheduling with expected common coverage in wireless sensor networksen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Sleep scheduling with expected common coverage in wireless sensor networks.pdf
Size:
963.7 KB
Format:
Adobe Portable Document Format
Description:
Full printable version