M. S. Corson and A. Ephremides. A distributed routing algorithm for mobile radio networks. In Proceedings of the IEEE Military Communications Conference (MILCOM '89), October 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....INTEL. We are working closely with ITT to develop a proposal for DoD. 1 Introduction A Mobile Ad Hoc Network (MANET) is a collection of wireless hosts that can be rapidly deployed as a multi hop packet radio network without the aid of any established infrastructure or centralized administration [14]. Such networks can be used to enable next generation of battlefield applications envisioned by the military [29] including situation awareness systems for maneuvering war fighters, and remotely deployed unmanned micro sensor networks. Ad Hoc networks can also provide solutions for civilian ....

M. Corson and A. Ephremides. A distributed routing algorithm for mobile radio networks. MILCOM 89, 1989.

....Index Terms Ad Hoc Networks, AODV, Vulnerability, Intrusion Detection. I. INTRODUCTION A mobile Ad Hoc network is a collection of wireless hosts that can be rapidly deployed as a multi hop packet radio network without the aid of any established infrastructure or centralized administration [1]. Such networks can be used to enable next generation of battlefield applications envisioned by the military [2] including situation awareness systems for maneuvering war fighters, and remotely deployed unmanned micro sensor networks. Ad Hoc networks can provide communication for civilian ....

M. Corson and A. Ephremides, "A distributed routing algorithm for mobile radio networks," in Proceedings of Military Communications Conference, 1989.

....multipath routing, proposed by Gafni and Bertsekas [24] uses a series of link reversals to form a directed acyclic graph (DAG) rooted at the destination. One problem is that this protocol, which came to be known as GB, exhibits instability when the network is partitioned. Corson and Ephremides [25] developed a new algorithm based on this concept, termed Lightweight Mobile Routing (LMR) algorithm. Subsequently, the same authors introduced TORA [3] LMR and TORA share many similarities including the route construction and route maintenance phases. TORA has an additional phase known as route ....

M.S. Corson and A. Ephremides, "A distributed routing algorithm for mobile radio networks," in Proc. IEEE MILCOM '89, Oct. 1989.

....out going links. Hence, if a topology changes, a route re establishment phase is needed. A detailed contrast between these approaches is found in [BL87] and [Tor87] 2.2 Current Mobile Routing Schemes Many ad hoc mobile routing schemes have evolved. They include those of [Rob90] P. 95] Eph95] T. 93] Mal96] Tsa95] and [Kei95] Most of these schemes are based on either broadcast or point to point routing using either the connectionless or connection oriented packet forwarding approach. We briefly describe four such schemes. The Layer Net self organising protocol proposed in ....

....On top of this, a clustering methodology is used to reduce the number of updates due to MHs migrations. Routes are constructed between all pairs of nodes and route maintenance is essentially cluster maintenance. Hence this method is inefficient. In source initiated distributed routing [Eph95] however, a combination of point to point and broadcast routing using the connection oriented packet forwarding approach is used. Here routes 3 are initiated by the source and are constructed based on demand. Hence this scheme forgoes the need to constantly propagate up to date routing ....

[Article contains additional citation context not shown here]

M. Scott Corson & Anthony Ephremides. `A Distributed Routing Algorithm for Mobile Radio Networks'. ACM Wireless Networks Journal, 1(1):61--81, January 1995. 42

....throughput gains by a factor of four over pure flooding under static conditions with all nodes and links operational. Another approach has been proposed for use in situations where rate of change in topology is not so high as to require pure flooding but too fast for shortest path algorithms [96]. In this approach the objective is to build routes quickly so that they may be used before the topology changes and react quickly to establish new routes when topological changes destroy existing routes. A query response exchange process is used in a table update protocol to seek out new routes ....

....minimum hop algorithm A minimum hop routing procedure can readily be derived from the Jaffe Moss shortest path algorithm [52] This algorithm exhibits good convergence performance (see Table 2.1) and is loop free. It is a well known algorithm with its behaviour examined by various authors [37, 54, 78, 76, 77, 96], 4, p. 320] While in this study the Jaffe Moss algorithm is being used as a minimum hop algorithm, it is in fact a more general minimum cost algorithm. If the link cost function incorporates parameters such output queue length, then the algorithm calculates minimum delay paths through the ....

[Article contains additional citation context not shown here]

S. Corson and A. Ephremides, "A distributed routing algorithm for mobile radio networks," in IEEE MILCOM proceedings, pp. 11.2.1--11.2.4, 1989.

....propagate refresh packets outwards from the destination, reception of which resets the reference level of all nodes to zero and restores distance significance to their d i s. The usage of periodic, destination initiated, route optimization was mentioned as a possible routing enhancement in [18] and, later, a similar technique was developed as the major mechanism for route adaptation and maintenence in [12] Besides serving as a routing enhancement, the periodic refresh guarantees that router state errors resulting from undetectable errors in packet transmissions or other sources do ....

M.S. Corson, A. Ephremides, A Distributed Routing Algorithm for Mobile Radio Networks, Proc. MILCOM `89, Boston, MA, (October, 1989).

No context found.

M. S. Corson and A. Ephremides. A distributed routing algorithm for mobile radio networks. In Proceedings of the IEEE Military Communications Conference (MILCOM '89), October 1989.

No context found.

M. S. Corson and A. Ephremides. A distributed routing algorithm for mobile radio networks. In Proceedings of the IEEE Military Communications Conference (MILCOM), 1989.

No context found.

S. Corson and A. Ephremides. A distributed routing algorithm for mobile radio networks. In Proceedings of the IEEE Military Communications Conference (MILCOM '89), October 1989.

No context found.

M.S. Corson, A. Ephremides. A Distributed Routing Algorithm for Mobile Radio Networks, Proceedings of the IEEE Military Communications Conference (MILCOM'89), October 1989.

No context found.

S. Corson and A. Ephremides, "Distributed Routing Algorithm for Mobile Radio Networks", Proceedings - IEEE Military Communications Conference, Piscataway, NJ, pp210-213,1989

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