Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks

Computer Networks

Volumn 52, Issue 12, 2008, Pages 2419-2431

  Altinel, I Kuban ^a   Aras, Necati ^a   Güney, Evren ^a   Ersoy, Cem ^a  

^a BOGAZICI UNIVERSITY   (Turkey)

Author keywords

Approximation algorithms; Coverage; Heuristics; Integer linear programing; Sensor networks

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTER NETWORKS; COMPUTER SOFTWARE SELECTION AND EVALUATION; DETECTORS; DYNAMIC PROGRAMMING; HEURISTIC METHODS; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; LINEAR PROGRAMMING; LINEARIZATION; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; METROPOLITAN AREA NETWORKS; NETWORK PROTOCOLS; NONLINEAR PROGRAMMING; SENSORS;

BINARY INTEGER PROGRAMMING (BIT); COMPUTATIONAL RESULTS; COVERAGE PROBLEMS; ELSEVIER (CO); GENERAL (CO); HETEROGENEOUS SENSOR NETWORKS; INTEGER LINEAR PROGRAMMING (ILP) MODEL; LAGRANGEAN RELAXATION; MINIMUM COSTS; NEW MODEL; OF SENSORS; SENSOR PLACEMENT; SOLUTION QUALITY;

SENSOR NETWORKS;

EID: 46449132904     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2008.05.002     Document Type: Article

References (38)

