Experimental analysis of simple, distributed vertex coloring algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Application-specific protocol architectures for wireless networks
Application-specific protocol architectures for wireless networks
Topology control for wireless sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Clustering strategies for improving the lifetime of two-tiered sensor networks
Computer Communications
Optimal placement and routing strategies for resilient two-tiered sensor networks
Wireless Communications & Mobile Computing
Relay node placement in large scale wireless sensor networks
Computer Communications
| Hi-index | 0.00 |
In hierarchical two-tiered sensor networks, higher-powered relay nodes have recently been proposed to be used as cluster heads for designing scalable sensor networks.The assignment of sensor nodes to clusters in an energy-efficient way is known to improve the lifetime of such networks. In this paper we have proposed two efficient distributed algorithms for assigning sensor nodes to clusters in two-tiered networks. The first heuristic assumes that all relay nodes, acting as cluster heads, send their data directly to the base station. The second heuristic relaxes this assumption and is to be used with any network where each relay node uses a multi-hop route to send its data to the base station. Simulations on networks of different sizes show that our approaches consistently outperform existing heuristics for clustering in two-tier sensor networks and are fast enough to be used for practical networks containing hundreds of sensor nodes. We have compared the results of our distributed approaches with the optimal solutions obtained using an existing approach based on an Integer Linear Program (ILP) formulation and have shown that, on an average, our approaches, with a relatively small overhead, can produce results that are close to the optimal solutions.