Providing full connectivity in large ad-hoc networks by dynamic placement of aerial platforms

Proceedings - IEEE Military Communications Conference MILCOM

Volumn 3, Issue , 2004, Pages 1429-1436

  Chandrashekar, Karthikeyan ^a   Dekhordi, Majid Raissi ^a   Baras, John S ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GROUND NODE; HEURISTIC ALGORITHMS; ROUTING PROTOCOLS; UNMANNED AERIAL VEHICLES (UAV);

ALGORITHMS; HEURISTIC METHODS; NETWORK PROTOCOLS; PROBLEM SOLVING; ROUTERS; UNMANNED VEHICLES;

METROPOLITAN AREA NETWORKS;

EID: 27744592521     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. Izhak Rubin and Runhe Zhang. Performance behaviour of unmanned vehicle aided mobile backbone based wireless ad hoc networks.
2. S. Benjamin and I.Rubin. Connected disc covering and applications to mobile gateway placement in ad hoc networks. In Proceedings of ADHOC NetwOrks and Wireless (ADHOC-NOW).
3. D.B. Johnson and D.A. Maltz. Dynamic source routing in ad hoc wireless networks. Mobile Computing, Kluwer Academic Publishers. 1996.
4. Kin K. Leung, Brace McNair, Jr Leonard J. Cimini, and JackH. Winters. Outdoor ieee 802.11 cellular networks: Mac protocol design and performance. 2002.
5. D. Ghosh. Neighborhood search heuristics for the uncapacitated facility location problem. European Journal of Operational Research, vol.150, no.1, 1 Oct. 2003. p. 150-62.
6. A. Meyerson S. Guha and K. Munagala. A constant factor approximation algorithm for the fault-tolerant facility location problem. Journal of Algorithms, vol.48, no.2, Sept. 2003. p. 429-40.
7. S. Guha and S. Khuller. Greedy strikes back: improved facility location algorithms. Journal of Algorithms, vol.31, no.1, April 1999. p. 228-48.
8. D.J. Elzinga and D.W. Hearn. The minimum covering sphere problem. Management Science, 19(1), 1972, pp. 96-104.
9. T.H. Hopp and C.P. Reeve. An algorithm for computing the minimum covering sphere in any dimension. Technical Report, National Institute of Standards and Technology (NIST), NISTIR 5831, May 1996.
10. N. Megiddo. The weighted euclidean 1-center problem. Mathematics of Operations Research, Vol. 8, No. 4, Nov. 1983, pp.498-504.
11. C. E. Perkins and E. M. Royer. Ad hoc On-demand Distance Vector (AODV) Routing. Internet Draft, draft-ietf-manet-aodv-02.txt, November 1998. Work in progress.
12. Opnet modeler version 10.0.a. www.opnet.com.