C-K. Toh, "A novel distributed routing protocol to support ad-hoc mobile computing," IEEE International Phoenix Conf. on Computers and Communications, IPCCC'96.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Prakash and Singhal [25] 26] propose the use of dynamic hashing and quorum for e#cient location management. Akyildiz, et al. [1] Corson and Ephremides [3] Das et al. [4] Friesleben and Jansen [8] Johnson [11] Lauer [17] Vaidya and co authors [14] 15] Park and Corson [21] Toh [30] [31] are other representative publications in the area of routing and mobility management. C Motivation for the study Routing and location management directly a#ect the functioning of an ad hoc network. In addition, routing a#ects performance. All other aspects being invariant, e#cient routing ....

C. -K. Toh, "A novel distributed routing protocol to support ad-hoc mobile computing," Wireless Personal Communication, Jan. 1997.

....fresh the routes learned and to delete unused routes. Some examples of this category are: AODV (Ad Hoc On Demand Distance Vector Routing) 11] DSR (Dynamic Source Routing) 9] LMR (Lightweight Mobile Routing) 4] TORA (Temporary Ordered Routing Algorithm) 11] ABR (Associative Based Routing) [17] and SSR (Signal Stability Routing) 6] 3 The PERA Ad Hoc routing protocol PERA tries to fulfill the following requirements: Each robot can send data to any other robot. Each robot can receive data from any other robot. Movement of robots is allowed without disturbing ....

C. Toh, "A Novel Distributed Routing Protocol To Support Ad-Hoc Mobile Computing", IEEE 15th Annual Int'l. Phoenix Conf. Comp. and Commun., 1996.

....value is used in the propagation of the reference levels. Finally, the second value representing the delta, i, is the unique ID of the node itself. When a new reference level is generated, links may be reversed to adapt to the new reference level. The Associativity Based Routing (ABR) protocol [28] uses the degree of association stability as a metric. Each node periodically generates a beacon to indicate its presence to neighbor nodes. For each beacon received, the associativity counter (called associativity tick in [28] of the current node with respect to the beaconing node is ....

....new reference level. The Associativity Based Routing (ABR) protocol [28] uses the degree of association stability as a metric. Each node periodically generates a beacon to indicate its presence to neighbor nodes. For each beacon received, the associativity counter (called associativity tick in [28]) of the current node with respect to the beaconing node is incremented. Associativity counters are reset when the neighbors of a node or the node itself move out of proximity. Longer lived routes are preferred since they indicate less node mobility and, so, more stability. Route discovery is ....

C.-K. Toh, "A novel distributed routing protocol to support ad-hoc mobile computing," in Proc. IEEE 15th Int'l Phoenix Conf. on Computers and Communications, pp. 480--486, 1996. 40

....uni directional links will require nodes to exchange ) 2 n O information with each other, where n is the number of nodes in the network[9] Modifications to distance vector based routing algorithm are also shown in order to make them work in ad hoc networks with uni directional links. SSA[10] proposes a distributed adaptive routing protocol for finding and maintaining stable routes based on signal strength and location stability in ad hoc networks. SSA utilizes periodical control packets to confirm the connection status of links, and signal strength to judge link stability. This ....

Chai-Keong Toh, "A Novel Distributed Routing Protocol to Support Ad-Hoc Mobile Computing (ABR)," Proceedings of 15 IEEE Annual International Phenix Conference on Computers and Communications, March 1996.

....sourceinitiated on demand routing protocol creates route when the source node only requires a route to the destination node. Ad Hoc On Demand Distance Vector Routing (AODV) 5] Dynamic Source Routing (DSR) 6] Temporally Ordering Routing Algorithm (TORA) 7] Associativity Based Routing (ABR) [8] and Signal Stability Routing (SSR) 9] are all on demand routing protocols for ad hoc wireless networks. Source initiated on demand routing protocols often process include route discovery to establish a route first when the source node requires, and then maintain the route when network topology ....

....to set synchronous clock. The last way is more convenient and easy to implement, and we just need to choose an adequate Tc for the ABRP. In the future for ABRP, there are also many ways to be considered that can improve the stability of the routes. Taking Associativity Based Routing (ABR)[8] and Signal Stability Routing (SSR) 9] for example, the intermediate nodes can choose more stable path first. And, we will keep about some hot issues of the ad hoc networks, such as the QoS and mulicast to enhance the capability of the ABRP. ....

C-K. Toh, "A Novel Distributed Routing Protocol To Support Ad-Hoc Mobile Computing," Proc. 1996.

....short route for a nearby link on the route, and when the link breaks, relevant neighboring node will salvage the route and help to deliver the affected packets to the destination. Several reports have proposed techniques toward improving the route stability. Associativity Based Routing (ABR)[21] protocol defines a routing metric known as degree of association stability. A high value of the metric may indicate a low state of relative mobility between neighboring nodes. In ABR, a route is selected based on the degree of association stability of mobile nodes, so that it can derive ....

C-K. Toh, "A Novel Distributed Routing Protocol To Support Ad-Hoc Mobile Computing," Proc. 1996.

....along the line of sight between source and destination nodes is often impossible. Further, those approaches do not consider routing around congested areas or where links suffer from poor quality. There exist some approaches, which take the path quality for routing decisions into account (ABR [12], SSA [13] But for large scale MANETs, not only the quality of wireless transmission over a single link or along a single path should be considered, but as well the quality of transmission and routes within whole geographical areas. If required, areas should be bypassed completely for ....

Toh, C.-K.: Novel Distributed Routing Protocol to Support Ad-Hoc Mobile Computing. Proceedings of the 1996.

....the aid of a fixed networking infrastructure. Their use is being proposed as an extension to the Internet, but they can be used anywhere a fixed infrastructure does not exist or is not desirable. A lot of research of mobile ad hoc networks has focused on the development of routing protocols (e.g. [9, 10, 15, 17, 18, 19, 20, 21]. Our research is focused on the performance of TCP over mobile ad hoc networks. Since TCP IP is the standard network protocol stack for communication on the Internet, its use over mobile ad hoc networks is a certainty because of the number of applications that it leverages, and because it allows ....

....via the reverse channel. Thus, the lowest sequence number of the packets lost would also happen to be the first in the window. 7 Related Work Because routing is an important problem in mobile ad hoc networks researchers have explored several routing protocols for this environment (e.g. [9, 10, 15, 17, 18, 19, 20, 21]) Recently, some researchers have considered the performance of TCP on multi hop networks [14, 7] Gerla et al. 14] investigated the impact of the MAC protocol on performance of TCP on multi hop networks. Chandran et al. 7] proposed the TCP Feedback (TCP F) protocol, which uses explicit ....

C. Toh, "A novel distributed routing protocol to support ad-hoc mobile computing," Wireless Personal Communication, Jan. 1997. 21

....knows the route to the destination. The reply is then routed back through the same path through which it had come. Route mantainance is accomplished through the use of route error packets and acknowledgements. 10 Temporally Ordered Routing Algorithm (TORA) 64] Associativity Based Routing (ABR) [83], Signal Stability Routing (SBR) 26] are other examples of similar on demand ad hoc routing protocols. Adaptability and self con guration are important parameters of any ad hoc routing protocol. The eciency and performance of ad hoc routing protocols will a ect the eciency of service execution ....

C.K. Toh. A novel distributed routing protocol to support ad-hoc mobile computing. In Proc. IEEE. 15th International Phoenix Conference on Computer and Communications, pages 480-86, march 1996.

