Topology partitioning in wireless sensor networks using multiple sinks

Energy consumption is the key design criterion for routing data in wireless sensor Network. Recently the use of multiple sinks instead of single is considered as a research topic for energy saving. The objective is to maximize the network lifetime by reducing distance from source node to sink during...

Full description

Saved in:
Bibliographic Details
Published in2011 14th International Conference on Computer and Information Technology pp. 251 - 256
Main Authors Rehena, Z., Roy, S., Mukherjee, N.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2011
Subjects
Artificial neural networks
k-NNG
Multiple sinks
Partitioning network
Routing
Wireless Sensor Network
Wireless sensor networks
Online AccessGet full text

Cover

More Information
Summary:Energy consumption is the key design criterion for routing data in wireless sensor Network. Recently the use of multiple sinks instead of single is considered as a research topic for energy saving. The objective is to maximize the network lifetime by reducing distance from source node to sink during data transmission. This paper proposes a network partitioning algorithm based on selection of farthest node from k-Nearest Neighbour Graph. After partitioning, a restricted flooding-based routing protocol is used for data transmission. It is shown that the network lifetime significantly increases in a partitioned network in comparison with a non-partitioned network.
ISBN:1612849075
9781612849072
DOI:10.1109/ICCITechn.2011.6164793