Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 818135, 9 pages
http://dx.doi.org/10.1155/2014/818135
Research Article

Fault Tolerant Coverage and Connectivity in Presence of Channel Randomness

School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi 110067, India

Received 31 August 2013; Accepted 24 October 2013; Published 21 January 2014

Academic Editors: A. Manikas and Y. Qi

Copyright © 2014 Anil Kumar Sagar and D. K. Lobiyal. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless sensor networks: a survey,” Computer Networks, vol. 39, no. 4, pp. 393–422, 2002. View at Publisher · View at Google Scholar · View at Scopus
  2. H. M. Ammari and S. K. Das, “Centralized and clustered k-coverage protocols for wireless sensor networks,” IEEE Transactions on Computers, vol. 61, no. 1, pp. 118–133, 2012. View at Publisher · View at Google Scholar · View at Scopus
  3. Y. Cai, M. Li, W. Shu, and M.-Y. Wu, “ACOS: a precise energy-aware coverage control protocol for wireless sensor networks,” Ad Hoc and Sensor Wireless Networks, vol. 3, no. 1, pp. 77–98, 2007. View at Google Scholar · View at Scopus
  4. M. Esnaashari and M. R. Meybodi, “Deployment of a mobile wireless sensor network with k-coverage constraint: a cellular learning automata approach,” Wireless networks, vol. 19, pp. 945–968, 2012. View at Google Scholar · View at Scopus
  5. S. He, J. Chen, and Y. Sun, “Coverage and connectivity in duty-cycled wireless sensor network for event monitoring,” IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 3, pp. 475–482, 2012. View at Google Scholar · View at Scopus
  6. D. Li, J. Cao, M. Liu, and Y. Zheng, “K-connected target coverage problem in wireless sensor networks,” in Combinatorial Optimization and Applications, vol. 4616, pp. 20–31, 2007. View at Google Scholar
  7. X. Bai, Z. Yun, D. Xuan, B. Chen, and W. Zhao, “Optimal multiple-coverage of sensor networks,” in Proceedings of the IEEE INFOCOM, pp. 2498–2506, Shanghai, China, April 2011. View at Publisher · View at Google Scholar · View at Scopus
  8. S. S. Dhillon and K. Chakrabarty, “Sensor placement for effective coverage and surveillance in distributed sensor networks,” in Proceedings of the Wireless Communications and Networking Conference, vol. 3, pp. 1609–1614, 2003.
  9. C. Bettstetter and C. Hartmann, “Connectivity of wireless multihop networks in a shadow fading environment,” Wireless Networks, vol. 11, no. 5, pp. 571–579, 2005. View at Publisher · View at Google Scholar · View at Scopus
  10. R. Hekmat and P. Van Mieghem, “Connectivity in wireless ad-hoc networks with a log-normal radio model,” Mobile Networks and Applications, vol. 11, no. 3, pp. 351–360, 2006. View at Publisher · View at Google Scholar · View at Scopus
  11. N. Bulusu, J. Heidemann, and D. Estrin, “GPS-less low-cost outdoor localization for very small devices,” IEEE Personal Communications, vol. 7, no. 5, pp. 28–34, 2000. View at Publisher · View at Google Scholar · View at Scopus
  12. T. S. Rappaport, Wireless Communications, Principles and Practice, Prentice Hall, 2nd edition, 2002.
  13. G. Zhou, T. He, S. Krishnamurthy, and J. A. Stankovic, “Models and solutions for radio irregularity in wireless sensor networks,” ACM Transactions on Sensor Networks, vol. 2, no. 2, pp. 221–262, 2006. View at Publisher · View at Google Scholar · View at Scopus
  14. B. Xiao, H. Chen, and S. Zhou, “Distributed localization using a moving beacon in wireless sensor networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 5, pp. 587–600, 2008. View at Publisher · View at Google Scholar · View at Scopus
  15. J. Orriss and S. K. Barton, “Probability distributions for the number of radio transceivers which can communicate with one another,” IEEE Transactions on Communications, vol. 51, no. 4, pp. 676–681, 2003. View at Publisher · View at Google Scholar · View at Scopus
  16. M. D. Penrose, “On k-connectivity for a geometric random graph,” Random Structures and Algorithms, vol. 15, no. 2, pp. 145–164, 1999. View at Google Scholar · View at Scopus