Please use this identifier to cite or link to this item:
http://hdl.handle.net/11455/46855
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wen, C.Y. | en_US |
dc.contributor.author | 溫志煜 | zh_TW |
dc.contributor.author | Chen, Y.C. | en_US |
dc.date | 2009 | zh_TW |
dc.date.accessioned | 2014-06-06T08:22:20Z | - |
dc.date.available | 2014-06-06T08:22:20Z | - |
dc.identifier.issn | 1424-8220 | zh_TW |
dc.identifier.uri | http://hdl.handle.net/11455/46855 | - |
dc.description.abstract | This paper presents two scheduling management schemes for wireless sensor networks, which manage the sensors by utilizing the hierarchical network structure and allocate network resources efficiently. A local criterion is used to simultaneously establish the sensing coverage and connectivity such that dynamic cluster-based sleep scheduling can be achieved. The proposed schemes are simulated and analyzed to abstract the network behaviors in a number of settings. The experimental results show that the proposed algorithms provide efficient network power control and can achieve high scalability in wireless sensor networks. | en_US |
dc.language.iso | en_US | zh_TW |
dc.relation | Sensors | en_US |
dc.relation.ispartofseries | Sensors, Volume 9, Issue 5, Page(s) 3908-3941. | en_US |
dc.relation.uri | http://dx.doi.org/10.3390/s90503908 | en_US |
dc.subject | wireless sensor networks | en_US |
dc.subject | scheduling management | en_US |
dc.subject | sensing coverage | en_US |
dc.subject | coverage | en_US |
dc.title | Dynamic Hierarchical Sleep Scheduling for Wireless Ad-Hoc Sensor Networks | en_US |
dc.type | Journal Article | zh_TW |
dc.identifier.doi | 10.3390/s90503908 | zh_TW |
item.grantfulltext | none | - |
item.openairetype | Journal Article | - |
item.languageiso639-1 | en_US | - |
item.fulltext | no fulltext | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
Appears in Collections: | 通訊工程研究所 |
TAIR Related Article
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.