Font Size: a A A

The Study On Routing Protocol For Wireless Sensor Networks Based On Minimum Energy Consumption Tree

Posted on:2011-06-10Degree:MasterType:Thesis
Country:ChinaCandidate:Y PengFull Text:PDF
GTID:2178360305451476Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
The wireless sensor network(WSN) combinates of sensor technology, computing technology and communication technology. Inexpensive sensors capable of significant computation and wireless communication are becoming available. These sensor nodes can be deployed to collect useful information from the field in a variety of scenarios including military surveillance, landmine detection, in harsh physical environments, for scientific investigations. The applications of WSN has caused many countries in the world of the military departments, industry and academia extensive attention because of the tremendous value, and it has been widely used in military, industrial process control, national security, environmental monitoring and other fields.Limited and irreplaceable energy of the WSN nodes makes it important to design an efficient routing protocol for reducing the energy consumption and prolonging the lifetime of wireless sensor networks. For solving the problem above, various routing protocol has been proposed, such as LEACH, PEAGSIS etc. Unfortunately, these protocols do not properly figure out the problem of how to efficiently save nodes energy.MECT reduces the communication energy consumption in each round by collecting data from a spanning tree. It regards the network as an indirected and connected graph, and base station produces a tree based on it. Data transfer begins from the leaf to the root. MECT considers not only the total energy consumption in each round but also the evenness of energy consumption of every node. So, the protocol can guarantee both the reduction of energy consumption and the load balance.Parallel transmission is adopted during the process of data transfer in MECT. In each round, base station allocates the time slot for every node after producing the spanning tree. The allocated time slot can make more than one node pair transfers its data without collision. It efficiently improves transfer efficiency and reduces the time delay. This paper makes simulation on MECT. The results show MECT outperforms LEACH and PEGASIS in terms of lifetime and time delay.
Keywords/Search Tags:wireless sensor networks, minimum spanning tree, residual energy, time delay
PDF Full Text Request
Related items