Abstract
Duty-cycling is an appealing solution for energy savings in densely deployed, energy-constrained wireless sensor networks (WSNs). Indeed, several applications, such as intruder detection and tracking, require the design of k-covered WSNs, which are densely in nature and where each location in a monitored field is covered (or sensed) by at least k active sensors. With duty-cycling, sensors can be turned on or off according to a scheduling protocol, thus reducing the number of active sensors required to k-cover a field and helping all sensors deplete their energy slowly and uniformly. In this paper, we propose a duty-cycling framework, called clustered randomized m-connected k-coverage (CRACC mk ), for k-coverage of a sensor field. We present two protocols using CRACC mk , namely T-CRACC mk and D-CRACC mk , which differ by their degree of granularity of network clustering. We prove that the CRACC mk protocols are minimum energy m-connected k-coverage protocols in that each deploys a minimum number of active sensors to k-cover a sensor field and that k-coverage implies m-connectivity between all active sensors, with m being larger than k. We enhance the practicality of the CRACC mk protocols by relaxing some widely used assumptions for k-coverage. Simulation results show that the CRACC mk protocols outperform existing k-coverage protocols for WSNs.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Adlakha, S., Srivastava, M.: Critical Density Threshold for Coverage in Wireless Sensor Networks. In: Proc. IEEE WCNC, pp. 1615–1620 (2003)
Akyildiz, I.F., Pompili, D., Melodia, T.: Underwater Acoustic Sensor Networks: research Challenges. Ad Hoc Networks 3, 257–279 (2005)
Bai, X., Kumar, S., Xuan, D., Yun, Z., Lai, T.H.: Deploying Wireless Sensors to Achieve Both Coverage and Connectivity. In: Proc. ACM MobiHoc, pp. 131–142 (2006)
Bollobás, B.: The Art of Mathematics: Coffee Time in Memphis. Cambridge University Press, Cambridge (2006)
Hall, P.: Introduction to the Theory of Coverage Processes. John Wiley, Chichester (1988)
Huang, C., Tseng, Y., Wu, H.: Distributed Protocols for Ensuring Both Coverage and Connectivity of a Wireless Sensor Network. ACM TOSN 3(1), 1–24 (2007)
Ji, X., Zha, H.: Sensor Positioning in Wireless Ad-hoc Sensor Networks Using Multidimensional Scaling. In: Proc. IEEE Infocom, pp. 2652–2661 (2004)
Kumar, S., Lai, T., Balogh, J.: On k-Coverage in a Mostly Sleeping Sensor Network. In: Proc. ACM MobiCom, pp. 144–158 (2004)
Lazos, L., Poovendran, R.: Stochastic Coverage in Heterogeneous Sensor Networks. ACM TOSN 2(3), 325–358 (2006)
Li, X., Wan, P., Frieder, O.: Coverage in Wireless Ad-Hoc Sensor Networks. IEEE TC 52, 753–763 (2003)
Luo, J., Hubaux, J.-P.: Joint Mobility and Routing for Lifetime Elongation in Wireless Sensor Networks. In: Proc. IEEE Infocom, pp. 1735–1746 (2005)
Megerian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.: Worst and Best-Case Coverage in Sensor Networks. IEEE TMC 4(1), 84–92 (2005)
Shakkottai, S., Srikant, R., Shroff, N.: Unreliable Sensor Grids: Coverage, Connectivity and Diameter. Ad Hoc Networks 3(6), 702–716 (2005)
Shih, E., Cho, S.-H., Ickes, N., Min, R., Sinha, A., Wang, A., Chandrakasan, A.: Physical Layer Driven Protocol and Algorithm Design for Energy-efficient Wireless Sensor Networks. In: Proc. ACM MobiCom, pp. 272–287 (2001)
Tian, D., Georganas, N.: Connectivity Maintenance and Coverage Preservation in Wireless Sensor Networks. Ad Hoc Networks 3, 744–761 (2005)
Xing, G., Wang, X., Zhang, Y., Lu, C., Pless, R., Gill, C.: Integrated Coverage and Connectivity Configuration for Energy Conservation in Sensor Networks. ACM TOSN 1(1), 36–72 (2005)
Yang, S., Dai, F., Cardei, M., Wu, J.: On Connected Multiple Point Coverage in Wireless Sensor Networks. International Journal of Wireless Information Networks 13(4), 289–301 (2006)
Yarvis, M., Kushalnagar, N., Singh, H., Rangarajan, A., Liu, Y., Singh, S.: Exploiting Heterogeneity in Sensor Networks. In: Proc. IEEE Infocom, pp. 878–890 (2005)
Ye, F., Zhong, G., Cheng, J., Lu, S., Zhang, L.: PEAS: A Robust Energy Conserving Protocol for Long-Lived Sensor Networks. In: Proc. ICDCS, pp. 1–10 (2003)
Zhang, H., Hou, J.: Maintaining Sensing Coverage and Connectivity in Large Sensor Networks. Ad Hoc & Sensor Wireless Networks 1(1–2), 89–124 (2005)
Zhou, Z., Das, S., Gupta, H.: Connected k-Coverage Problem in Sensor Networks. In: Proc. ICCCN, pp. 373–378 (2004)
Zhou, G., He, T., Krishnamurthy, S., Stankovic, J.: Impact of Radio Irregularity on Wireless Sensor Networks. In: Proc. MobiSys., pp. 125–138 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ammari, H.M., Das, S.K. (2008). Clustering-Based Minimum Energy Wireless m-Connected k-Covered Sensor Networks. In: Verdone, R. (eds) Wireless Sensor Networks. EWSN 2008. Lecture Notes in Computer Science, vol 4913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77690-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-77690-1_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77689-5
Online ISBN: 978-3-540-77690-1
eBook Packages: Computer ScienceComputer Science (R0)