Lifetime-maximized cluster association in two-tiered wireless sensor networks

Wireless Communications and Mobile Computing

Volumn 9, Issue 3, 2009, Pages 325-334

  Song, Wen Zhan ^a   Wang, WeiZhao ^b   Moaveni Nejad, Kousha ^b   Li, Xiang Yang ^b  

^a WASHINGTON STATE UNIVERSITY   (United States)

^b ILLINOIS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Clustering; Network lifetime; Two tiered

Indexed keywords

APPROXIMATION ALGORITHMS; ELECTRIC NETWORK TOPOLOGY; ROUTING PROTOCOLS; SENSOR NETWORKS; SENSOR NODES; TELECOMMUNICATION EQUIPMENT; WIRELESS TELECOMMUNICATION SYSTEMS;

BANDWIDTH REQUIREMENTS; CLUSTERING; COMBINED INFORMATIONS; NETWORK LIFETIME; NETWORK TOPOLOGIES; NUMERICAL RESULTS; OPTIMAL ALGORITHMS; OPTIMALITY; SIMULATION STUDIES; TWO-TIERED;

WIRELESS SENSOR NETWORKS;

EID: 63049089191     PISSN: 15308669     EISSN: None     Source Type: Journal    
DOI: 10.1002/wcm.544     Document Type: Article

References (15)

1. Baker DJ, Ephremides A. The architectural organization of a mobile radio network via a distributed algorithm. IEEE Transactions on Communications 1981; 29(11): 1694-1701.
2. Parekh AK. Selecting routers in ad-hoc wireless networks. In Proceedings of ITS, 1994.
3. Bandyopadhyay S, Coyle E. An energy efficient hierarchical clustering algorithm for wireless sensor networks. In Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom), 2003.
4. Cai L, Shi Y, Pan J, Hou YT, Shen SX. Topology control for wireless sensor networks. In Proceedings of the 9th Annual International Conference on Mobile Computing and Networking. ACM Press, 2003; pp. 286-299.
5. Cai L, Shi Y, Pan J, Hou YT, Shen SX. Optimal basestation locations in two-tiered wireless sensor networks. IEEE Transactions on Mobile Computing 2005; 4(5): 458-473.
6. Wieselthier J, Ephremides A, Baker DJ. A design concept for reliable mobile radio networks with frequency hopping signaling. In Proceedings of IEEE 1987; 75: 56-73.
7. Parekh AK. Selecting routers in ad-hoc wireless networks. In Proceeding ITS, 1994.
8. Lin CR, Gerla M. Adaptive clustering for mobile wireless networks. IEEE Journal on Selected Areas in Communications 1997; 15: 1265-1275.
9. Basagni S. Distributed clustering for ad hoc networks. In Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'99). IEEE Computer Society, 1999; p. 310.
10. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing 1973; 2: 225-231.
11. Graham R. Bounds for multiprocessing timing anomalies. SIAM Journal on Applied Mathematics 1969; 17: 416-429.
12. Hochbaum DS, Shmoys DB. Using dual approximation algorithms for scheduling problems theoretical and practical results. Journal of the ACM 1987; 34(1): 144-162.
13. Tardos E, Lenstra JK, Shmoys DB. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming 1990; 46(3): 259-271.
14. Jansen K, Porkolab L. Improved approximation schemes for scheduling unrelated parallel machines. In Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing. ACM Press, 1999; pp. 408-417.
15. Shmoys DB, Tardos E. An approximation algorithm for the generalized assignment problem. Mathematical Programming 1993; 62(3): 461-474.