Optimal sensor deployment to increase the security of the maximal breach path in border surveillance

European Journal of Operational Research

Volumn 259, Issue 1, 2017, Pages 19-36

  Karabulut, Ezgi ^a   Aras, Necati ^b   Kuban Altinel I ^b  

^a Georgia Institute of Technology   (United States)

^b BOGAZICI UNIVERSITY   (Turkey)

Author keywords

Bilevel programming; Border surveillance; Maximal breach path; OR in defense; Wireless sensor networks

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; LOW POWER ELECTRONICS; MONITORING; OPTIMIZATION; TABU SEARCH; TARGET TRACKING;

BI-LEVEL OPTIMIZATION MODELS; BI-LEVEL PROGRAMMING; BORDER SURVEILLANCE; COMPUTATIONAL EXPERIMENT; ENVIRONMENTAL MONITORING; MAXIMAL BREACH; MONITORING ENVIRONMENT; OR IN DEFENSE;

WIRELESS SENSOR NETWORKS;

EID: 84994427191     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2016.09.016     Document Type: Article

References (34)

1. Aksen, D., Akca, S., Aras, N., A bilevel partial interdiction problem with capacitated facilities and demand outsourcing. Computers and Operations Research 41:1 (2014), 346–358.
2. Aksen, D., Aras, N., A bilevel fixed charge location model for facilities under imminent attack. Computer and Operations Research 39:7 (2012), 1364–1381.
3. Aksen, D., Aras, N., Piyade, N., A bilevel p-median model for the planning and protection of critical facilities. Journal of Heuristics 19:2 (2013), 373–398.
4. Akyildiz, I., Melodia, T., Chowdhury, K., A survey on wireless multimedia sensor networks. Computer Networks 51 (2007), 921–960.
5. Altınel, I., Aras, N., Güney, E., Ersoy, C., Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks. Computer Networks 52 (2008), 2419–2431.
6. Başdere, M., Aras, N., Altınel, I.K., Afşar, S., A leader–follower game for the point coverage problem in wireless sensor networks. European Journal of Industrial Engineering 7:5 (2013), 635–656.
7. Bard, J.F., Moore, J.T., An algorithm for the discrete bilevel programming problem. Naval Research Logistics 39 (1992), 419–435.
8. Berman, O., Drezner, T., Drezner, Z., Wesolowsky, G., A defensive maximal covering problem on a network. International Transactions in Operational Research 16:1 (2009), 69–86.
9. Berman, O., Gavious, A., Location of terror response facilities: a game between state and terrorist. European Journal of Operational Research 177:2 (2007), 1113–1133.
10. Berman, O., Gavious, A., Huang, R., Location of response facilities: a simultaneous game between state and terrorist. International Journal of Operational Research 10:1 (2011), 102–120.
11. Bracken, J., McGill, J., Mathematical programs with optimization problems in the constraints. Operations Research 21:1 (1973), 37–44.
12. Chinchuluun, A., Huang, I.-X., Pardalos, P., Advances in applied mathematics and global optimization. Multilevel (hierarchical) optimization: complexity issues, optimality conditions, algorithms, 2009, Springer-Berlin, 197–221.
13. Clouqueur, T., Phipatanasuphorn, V., Ramanathan, P., Saluja, K., Sensor deployment strategy for target detection. Proceedings of the first ACM international workshop on wireless sensor networks and applications, 2002, 42–48.
14. Dempe, S., Discrete bilevel optimization problems. Technical Report D-04109, 2001, Institute für Wirtschaftsinformatik, Universität Leipzig.
15. DeNegre, S., Ralphs, T., Operations research and cyber-infrastructure. A branch-and-cut algorithm for integer bilevel linear programs Operations research/computer science interfaces series: Vol. 47, 2009, Springer, 65–78.
16. Dhillon, S., Chakrabarty, K., Iyengar, S., Sensor placement for grid coverage under imprecise detections. Proceedings of the fifth international conference on information fusion, Vol. 2, 2002, 1581–1587.
17. Güney, E., Aras, N., Altınel, I.K., Ersoy, C., Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks. Computer Networks 54:11 (2010), 1805–1822.
18. Israeli, E., Wood, R., Shortest-path network interdiction. Networks 40:2 (2002), 97–111.
19. Keçici, S., Aras, N., Verter, V., Incorporating the threat of terrorist attacks in the design of public service facility networks. Optimization Letters 6:6 (2012), 1101–1121.
20. Keskin, E., Altınel, I.K., Aras, N., Ersoy, C., Wireless sensor network lifetime maximization by optimal sensor deployment, activity scheduling, data routing and sink mobility. Ad Hoc Networks 17 (2014), 18–36.
21. Köppe, M., Queyranne, M., Ryan, C., Parametric integer programming algorithm for bilevel mixed integer programs. Journal of Optimization Theory and Application 146:1 (2010), 137–150.
22. Losada, C., Scaparra, M., O'Hanley, J., Optimizing system resilience: a facility protection model with recovery time. European Journal of Operational Research 217:3 (2012), 519–530.
23. Maniezzo, V., Stützle, T., Voß, S., Matheuristics: hybridizing metaheuristics and mathematical programming Annals of information systems, Vol. 10, 2009, Springer.
24. Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M., Worst and best-case coverage in sensor networks. IEEE Transactions on Mobile Computing 4:1 (2005), 84–92.
25. Meguerdichian, S., Koushanfar, F., Qu, G., Potkonjak, M., Exposure in wireless ad-hoc sensor networks. Proceedings of the seventh annual international conference on mobile computing and networking, 2001, 139–150.
26. Meguerdichian, S., Potkonjak, M., Low power 0/1 coverage and scheduling techniques in sensor networks. UCLA Technical Reports 030001, 2003, University of California, Los Angeles.
27. Moore, J., Bard, J., The mixed integer linear bilevel programming problem. Operations Research 38:5 (1990), 911–921.
28. O'Hanley, J., Church, R., Designing robust coverage to hedge against worst-case facility losses. European Journal of Operational Research 209:1 (2011), 23–36.
29. Saharidis, G., Conejo, A., Kozanidis, G., Metaheuristics for bi-level optimization. Exact solution methodologies for linear and (mixed) integer bilevel programming Studies in computational intelligence, Vol. 482, 2013, Springer-Verlag Berlin Heidelberg, 221–245).
30. Saharidis, G., Ierapetritou, M., Resolution method for mixed integer bilevel linear problems based on decomposition technique. Journal of Global Optimization 44:1 (2009), 29–51.
31. Salmeron, J., Wood, K., Baldick, R., Worst-case interdiction analysis of large-scale electric power grids. IEEE Transactions on Power Systems 24:21 (2009), 96–104.
32. von Stackelberg, H., Marktform und Gleichgewicht, 1934, Springer Verlag, Vienna and Berlin.
33. Woodruff, D., Zemel, E., Hashing vectors for tabu search. Annals of Operations Research 41:2 (1993), 123–137.
34. Yates, J., Batta, R., Karwan, M., Optimal placement of sensors and interception resource assessment for the protection of regional infrastructure from covert attack. Journal of Transportation Security 4:2 (2011), 145–169.