Font Size: a A A

Clustering Routing Protocol Based On Minimun Hop Routing In Wireless Sensor Network

Posted on:2016-05-07Degree:MasterType:Thesis
Country:ChinaCandidate:H ZhangFull Text:PDF
GTID:2308330461476518Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
Wireless sensor network based on micro-electromechanical system combined with the embedded technology, composed of a large of multifunctional sensor nodes in the monitoring network in the form of self-organization. Wireless sensor node has the advantage of low cost, multiple functions, simple deployment, but it also embodies some problems in actual application: firstl, the sensor nodes are powered by battery and could not through artificial maintenance to replace the battery; second, sensor nodes are usually deployed in remote harsh areas, complex environmental condition require the topology of the network should be excellent;third, sensor nodes has a large number of redundant in sampling. In order to solve the above problems, the design of efficient routing strategy and optimize the network topology has increasingly become a key research topic at home and abroad.Based on routing algorithm and network topology is studied, the main contribution in the paper are as follows:First, aiming at the transmission link instability and delay problems, this paper proposes a residual energy and congestion control algorithm based on minimum hop routing(CEMHR).To the problem of delay in transmission data,comprehensively consider the residual energy of the nodes and the degree of congestion to select the next-hop node; for data transmission, the algorithm introduces the idea of multi-node backup, with finite state machine model to ensure reliable transmission of data. Simulation results show that the CEMHR algorithm can effectively improve the efficiency of network transmission, a balanced use of the network node energy, in different network environment can effectively reduce the transmission delay,improve the network lifetime.Second, this paper puts forward Model-HEED(M-HEED). In data sampling phase, model prediction technology replaces the traditional sensor sampling; in clustering stage, instead of a large number of member nodes into the cluster but a small amount of super nodes into the cluster; routing between clusters using CEMHR algorithm to ensure the reliable transmission of model and data; to re-clustering mechanism is no longer a periodic elections, but according to the practical application of judgement, based on node residual energy and whether there is abnormal; In order to improve the reliability of the network, the algorithm proposed two-stage link detection technology, it is the Sink to the clusters and the clusters to the super node. Finally, compared with the HEED algorithm,our M-HEED algorithm can prolong the network lifetime effectively, reduce the data redundancy, improve the network transmission efficiency at the same time,guarantee the network safe and reliable.
Keywords/Search Tags:Wireless Sensor Network, Minimum Hop Routing, Congestion Control, Clustering Routing Algorithm, Model Optimization
PDF Full Text Request
Related items