F. Liberati, G. Oddi, Andrea Lanna, A. Pietrabissa
{"title":"一种面向集群无线传感器网络的轻量级传感器调度算法","authors":"F. Liberati, G. Oddi, Andrea Lanna, A. Pietrabissa","doi":"10.1109/MED.2015.7158881","DOIUrl":null,"url":null,"abstract":"This paper deals with the design of a lightweight sensor scheduling algorithm in clustered wireless sensor networks (WSNs) for environmental observation. The aim is that of achieving energy savings and a fair distribution of the sensing task among WSN nodes, while ensuring that critical network tasks, such as data fusion, are not impaired. The proposed scheduling policy takes into account feedback on nodes' health status and the quality of the information provided by the nodes to be scheduled. As a result, dynamically variable schedules are produced, adapted to the current status of the WSN. Simulation results are presented to highlight the relevant features of the algorithm.","PeriodicalId":316642,"journal":{"name":"2015 23rd Mediterranean Conference on Control and Automation (MED)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A lightweight sensor scheduling algorithm for clustered wireless sensor networks\",\"authors\":\"F. Liberati, G. Oddi, Andrea Lanna, A. Pietrabissa\",\"doi\":\"10.1109/MED.2015.7158881\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper deals with the design of a lightweight sensor scheduling algorithm in clustered wireless sensor networks (WSNs) for environmental observation. The aim is that of achieving energy savings and a fair distribution of the sensing task among WSN nodes, while ensuring that critical network tasks, such as data fusion, are not impaired. The proposed scheduling policy takes into account feedback on nodes' health status and the quality of the information provided by the nodes to be scheduled. As a result, dynamically variable schedules are produced, adapted to the current status of the WSN. Simulation results are presented to highlight the relevant features of the algorithm.\",\"PeriodicalId\":316642,\"journal\":{\"name\":\"2015 23rd Mediterranean Conference on Control and Automation (MED)\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 23rd Mediterranean Conference on Control and Automation (MED)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MED.2015.7158881\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 23rd Mediterranean Conference on Control and Automation (MED)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MED.2015.7158881","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A lightweight sensor scheduling algorithm for clustered wireless sensor networks
This paper deals with the design of a lightweight sensor scheduling algorithm in clustered wireless sensor networks (WSNs) for environmental observation. The aim is that of achieving energy savings and a fair distribution of the sensing task among WSN nodes, while ensuring that critical network tasks, such as data fusion, are not impaired. The proposed scheduling policy takes into account feedback on nodes' health status and the quality of the information provided by the nodes to be scheduled. As a result, dynamically variable schedules are produced, adapted to the current status of the WSN. Simulation results are presented to highlight the relevant features of the algorithm.