Reliable Graph Routing in Industrial Wireless Sensor Networks
Research studies on smart cities have been conducted, which will enable a better management of the available resources. Industrial wireless sensor networks (IWSNs) are important part of smart city. IWSNs are used for process measurement and control applications in harsh and noisy industrial environm...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi - SAGE Publishing
2013-12-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2013/758217 |
| _version_ | 1797710240977780736 |
|---|---|
| author | Jing Zhao Yajuan Qin Dong Yang Junqi Duan |
| author_facet | Jing Zhao Yajuan Qin Dong Yang Junqi Duan |
| author_sort | Jing Zhao |
| collection | DOAJ |
| description | Research studies on smart cities have been conducted, which will enable a better management of the available resources. Industrial wireless sensor networks (IWSNs) are important part of smart city. IWSNs are used for process measurement and control applications in harsh and noisy industrial environments. As substitutes for traditional wired industrial networks, IWSNs are more flexible, scalable, and efficient. However, resource limitation of the sensor nodes and unreliability of low-power wireless links, in combination with stringent quality of the service (QoS) requirements of industrial applications, imposes many challenges in designing efficient routing for IWSNs. Existing standards propose a simple and reliable routing mechanism named graph routing. In this paper, we propose novel routing algorithms to discover reliable paths and construct reliable routing graphs. In our approaches, the centralized manager selects parent nodes for each node in the network to satisfy reliability requirements of the intended application. We try to maximize the number of reliable nodes and change the parent nodes selection strategy along with the link quality and the link correlation. Our design is evaluated using simulation where we show that our algorithm could achieve a balance between routing reliability and overhead. |
| first_indexed | 2024-03-12T06:49:19Z |
| format | Article |
| id | doaj.art-7b24adc09cb2459cb6a9dc73763757b7 |
| institution | Directory Open Access Journal |
| issn | 1550-1477 |
| language | English |
| last_indexed | 2024-03-12T06:49:19Z |
| publishDate | 2013-12-01 |
| publisher | Hindawi - SAGE Publishing |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj.art-7b24adc09cb2459cb6a9dc73763757b72023-09-03T00:23:55ZengHindawi - SAGE PublishingInternational Journal of Distributed Sensor Networks1550-14772013-12-01910.1155/2013/758217758217Reliable Graph Routing in Industrial Wireless Sensor NetworksJing ZhaoYajuan QinDong YangJunqi DuanResearch studies on smart cities have been conducted, which will enable a better management of the available resources. Industrial wireless sensor networks (IWSNs) are important part of smart city. IWSNs are used for process measurement and control applications in harsh and noisy industrial environments. As substitutes for traditional wired industrial networks, IWSNs are more flexible, scalable, and efficient. However, resource limitation of the sensor nodes and unreliability of low-power wireless links, in combination with stringent quality of the service (QoS) requirements of industrial applications, imposes many challenges in designing efficient routing for IWSNs. Existing standards propose a simple and reliable routing mechanism named graph routing. In this paper, we propose novel routing algorithms to discover reliable paths and construct reliable routing graphs. In our approaches, the centralized manager selects parent nodes for each node in the network to satisfy reliability requirements of the intended application. We try to maximize the number of reliable nodes and change the parent nodes selection strategy along with the link quality and the link correlation. Our design is evaluated using simulation where we show that our algorithm could achieve a balance between routing reliability and overhead.https://doi.org/10.1155/2013/758217 |
| spellingShingle | Jing Zhao Yajuan Qin Dong Yang Junqi Duan Reliable Graph Routing in Industrial Wireless Sensor Networks International Journal of Distributed Sensor Networks |
| title | Reliable Graph Routing in Industrial Wireless Sensor Networks |
| title_full | Reliable Graph Routing in Industrial Wireless Sensor Networks |
| title_fullStr | Reliable Graph Routing in Industrial Wireless Sensor Networks |
| title_full_unstemmed | Reliable Graph Routing in Industrial Wireless Sensor Networks |
| title_short | Reliable Graph Routing in Industrial Wireless Sensor Networks |
| title_sort | reliable graph routing in industrial wireless sensor networks |
| url | https://doi.org/10.1155/2013/758217 |
| work_keys_str_mv | AT jingzhao reliablegraphroutinginindustrialwirelesssensornetworks AT yajuanqin reliablegraphroutinginindustrialwirelesssensornetworks AT dongyang reliablegraphroutinginindustrialwirelesssensornetworks AT junqiduan reliablegraphroutinginindustrialwirelesssensornetworks |