Integrated clustering and routing strategies for large scale sensor networks

Authors:
Ataul Bari;Arunita Jaekel;Subir Bandyopadhyay
Affiliations:
School of Computer Science, University of Windsor, Windsor, ON, Canada;School of Computer Science, University of Windsor, Windsor, ON, Canada;School of Computer Science, University of Windsor, Windsor, ON, Canada
Venue:
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Year:
2007

Citing 4
Cited 5

Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-Efficient Communication Protocol for Wireless Microsensor Networks

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Optimal Data Delivery in Wireless Sensor Networks in the Energy and Latency Domains

WICON '05 Proceedings of the First International Conference on Wireless Internet
Relay node placement in large scale wireless sensor networks

Computer Communications

Design of sensor networks with guaranteed connectivity and lifetime

WICON '07 Proceedings of the 3rd international conference on Wireless internet
Relay node placement with energy and buffer constraints in wireless sensor networks using mobile data collector

International Journal of Sensor Networks
Fast track article: Designing hierarchical sensor networks with mobile data collectors

Pervasive and Mobile Computing
Energy aware fault tolerant routing in two-tiered sensor networks

ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
A new architecture for hierarchical sensor networks with mobile data collectors

ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In two-tiered sensor networks using relay nodes, sensor nodes are arranged in clusters and the higher-powered relay nodes can be used as cluster heads. The lifetime of the networks is determined primarily by the lifetime of the relay nodes. Clustering techniques and routing schemes play a crucial role in determining the useful network lifetime. Traditionally, the clustering and the routing problems, for these networks, have been considered independently and solved separately. In this paper, we present a new integer linear program (ILP) formulation that jointly optimizes both clustering and routing to maximize the lifetime of such networks. We show that our integrated approach can lead to significant improvements over techniques that consider clustering and routing separately, particularly for the non-flow-splitting (single-path) routing model. We also propose a heuristic, based on LP-relaxation of the routing variables, which can be used for larger networks.