点击次数：

论文类型：期刊论文

发表时间：2014-11-01

发表刊物：IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS

收录刊物：SCIE、EI、Scopus

卷号：61

期号：11

页面范围：6346-6355

ISSN号：0278-0046

关键字：Connected-k neighborhood (CKN); duty-cycle; geographic routing; mobility; wireless sensor networks (WSNs)

摘要：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.