1. Akyildiz I.F., Su W., Sankarasubramaniam Y., and Çayi{dotless}rci{dotless} E. A survey on sensor networks. IEEE Communications Magazine 40 (2002) 102-114
2. Callaway Jr. E.H. Wireless Sensor Networks: Architecture and Protocols (2004), Auerbach Publications, Boca Raton
3. Bulusu N., Heidemann J., and Estrin D. GPS-less low-outdoor localization for very small devices. IEEE Personal Communication Magazine 7 (2000) 28-34
4. S.S. Dhillon, K. Chakrabarty, S.S. Iyengar, Sensor placement for grid coverage under imprecise detections, in: Proceedings of the International Conference on Information Fusion, 2002, pp. 1581-1587.
5. S.S. Dhillon, K. Chakrabarty, Sensor placement for effective coverage and surveillance in distributed sensor networks, in: Proceedings of the IEEE Wireless Communications and Networking Conference, 2003, pp. 1609-1614.
6. A. Howard, M.J. Mataric, G.S. Sukhatme, Mobile sensor network deployment using potential fields: a distributed, scalable solution to the area coverage problem, in: Proceedings of the International Symposium on Distributed Autonomous Robotics Systems, June 2002, pp. 299-308.
7. Howard A., Mataric M.J., and Sukhatme G.S. An incremental self-deployment algorithm for mobile sensor networks. Autonomous Robots Special Issue on Intelligent Embedded Systems 13 (2002) 113-126
8. Y. Zou, K. Chakrabarty, Sensor deployment and target localization based on virtual forces, in: Proceedings of the IEEE Infocom Conference, vol. 2, April 2003, pp. 1293-1303.
9. Chakrabarty K., Iyengar S.S., Qi H., and Cho E. Grid coverage for surveillance and target location in distributed sensor networks. IEEE Transactions on Computers 51 (2002) 1448-1453
10. S. Meguerdichian, M. Potkonjak, Low Power 0/1 Coverage and Scheduling Techniques in Sensor Networks, UCLA Technical Reports 030001, January 2003.
11. Adams W.P., and Sherali H.D. Linearization strategies for a class of zero-one mixed integer programming problems. Operations Research 38 (1990) 217-226
12. R.R. Brooks, S.S. Iyengar, Multi-Sensor Fusion: Fundamentals and Applications With Software, Prentice Hall PTR, Upper Saddle River, NJ, 1998.
13. İ. K. Alti{dotless}nel, E. Güney, N. Aras, C. Ersoy, Effective coverage in sensor networks: binary integer programming formulations and heuristics, in: Proceedings of the IEEE International Conference on Communications (ICC'06), vol. 9, June 2006, pp. 4014-4019.
14. Zou Y., and Chakrabarty K. Uncertainty-aware and coverage-oriented deployment for sensor networks. Journal of Distributed and Parallel Computing 64 (2004) 788-798
15. M. Zhang, X. Du, and K. Nygard, Improving coverage performance in sensor networks by using mobile sensors, in: Proceedings of the Military Communications Conference (MILCOM 2005), vol. 5, 2005, pp. 3335-3341.
16. Wang J., and Zhong N. Efficient point coverage in wireless sensor networks. Journal of Combinatorial Optimization 11 (2006) 291-304
17. J. Zhang, T. Yan, S.H. Son, Deployment strategies for differentiated detection in wireless sensor networks, 2005 Third Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks (SECON'06), vol. 1, 2006, pp. 316-325.
18. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, NY
19. Yang S., Dai F., Cardei M., Wu J., and Patterson F. On connected multiple point coverage in wireless sensor networks. International Journal of Wireless Information Networks 13 (2006) 289-301
20. M. Cardei, M.T. Thai, Y. Li, W. Wu, Energy-efficient target coverage in wireless sensor networks, in: Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communication Societies (INFOCOM), vol. 3, 2005, pp. 1976-1984.
21. M. Cardei, J. Wu, M. Lu, M.O. Pervaiz, maximum network lifetime in wireless sensor networks with adjustable sensing ranges, in: IEEE International Conference on Wireless And Mobile Computing, Networking And Communications 2005, (WiMob'2005), vol. 3, 2005, pp. 438-445.
22. Zhang H., and Hou J. Maintaining sensing coverage and connectivity in large sensor networks. Wireless Ad Hoc and Sensor Networks: An International Journal 1 (2005) 89-123
23. X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, C. Gill, Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks, in: Proceedings of the First international conference on Embedded networked sensor systems (SenSys'03), ACM Press, 2003, pp. 28-39.
24. Tian D., and Georganas N.D. Connectivity maintenance and coverage preservation in wireless sensor networks. Ad Hoc Networks 3 (2005) 744-761
25. Caprara A., Toth P., and Fischetti M. Algorithms for the set covering problem. Annals of Operations Research 98 (2000) 353-371
26. Zou Y., and Chakrabarty K. A distributed coverage- and connectivity-centric technique for selecting active nodes in wireless sensor networks. IEEE Transactions on Computers 54 (2005) 978-991
27. S. Orçun, T. Cebe, İ. K. Alti{dotless}nel, Ö. Hortaçsu, Optimal planning and scheduling of batch plants with operational uncertainties: an industrial application to baker's yeast production, Computers and Chemical Engineering (Suppl.) (1999) S183-S186.
28. Hwang H.-S. A stocahstic set-covering location model for both ameliorating and deteriorating items. Computers and Industrial Engineering 46 (2004) 313-319
29. E. Onur, C. Ersoy, H. Deliç, L. Akarun, Coverage in sensor networks when obstacles are present, in: Proceedings of the IEEE International Conference on Communications (ICC'06), vol. 9, 2006, pp. 4077-4082.
30. Qishi W., Rao N.S.V., Xiaojiang D., Iyengar S.S., and Vaishnavi V.K. On efficient deployment of sensors on planar grid. Computer Communications (2007) 10.1016/j.comcom.2007.05.012
31. Lund C., and Yannakakis M. On the hardness of approximating minimization problems. Journal of the ACM 41 (1994) 960-981
32. Karmarkar N. A new polynomial-time algorithm for linear programming. Combinatorica 4 (1984) 373-395
33. İ. K. Alti{dotless}nel, E. Güney, N. Aras, C. Ersoy, Binary integer programming formulation and heuristics for the differentiated coverage problem in heterogenous sensor networks, Research Paper Series No: FBE-IE-05/2007-08, Boǧaziçi University, İstanbul, Türkiye, September 2007.
34. Chvátàl V. A greedy heuristic for the set covering problem. Mathematics of Operations Research 4 (1979) 233-235
35. Fisher M.L. The Lagrangean relaxation method for solving integer programming problems. Management Science 27 (1981) 1-18
36. Held M.H., Wolfe P., and Crowder H.D. Validation of the subgradient optimization. Mathematical Programming 6 (1974) 62-88
37. Beasley J.E. A Lagrangean heuristic for the set covering problem. European Journal of Operational Research 31 (1987) 85-93
38. Cplex 11.0 User's Manual, ILOG, 2008.