Abstract
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.
Highlights
The ubiquitous computing research studies and the deployment of urban wireless infrastructures make smart cities take shape [1,2,3,4,5]
The experiment results show that the algorithms can achieve highly reliable routing at the cost of modest configuration overhead compared with other baseline methods
When the link success probability is low, there is no difference in the performance with different Rd because our approaches select all parent nodes in routing graph
Summary
The ubiquitous computing research studies and the deployment of urban wireless infrastructures make smart cities take shape [1,2,3,4,5]. The construction of the global reliable routing is performed by the centralized manager to meet stringent requirements [16,17,18]. A simple and reliable routing mechanism named graph routing is presented by ISA 100.11a [15] and WirelessHART [14] These current standards do not specify a routing algorithm. We present flexible route selection algorithms which consider the reliability requirement together with network overhead. We propose the efficient algorithms to construct reliable graphs: determining the routing that (1) achieves the maximum proportion of nodes which successfully transmit packets to the destination node (2) and a tradeoff between the reliable routing and the network overhead.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
