Young-Bae Ko and Nitin H. Vaidya, "Using location information to improve routing in ad hoc networks," Tech. Rep., Department of Computer Science, Texas A&M University, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Geometric Spanners for Wireless Ad Hoc Networks - Alzoubi, Li, Wang, Wan, Frieder (2003) (1 citation) (Correct)
....algorithm. The simplest routing method is to flood the message, which not only wastes the rare resources of wireless node, but also diminishes the throughput of the network. One way to avoid flooding is to let each node communicate with only a selected subset of its neighbors [2] 3] 4] [5], or to use a hierarchical structure. Examples of hierarchical routing are dominating set based routings [6] 7] 8] 9] When each wireless node knows its geometry position and can quickly retrieve the geometry information about the destination node of a routing request, several localized ....
Y.-B. Ko and N.H. Vaidya, "Using Location Information to Improve Routing in Ad Hoc Networks," technical report, Dept. of Computer Science, Texas A&M Univ., 1997.
Optimizations for Location-aided Routing (LAR) in Mobile Ad Hoc .. - Ko, Vaidya (1998) Self-citation (Ko Vaidya) (Correct)
.... a challenging problem in the area of mobile ad hoc networking (MANET) Many different protocols have been proposed to achieve a given level of routing performance for MANET [1, 2, 4, 5, 6, 8, 9, 14, 15, 18, 19, 20, 22, 23] Among those protocols, Location Aided Routing (LAR) algorithms we proposed [11, 12, 14] attempt to reduce routing discovery overhead incurred with some flooding based approaches, such as Dynamic Source Routing (DSR) 9, 10] and Ad hoc On demand Distance Vector routing Research reported is supported in part by Texas Advanced Technology Program grants 010115 248 and 009741 052 C. ....
....010115 248 and 009741 052 C. AODV) 19] In LAR, the use of physical location information has been suggested to reduce the search space for a desired route. The basic LAR has two different algorithms in terms of how to define the limited search space, named request zone , as described in [11, 12, 14]. Several optimizations are possible to achieve more efficient performance of the basic LAR protocols. In [12, 14] some potential optimizations to the basic LAR algorithms have been suggested, for instance, alternative definitions of request zone or use of directional antenna, etc. This report ....
[Article contains additional citation context not shown here]
Y.-B. Ko and N. H. Vaidya, "Using location information to improve routing in ad hoc networks," Tech. Rep. 97-013, CS Dept., Texas A&M University, December 1997.
Regional Gossip Routing for Wireless Ad Hoc Networks - Li, Moaveninejad, Frieder (Correct)
No context found.
Young-Bae Ko and Nitin H. Vaidya, "Using location information to improve routing in ad hoc networks," Tech. Rep., Department of Computer Science, Texas A&M University, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC