Clustering Routing Protocol Based On Opportunistic Routing In Wireless Sensor Network

Wireless sensor networks as the new-type data information acquisition and processing mode are widely applied to the fields of military aviation, space exploration, environmental monitoring, medical treatment, and so on. However, the WSNs are always deployed in remote harsh areas, and the complexity and variability of the wireless channel leads to frequent interruptions of the transmission links. Generally, sensor nodes are powered by energy limited battery, which will stop working once the battery runs out of energy. So the energy problem has always been the bottleneck of network performance. Moreover, when an emergency occurs, such as nodes break down, we expect the node to transmit a high-priority packet to the supervision center immediately. To solve the problems above, how to construct a valid network topology and design high-efficiency routing algorithm to meet the need of different applications become hot topics in the wireless sensor networks research.This paper is focusing on the solution of the problem mentioned above, the mainly contributions are list as follows:First, in order to achieve the requirement of the data transmission delay for different priorities data, this paper proposes a congestion control algorithm based on multi-priority data for opportunistic routing (CEDOR), which takes the shortest path prediction, residual energy and congestion control into account. The algorithm relies on Delivery Utility to determine the candidate forwarding node set in the procedure of data transmission. Simulation result shows that the proposed CEDOR algorithm can effectively improve the efficiency of network data transmission and ensure the high priority data being delivered on time under the guarantee of network lifetime and energy balance.Second, based on compare and analysis the existing classic clustering routing algorithm HEED, this paper proposes an efficiency dynamic clustering routing algorithm ED-HEED. In the cluster selection process, in order to optimize the network topology and select better nodes as the cluster head, the modified clustering algorithm considers the shortest path prediction of the node to the destination Sink and the congestion situation. In the data transmission procedure, the proposed high-efficiency CEDOR opportunistic routing algorithm is applied into the ED-HEED as the data transmission mode between cluster headers. A novel adaptive dynamic clustering mechanism is also considered into the algorithm, as well as the data redundancy and security control mechanism. Our Simulation demonstrates that compared with the HEED algorithm, the ED-HEED algorithm can reduce the energy consumption, prolong the network life and keep the security and availability of the network.