Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

An Efficient Localized Chain Construction Scheme for Chain Oriented Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Mamun, Q. ; Clayton Sch. of IT, Monash Univ., Clayton, VIC, Australia ; Ramakrishnan, S. ; Srinivasan, B.

An efficient logical topology helps wireless sensor networks (WSNs) minimizing different constraints. For large-scale WSNs, chain oriented logical topologies are shown to be more energy conservative than other logical topologies. Chain construction is the main challenge to create a chain oriented logical topology. In this paper, we propose a chain construction scheme, which creates several chains for the topology using Voronoi tessellation. The main idea of this scheme is to divide the target field into a number of small areas (i.e., Voronoi cells) so that in each cell, a chain is constructed. To construct a chain in a Voronoi cell, we use a protocol, which guarantees the summation of square to the distances would be the lowest. We compare our chain construction algorithm with other similar algorithms. Simulation results show that proposed Voronoi diagram based algorithm saves more energy, lengthens lifetime of the network, and reduces data collection latency.

Published in:

Autonomous Decentralized Systems (ISADS), 2011 10th International Symposium on

Date of Conference:

23-27 March 2011