Geographic Routing in Duty-Cycled Industrial Wireless Sensor Networks With Radio Irregularity
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 (T...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2016-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/7781617/ |
| _version_ | 1818619594304126976 |
|---|---|
| author | Lei Shu Mithun Mukherjee Likun Hu Neil Bergmann Chunsheng Zhu |
| author_facet | Lei Shu Mithun Mukherjee Likun Hu Neil Bergmann Chunsheng Zhu |
| author_sort | Lei Shu |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-16T17:39:58Z |
| format | Article |
| id | doaj.art-1d61402d8e68412cb22cafb7825ecc77 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-16T17:39:58Z |
| publishDate | 2016-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-1d61402d8e68412cb22cafb7825ecc772022-12-21T22:22:38ZengIEEEIEEE Access2169-35362016-01-0149043905210.1109/ACCESS.2016.26384417781617Geographic Routing in Duty-Cycled Industrial Wireless Sensor Networks With Radio IrregularityLei Shu0Mithun Mukherjee1https://orcid.org/0000-0002-6605-180XLikun Hu2Neil Bergmann3Chunsheng Zhu4Guangdong Provincial Key Laboratory of Petrochemical Equipment Fault Diagnosis, Guangdong University of Petrochemical Technology, Maoming, ChinaGuangdong Provincial Key Laboratory of Petrochemical Equipment Fault Diagnosis, Guangdong University of Petrochemical Technology, Maoming, ChinaGuangdong Provincial Key Laboratory of Petrochemical Equipment Fault Diagnosis, Guangdong University of Petrochemical Technology, Maoming, ChinaSchool of Information Technology and Electrical Engineering The University of Queensland, Brisbane, QLD, AustraliaDepartment of Electrical and Computer Engineering, The University of British Columbia, Vancouver, BC, CanadaIndustrial 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.https://ieeexplore.ieee.org/document/7781617/Industrial Wireless Sensor NetworksSleep SchedulingGeographic RoutingRadio Irregularity |
| spellingShingle | Lei Shu Mithun Mukherjee Likun Hu Neil Bergmann Chunsheng Zhu Geographic Routing in Duty-Cycled Industrial Wireless Sensor Networks With Radio Irregularity IEEE Access Industrial Wireless Sensor Networks Sleep Scheduling Geographic Routing Radio Irregularity |
| title | Geographic Routing in Duty-Cycled Industrial Wireless Sensor Networks With Radio Irregularity |
| title_full | Geographic Routing in Duty-Cycled Industrial Wireless Sensor Networks With Radio Irregularity |
| title_fullStr | Geographic Routing in Duty-Cycled Industrial Wireless Sensor Networks With Radio Irregularity |
| title_full_unstemmed | Geographic Routing in Duty-Cycled Industrial Wireless Sensor Networks With Radio Irregularity |
| title_short | Geographic Routing in Duty-Cycled Industrial Wireless Sensor Networks With Radio Irregularity |
| title_sort | geographic routing in duty cycled industrial wireless sensor networks with radio irregularity |
| topic | Industrial Wireless Sensor Networks Sleep Scheduling Geographic Routing Radio Irregularity |
| url | https://ieeexplore.ieee.org/document/7781617/ |
| work_keys_str_mv | AT leishu geographicroutingindutycycledindustrialwirelesssensornetworkswithradioirregularity AT mithunmukherjee geographicroutingindutycycledindustrialwirelesssensornetworkswithradioirregularity AT likunhu geographicroutingindutycycledindustrialwirelesssensornetworkswithradioirregularity AT neilbergmann geographicroutingindutycycledindustrialwirelesssensornetworkswithradioirregularity AT chunshengzhu geographicroutingindutycycledindustrialwirelesssensornetworkswithradioirregularity |