Clustering sensors in wireless ad hoc networks operating in a threat environment

Operations Research

Volumn 53, Issue 3, 2005, Pages 432-442

  Patel, Dipesh J ^a   Batta, Rajan ^a   Nagi, Rakesh ^a  

^a State University of New York   (United States)

Author keywords

Maximal expected coverage; Military applications; Wireless ad hoc networks

Indexed keywords

BANDWIDTH CAPACITY; COLUMN GENERATION (CG); MAXIMAL EXPECTED COVERAGE; WIRELESS AD HOC NETWORKS;

BANDWIDTH; DATA PROCESSING; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL MODELS; MILITARY APPLICATIONS; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS;

SENSORS;

EID: 25144442637     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1040.0171     Document Type: Review

References (39)

1. Aytug, H., C. Saydam. 2002. Solving large-scale maximum expected covering location problems by genetic algorithms: A comparative study. Eur. J. Oper. Res. 141(3) 480-494.
2. Bandyopadhyay, S., E. J. Coyle. 2003. An energy efficient hierarchical clustering algorithm for wireless sensor networks. Proc. IEEE INFOCOM 2003. Twenty-Second Annual Joint Conf. of IEEE Compta, and Communications Societies, No. 3. San Francisco, CA, 1713-1723.
3. Barnhart, C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, P. H. Vance. 1998. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3) 316-329.
4. Basagni, S. 1999. Distributed clustering for ad hoc networks. Proc. IEEE Internat. Sympos. on Parallel Architectures, Algorithms, and Networks (I-SPAN). Perth, Western Australia, 310-315.
5. Basagni, S., I. Chlamtac, A. Farago. 1997. A generalized clustering algorithm for peer-to-peer networks. ICALP '97. Bologna, Italy.
6. Basu, P., N. Khan, T. D. C. Little. 2001. A mobility based metric for clustering in mobile ad hoc networks. Proc. Distributed Computing Systems Workshop. WNMC2001, Scottsdale, AZ.
7. Batta, R., N. R. Mannur. 1990. Covering-location models for emergency situations that require multiple response units. Management Sci. 36(1) 16-23.
8. Batta, R., J. M. Dolan, N. N. Krishnamurthy. 1989. The maximal expected covering location problem: Revisited. Transportation Sci. 23(4) 277-287.
9. Berman, O., D. Krass. 2002. The generalized maximal covering location problem. Comput. Oper. Res. 29(6) 563-581.
10. Chapman, S. C., J. A. White. 1974. Probabilistic formulations of emergency service facilities location problems. ORSA/TIMS Conference, San Juan, Puerto Rico.
11. Chen, W., N. Jain, S. Singh. 1999. ANMP: Ad hoc network management protocol. IEEE Selected Areas Comm. 17(8) 1506-1531.
12. Chiang, C., H. Wu, W. Liu, M. Gerla. 1997. Routing in clustered multihop, mobile wireless networks with fading channel. Proc. IEEE SICON'97, 197-211.
13. Chiyoshi, F. Y., R. D. Galvao, R. Morabito. 2003. A note on solutions to the maximal expected covering location problem. Comput. Oper. Res. 30(1) 87-96.
14. Church, R., C. ReVelle. 1974. The maximal covering location problem. Papers Regional Sci. Association 32 101-118.
15. Daskin, M. S. 1983. A maximum expected covering location model: Formulation, properties and heuristic solution. Transportation Sci. 17(1) 48-70.
16. Daskin, M. S., S. H. Owen. 1999. Two new location covering problems: The partial p-center problem and the partial set covering problem. Geographical Anal 31(3) 217-235.
17. Desrosiers, J., F. Soumis, M. Desrochers. 1984. Routing with time windows by column generation. Networks 14 545-565.
18. Frontline. 2004. Understanding battlefield realities: Software allows military to track and predict movements. Indust. Engineer Magazine 36(3) 19.
19. Gerla, M., J. T.-C. Tsai. 1995. Multicluster, mobile, multimedia radio network. ACM-Baltzer J. Wirless Networks 1(3) 255-265.
20. Haas, Z. 1997. A new routing protocol for the reconfigurable wireless networks. Proc. IEEE Internat. Conf. Universal Personal Comm., Vol. 2. San Diego, CA, 562-566.
21. Haas, Z. J., S. Tabrizi. 1998. On some challenges and design choices in ad hoc communications. Proc. IEEE MILCOM'98. San Diego, CA, 187-192.
22. Hall, D. L., J. Llinas, eds. 2001. Handbook of Multisensor Data Fusion. CRC Press, Boca Raton, FL.
23. Hogan, K., C. Revelle. 1986. Concepts and applications of backup coverage. Management Sci. 32(11) 1434-1444.
24. Jayaraman, V., R. Srivastava. 1995. A service logistics model for simultaneous siting of facilities and multiple levels of equipment. Comput. Oper. Res. 22(2) 191-204.
25. Johnson, D. B., D. A. Maltz. 1999. The dynamic source routing protocol for mobile ad hoc networks. T. Imielinski, H. Korth, eds. Mobile Computing, Ch. 5. Kluwer Academic Publishers, Boston, MA, 153-181.
26. Krishnamurthy, N. N., R. Batta, M. H. Karwan. 1993. Developing conflict-free routes for automated guided vehicles. Oper. Res. 41(6) 1077-1090.
27. Mamer, J. W., R. D. McBride. 2000. A decomposition-based pricing procedure for large-scale linear programs: An application to the linear multicommodity flow problem. Management Sci. 46(5) 693-709.
28. Marianov, V., C. Revelle. 1994. The queuing probabilistic location set covering problem and some extensions. Socio-Econom. Planning Sci. 28(3) 167-178.
29. Murthy, S., J. J. Garcia-Luna-Aceves. 1996. An efficient routing protocol for wireless networks. Mobile Networks Appl. (special issue on routing in mobile communication networks) 1(2) 183-197.
30. Parekh, A. K. 1994. Selecting routers in ad-hoc wireless networks. Proc. IEEE Internat. Telecommunication Sympos. Rio de Janeiro, Brazil, 420-424.
31. Park, V. D., M. S. Corson. 1997. A highly adaptive distributed routing algorithm for mobile wireless networks. INFOCOM, Kobe, Japan, 1405-1413.
32. Patel, D. J. 2002. Clustering sensors in wireless ad hoc networks using a dynamic expected coverage model. Unpublished master's thesis, Department of Industrial Engineering, University at Buffalo (SUNY), Buffalo, NY.
33. Perkins, C. E., P. Bhagwat. 1994. Highly dynamic destination-sequenced distance-vector routing for mobile computers. Proc. ACM SIGCOMM'94. London, UK, 234-244.
34. Perkins, C. E., E. M. Royer, S. R. Das. 1999. Multicast operation of the ad hoc on-demand distance vector routing. Proc. Mobicom'99. Seattle, WA, 207-218.
35. Ramanathan, R., M. Steenstrup. 1998. Hierarchically organized multihop mobile wireless networks for quality-of-service support. ACM/Baltzer Mobile Networks Appl. 3(1) 101-119.
36. Ribeiro, C. C., M. Minoux, M. C. Penna. 1989. An optimal column generation- with-ranking algorithm for very large scale set partitioning problems in traffic assignment. Eur: J. Oper. Res. 41 232-239.
37. Sanchez, R., J. Evans, G. Minden. 1999. Networking on the battlefield: Challenges in highly dynamic multi-hop wireless networks. Proc. IEEE MILCOM'99, Vol. 2, 2 751-755.
38. Toh, C.-K. 1996. A novel distributed routing protocol to support ad hoc mobile computing. Proc. IEEE 15th Annual Internat. Phoenix Conf. Comput. Comm. Scottsdale, AZ, 480-486.
39. Toregas, C., R. Swain, C. ReVelle, L. Bergman. 1971. The location of emergency service facilities. Oper. Res. 19 1363-1373.