Next Article in Journal
Plasmonic Refractive Index Sensor with High Figure of Merit Based on Concentric-Rings Resonator
Next Article in Special Issue
Data-Driven Packet Loss Estimation for Node Healthy Sensing in Decentralized Cluster
Previous Article in Journal
Evaluation of Apple Maturity with Two Types of Dielectric Probes
Previous Article in Special Issue
Activity Level Assessment Using a Smart Cushion for People with a Sedentary Lifestyle
Article Menu
Issue 1 (January) cover image

Export Article

Open AccessArticle
Sensors 2018, 18(1), 127;

Reliability-Aware Cooperative Node Sleeping and Clustering in Duty-Cycled Sensors Networks

School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China
Department of Software Engineering, College of Computer and Information Sciences, King Saud University, Riyadh 11543, Saudi Arabia
Authors to whom correspondence should be addressed.
Received: 31 October 2017 / Revised: 14 December 2017 / Accepted: 25 December 2017 / Published: 4 January 2018
Full-Text   |   PDF [4381 KB, uploaded 4 January 2018]   |  


Duty-cycled sensor networks provide a new perspective for improvement of energy efficiency and reliability assurance of multi-hop cooperative sensor networks. In this paper, we consider the energy-efficient cooperative node sleeping and clustering problems in cooperative sensor networks where clusters of relay nodes jointly transmit sensory data to the next hop. Our key idea for guaranteeing reliability is to exploit the on-demand number of cooperative nodes, facilitating the prediction of personalized end-to-end (ETE) reliability. Namely, a novel reliability-aware cooperative routing (RCR) scheme is proposed to select k-cooperative nodes at every hop (RCR-selection). After selecting k cooperative nodes at every hop, all of the non-cooperative nodes will go into sleep status. In order to solve the cooperative node clustering problem, we propose the RCR-based optimal relay assignment and cooperative data delivery (RCR-delivery) scheme to provide a low-communication-overhead data transmission and an optimal duty cycle for a given number of cooperative nodes when the network is dynamic, which enables part of cooperative nodes to switch into idle status for further energy saving. Through the extensive OPNET-based simulations, we show that the proposed scheme significantly outperforms the existing geographic routing schemes and beaconless geographic routings in wireless sensor networks with a highly dynamic wireless channel and controls energy consumption, while ETE reliability is effectively guaranteed. View Full-Text
Keywords: beaconless geographic routing; cooperative communication; duty cycle; energy efficiency; reliability-aware beaconless geographic routing; cooperative communication; duty cycle; energy efficiency; reliability-aware

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Song, J.; Miao, Y.; Song, E.; Hossain, M.S.; Alhamid, M.F. Reliability-Aware Cooperative Node Sleeping and Clustering in Duty-Cycled Sensors Networks. Sensors 2018, 18, 127.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top