....bandwidth consumed by maintaining routes to only those destinations for which a source has data traffic. Therefore, the routing is source initiated as opposed to table driven routing protocols that are destination initiated. There are several recent examples of this approach (e.g. AODV [16] ABR [20], DSR [10] TORA [14] SSA [4] ZRP [9] and the routing protocols differ on the specific mechanisms used to disseminate floodsearch packets and their responses, cache the information heard from other nodes searches, determine the cost of a link, and determine the existence of a neighbor. ....

C-K. Toh. A Novel Distributed Routing Protocol to support Ad-Hoc Mobile Computing. In Proc.

....This does not scale well to mobility as overhead (due to route requests) and latency (due to finding new routes) increase as mobility increases. 3.8 Associativity Based Routing ABR 3.8. 1 Description The Associativity Based Routing (ABR) protocol is a new approach for routing proposed in [Toh96,Toh99]. ABR defines a new metric for routing known as the degree of association stability. It is free from loops, deadlock, and packet duplicates. In ABR, a route is selected based on associativity states of nodes. The routes thus selected are liked to be long lived. All node generate periodic ....

C. Toh, "A Novel Distributed Routing Protocol to Support Ad-Hoc Mobile Computing," Proceedings of

....the vicinity. The Temporally Ordered Routing Algorithm (TORA) 43] is an on demand protocol based on a link reversal algorithm. TORA aims to minimise the reaction to topological changes of the network and provides multiple routes for any source destination pair. Associativity Based Routing (ABR) [44] is a totally different approach for ad hoc routing. ABR aims to reactively establish long lived routes by measuring the associativity of all nodes respective to their neighbours. Still another on demand protocol is Signal Stability based Adaptive Routing (SSA) 45] which uses signal strength and ....

Toh C.-K. (1996) A Novel Distributed Routing Protocol To Support AdHoc Mobile Computing. In: IEEE International Phoenix Conference on Computers and Communication, March 27-29, Phoenix, AZ USA, pp. 480486.

No context found.

C-K. Toh, "A novel distributed routing protocol to support ad-hoc mobile computing," IEEE International Phoenix Conf. on Computers and Communications, IPCCC'96.

No context found.

C-K. Toh, "A novel distributed routing protocol to support ad-hoc mobile computing," IEEE International Phoenix Conf. on Computers and Communications, IPCCC'96.

No context found.

C.-K. Toh. A novel distributed routing protocol to support ad-hoc mobile computing. In Proceedings of IEEE Phoenix Conference on Computer and Communications, Arizone, USA, Mar. 1996.

No context found.

C.-K. Toh, "A novel distributed routing protocol to support ad-hoc mobile computing," in Proceedings of IEEE Phoenix Conference on Computer and Communications, (Arizone, USA), Mar. 1996.

No context found.

C.-K. Toh. A novel distributed routing protocol to support ad-hoc mobile computing. In Proc. IEEE Fifteenth Annual International Phoenix Conference on Computers and Communications, pages 480--486, 1996.

No context found.

C-K. Toh. A novel distributed routing protocol to support ad hoc mobile computing. Proceedings, IEEE 15th Annual International Phoenix Conference on Computers and Communication, pages 480--486, 1996.

No context found.

C. K. Toh. A novel distributed routing protocol to support ad-hoc mobile computing. In IEEE Annual International Phoenix Conference on Computers and Communications, pages 480--486, March 1996. Proceedings of the Eighth IEEE International Symposium on Computers and Communication (ISCC'03)

No context found.

C.-K. Toh, A Novel Distributed Routing Protocol To Support Ad-Hoc Mobile Computing, Proceedings of the 1996.

No context found.

C-K. Toh, "A novel distributed routing protocol to support ad-hoc mobile computing," IEEE International Phoenix Conf. on Computers and Communications, IPCCC'96.

No context found.

C-K. Toh, \A novel distributed routing protocol to support ad-hoc mobile networks," in Proc 1996.

No context found.

C.-K. Toh, "A novel distributed routing protocol to support ad-hoc mobile computing," in 15th IEEE Annual International Phoenix Conference on Computers and Communications, 1996.

No context found.

C.-K. Toh, \A novel distributed routing protocol to support ad-hoc mobile computing, " in Proceedings of 15th IEEE Annual International Phoenix Conference on Computers and Communications, 1996, pp. 480-486.

No context found.

C. K. Toh. A novel distributed routing protocol to support ad-hoc mobile computing. In Proc. 15th IEEE Annual International Phoenix Conf. Computers and Communications (IEEE'96). (1996).

First 50 documents

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