ScholarLens Back to search
2013•Unpublished venueRequires access

Research and Implementation of Data Collection Protocol for Wireless Sensor Networks

Hongke Xu, Xiaohong Wang, Mingqiang Song, Teng Feng, Liang Dai, Xiangjun He

Open publisher page 0 citations

Abstract

Wireless Sensor Network is a new self-organization and multi-hop network which deploys a lot of nodes which communicating with each other wirelessly, so the design of a appropriate routing protocol for wireless sensor networks is essential. In this script, the performances of many classical route strategies are introduced and analyzed. In order to test the performance of LEACH and LEACH-C algorithm, the NS2 (Network Simulator Version 2) is used to realize the simulation of the LEACH and LEACH-C algorithm in three different scenarios and analyze the results from three angles. The result shows that, in condition that the SINK node is not far from the deployed sensors, no matter the nodes are randomly deployed or deployed in linear, LEACH-C performs much better than LEACH. In the opposite condition, LEACH will perform better than LEACH-C except in the data throughput.

About this research paper

What this paper is about

Wireless Sensor Network is a new self-organization and multi-hop network which deploys a lot of nodes which communicating with each other wirelessly, so the design of a appropriate routing protocol for wireless sensor networks is essential. In this script, the performances of many classical route strategies are introduced and analyzed. In order to test the performance of LEACH and LEACH-C algorithm, the NS2 (Network Simulator Version 2) is used to realize the simulation of the LEACH and LEACH-C algorithm in three different scenarios and analyze the results from three angles. The result shows that, in condition that the SINK node is not far from the deployed sensors, no matter the nodes are randomly deployed or deployed in linear, LEACH-C performs much better than LEACH. In the opposite condition, LEACH will perform better than LEACH-C except in the data throughput.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Wireless Sensor Network is a new self-organization and multi-hop network which deploys a lot of nodes which communicating with each other wirelessly, so the design of a appropriate routing protocol for wireless sensor networks is essential. In this script, the performances of many classical route strategies are introduced and analyzed. In order to test the performance of LEACH and LEACH-C algorithm, the NS2 (Network Simulator Version 2) is used to realize the simulation of the LEACH and LEACH-C algorithm in three different scenarios and analyze the results from three angles. The result shows that, in condition that the SINK node is not far from the deployed sensors, no matter the nodes are randomly deployed or deployed in linear, LEACH-C performs much better than LEACH. In the opposite condition, LEACH will perform better than LEACH-C except in the data throughput.

Key concepts: Wireless sensor network, Computer science, Computer network, Routing protocol, Throughput, Protocol (science), Node (physics), Key distribution in wireless sensor networks

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Research and Implementation of Data Collection Protocol for Wireless Sensor Networks — Research Paper | ScholarLens