Please use this identifier to cite or link to this item:
|Title:||An efficient data collecting network structure in wireless sensor networks|
|Keywords:||Metropolitan area networks|
Wireless telecommunication systems
|Source:||2008 International Conference on Communications, Circuits and Systems, Shanghai, China, May 25-27, 2008, p. 444-447 How to cite?|
|Abstract:||In a sensor network, a single event may be captured by hundreds of sensor nodes simultaneously. Data in these sensor nodes are thus highly correlated. Data transmission can be facilitated by employing data aggregation techniques. The traditional way to do data aggregation in a sensor network is to divide the network into clusters and elect one node as the cluster head in each cluster. These cluster heads are responsible for collecting data from other nodes within its belonging cluster. Collected data will first be fused before being forwarded to the base station. Due to the design limitations, most nodes in a sensor network are only capable of handling a single connection at a time. Therefore, to collect data from n cluster members, a cluster head will need at least n time slots. In this paper, a special network structure and its formation algorithm are proposed. Simulation results show that the proposed network structure can greatly reduce the delay in data collection.|
|Rights:||© 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holders.
|Appears in Collections:||Conference Paper|
Show full item record
Checked on Feb 19, 2017
Checked on Feb 19, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.