{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T05:25:53Z","timestamp":1738214753137,"version":"3.34.0"},"reference-count":17,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2008,3,18]],"date-time":"2008-03-18T00:00:00Z","timestamp":1205798400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Network Mgmt"],"published-print":{"date-parts":[[2009,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>One of the major requirements for new wireless sensor networks is to extend the lifetime of the network. Node\u2010scheduling techniques have been used extensively for this purpose. Some existing approaches rely mainly on location information through global positioning system (GPS) devices for designing efficient scheduling strategies. However, integration of GPS devices with sensor nodes is expensive and increases the cost of deployment dramatically. In this paper we present a location\u2010free solution for node scheduling. Our scheme is based on a graph theoretical approach using<jats:italic>minimum dominating sets<\/jats:italic>. We propose a heuristic to extract a collection of dominating sets. Each set consists of a group of working nodes which ensures a high level of network coverage. At each round, one set is responsible for covering the sensor field while the nodes in other sets are in sleep mode. We evaluate our solution through simulations and discuss our future research directions. Copyright \u00a9 2008 John Wiley &amp; Sons, Ltd.<\/jats:p>","DOI":"10.1002\/nem.689","type":"journal-article","created":{"date-parts":[[2008,3,18]],"date-time":"2008-03-18T10:58:29Z","timestamp":1205837909000},"page":"75-99","source":"Crossref","is-referenced-by-count":7,"title":["An energy\u2010efficient node\u2010scheduling scheme for wireless sensor networks based on minimum dominating sets"],"prefix":"10.1002","volume":"19","author":[{"given":"Babak","family":"Pazand","sequence":"first","affiliation":[]},{"given":"Amitava","family":"Datta","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2008,3,18]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.67"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1024422"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","unstructured":"MeguerdichianS KoushanfarF PotkonjakM SrivastavaMB.Coverage problems in wireless ad\u2010hoc sensor networks. InProceedings of IEEE Infocom 2001;1380\u20131387.","DOI":"10.1109\/INFCOM.2001.916633"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","unstructured":"SlijepcevicS PotkonjakM.Power efficient organization of wireless sensor networks. InIEEE International Conference on Communications (ICC) 2001;472\u2013476.","DOI":"10.1109\/ICC.2001.936985"},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","unstructured":"TianD GeorganasND.A coverage\u2010preserving node scheduling scheme for large wireless sensor networks. InProceedings of ACM Workshop on Wireless Sensor Networks and Applications Atlanta GA October2002.","DOI":"10.1145\/570738.570744"},{"key":"e_1_2_1_7_2","unstructured":"MeguerdichianS PotkonjakM.Low power 0\/1 coverage and scheduling techniques in sensor networks.UCLA Technical Report 030001 January2003."},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/1138127.1138131"},{"key":"e_1_2_1_9_2","doi-asserted-by":"crossref","unstructured":"HuangC\u2010F TsengY\u2010C.The coverage problem in a wireless sensor network. InACM International Workshop on Wireless Sensor Networks and Applications 2003;115\u2013121.","DOI":"10.1145\/941350.941367"},{"key":"e_1_2_1_10_2","unstructured":"YeF ZhongG ChengJ LuS ZhangL.PEAS: a robust energy conserving protocol for long\u2010lived sensor networks. InProceedings of the 23rd International Conference on Distributed Computing Systems 2003;28\u201337."},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/1077391.1077394"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2005.07.001"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1504\/IJAHUC.2005.008018"},{"key":"e_1_2_1_14_2","unstructured":"MICA2 Mote Datasheet 2006.https:\/\/linproxy.fan.workers.dev:443\/http\/www.xbow.com\/products\/Product_pdf_files\/Wireless_pdf\/MICA2_Datasheet.pdf[14 January 2008]."},{"key":"e_1_2_1_15_2","doi-asserted-by":"crossref","unstructured":"AnastasiG FalchiA PassarellaA ContiM GregoriE.Performance measurements of motes sensor networks. InProceedings of the ACM MSWiM Conference October2004.","DOI":"10.1145\/1023663.1023695"},{"key":"e_1_2_1_16_2","doi-asserted-by":"crossref","unstructured":"LeeWL DattaA Cardell\u2010OliverR.FlexiMAC: A flexible TDMA\u2010based MAC protocol for fault\u2010tolerant and energy\u2010efficient wireless sensor networks. InIEEE international Conference on Networks (ICON'06) September2006.","DOI":"10.1109\/ICON.2006.302648"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2005.31"},{"key":"e_1_2_1_18_2","doi-asserted-by":"crossref","unstructured":"GaneriwalS KumarR SrivastavaM.Timing\u2010sync protocol for sensor networks. InProceedings of the First ACM Conference on Embedded Networked Sensor Systems (SenSys) Los Angeles CA November2003.","DOI":"10.1145\/958491.958508"}],"container-title":["International Journal of Network Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnem.689","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/nem.689","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T04:17:12Z","timestamp":1738124232000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/10.1002\/nem.689"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,18]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["10.1002\/nem.689"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1002\/nem.689","archive":["Portico"],"relation":{},"ISSN":["1055-7148","1099-1190"],"issn-type":[{"type":"print","value":"1055-7148"},{"type":"electronic","value":"1099-1190"}],"subject":[],"published":{"date-parts":[[2008,3,18]]}}}