Dynamic point coverage problem inwireless sensor networks: A cellular learning automata approach

Ad-Hoc and Sensor Wireless Networks

Volumn 10, Issue 2-3, 2010, Pages 193-234

  Esnaashari, Mehdi ^a   Meybodi, Mohammad Reza ^a  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Cellular learning automata; Dynamic point coverage; Learning automata; Scheduling; Wireless sensor network

Indexed keywords

EID: 78651423558     PISSN: 15519899     EISSN: 15520633     Source Type: Journal    
DOI: None     Document Type: Article

References (89)

1. M. Ilyas and I. Mahgoub. Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems. CRC Press, London,Washington, D.C., 2005.
2. H. Chen, H. Wu and N.-F. Tzeng. Grid-based Approach for Working Node Selection in Wireless Sensor Networks. Proc. of IEEE Intl. Conf. on Communications 2004 (ICC 2004), 2004.
3. Y. Zou and K. Chakrabarty. A Distributed Coverage- and Connectivity-Centric Technique for Selecting Active Nodes inWireless Sensor Networks. IEEE Transactions on Computers 54(8), 978-991, August 2005.
4. F. Pedraza, A. García andA. L. Medaglia. Efficient CoverageAlgorithms forWireless Sensor Networks. in Proc. of the 2006 Systems and Information Engineering Design Symposium, 2006.
5. Zh. Dingxing, X. Ming, Ch. Yingwen andW. Shulin. Probabilistic Coverage Configuration for Wireless Sensor Networks. 2nd Intl. Conf. on Wireless Communications, Networking and Mobile Computing (WiCOM 2006),Wuhan, September 2006.
6. R. Gupta and S. R. Das. Tracking Moving Targets in a Smart Sensor Network. Proc. IEEE VTC 5, 3035-3039, October 2003.
7. Ch. Gui and P. Mohapatra. Power Conservation and Quality of Surveillance in Target Tracking Sensor Networks. Proc. of the 10th Annual Intl. Conf. on Mobile Computing and Networking (MOBICOM 2004), Philadelphia, PA, USA, September-October, 2004.
8. G. He and J. C. Hou. Tracking Targets with Quality inWireless Sensor Networks. 13th IEEE Intl. Conf. on Network Protocols (ICNP 2005), Boston, MA, USA, November 2005.
9. M. K.Watfa and S. Commuri.AReduced CoverApproach to Energy EfficientTracking using Wireless Sensor Networks. World Congress in Computer Sceince, Computer Engineering and Applied Computing, Las Vegas, Nevada, USA, June 2006.
10. J. Jeong, S. Sharafkandi and D. H. C. du. Energy-aware scheduling with quality of surveillance guarantee in wireless sensor networks. Intl. Conf. on Mobile Computing and Networking, Los Angeles, CA, USA, 2006.
11. J. Jeong, T. Hwang, T. He and D. Du. MCTA: Target Tracking Algorithm based on Minimal Contour inWireless Sensor Networks. In IEEE Infocom2007 Minisymposia, August 2007.
12. V. Raghunathan, C. Schurgers, S. Park and M. B. Srivastava. Energy-AwareWireless sensor networks. IEEE Singal Processing Magazine, 2002-03.
13. K. Chakrabarty, S. S. Iyengar, H. Qi and E. Cho. Grid coverage for surveillance and target Location in distributed sensor networks. IEEE Transactions on Computers 51, 1448-1453, 2002.
14. G. Bontempi and Y. Le Borgne. An adaptive modular approach to the mining of sensor network data. Workshop on Data Mining in Sensor Networks, SIAM SDM, Newport Beach, CA, USA, April 2005.
15. C. Liu, K.Wu and J. Pei.ADynamic Clustering and Scheduling Approach to Energy Saving in Data Collection from Wireless Sensor Networks. In Proceedings of the Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (SECON'05), Santa Clara, California, USA, September, 2005.
16. O.Younis and S. Fahmy.An Experimental Study of Routing and Data Aggregation in Sensor Networks. In Proceedings of the International Workshop on Localized Communication and Topology Protocols for Ad hoc Networks (LOCAN), held in conjunction with The 2nd IEEE International Conference on Mobile Ad Hoc and Sensor Systems (MASS-2005), November 2005.
17. R. Virrankoski and A. Savvides. TASC: Topology Adaptive Spatial Clustering for Sensor Networks. Second IEEE Intl. Conf. on Mobile Ad Hoc and Sensor Systems, Washington, DC, November, 2005.
18. S. Soro and W. Heinzelman. Prolonging the Lifetime of Wireless Sensor Networks via Unequal Clustering. Proceedings of the 5th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (IEEE WMAN '05), April 2005.
19. W. Heinzelman, A. Chandrakasan and H. Balakrishnan. Energy-efficient communication protocol for wireless microsensor networks. Proc. of 33rd Hawaii Intl. Conf. on System Science (HICSS '00), January 2000.
20. O. Younis and S. Fahmy. Distributed Clustering in Ad-hoc Sensor Networks A Hybrid, Energy-Efficient Approach. In Proc. of IEEE INFOCOM 1, 629-640, March 2004.
21. S. P. Chaudhuri and D. B. Johnson. An Adaptive Scheduling Protocol for Multi-scale Sensor Network Architecture. IEEE Intl. Conf. on Distributed Computing in Sensor Systems (DCOSS), Santa Fe, New Mexico, June 2007.
22. A. M. Chou and V. Li. Slot Allocation Strategies for TDMA Protocols in Multihop Packet Radio Networks. In Proceedings of INFOCOM, pp. 710-716, 1992.
23. I. Chlamtac and A. Farago. Making Transmission Schedules Immune to Topology Changes in Multi-hop Packet Radio Networks. IEEE/ACM Transactions on Networks 2, 23-29, 1994.
24. V. Rajendran, K. Obraczka and J. J. Garcia-Luna-Aceves. Energy-efficient Collision-Free Medium Access Control for Wireless Sensor Networks. In Proceedings of the First Intl. Conf. on Embedded Networked Sensor Systems (Sensys'03), New York, pp. 181-192, 2003.
25. L. Bao and J. J. Garcia-Luna-Aceves. A New Approach to Channel Access Scheduling for Ad hoc Networks. In Proceedings of the 7th Annual International Conference on Mobile Computing and Networking (MobiCom'01), New York, pp. 210-221, 2001.
26. M. Sichitiu. Cross-Layer Scheduling for Power Efficiency inWireless Sensor Networks. In Proc. of IEEE INFOCOM, volume 1, March 2004.
27. Y. Nam, T. Kwon, H. Lee, H. Jung and Y. Choi. Guaranteeing the network lifetime in wireless sensor networks: A MAC Layer Approach. Elsevier Computer Communications 30, 2532-2545, June 2007.
28. Sh. Liu, K.W. Fan and P. Sinha. Dynamic Sleep Scheduling using Online Experimentation forWireless Sensor Networks. In Proceeding of SenMetrics, San Diego, July 2005.
29. Y. Xu, J. S. Heidemann and D. Estrin. Geography-informed energy conservation for ad hoc routing. In Proceedings of Mobile Computing and Networking, pp. 70-84, 2001.
30. J. Salzmann, S. Kubisch, F. Reichenbach and D. Timmermann. Energy and Coverage Aware Routing Algorithm in Self Organized Sensor Networks. In Proceedings of Networked Sensing Systems (INSS'07), June 2007.
31. C. Schurgers, V. Tsiatsis and M. Srivastava. STEM: Topology management for energy efficient sensor networks. In Proceedings of the IEEE Aerospace Conference, March 2002.
32. R. Akl and U. Sawant. Grid-based Coordinated Routing in Wireless Sensor Networks. In Proceedings of 4th IEEE Conf. on Computer Communications and Networking, January 2007.
33. G.Wang, G. Cao, T. La Porta and W. Zhang. Sensor Relocation in Mobile Sensor Networks. In Proceedings of IEEE INFOCOM, March 2005.
34. J. N. Al-Karaki, R. Ul-Mustafa and A. E. Kamal. Data aggregation in wireless sensor networks - exact and approximate algorithms. In Proceedings of IEEE Workshop on High Performance Switching and Routing, pp. 241-245, April 2004.
35. F. Araújo and L. Rodrigues. On the Monitoring Period for Fault-Tolerant Sensor Networks. In Proceedings of Latin-American Symposium on Dependable Computing, pp. 174-190, 2005.
36. Z. Jiang, J. Wu, A. Agah and B. Lu. Topology Control for Secured Coverage in Wireless Sensor Networks. In Proceedings of 3rd IEEE Intl. Workshop on Wireless and Sensor Networks Security (WSNS'07), October 2007.
37. R. P. Liu, G. Rogers, S. Zhou and J. Zic. Topology control with Hexagonal Tessellation. Intl. Journal of Sensor Networks 2(1/2), 91-98, 2007.
38. R. P. Liu, G. Rogers and S. Zhou. Honeycomb Architecture for Energy Conservation in Wireless Sensor Networks. In Proceedings of IEEE Globecom, San Francisco, November 2006.
39. Y. Wu, S. Fahmy and N. B. Shroff. Optimal QoS-Aware Sleep/Wake Scheduling for Time-Synchronized Sensor Networks. Invited Sessions on Optimization of Communication Networks 40th Annual Conf. on Information Sciences and Systems (CISS), Princeton, NJ, 2006.
40. M. Bagheri and M. Hefeeda. Randomized k-Coverage Algorithms For Dense Sensor Networks. in Proc. of IEEE INFOCOM 2007 Minisymposium, Anchorage, AK, pp. 2376-2380, May 2007.
41. M. Bagheri, M. Hefeeda and H. Ahmadi.ANear Optimal K-Coverage Algorithm for Largescale Sensor Networks. Technical ReportTR2006-10, School of Computing Science, Simon Fraser University, Burnaby, BC, Canada, May 2006.
42. B. Wang, K.C. Chua, V. Srinivasan and W. Wang. Scheduling Sensor Activity for Point Information Coverage inWireless Sensor Networks. In Proc. of WiOpt, 2006.
43. B. Wang, K.C. Chua, V. Srinivasan and W. Wang. Sensor Density for Complete Information Coverage in Wireless Sensor Networks. In Proc. of EWSN 2006, Zurich, Switzerland, February 2006.
44. B. Liang, J. Frolik and X. S. Wang. A Predictive QoS Control Strategy forWireless Sensor Networks. The 1st Workshop on Resource Provisioning and Management in Sensor Networks (PRMSN 05) in Conjunction with the 2nd IEEE MASS, Washington DC, November 2005.
45. J. Frolik. QoS Control for Random AccessWireless Sensor Networks. Wireless Communications and Networking Conf. (WCNC04), Atlanta, March 2004.
46. J.W. Branch, G. G. Chen and B. K. Szymanski. ESCORT: Energy-efficient Sensor Network Communal Routing Topology Using Signal Quality Metrics. in Proc. of the 4th IEEE Intl. Conf. on Networking (IEEE ICN'05), Reunion Island, France, April 2005.
47. Y. Cai, M. Li,W. Shu and M- Y. Wu. ACOS:AnArea-based Collaborative Sleeping Protocol forWireless Sensor Networks. Intl. Journal of Ad Hoc & Sensor Wireless Networks, 2006.
48. Ch-F. Hsin and M. Liu. Network Coverage Using Low Duty-Cycled Sensors: Random & Coordinated Sleep Algorithms. In Proc. of the 3rd Intl. Symposium on Information Processing in Sensor Networks (IPSN 2004), Berkeley, California, USA, April 26-27, 2004.
49. J. Wu and Sh. Yang. Coverage Issue in Sensor Networks with Adjustable Ranges. In Proc. of 33rd Intl. Conf. on Parallel Processing Workshops (ICPP 2004 Workshops), Montreal, Quebec, Canada, August 2004.
50. M. Sigalas and G. Vouros. Poster Abstract: Energy Efficient Area Coverage in Arbitrary Sensor Networks. In Proc. of EWSN 2006, Zurich, Switzerland, February 2006.
51. R. Zheng, G. He and X. Liu. Location-free Coverage Maintenance inWireless Sensor Networks. Technical report UH-CS-05-15, Dept. of Computer Science, University of Houston, 2005.
52. A. Giusti, A. L. Murphy and G. P. Picco. Decentralized Scattering of Wake-up Times in Wireless Sensor Networks. In Proc. of the 4th European Conf. on Wireless Sensor Networks (EWSN), Delft, The Netherlands, Lecture Notes on Computer Science, Volume 4373. Springer, pp. 245-260, January 2007.
53. H. Zhang and J. C. Hou. Maintaining Sensing Coverage and Connectivity in Large Sensor Networks. Theoretical and Algorithmic Aspects of Sensor, Ad HocWireless and Peer-to-Peer Network, Chapter 28, pp. 453-475, Auerbach Publications, 2006.
54. S. K. Das and W. Choi. Coverage-Adaptive Random Sensor Selection with Latency Control for Application-Specific. In Proc. of the IEEE Intl. Conf. on Control and Automation (ICCA2005), Budapest, Hungray, June 2005.
55. F. Ye, G. Zhong, J. Cheng, S. Lu and L. Zhang. PEAS:ARobust Energy Conserving Protocol for Long-lived Sensor Networks. In Proceedings of the 23rd Intl. Conf. on Distributed Computing Systems (ICDCS'03), pp. 28-37, 2003.
56. N. Bisnik and N. Jaggi. Randomized Scheduling Algorithms forWireless Sensor Networks. Work in Progress, 2006.
57. O. H. Sanli, H. Cam and X. Cheng. EQoS: An Energy Efficient QoS Protocol for Wireless Sensor Networks. In Proc. of 2004 Western Simulation MultiConference, San Diego, CA, January 2004.
58. T. S. Rappaport. Wireless Communications, Principles and Practice. Prentice Hall, New Jersey, 1996.
59. Kh. Th. Soe. Increasing Lifetime of Target TrackingWireless Sensor Networks. In Proceedings of World Academy of Science, Engineering and Technology, pp. 2070-3740, August 2008.
60. B. Jiang, B. Ravindran and H. Cho. Energy Efficient Sleep Scheduling in Sensor Networks for Multiple Target Tracking. Lecture Notes in Computer Science, pp. 498-509, 2008.
61. L. Arienzo and M. Longo.AnEnergy-Efficient Strategy forTargetTracking throughWireless Sensor Networks. Gruppo Telecomunicazioni Teoria dell'Informazione Conf., Florence, Italy, June 2008.
62. X. Wang, J. J. Ma, L. Ding and D. W. Bi. Robust Forecasting for Energy Efficiency of Wireless Multimedia Sensor Networks. Sensors Journals 7, 2779-2807, 2007.
63. X. Wang, J. J. Ma, Sh. Wang and D. W. Bi. Cluster-based Dynamic Energy Management for Collaborative Target Tracking inWireless Sensor Networks. Sensors Journals 7, 1193- 1215, 2007.
64. Y. M. A. Khalifa, E. Okoene and M. B. Al-Mourad. Autonomous Intelligent Agent-based Tracking Systems. ICGST-ACSE Journal 7(1), 21-31, May 2007.
65. M. K. Watfa. An Energy Efficient Approach to Dynamic Coverage in Wireless Sensor Networks. Journal of Networks 1(4), 10-20, August 2006.
66. T. He, P. Vicaire, T. Yan, L. Luo, L. Gu and G. Zhou. Achieving Real-Time Target Tracking Using Wireless Sensor Networks. In Proc. of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'06), April 2006.
67. H. Yang and B. Sidkar. Lightweight Target Tracking Protocol Using Ad hoc Sensor Networks. In Proceedings of IEEE VTC, Stockholm, Sweden, May 2005.
68. S. Bhattacharya, G. Xing, Ch. Lu, G.C. Roman, O. Chipara and B. Harris. DynamicWakeup and Topology Maintenance Protocol with Spatiotemporal Guarantees. In Proceedings of 4th International Symposium on Information Processing in Sensor Networks, pp. 28-34, 2005.
69. W. Zhang and G. Cao. Optimizing Tree Reconfiguration for Mobile Target Tracking in Sensor Networks. In Proceedings of Twenty-third Annual Joint Conf. of INFOCOM, vol. 4, pp. 2434-2445, 2004.
70. http://www.nytimes.com/2008/07/12/business/12newpark.html
71. A. Sobeih,W. P. Chen, J. C. Hou, L. C. Kung, N. Li, H. Lim, H.Y.Tyan and H. Zhang. J. -Sim: A Simulation and Emulation Environment for Wireless Sensor Networks. IEEE Wireless Communications 13(4), 104-119, August 2006.
72. L. Wang and Y. Ziao. A Survey of Energy-Efficient Scheduling Mechanisms in Sensor Networks. Mobile Networks and Applications 11(5), 723-740, 2006.
73. C. Bettstetter, H. Hartenstein and X. Pérez-Costa. Stochastic Properties of the Random Waypoint Mobility Model. ACM/Kluwer Wireless Networks: Special Issue on Modeling and Analysis of Mobile Networks 10(5), 555-567, September 2004.
74. E. Fredkin. Digital machine:Aninformational process based on reversible cellular automata. Physica D45, 245-270, 1990.
75. M. A. L. Thathachar and P. S. Sastry. Varieties of Learning Automata: An Overview. IEEE Transaction on Systems, Man, and Cybernetics-Part B: Cybernetics 32(6), 711-722, 2002.
76. K. S. Narendra and M.A. L. Thathachar. Learning Automata: An Introduction. Prentice-Hall Inc, 1989.
77. M. R. Kharazmi and M. R. Meybodi. Image Segmentation Using Cellular Learning Automata. In Proc. of 10th Iranian Conf. on Electrical Engineering, ICEE-96, Tabriz, Iran, May 2001.
78. M. R. Kharazmi and M. R. Meybodi. Image Restoration Using Cellular Learning Automata. In Proc. of 2nd Iranian Conf. on Machine Vision, Image Processing and Applications, Tehran, Iran, pp. 261-270, 2003.
79. M. R. Meybodi, H. Beygi and M. Taherkhani. Cellular Learning Automata and its Applications. Journal of Science Tech., Sharif (Sharif University of Technology, Tehran, Iran), pp. 54-77, 2004.
80. M. R. Meybodi and M. R. Khojaste. Application of Cellular LearningAutomata in Modeling of Commerce Networks. In Proc. of 6th Annual Intl. Computer Society of Iran Computer Conf., CSICC-2001, Isfehan, Iran, pp. 284-295, February 2001.
81. M. R. Meybodi and M. Taherkhani. Application of Cellular Learning Automata in Modeling of Rumor Diffusion. In Proc. of 9th Conf. on Electrical Engineering, Power and Water Institute of Technology, Tehran, Iran, pp. 102-110, May 2001.
82. H. Beigy and M. R. Meybodi.ASelf-Organizing ChannelAssignmentAlgorithm:ACellular Learning Automata Approach. Springer-Verlag Lecture Notes in Computer Science, vol. 2690, pp. 119-126, 2003.
83. H. Beigy and M. R. Meybodi. Call Admission in Cellular Networks: A Learning Automata Approach. Springer-Verlag Lecture Notes in Computer Science, vol. 2510, pp. 450-457, 2002.
84. H. Beigy and M. R. Meybodi.AMathematical Framework for Cellular Learning Automata. Advances in Complex Systems7(3 & 4), 295-319, September & December 2004.
85. H. Beigy and M. R. Meybodi. Open Synchronous Cellular Learning Automata. Advances in Complex Systems 10(4), 1-30, December 2007.
86. H. Beigy and M. R. Meybodi. Asynchronous Cellular Learning Automata. Automatica 44(5), 1350-1357, May 2008.
87. M. Esnaashari and M. R. Meybodi. A Cellular Learning Automata based Clustering Algorithm forWireless Sensor Networks. Sensor Letters 6(5), 723-735, December 2008.
88. S. Meguerdichian, F. Koushanfar, M. Potkonjak and M. B. Srivastava. Coverage Problems inWireless Ad-Hoc Sensor Networks. In Proc. of the IEEE INFOCOM '01, the Conference on Computer Communications, vol. 3, pp. 1380-1387, April 2001.
89. F. Ye, S. Lu and L. Zhang. A Randomized Energy-Conservation Protocol for Resilient Sensor Networks. Wireless Networks 12(5), 637-652, October 2006.