Sleep Scheduling for Geographic Routing in Duty-Cycled Mobile Sensor Networks

Recently, the research focus on geographic routing, a promising routing scheme in wireless sensor networks (WSNs), is shifting toward duty-cycled WSNs in which sensors are sleep scheduled to reduce energy consumption. However, except the connected-k neighborhood (CKN) sleep scheduling algorithm and...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on industrial electronics (1982) 2014-11, Vol.61 (11), p.6346-6355
Main Authors: Zhu, Chunsheng, Yang, Laurence T., Shu, Lei, Leung, Victor C. M., Rodrigues, Joel J. P. C., Wang, Lei
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Algorithms
Educational institutions
Job shop scheduling
Mobile communication
Neighborhoods
Routing
Scheduling algorithms
Sleep
Wireless sensor networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Recently, the research focus on geographic routing, a promising routing scheme in wireless sensor networks (WSNs), is shifting toward duty-cycled WSNs in which sensors are sleep scheduled to reduce energy consumption. However, except the connected-k neighborhood (CKN) sleep scheduling algorithm and the geographic routing oriented sleep scheduling (GSS) algorithm, nearly all research work about geographic routing in duty-cycled WSNs has focused on the geographic forwarding mechanism; further, most of the existing work has ignored the fact that sensors can be mobile. In this paper, we focus on sleep scheduling for geographic routing in duty-cycled WSNs with mobile sensors and propose two geographic-distance-based connected-k neighborhood (GCKN) sleep scheduling algorithms. The first one is the geographic-distance-based connected-kneighborhood for first path (GCKNF) sleep scheduling algorithm. The second one is the geographic-distance-based connected-kneighborhood for all paths (GCKNA) sleep scheduling algorithm. By theoretical analysis and simulations, we show that when there are mobile sensors, geographic routing can achieve much shorter average lengths for the first transmission path explored in WSNs employing GCKNF sleep scheduling and all transmission paths searched in WSNs employing GCKNA sleep scheduling compared with those in WSNs employing CKN and GSS sleep scheduling.
ISSN:0278-0046
1557-9948
DOI:10.1109/TIE.2014.2311390