The delay-constrained information coverage problem in mobile sensor networks: Single hop case

Wireless Networks

Volumn 16, Issue 7, 2010, Pages 1961-1973

  Keung, Gabriel Y ^a   Zhang, Qian ^a   Li, Bo ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Information coverage; Mobile sensor network; Mobility; Sink node placement

Indexed keywords

APPROXIMATION TECHNIQUES; FINITE SEARCH SPACE; INFORMATION COVERAGE; MOBILE SENSOR NETWORKS; MOBILITY; NP-HARD; PERFORMANCE BOUNDS; REAL APPLICATIONS; SENSING INFORMATION; SENSOR MOBILITY; SINGLE HOP; SINK NODES;

OPTIMIZATION; WIRELESS NETWORKS;

SENSOR NETWORKS;

EID: 77957893923     PISSN: 10220038     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11276-010-0238-2     Document Type: Article

References (21)

1. Ad Hoc UAV Ground Network (AUGNet): University of Colorado. http://www.augnet.colorado.edu/
2. ZebraNet: Princeton University. http://www.princeton.edu/~mrm/zebranet. html
3. Hull, B., Bychkovsky, V., Chen, K., Goraczko, M., Miu, A., Shih, E., Zhang, Y., Balakrishnan, H., & Madden, S. (2006). CarTel: A distributed mobile sensor computing system. In Proceedings of ACM conference on embedded networked sensor systems (SENSYS), November, 2006.
4. Vahdat, A., & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks, Technical Report CS-2000-06, Department of Computer Science, Duke University.
5. Small, T., & Haas, Z. J. (2003). The shared wireless infostation model-a new ad hoc networking paradigm (or where is a whale, there is a way). In Proceedings of ACM international Symposium on mobile ad hoc networking and computing (MOBIHOC), June, 2003.
6. Lindgren, A., Doria, A., & Schelen, O. (2003). Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review, 7(3).
7. Wang, Y., & Wu, H. (2006). DFT-MSN: The delay/fault-tolerant mobile sensor network for pervasive information gathering. In Proceedings of IEEE conference on computer communications (INFOCOM), April, 2006.
8. Lima, L., & Barros, J. (2007). Random walks on sensor networks. In Proceedings of WiOpt, April, 2007.
9. Shah, R., Roy, S., Jain, S., & Brunette, W. (2003). Data mules: Modeling a three-tier architecture for sparse sensor networks. In Proceedings of the IEEE workshop on SNPA, May, 2003.
10. Shi, Y., & Hou, Y.T. (2007). Approximation algorithm for base station placement in wireless sensor networks. In Proceedings of IEEE conference on sensor, mesh and ad hoc communications and networks (SECON), June, 2007.
11. Shi, Y., & Hou, Y. T. (2008). Theoretical results on base station movement problem for sensor network. In Proceedings of IEEE conference on computer communications (INFOCOM), April, 2008.
12. Pásztor, B., Musolesi, M., & Mascolo, C. (2007). Opportunistic mobile sensor data collection with SCAR. In Proceedings of IEEE conference on mobile adhoc and sensor systems (MASS), October, 2007.
13. Crossbow, I. (2005). Avoiding RF interference between WiFi and Zigbee. Technical Report, Crossbow Technology Inc.
14. Garey M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W. H. Freeman and Company.
15. Ostrovsky, R., & Rabani, Y.(2000). Polynomial time approximation schemes for geometric k-clustering. In Proceedings of IEEE Symposium on foundations of computer science, November, 2000.
16. Camp, T., Boleng, J., & Davies, V. (2002). A survey of mobility models for ad hoc network research. In Wireless communication and mobile computing (WCMC): Special issue on mobile ad hoc networking research, trends and applications, 2(5), 483-502, September, 2002.
17. Liu, B., Brass, P., Dousse, O., Nain, P., & Towsley, D. (2005). Mobility improves coverage of sensor networks. In Proceedings of ACM international Symposium on mobile ad hoc networking and computing (MOBIHOC), May, 2005.
18. Stadje, W. (1987). The exact probability distribution of a two-dimensional random walk. Journal of Statistical Physics, Springer.
19. Pham, D. T., & Karaboga, D. (2000). Intelligent optimisation techniques: Enetic algorithm, tabu search, simulated annealing, and neural network. Berlin: Springer.
20. Beisiegel, B., Kallrath, J., Kochetov, Y., & Rudnev, A. (2005). Simulated annealing based algorithm for the 2D bin packing problem with impurities. In Proceedings of operations research, Springer.
21. Keung, G.Y., Li, B., & Zhang, Q. Message delivery capacity in delay-constrained mobile sensor networks: Bounds and realization (to be submitted).