Coverage-time optimization for clustered wireless sensor networks: A power-balancing approach

IEEE/ACM Transactions on Networking

Volumn 18, Issue 1, 2010, Pages 202-215

  Shu, Tao ^a   Krunz, Marwan ^a  

^a University of Arizona   (United States)

Author keywords

Clustering; Coverage time; Generalized geometric programming; Linear programming; Sensor networks; Signomial optimization; Topology control

Indexed keywords

ANALYTICAL MODEL; CLUSTER HEAD; CLUSTER PLANNING; CLUSTERED WIRELESS SENSOR NETWORKS; CLUSTERING; COVERAGE TIME; DISTRIBUTED SENSOR; ENERGY CONSUMPTION; GENERALIZED GEOMETRIC PROGRAMMING; INTERCLUSTER COMMUNICATION; LINEAR PROGRAMS; LINEAR TIME; LOCATION INFORMATION; NUMERICAL EXAMPLE; OPTIMAL CLUSTERING; OPTIMAL POWER ALLOCATION; OPTIMIZATION FORMULATIONS; PATH RELIABILITY; POWER CONSUMPTION; RAYLEIGH FADING MODEL; SENSING REGION; TIME OPTIMIZATION; TIME-OPTIMAL; TOPOLOGY CONTROL; UPPER BOUND;

DYNAMIC PROGRAMMING; LINEAR PROGRAMMING; LINEARIZATION; LOCATION; OPTIMIZATION; PHOTOLITHOGRAPHY; RAYLEIGH FADING; SENSOR NETWORKS; SENSOR NODES; SPACECRAFT; STOCHASTIC MODELS; STOCHASTIC SYSTEMS; TELECOMMUNICATION EQUIPMENT; TOPOLOGY;

WIRELESS SENSOR NETWORKS;

EID: 77249170731     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2009.2022936     Document Type: Article

References (25)

1. IEEE 802.15 Wpan Task Group 4 (tg4), [Online. Available: www.ieee802.org/15/pub/TG4.html
2. I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "A survey on sensor networks," IEEE Commun. Mag., vol.40, no.8, pp. 102-114, Aug. 2002.
3. A. D. Amis andR.Prakash, "Load-balancing clusters inwireless ad hoc networks," inProc. 3rd IEEE Symp. Application-Specific Syst. Software Eng. Technol., Richardson, TX, 2000, pp. 25-32.
4. A. D. Amis, R. Prakash, T. H. P. Vuong, and D. T. Huynh, "Max-min d-cluster formation in wireless ad hoc networks," in Proc. IEEE IN-FOCOM, Tel Aviv, Israel, 2000, pp. 32-41.
5. D. J. Baker and A. Ephremides, "The architectural organization of a mobile radio network via a distributed algorithm," IEEE Trans. Commun., vol.COM-29, no.11, pp. 1694-1701, Nov. 1981. (Pubitemid 12447240)
6. S. Bandyopadhyay and E. J. Coyle, "An energy efficient hierarchical clustering algorithm for wireless sensor networks," in Proc. IEEE IN-FOCOM, San Francisco, CA, 2003, vol.3, pp. 1713-1723.
7. S. Bandyopadhyay and E. J. Coyle, "Minimizing communication costs in hierarchically-clustered networks of wireless sensors," J. Comput. Netw., vol.44, no.1, pp. 1-16, Jan. 2004.
8. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
9. C. F. Chiasserini, I. Chlamtac, P. Monti, and A. Nucci, "An energy efficient method for nodes assignment in cluster-based ad hoc networks," J. Wireless Netw., vol.10, no.3, pp. 223-231, May 2004.
10. C. F. Chiasserini and M. Garetto, "Modeling the performance of wireless sensor networks," presented at the IEEE INFOCOM, Hong Kong, China, 2004.
11. B. Das, R. Sivakumar, and V. Bharghavan, "Routing in ad hoc networks using a spine," in Proc. IEEE Int. Conf. Comput. Commun. Netw., Las Vegas, NV, 1997, pp. 34-39.
12. J. G. Ecker, "Geometric programming: Methods, computations and applications," SIAM Rev., vol.22, no.3, pp. 338-362, 1980.
13. A. Ephremides, J. E. Wieselthier, and D. J. Baker, "A design concept for reliable mobile radio networks with frequency hopping signaling," Proc. IEEE, vol.75, no.1, pp. 56-73, 1987.
14. M.Gerla andJ. Tsai, "Multicluster, mobile, multimedia radio network," J. Wireless Netw., vol.1, no.3, pp. 255-265, 1995.
15. G. Gupta and M. Younis, "Load-balanced clustering of wireless sensor networks," in Proc. IEEE ICC, Anchorage, AK, 2003, pp. 1848-1852.
16. W. B. Heinzelman, A. P. Chandrakasan, and H. Balakrishnan, "An application-specific protocol architecture for wireless microsensor networks," IEEE Trans. Wireless Commun., vol.1, no.4, pp. 660-670, Oct. 2002.
17. J. M. Kahn, R. H. Katz, and K. S. Pister, "Next century challenges: Mobile networking for smart dust," in Proc. ACM MobiCom, Seattle, WA, 1999, pp. 271-278.
18. F. Kuhn, T. Moscibroda, and R. Wattenhofer, "Initializing newly deployed ad hoc and sensor networks," in Proc. ACM MobiHoc, Tokyo, Japan, 2004, pp. 260-274. (Pubitemid 40061945)
19. C. R. Lin and M. Gerla, "Adaptive clustering for mobile wireless networks," IEEE J. Sel. Areas Commun., vol.15, no.7, pp. 1265-1275, Sep. 1997.
20. T. Moscibroda and R. Wattenhofer, "Maximizing the lifetime of dominating sets," presented at the IEEE WMAN, Denver, CO, 2005.
21. J. Pan, Y. T. Hou, L. Cai, Y. Shi, and S. X. Shen, "Topology control for wireless sensor networks," in Proc. ACM MobiCom, San Diego, CA, 2003, pp. 286-299.
22. S. J. Park, R. Vedantham, R. Sivakumar, and I. F. Akyildiz, "A scalable approach for reliable downstream data delivery in wireless sensor networks," in Proc. ACM MobiHoc, Tokyo, Japan, 2004, pp. 78-89.
23. E. L. Peterson, "Geometric programming," SIAM Rev., vol.18, no.1, pp. 1-51, Jan. 1976.
24. P. J. Wan, K. M. Alzoubi, and O. Frieder, "Distributed construction of connected dominating set in wireless ad hoc networks," in Proc. IEEE INFOCOM, New York, 2002, pp. 1597-1604.
25. J. Wu and H. L. Li, "On calculating connected dominating set for efficient routing in ad hoc wireless networks," in Proc. 3rd ACM Int. Workshop Discrete Algorithms Methods Mobile Comput. Commun., Seattle, WA, 1999, pp. 7-14.