Font Size: a A A

Research On Energy Efficient And Cluster Based Routing Protocol For Wireless Sensor Networks

Posted on:2014-02-09Degree:MasterType:Thesis
Country:ChinaCandidate:H R ZhaoFull Text:PDF
GTID:2248330395980842Subject:Control theory and control engineering
Abstract/Summary:PDF Full Text Request
Wireless Sensor Network (WSN) is a multi-hop Ad hoc self-organization network system, which is made up of a large number of sensor nodes which deploy in a monitoring region. Sensor nodes within the region construct a multi-hop Ad hoc self-organization network system through wireless communication, and they sense, collect and process environment data, send the corresponding data to the base station. The base station will operate the collected data then offer the result to users friendly. The users made related decision according to the information they receive.In Wireless Sensor Network, the nodes have limited energy is a constraint of WSN. Data aggregation is a process of dealing with a large number of data or information to combination more effective and satisfying user demand. Data aggregation can reach the goal that prolong the networks lifetime by reduce the number of data. The paper researches some basic theoretical knowledge of Wireless Sensor Network and data fusion. And then based on the static node LEACH algorithm is proposed. Finally, a kind of improved HEED-M mobile node routing algorithm is proposed. The main contents are as follows:(1) Wireless Sensor Networks and the basic knowledge node of data fusion is been studied. Some typical data aggregation algorithm is analyzed, including plane routing algorithm and hierarchy algorithm.(2) Based on LEACH algorithm is discussed in detail. The advantages and disadvantages of the algorithm are analyzed. When selecting the head of a cluster without considering the current remain energy of node, cluster head communicate with the base station by single-hop in LEACH, so improved it. When selecting the cluster head, set timing time according to the current remain energy and the distance between node and base station, use single-hop and multi-hop to communicate with base station. In multi-hop module, reference to a function of distance and remain energy to determine the best path, finally simulating the improved LEACH algorithm and comparing to the LEACH algorithm. (3) For the mobility of WSN, HEED-M is researched and discussed. We analyze advantages and disadvantages. And then a kind of improved HEED-M algorithm is proposed. In cluster generation phase, considering not only the minimum average power, but also calculating the cost to join different cluster and consider the node moving. And then comparing to the LEACH、HEED-M algorithm, the simulation result shows that the proposed algorithm can resolved the high energy consumption problem bring by networks mobility, which has superior performance in network life cycle, energy consumption and load balance.
Keywords/Search Tags:Wireless Sensor Network, routing, LEACH, HEED-M
PDF Full Text Request
Related items