Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Improved approximation schemes for scheduling unrelated parallel machines
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Topology control for wireless sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
LORP: a load-balancing based optimal routing protocol for sensor networks with bottlenecks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
| Hi-index | 0.00 |
In this paper, we study the two-tiered wireless sensor network (WSN) architecture and propose the optimal cluster association algorithm for it to maximize the overall network lifetime. A two-tiered WSN is formed by number of small sensor nodes (SNs), powerful application nodes (ANs), and base-stations (BSs, or gateways). SNs capture, encode, and transmit relevant information to ANs, which then send the combined information to BSs. Assuming the locations of the SNs, ANs, and BSs are fixed, we consider how to associate the SNs to ANs such that the network lifetime is maximized while every node meets its bandwidth requirement. When the SNs are homogeneous (e.g., same bandwidth requirement), we give optimal algorithms to maximize the lifetime of the WSNs; when the SNs are heterogeneous, we give a 2-approximation algorithm that produces a network whose lifetime is within 1/2 of the optimum. We also present algorithms to dynamically update the cluster association when the network topology changes. Numerical results are given to demonstrate the efficiency and optimality of the proposed approaches. In simulation study, comparing network lifetime, our algorithm outperforms other heuristics almost twice.