Abstract
The graph routing is a kind of routing mechanism proposed in the wireless senor network. At present, there is less research on the graph routing algorithm. In this paper, a routing algorithm of wireless senor network based on Received Signal Strength Indication (RSSI) and path stability is presented. The hierarchical algorithm based on RSSI of the communication link was adopted and guaranteed the least hop and communication reliability. The paper takes advantage of the hierarchical algorithm based on RSSI to ensure minimum number of hops and communication availability. A communication link quality mechanism based on path stability and RSSI that is used for communication nodes among layers is proposed. The routing among layers is selected based on the communication quality mechanism. The source routing is realized and used to the unicast downstream data transmission in Wireless senor network. The paper realized the source routing based on path stability.
Highlights
The development of micro-electronics technology and the research of wireless sensor network lay the technical foundation for process industry being wireless
When the value of Received Signal Strength Indication (RSSI) is lower than the valve -80db, the link is cancelled by the hierarchy algorithm and its value of the path stability isn’t provided in the table1.As an example, the graph routing algorithm in the paper is illustrated in figure 2
Based on wireless Highway Addressable Remote Transducer (HART) graph routing algorithm, a algorithm based on RSSI and path stability is proposed in the paper
Summary
The development of micro-electronics technology and the research of wireless sensor network lay the technical foundation for process industry being wireless. Time Division Multiple Address (TDMA) scheduling with frequency hopping that takes advantage of multifrequency, many links and the retry information is allocated to ensure the reliability. 3) Communication Mode In order to avoid conflict, TDMA is selected for the communication in wireless HART. It takes advantage of the clock synchronization technology of the whole network to ensure the transmission security. Graph routing used for information transmission among devices is the key technology for great communication reliability. In this paper a graph routing algorithm based on the quality of the communication link is proposed. The routing selection between layers depends on the quality measure of communication link. The source routing algorithm defined by wireless HART is realized in the paper
Sign-in/Register to view highlights & summary 
Published Version (
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