An Energy-Efficient CKN Algorithm for Duty-Cycled Wireless Sensor Networks
To prolong the lifetime of a wireless sensor network, one common approach is to dynamically schedule sensors' active/sleep cycles (i.e., duty cycles) using sleep scheduling algorithms. The connected K -neighborhood (CKN) algorithm is an efficient decentralized sleep scheduling algorithm for red...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi - SAGE Publishing
2012-05-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2012/106439 |
| _version_ | 1797763371572920320 |
|---|---|
| author | Lei Wang Zhuxiu Yuan Lei Shu Liang Shi Zhenquan Qin |
| author_facet | Lei Wang Zhuxiu Yuan Lei Shu Liang Shi Zhenquan Qin |
| author_sort | Lei Wang |
| collection | DOAJ |
| description | To prolong the lifetime of a wireless sensor network, one common approach is to dynamically schedule sensors' active/sleep cycles (i.e., duty cycles) using sleep scheduling algorithms. The connected K -neighborhood (CKN) algorithm is an efficient decentralized sleep scheduling algorithm for reducing the number of awake nodes while maintaining both network connectivity and an on-demand routing latency. In this paper, we investigate the unexplored energy consumption of the CKN algorithm by building a probabilistic node sleep model, which computes the probability that a random node goes to sleep. Based on this probabilistic model, we obtain a lower epoch bound that keeps the network more energy efficient with longer lifetime when it runs the CKN algorithm than it does not. Furthermore, we propose a new sleep scheduling algorithm, namely, Energy-consumption-based CKN (ECCKN), to prolong the network lifetime. The algorithm EC-CKN, which takes the nodes' residual energy information as the parameter to decide whether a node to be active or sleep, not only can achieve the k -connected neighborhoods problem, but also can assure the k -awake neighbor nodes have more residual energy than other neighbor nodes in current epoch. |
| first_indexed | 2024-03-12T19:41:41Z |
| format | Article |
| id | doaj.art-c34afac83f1c45dbaaf7c1049faa2a13 |
| institution | Directory Open Access Journal |
| issn | 1550-1477 |
| language | English |
| last_indexed | 2024-03-12T19:41:41Z |
| publishDate | 2012-05-01 |
| publisher | Hindawi - SAGE Publishing |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj.art-c34afac83f1c45dbaaf7c1049faa2a132023-08-02T03:50:02ZengHindawi - SAGE PublishingInternational Journal of Distributed Sensor Networks1550-14772012-05-01810.1155/2012/106439An Energy-Efficient CKN Algorithm for Duty-Cycled Wireless Sensor NetworksLei Wang0Zhuxiu Yuan1Lei Shu2Liang Shi3Zhenquan Qin4 School of Software, Dalian University of Technology, Dalian 116621, China School of Software, Dalian University of Technology, Dalian 116621, China Department Multimedia Engineering, Osaka University, Osaka 565-0871, Japan School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, China School of Software, Dalian University of Technology, Dalian 116621, ChinaTo prolong the lifetime of a wireless sensor network, one common approach is to dynamically schedule sensors' active/sleep cycles (i.e., duty cycles) using sleep scheduling algorithms. The connected K -neighborhood (CKN) algorithm is an efficient decentralized sleep scheduling algorithm for reducing the number of awake nodes while maintaining both network connectivity and an on-demand routing latency. In this paper, we investigate the unexplored energy consumption of the CKN algorithm by building a probabilistic node sleep model, which computes the probability that a random node goes to sleep. Based on this probabilistic model, we obtain a lower epoch bound that keeps the network more energy efficient with longer lifetime when it runs the CKN algorithm than it does not. Furthermore, we propose a new sleep scheduling algorithm, namely, Energy-consumption-based CKN (ECCKN), to prolong the network lifetime. The algorithm EC-CKN, which takes the nodes' residual energy information as the parameter to decide whether a node to be active or sleep, not only can achieve the k -connected neighborhoods problem, but also can assure the k -awake neighbor nodes have more residual energy than other neighbor nodes in current epoch.https://doi.org/10.1155/2012/106439 |
| spellingShingle | Lei Wang Zhuxiu Yuan Lei Shu Liang Shi Zhenquan Qin An Energy-Efficient CKN Algorithm for Duty-Cycled Wireless Sensor Networks International Journal of Distributed Sensor Networks |
| title | An Energy-Efficient CKN Algorithm for Duty-Cycled Wireless Sensor Networks |
| title_full | An Energy-Efficient CKN Algorithm for Duty-Cycled Wireless Sensor Networks |
| title_fullStr | An Energy-Efficient CKN Algorithm for Duty-Cycled Wireless Sensor Networks |
| title_full_unstemmed | An Energy-Efficient CKN Algorithm for Duty-Cycled Wireless Sensor Networks |
| title_short | An Energy-Efficient CKN Algorithm for Duty-Cycled Wireless Sensor Networks |
| title_sort | energy efficient ckn algorithm for duty cycled wireless sensor networks |
| url | https://doi.org/10.1155/2012/106439 |
| work_keys_str_mv | AT leiwang anenergyefficientcknalgorithmfordutycycledwirelesssensornetworks AT zhuxiuyuan anenergyefficientcknalgorithmfordutycycledwirelesssensornetworks AT leishu anenergyefficientcknalgorithmfordutycycledwirelesssensornetworks AT liangshi anenergyefficientcknalgorithmfordutycycledwirelesssensornetworks AT zhenquanqin anenergyefficientcknalgorithmfordutycycledwirelesssensornetworks AT leiwang energyefficientcknalgorithmfordutycycledwirelesssensornetworks AT zhuxiuyuan energyefficientcknalgorithmfordutycycledwirelesssensornetworks AT leishu energyefficientcknalgorithmfordutycycledwirelesssensornetworks AT liangshi energyefficientcknalgorithmfordutycycledwirelesssensornetworks AT zhenquanqin energyefficientcknalgorithmfordutycycledwirelesssensornetworks |