Topology partitioning in wireless sensor networks using multiple sinks
Zeenat Rehena, Sarbani Roy, Nandini Mukherjee · 2011
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.