Geographic routing in duty-cycled industrial wireless sensor networks with radio irregularity

Shu, Lei and Mukherjee, Mithun and Hu, Likun and Bergmann, Neil and Zhu, Chunsheng (2016) Geographic routing in duty-cycled industrial wireless sensor networks with radio irregularity. IEEE Access, 4 . pp. 9043-9052. ISSN 2169-3536

Documents
Geographic Routing in Duty-Cycled Industrial Wireless Sensor Networks With Radio Irregularity.pdf
[img]
[Download]
[img]
Preview
PDF
Geographic Routing in Duty-Cycled Industrial Wireless Sensor Networks With Radio Irregularity.pdf - Whole Document

16MB
Item Type:Article
Item Status:Live Archive

Abstract

Industrial wireless sensor networks (IWSNs) are required to provide highly reliable and real-time transmission. Moreover, for connected K-neighborhood (CKN) sleep scheduling-based duty-cycled IWSNs in which the network lifetime of IWSNs can be prolonged, the two-phase geographic greedy forwarding (TPGF) geographic routing algorithm has attracted attention due to its unique transmission features: multi path, shortest path, and hole bypassing. However, the performance of TPGF in CKN-based duty-cycled IWSNs with radio irregularity is not well investigated in the literature. In this paper, we first evaluate the impact of radio irregularity on CKN-based duty-cycled IWSNs. Furthermore, we investigate the routing performance of TPGF in CKN-based duty-cycled IWSNs with radio irregularity, in terms of the number of explored routing paths as well as the lengths of the average and shortest routing paths. Particularly, we establish the upper bound on the number of explored routing paths. The upper bound is slightly relaxed with radio irregularity compared with without radio irregularity; however, it is bounded by the number of average 1-hop neighbors in always-on IWSNs. With extensive simulations, we observe that the cross-layer optimized version of TPGF (i.e., TPFGPlus) finds reliable transmission paths with low end-to-end delay, even in CKN-based duty-cycled IWSNs with radio irregularity.

Keywords:Routing, Wireless sensor networks, Upper bound, Delays, Job shop scheduling, Bidirectional control, Industrial plants, NotOAChecked
Subjects:G Mathematical and Computer Sciences > G420 Networks and Communications
Divisions:College of Science > School of Computer Science
Related URLs:
ID Code:26157
Deposited On:03 Feb 2017 20:21

Repository Staff Only: item control page