The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (2009 vol.8)
pp: 1077-1086
Ali Chamam , Ecole Polytechnique of Montreal, Montreal
Samuel Pierre , Ecole Polytechnique of Montreal, Montreal
ABSTRACT
Minimizing energy dissipation and maximizing network lifetime are important issues in the design of applications and protocols for sensor networks. Energy-efficient sensor state planning consists in finding an optimal assignment of states to sensors in order to maximize network lifetime. For example, in area surveillance applications, only an optimal subset of sensors that fully covers the monitored area can be switched on while the other sensors are turned off. In this paper, we address the optimal planning of sensors' states in cluster-based sensor networks. Typically, any sensor can be turned on, turned off, or promoted cluster head, and a different power consumption level is associated with each of these states. We seek an energy-optimal topology that maximizes network lifetime while ensuring simultaneously full area coverage and sensor connectivity to cluster heads, which are constrained to form a spanning tree used as a routing topology. First, we formulate this problem as an Integer Linear Programming model that we prove NP-Complete. Then, we implement a Tabu search heuristic to tackle the exponentially increasing computation time of the exact resolution. Experimental results show that the proposed heuristic provides near-optimal network lifetime values within low computation times, which is, in practice, suitable for large-sized sensor networks.
INDEX TERMS
Wireless sensor networks (WSNs), coverage, clustering, routing, network lifetime, energy efficiency, optimization, mathematical programming, Tabu search heuristic.
CITATION
Ali Chamam, Samuel Pierre, "On the Planning of Wireless Sensor Networks: Energy-Efficient Clustering under the Joint Routing and Coverage Constraint", IEEE Transactions on Mobile Computing, vol.8, no. 8, pp. 1077-1086, August 2009, doi:10.1109/TMC.2009.16
REFERENCES
[1] C.Y. Chong and S.P. Kumar, “Sensor Networks: Evolution, Opportunities, and Challenges,” Proc. IEEE, vol. 91, no. 8, pp.1247-1256, Aug. 2003.
[2] M. Cardei, M.T. Thai, Y. Li, and W. Wu, “Energy-Efficient Target Coverage in Wireless Sensor Networks,” Proc. IEEE INFOCOM, vol. 3, pp.1976-1984, 2005.
[3] V. Raghunathan, C. Schurgers, S. Park, and M.B. Srivastava, “Energy-Aware Wireless Microsensor Networks,” IEEE Signal Processing Magazine, vol. 19, pp.40-50, 2002.
[4] K. Akkaya and M. Younis, “A Survey of Routing Protocols in Wireless Sensor Networks,” Ad Hoc Network J., vol. 3, no. 3, pp.325-349, 2005.
[5] L.M.C. Arboleda and N. Nasser, “Comparison of Clustering Algorithms and Protocols for Wireless Sensor Networks,” Proc.Canadian Conf. Electrical and Computer Eng., pp.1787-1792, May 2006.
[6] M. Younis, P. Munshi, G. Gupta, and S.M. Elsharkawy, “On Efficient Clustering of Wireless Sensor Networks,” Proc. Second IEEE Workshop Dependability and Security in Sensor Networks and Systems, pp.78-91, 2006.
[7] H. Karl and A. Wiling, Protocols and Architectures for Wireless Sensor Networks. Wiley, 2005.
[8] Y. Yao and G.B. Giannakis, “Energy-Efficient Scheduling for Wireless Sensor Networks,” IEEE Trans. Comm., vol. 53, no. 8, pp.1333-1342, 2005.
[9] S.F. Hwang, Y.Y. Su, Y.Y. Lin, and C.R. Dow, “A Cluster-Based Coverage-Preserved Node Scheduling Scheme in Wireless Sensor Networks,” Proc. Third Ann. Int'l Conf. Mobile and Ubiquitous Systems: Networking and Services, pp.1-7, July 2006.
[10] W.R. Heizelman, A. Chandrakasan, and H. Balakrishnan, “Energy-Efficient Communication Protocol for Wireless Micro Sensor Networks,” Proc. IEEE Hawaii Int'l Conf. System Sciences, Jan. 2000.
[11] V. Mhatre and C. Rosenberg, “Homogeneous vs. Heterogeneous Clustered Sensor Networks: A Comparative Study,” Proc. IEEE Int'l Conf. Comm., vol. 6, pp.3646-3651, June 2004.
[12] M. Inanc, M.I. Magdon, and B. Yener, “Power Optimal Connectivity and Coverage in Wireless Sensor Networks,” Technical Report TR-03-06, Dept. of Computer Science, Rensselaer Polytechnic Inst., 2003.
[13] J. Carle and D. Simplot, “Energy Efficient Area Monitoring bySensor Networks,” Computer, vol. 37, no. 2, pp.40-46, Feb. 2004.
[14] X.Y. Li, P.J. Wan, and O. Frieder, “Coverage in Wireless Ad-Hoc Sensor Networks,” IEEE Trans. Computers, vol. 52, no. 6, pp.753-763, June 2002.
[15] G. Xing, X. Wang, Y. Zhang, C. Lu, R. Pless, and C. Gill, “Integrated Coverage and Connectivity Configuration for Energy Conservation in Sensor Networks,” ACM Trans. Sensor Networks, vol. 1, no. 1, pp.36-72, Aug. 2005.
[16] T. Yan, T. He, and J.A. Stankovic, “Differentiated Surveillance for Sensor Networks,” Proc. First Int'l Conf. Embedded Networked Sensor Systems (SenSys '03), pp.51-62, 2003.
[17] J. Lu, J. Wang, and T. Suda, “Scalable Coverage Maintenance for Dense Wireless Sensor Networks,” Proc. Third Ann. IEEE Comm. Soc. Conf. Sensor and Ad Hoc Comm. and Networks (SECON '06), vol. 2, pp.651-660, Sept. 2006.
[18] A. Chamam and S. Pierre, “Dynamic Sensor Activation for Maximizing Network Lifetime under Coverage Constraint,” Proc. Int'l Symp. Comm. and Information Technologies (ISCIT '07), pp.971-976, Oct. 2007.
[19] S. Lindsey and C.S. Raghavendra, “PEGASIS: Power Efficient Gathering in Sensor Information Systems,” Proc. IEEE Aerospace Conf., Mar. 2002.
[20] N. Ahmed, S.S. Kanhere, and S. Jha, “Probabilistic Coverage in Wireless Sensor Networks,” Proc. IEEE Conf. Local Computer Networks (LCN '05), vol. 1, pp.672-681, 2005.
[21] D. Tian and N.D. Georganas, “A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networks,” Proc. ACM Int'l Workshop Wireless Sensor Networks and Applications (WSNA '02), pp.32-41, 2002.
[22] M. Hefeeda and H. Ahmadi, “A Probabilistic Coverage Protocol for Wireless Sensor Networks,” Proc. IEEE Int'l Conf. Network Protocols (ICNP '07), pp.41-50, Oct. 2007.
[23] Y.-S. Yen, S. Hong, R.-S. Chang, and H.-C. Chao, “An Energy Efficient and Coverage Guaranteed Wireless Sensor Network,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC '07), pp.2923-2928, Mar. 2007.
[24] N. Patwari, J.N. Ash, S. Kyperountas, A.O. Hero, III, R.L. Moses, and N.S. Correal, “Locating the Nodes: Cooperative Localization in Wireless Sensor Networks,” IEEE Signal Processing Magazine, vol. 22, no. 4, pp.54-69, 2005.
[25] J. Bachrach and C. Taylor, “Localization in Sensor Networks,” Handbook of Sensor Networks: Algorithms and Architectures, I.Stojmenovic, ed., Wiley Interscience, 2005.
[26] H. Chu and R. Jan, “A GPS-Less, Outdoor, Self-Positioning Method for Wireless Sensor Networks,” J. Ad Hoc Networks, vol. 5, no. 5, pp.547-557, July 2007.
[27] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, “The Set-Covering Problem,” Introduction to Algorithms, second ed., Section35.3, pp.1033-1038, MIT Press and McGraw-Hill, 2001.
[28] http://www.ilog.com/productscplex/, 2009.
[29] W. Zhou, H.-M. Chen, and X.-F. Zhang, “An Energy Efficient Strong Head Clustering Algorithm for Wireless Sensor Networks,” Proc. Int'l Conf. Wireless Comm. Networking and Mobile Computing (WiCom '07), pp.2584-2587, Sept. 2007.
[30] O. Younis and S. Fahmy, “HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks,” IEEE Trans. Mobile Computing, vol. 3, no. 4, pp.366-379, Oct.-Dec. 2004.
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool