Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baker, D.J., Ephremides, A.: The architectural organization of a mobile radio network via a distributed algorithm. IEEE Transactions on Communications 29(11), 1694–1701 (1981)
Parekh, A.K.: Selecting routers in ad-hoc wireless networks. In: Proceedings of ITS (1994)
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), IEEE Computer Society Press, Los Alamitos (2003)
Cai, L., Shi, Y., Pan, J., Hou, Y.T., Shen, S.X.: Topology control for wireless sensor networks. In: Proceedings of the 9th Annual International Conference on Mobile Computing and Networking, pp. 286–299. ACM Press, New York (2003)
Cai, L., Shi, Y., Pan, J., Hou, Y.T., Shen, S.X.: Optimal base-station locations in two-tiered wireless sensor networks. IEEE Transactions on Mobile Computing (To appear)
Wieselthier, J., Ephremides, A., Baker, D.J.: A design concept for reliable mobile radio networks with frequency hopping signaling. Proceedings of IEEE 75, 56–73 (1987)
Parekh, A.K.: Selecting routers in ad-hoc wireless networks. In: Proceeding ITS (1994)
Lin, C.R., Gerla, M.: Adaptive clustering for mobile wireless networks. IEEE Journal on Selected Areas in Communications 15, 1265–1275 (1997)
Basagni, S.: Distributed clustering for ad hoc networks. In: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN ’99), p. 310. IEEE Computer Society, Washington (1999)
Hopcroft, J.E., Karp, R.M.: n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing 2, 225–231 (1973)
Graham, R.: Bounds for multiprocessing timing anomalies. SIAM Journal on Applied Mathematics 17 (1969)
Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems theoretical and practical results. J. ACM 34(1), 144–162 (1987)
Tardos, E., Lenstra, J.K., Shmoys, D.B.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program 46(3), 259–271 (1990)
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, 1999th edn. pp. 408–417. ACM Press, New York (1999)
Shmoys, D.B., Tardos, E.: An approximation algorithm for the generalized assignment problem. Math. Program 62(3), 461–474 (1993)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Wang, W., Song, WZ., Li, XY., Moaveni-Nejad, K. (2007). Optimal Cluster Association in Two-Tiered Wireless Sensor Networks. In: Aspnes, J., Scheideler, C., Arora, A., Madden, S. (eds) Distributed Computing in Sensor Systems. DCOSS 2007. Lecture Notes in Computer Science, vol 4549. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73090-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-73090-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73089-7
Online ISBN: 978-3-540-73090-3
eBook Packages: Computer ScienceComputer Science (R0)