R. Dube, C. Rais, K. Wang, and S. Tripathi, "Signal stability based adaptive routing (ssa) for ad hoc mobile networks," February 1997.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....wired networks works well when the degree of mobility is low [6 8] but for highly mobile nodes routing presents new problems in adhoc networks, including the integration of QoS considerations. Significant work has been presented in literature both for on demand and table driven approaches [9 15]. Location aware routing has been considered as a means of controlling flooding behavior in approaches depending on flooding [16 19] Location awareness is important for adhoc networks in other contexts as well, and in some cases (e.g. sensor network) may be a primary function of the adhoc ....

R. Dube, C. Rais, K. Wang, and S. Tripathi, "Signal stability based adaptive routing (SSA) for ad hoc mobile networks," IEEE Personal Communication, Feb. 1997.

....communications, as the multicast data packets is to be delivered to more than one receiver. To improve routing reliability, several unicast routing protocols have been presented based on choosing routes composed of more reliable wireless links rather than those of shortest hops. ABR [40] and SSA [8] are examples. These protocols measure the link reliability based on past and current information on the link states. However, as nodes move frequently, future link breakages cannot be avoided even for these more stable links. Therefore, to predict node mobility and the future states of the ....

....time 0 t . This model can provide the basis for route selection, choosing the route with the biggest minimum link probability, thus selecting the longest lived route rather than the normal shortest hop route. Associativity Based Routing (ABR) 40] and Signal Stability Based Adaptive Routing (SSA) [8] are reactive unicast routing protocols based on selecting long lived routes. In both protocols, every node transmits beacons periodically to advertise its existence and neighbors can measure the distance and capacity of the link to it by receiving its beacons and learn the link s stability. In ....

Dube, R.; Rais, C. D.; Wang, K.-Y. and Tripathi, S. K.; "Signal Stability-Based Adaptive Routing (SSA) for Ad Hoc Mobile Networks", IEEE Personal Communications Magazine, February 1997, Vol. 4, No. 1, pages 36-45.

....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 communications. Multiple applications running ....

R. Dube, "Signal Stability based Adaptive Routing (SSA) for Ad-Hoc Mobile Networks", IEEE Pers. Commun., 1997.

....contain the associativity counters of the nodes along the route from the source to the destination. The destination selects the best route by examining this information and sends a REPLY packet back to the source along the chosen path. The Signal Stability Based Adaptive Routing (SSR) protocol [29] selects routes based on the signal strength between nodes and a node s location stability in order to choose routes that have stronger connectivity. The signal strength is obtained by periodic beacons from the link layer of the neighbor nodes. During the route discovery process, route requests ....

R. Dube, C. Rais, K. Wang, and S. Tripathi, "Signal stability based adaptive routing (SSA) for ad hoc mobile networks," IEEE Personal Communication Magazine, vol. 4, no. 1, pp. 36--45, 1997.

....changes. Representatives in this (sub )category are Gafni and Bertsekas s algorithm [49] the dynamic source routing (DSR) protocol [70] the temporally ordered routing algorithm (TORA) 102] the associativity based routing (ABR) protocol [124] the signal stabilitybased routing (SBR) protocol [44], the location aided routing (LAR) algorithm [77] the power aware routing protocol [116] and the ad hoc on demand distance vector (AODV) protocol [111] In particular, ABR [124] and SBR [44] attempted to build routes that traverse links with high signal strength stability and or location ....

.... the associativity based routing (ABR) protocol [124] the signal stabilitybased routing (SBR) protocol [44] the location aided routing (LAR) algorithm [77] the power aware routing protocol [116] and the ad hoc on demand distance vector (AODV) protocol [111] In particular, ABR [124] and SBR [44] attempted to build routes that traverse links with high signal strength stability and or location stability, and the power aware routing protocol [116] explored the issue of increasing network lifetime by using power aware metrics for routing. LAR [77] on the other hand, uses location ....

R. Dube, C. D. Rais, K. Wang, and S. K. Trpathi, "Signal Stability Based Adaptive Routing (SSA) for Ad-Hoc Mobile Networks," IEEE personal Communication, vol. 4, no. 1, pp. 36-45, February 1997.

....computer simulations. In order to verify the mechanism of stable route construction, following protocols including SARAH are compared. As for SARAH, two methods that differ in Sth are simulated here. Table 2 shows simulation parameters. Flooding . Signal Stability based Adaptive Routing (SSA)[11] which constructs stable route by utilizing periodical broadcast packet among neighbor nodes . SARAH whose link stability threshold Sth is fixed (method A) SARAH whose link stability threshold Sth is the average (method B) Table 2: Simulation parameters Simulation region Number of nodes ....

Rohit Dube, Cynthia D. Rais, Kuang-Yeh Wang, and Satish K. Tripathi, "Signal Stability based Adaptive Routing (SSA) for Ad-Hoc Mobile Networks," IEEE Personal Communications, Feb. 1997.

....the multi rate network performance of almost any existing shortest path based protocol by adapting it to use our medium time metric. B. Signal Stability Based Ad Hoc Routing Protocols In [8] the authors show that the minimum hop path generally contains links which exhibit low reliability. In [9] and [10] the authors present routing protocols which are based on signal stability rather then just shortest path in order to provide increased path reliability. In this work signal stability information is used not only to increase path reliability, but also to increase network throughput. C. ....

R. Dube, C. Rais, K. Wang, and S. Tripathi, "Signal stability based adaptive routing (ssa) for ad hoc mobile networks," February 1997.

....satisfies the minimal requirement of the successful communication. Link availability is a general term to measure the probability or degree that a link is in the above available state. Words availability and reliability will be used interchangeable to describe link status in this paper. In [4], both signal stability and location stability are used to quantify the reliability of a link. With the signal stability, each node classifies its neighbors as either strongly connected or weakly connected according to the signal strength of received beacons generated periodically by its ....

R. Dube, C. Raia, K-YWang and S. Tripathi, "Signal stability based adaptive routing (SSA) for ad hoc networks", IEEE Personal Communications, Feb. 1997, pp. 36-45.

....The characteristics of an ad hoc network demand new metrics for routing. Traditionally, distance (measured in hops) is used as the metric in most ad hoc route discovery algorithms (e.g. AODV [5] DSR [6] TORA [7] etc. The use of other metrics (e.g. geographic location [8] signal stability [9] etc. can improve the quality and the relevance of the routes discovered for particular applications and configurations. Along these lines, we explore the use of different security attributes to improve the quality of the security of an ad hoc route. In this paper, we present Security Aware ....

....send updates and react to topology changes, using monitoring and other infrastructure support to maintain routing tables. Current research focuses on pure on demand[6, 5] routing protocols, and more recently, on augmentations that exploit additional information available on the ad hoc nodes[8, 9, 14] to improve the quality of routes and reduce performance overheads. Most of the protocols that have been proposed so far focus on discovering the shortest path between two nodes as fast as possible. In other words, the length of the routes is the only metric used in these protocols. Some protocols ....

R. Dube and C. D. Rais and Kuang-Yeh Wang and S. K. Tripathi, "Signal stability-based adaptive routing (SSA) for ad hoc mobile networks," IEEE Personal Communications, Feb. 1997.

....with a power based metric, rather than a hop count based metric. Some suggestions for the metric in [6] include energy consumed per packet, time to network partition, variance in battery life of nodes, and the energy cost per packet, while other schemes in this class are proposed in [7] 8] and [9]. The third class of approaches aim at modifying the MAC layer. In [10] it is suggested to modify IEEE 802.11 s handshaking procedure to allow nodes to transmit at a low power level, while [11] proposes enabling nodes to power themselves off when not actively transmitting or receiving. Some other ....

....distributed Bellman Ford algorithm with sequence numbers, and with total power consumption as the cost instead of the hop count metric normally used. Any shortest path algorithm can be used. The basic idea behind MINPOW is not new, and has been suggested before in different forms in [6] 7] 8] [9]. Various metrics like signal strength, transmit power cost of the link, a node s remaining battery life, or variance in battery life among all nodes, have been proposed. These approaches generally require substantial physical layer support, and the lack of standardization for cross layer ....

R. Dube, C. D. Rais, K.-Y. Wang, and S. K. Tripathi, "Signal stability based adaptive routing (SSA) for ad-hoc mobile networks," in IEEE Personal Communications, 1997.

....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 changing happened. The issue how to find ....

....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. ....

R. Dube et al., "Signal Stability based Adaptive Routing (SSA) for Ad-Hoc Mobile Networks," IEEE Pers. Commun., Feb. 1997, pp. 36-45.

....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 longer lived routes. A similar approach is used in Signal Stability Based Adaptive Routing(SSR)[5], in which route selection is based on the signal strength between nodes and a node s location stability. Routes that have stronger connectivity are preferred, which may also result in more stable route. Mobility prediction [20] is a different technique toward enhancing route stability. ....

R. Dube, C. D. Rais, K.-Y. Wang, and S. K. Tripathi, "Signal Stability based Adaptive Routing (SSA) for Ad-Hoc Mobile Networks, " IEEE Personal Communications, pp. 36-45, February 1997.

....and constantly changing topology pose difficult challenges on the routing protocol; foremost among them is how to deliver data packets while incurring the least routing overhead possible. Over the last few years, many routing protocols for mobile ad hoc networks have been proposed [2] 3] 4] [5], 6] 7] 8] These protocols can be broadly classified into three categories, namely, proactive, reactive, and hybrid. Studies show that reactive routing protocols perform better in terms of packet delivery and routing overhead especially in the presence of mobility due to the ability of these ....

R. Dube, C. Rais, K.Y. Wang, and S.K. Tripathi, "Signal stability-based adaptive routing (ssa) for ad hoc mobile networks," IEEE Personal Commun., vol. 4, no. 1, pp. 36--45, Feb. 1997.

....with a power based metric rather than a hop count based metric. Some suggestions for the metric in [6] include energy consumed per packet, time to network partition, variance in battery life of nodes and the energy cost per packet. Some other schemes in this class are proposed in [7] 8] and [9]. The third class of approaches aim at modifying the MAC layer. 10] suggests modifying IEEE 802.11 s handshaking procedure to allow nodes to transmit at a low power level. 11] proposes enabling nodes to power themselves off when not actively transmitting or receiving. The clustering problem ....

....is essentially distributed Bellman Ford algorithm with sequence numbers, and transmit power as the link cost instead of the hop count normally used. Any shortest path algorithm can be used. The basic idea behind MINPOW is not new, and has been suggested before in different forms in [6] 7] 8] [9]. Various metrics like signal strength, transmit power cost of the link, node s remaining battery life or variance in battery life among all nodes, have been proposed. These approaches generally require substantial physical layer support, and the lack of standardization for cross layer interaction ....

R. Dube, C. D. Rais, K.-Y. Wang, and S. K. Tripathi, "Signal stability based adaptive routing (SSA) for ad-hoc mobile networks," in IEEE Personal Communications, 1997.

....and provide a hybrid routing approach that is proactive within the cluster and reactive between clusters. While this protocol can group nodes into clusters among which path availability can be bounded, it does not help the selection among competing paths. Signal Stability Based Adaptive (SSA) [6] and Associativity Based (ABR) 29] routing protocols propose two di#erent mechanisms for assessing link stability. They both rely on periodic beaconing in order to estimate the link failure rates. ABR nodes determine which neighbors they are associated to after receiving five consecutive ticks . ....

R. Dube, C.D. Rais, K.Y. Wang, and S.K. Tripathi. "Signal Stability-Based Adaptive Routing (SSA) for Ad Hoc Mobile Networks." IEEE Personal Communications, p.36-45, Feb. 1997.

.... Link availability is a general term to measure the probability or degree that a link is in the above available state. Words availability and reliability will be used interchangeable to describe link status in this paper. increases the value of its associativity with the beaconing node. In [4], both signal stability and location stability are used to quantify the reliability of a link. With the signal stability, each node classifies its neighbors as either strongly connected or weakly connected according to the signal strength of received beacons generated periodically by its ....

R. Dube, C. Raia, K-YWang and S. Tripathi, "Signal stability based adaptive routing (SSA) for ad hoc networks", IEEE Personal Communications, Feb. 1997, pp. 36-45.

....or broadcasts for route computation. As we have mentioned before, our experience has been that flooding in ad hoc networks does not work well due to the presence of hidden and exposed stations. Ad hoc routing algorithms which provide a single route in response to a route query from a source ( 4] [12], 13] have low overhead but sometimes use sub optimal and stale routes. 4] uses flooding, in the worst case, for finding routes. 12] considers signal strength as a metric for routing. 13] uses additional criteria to judge routes: the relaying load, or number of existing connections passing ....

....well due to the presence of hidden and exposed stations. Ad hoc routing algorithms which provide a single route in response to a route query from a source ( 4] 12] 13] have low overhead but sometimes use sub optimal and stale routes. 4] uses flooding, in the worst case, for finding routes. [12] considers signal strength as a metric for routing. 13] uses additional criteria to judge routes: the relaying load, or number of existing connections passing through an intermediate node; and location stability, as measured in associativity ticks. 3] uses a spine structure for route computation ....

R. Dube, C. D. Rais, K.-Y. Wang, and S. K. Tripathi, "Signal stability based adaptive routing (SSA) for ad-hoc mobile networks," Tech. Rep. UMCP-CSD:CS-TR-3646, Dept. of Computer Science, Univ. of Maryland, College Park, Sept. 1996.

....its stability, but also the overhead cost (signaling, computation, etc) associated with route discovery and maintenance is reduced. One of the well known solutions to this problem is the mobility prediction of the nodes. Various mobility prediction schemes have been proposed for ad hoc networks [1, 2, 5, 6, 7, 8, 9, 11, 12, 13], most of which are simulation based. Many researchers have addressed the mobility characterization issues in wireless cellular networks, where one of the two nodes, the base station (BS) is stationary [14] Refs. 7, 8] have extended the concept of cellular mobility in ad hoc networking ....

....application, where any two nodes are mobile. Associativity based routing [13] selects a route based on associativity states of nodes. The objective is to select routes that have long lived links according to the associativity of the nodes involved. Signal stability based adaptive routing [2] selects a route based on both the signal strength between nodes and a node s location stability. The routes containing strongly connected nodes are preferred over the weakly connected nodes. The work presented in [1, 9] predicts status of links quantitatively. The proximity model proposed in [8] ....

R. Dube, C.D. Rais, K-Y.Wang and S.K. Tripathi, "Signal Stability-Based Adaptive Routing (SSA) for Ad-Hoc Mobile Networks", IEEE Personal Communications, February 1997, pp. 36-45.

....Routing Algorithm [25] WRP (Wireless Routing Protocol [22] and in the DARPA packet radio protocol (see [16, 18] Some of these protocols, however, can just as easily use shortest delay as the metric. Link quality is a metric that is used by SSA (Signal Stability based Adaptive Routing [8]) and by the DARPA protocol. Here, link quality information is used to select one among many different routes (in some cases a shortest hop route may not be used because of poor link quality) In addition to link quality, SSA also uses location stability as a metric. This metric biases route ....

R. Dube, C. D. Rais, K-Y Wang and S. K. Tripathi, "Signal Stability-based Adaptive Routing (SSA) for Ad Hoc Mobile Networks", Technical Report CS-TR-3646, UMIACS-TR-96-34, August 28, 1996.

....by simply turning off the DSR feature whereby intermediate nodes send out route updates based on the contents of their (often stale) route caches. Ahuja et al. 1] conducted a simulation based comparison of TCP performance over several MANET routing protocols, including AODV, DSR, and SSA [10]. Only a single source of TCP traffic was simulated. They concluded that frequency of route failures, routing overhead, and delay in route establishment are the important determinants of TCP throughput in an ad hoc network. Like [13] they found that disabling route replies from cache actually ....

R. Dube et al., "Signal stability based adaptive routing (SSA) for ad-hoc mobile networks," in IEEE Personal Communications, Feb. 1997.

....type have 5 been proposed. Lightweight Mobile Routing (LMR) 36] Dynamic Source Routing (DSR) 69] Temporarily Ordered Routing Algorithm (TORA) 121] Ad Hoc On Demand Distance Vector (AODV) routing [128] Associativity Based Routing (ABR) 159] Signal Stability Based Adaptive (SSA) routing [43], Routing Ondemand Acyclic Multipath (ROAM) algorithm [132] Multipath Dynamic Source Routing (MDSR) 118] Relative Distance Micro discovery Ad Hoc Routing (RDMAR) protocol [3] and Route Lifetime Assessment Based Routing (RABR) protocol [2] are typical on demand routing protocols. Fourth, with ....

....(e.g. real time traffic) Additionally, if the network has a large number of data sessions, the amount of control overhead grows to be comparable to those of proactive schemes. DSR, a typical on demand scheme, has even less control overhead than other on demand schemes (e.g. ABR [159] SSA [43]) since it does not exchange any hello or beacon messages. However, the drawback is that route breaks and link changes are detected only after data packets fail to go through the broken link, thus yielding longer delays. Intermediate nodes of a route in DSR need not maintain up to date route ....

R. Dube, C.D. Rais, K.-Y. Wang, and S.K. Tripathi, "Signal StabilityBased Adaptive Routing (SSA) for Ad Hoc Mobile Networks", IEEE Personal Communications Magazine, vol. 4, no. 1, February 1997, pp.36-45.

....to send a flood search message to obtain the path information it needs. The first routing protocol of this type was proposed to 1 establish virtual circuits in the MSE network [17] and there are several more recent examples of this approach (e.g. AODV [18] ABR [19] DSR [20] TORA [21] SSA [22]) These protocols differ on the specific mechanisms used to disseminate flood search 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. A hybrid of table driven and on demand approaches is ....

R. Dube et al., "Signal Stability-Based Adaptive Routing (SSA) for Ad-Hoc Mobile Networks, " IEEE Pers. Commun. February 1997. 14

....or broadcasts for route computation. As we have mentioned before, our experience has been that flooding in ad hoc networks does not work well due to the presence of hidden and exposed stations. Ad hoc routing algorithms which provide a single route in response to a route query from a source ( 4] [12], 13] have low overhead but sometimes use sub optimal and stale routes. 4] uses flooding, in the worst case, for finding routes. 12] considers signal strength as a metric for routing. 13] uses additional criteria to judge routes: the relaying load, or number of existing connections passing ....

....well due to the presence of hidden and exposed stations. Ad hoc routing algorithms which provide a single route in response to a route query from a source ( 4] 12] 13] have low overhead but sometimes use sub optimal and stale routes. 4] uses flooding, in the worst case, for finding routes. [12] considers signal strength as a metric for routing. 13] uses additional criteria to judge routes: the relaying load, or number of existing connections passing through an intermediate node; and location stability, as measured in associativity ticks. 3] uses a spine structure for route computation ....

R. Dube, C. D. Rais, K.-Y. Wang, and S. K. Tripathi, "Signal stability based adaptive routing (SSA) for ad-hoc mobile networks," Tech. Rep. UMCP-CSD:CS-TR-3646, Dept. of Computer Science, Univ. of Maryland, College Park, Sept. 1996.

....is propagated by a full broadcast, as opposed to a directed broadcast, because the source node may not be aware of any route node changes that occurred during RRCs. Signal Stability Routing Another on demand protocol is the Signal Stability Based Adaptive Routing protocol (SSR) presented in [13]. Unlike the algorithms described so far, SSR selects routes based on the signal strength between nodes and a node s location stability. This route selection criteria has the effect of choosing routes that have stronger connectivity. SSR can be divided into two cooperative protocols: the Dynamic ....

R. Dube et al., "Signal Stability based Adaptive Routing (SSA) for AdHoc Mobile Networks," IEEE Pers. Commun., Feb. 1997, pp. 36--45.

....as opposed to a directed broadcast, because the source node may not be aware of any route node changes that occurred during route re constructions. 2.2. 5 Signal Stability Routing (SSR) Another on demand protocol is the Signal Stability based Adaptive Routing protocol (SSR) presented in [6]. Unlike the algorithms described so far, SSR selects routes based on the signal strength between nodes and on a node s location stability. This route selection criteria has the effect of choosing routes that have stronger connectivities. SSR can be divided into two cooperative protocols: the ....

R. Dube, C. D. Rais, K.-Y. Wang, and S.K. Tripathi, "Signal Stability based Adaptive Routing (SSA) for Ad-Hoc Mobile Networks," IEEE Personal Communications, pp. 36--45, February 1997.

....compares the performance of DBF, DSR, and ABR protocol via simulation. The conclusion follows in Section 4. 2 Existing Ad Hoc Routing Protocols Recently, several proposals to support ad hoc mobile communications have evolved, including DSDV [8] LMR [9] WRP [10] DSR [7] ABR [6] AODV [11] SSA [12], TORA [13] ZRP [14] and CEDAR [15] Surveys of routing techniques for mobile wireless networks and ad hoc networks have been reported in [16] and [17] In this paper, we focus our attention and discussion on DBF, DSR, and ABR. 2.1 Distributed Bellman Ford Distributed Bellman Ford (DBF) ....

R. Dube, C.D. Rais, K.-Y. Wang, and S.K. Tripathi, "Signal Stability-Based Adaptive Routing (SSA) for Ad Hoc Mobile Networks", IEEE Personal Communications Magazine, vol. 4, no. 1, Feb. 1997, pp.36-45.

....[12] suffers from synchronization problems. The minimum connected dominating set (MCDS) routing algorithm in [2] 1] seems to eliminate some of the above problems but uses some impractical assumptions with regard to partitioning networks. The Signal Stability based Adaptive Routing protocol (SSA)[3] discovers routes on demand based on signal strength and location stability. While the SSA algorithm is simple, it requires additional work in maintaining information about relative signal strength of messages. In this paper, we consider the communication of packets or datagrams in dynamic ad hoc ....

Dube, R., Rais, C.D., Wang, K., Tripathi, S., "Signal Stability based Adaptive Routing (SSA) for Ad-Hoc Mobile Networks", Technical Report, CS-TR-3646, Department of Computer Science, University of Maryland, College Park,MD,1996.

....be improved by applying those optimization schemes. 1 Introduction The issue of developing efficient routing algorithms is 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 ....

R. Dube, C. D. Rais, K. Wang, and S. K. Tripathi, "Signal stability based adaptive routing (SSA) for ad hoc mobile networks," IEEE Personal Communication, Feb. 1997.

....of hops through other hosts in the network [4] Host mobility can cause frequent unpredictable topology changes. Therefore, the task of finding and maintaining routes in MANET is non trivial. Many protocols have been proposed for mobile ad hoc networks, with the goal of achieving efficient routing [3, 6, 8, 9, 11, 12, 13, 15, 18]. These algorithms differ in the approach used for searching a new route and or modifying a known route, when hosts move. In this report, we suggest an approach to decrease overhead of route discovery by utilizing location information for mobile hosts. Such location information may be obtained ....

....in part by Texas Advanced Technology Program grants 010115 248 and 009741 052 C. 1 We will use the terms host and node interchangeably. 2 Related Work Design of routing protocols is a crucial problem in mobile ad hoc networks [4, 16] and several routing algorithms have been developed (e.g. [3, 6, 8, 9, 11, 12, 13, 15, 18]) One desirable qualitative property of a routing protocol is that it should adapt to the traffic patterns [5] Johnson [11] points out that conventional routing protocols are insufficient for ad hoc networks, since the amount of routing related traffic may waste a large portion of the wireless ....

R. Dube, C. D. Rais, K. Wang, and S. K. Tripathi, "Signal stability based adaptive routing (SSA) for ad hoc mobile networks," IEEE Personal Communication, Feb. 1997.

....approaches that can improve the performance of the protocol. Research reported is supported in part by Texas Advanced Technology Program 009741 052 C. 1 Introduction Many protocols for routing have been proposed for mobile wireless networks (also known as ad hoc or mobile mesh networks) [5, 6, 8, 9, 11, 12, 14, 16, 18]. As the hosts in such a network are mobile, an inherent drawback of these protocols (more precisely, drawback of the network) is that routing related overhead tends to be high. Therefore, any techniques to reduce this overhead are worth investigating. In this brief note, we consider how to ....

R. Dube, C. D. Rais, K. Wang, and S. K. Tripathi, "Signal stability based adaptive routing (SSA) for ad hoc mobile networks," IEEE Personal Communication, Feb. 1997.

....of hops through other hosts in the network [7] Host mobility can cause frequent unpredictable topology changes. Therefore, the task of finding and maintaining routes in MANET is nontrivial. Many protocols have been proposed for mobile ad hoc networks, with the goal of achieving efficient routing [6, 9, 11, 12, 14, 16, 17, 18, 21, 23, 24, 28]. These algorithms differ in the approach used for searching a new route and or modifying a known route, when hosts move. In this paper, we suggest an approach to decrease overhead of route discovery by utilizing location information for mobile hosts. Such location information may be obtained ....

....in part by Texas Advanced Technology Program grants 010115 248and 009741 052 C. 1 We will use the terms host and node interchangeably. 2 Related Work Design of routing protocols is a crucial problem in mobile ad hoc networks [7, 25] and several routing algorithms have been developed (e.g. [6, 9, 11, 12, 14, 16, 17, 18, 21, 23, 24, 28]) One desirable qualitative property of a routing protocol is that it should adapt to the traffic patterns [8] Johnson and Maltz [15, 16] point out that conventional routing protocols are insufficient for ad hoc networks, since the amount of routing related traffic may waste a large portion of ....

R. Dube, C. D. Rais, K. Wang, and S. K. Tripathi, "Signal stability based adaptive routing (SSA) for ad hoc mobile networks, " IEEE Personal Communication, Feb. 1997.

No context found.

R. Dube, C. Rais, K. Wang, and S. Tripathi, "Signal stability based adaptive routing (ssa) for ad hoc mobile networks," February 1997.

No context found.

R. Dube, C. Rais, K. Wang, and S. Tripathi, "Signal stability based adaptive routing (ssa) for ad hoc mobile networks," February 1997. 7

No context found.

R. Dube, C. Rais, K. Wang, and S. Tripathi, "Signal stability based adaptive routing (ssa) for ad hoc mobile networks," February 1997.

No context found.

R. Dube, C. D. Rais, K.-Y. Wang, and S. K. Tripathi, "Signal stability based adaptive routing (SSA) for ad-hoc mobile networks," IEEE Personal Communications, vol. 4, pp. 36--45, Feb. 1997.

No context found.

Rohit Dube, Cynthia D. Rais, Kuang-Yeh Wang, and Satish K. Tripathi, "Signal stability-based adaptive routing (SSA) for ad hoc mobile networks," IEEE Personal Communications Magazine, vol. 4, no. 1, pp. 36--45, Feb. 1997.

No context found.

R. Dube, C. D. Rais, K.-Y. Wang, and S. K. Tripathi, "Signal stability based adaptive routing (SSA) for ad-hoc mobile networks," in IEEE Personal Communications, 1997.

No context found.

R. Dube, C. Rais, K. Wang, and S. Tripathi, "Signal stability based adaptive routing (SSA) for ad hoc mobile networks," IEEE Personal Communications, vol. 4, no. 1, pp. 36--45, Feb. 1997.

No context found.

R. Dube, C. Rais, K. Wang, and S. Tripathi, "Signal stability based adaptive routing (ssa) for ad hoc mobile networks," February 1997.

No context found.

R. Dube, C. Rais, K. Wang, and S. Tripathi, "Signal stability based adaptive routing (ssa) for ad hoc mobile networks," February 1997. 7

No context found.

R. Dube et al., "Signal Stability-Based Adaptive Routing (SSA) for Ad-Hoc Mobile Networks," IEEE Pers. Commun. February 1997.

No context found.

R. Dube, C. Rais, K. Wang, and S. Tripathi, "Signal stability based adaptive routing (SSA)for ad hoc mobile networks", IEEE Pers. Comm., pages 36--45, 1997.

No context found.

R. Dube, C.D. Rais, K.-Y. Wang, and S.K. Tripathi, "Signal Stability based Adaptive Routing (SSA) for Ad Hoc Mobile Networks," IEEE Personal Communications, pp. 36-45, Feb. 1997.

No context found.

R. Dube, C. Rais, K. Wang, and S. Tripathi, "Signal stability based adaptive routing (SSA) for ad hoc mobile networks," IEEE Personal Communication, Feb. 1997.

No context found.

Dube, Rohit; Rais, Cynthia D.; Wang, Kuang-Yeh; Tripathi, Satish K., "Signal Stability Based Adaptive Routing (SSA) for Ad-Hoc Mobile Networks," IEEE Personal Communication, Feb. 1997, pp. 36-45.

No context found.

R. Dube, C.D. Rais, K.-Y. Wang, S.K. Tripathi, "Signal stability-based adaptive routing (SSA) for ad hoc mobile networks," IEEE Personal Communications, vol.4, no.1, pp.36-45, February 1997

No context found.

R. Dube, C.D. Rais, K. Wang, and S.K. Tripathi, "Signal stability based adaptive routing (SSA) for ad hoc mobile networks, " IEEE Personal Communication, Feb. 1997.

No context found.

R. Dube, C.D. Rais, K.-Y. Wang, S.K. Tripathi, "Signal stability-based adaptive routing (SSA) for ad hoc mobile networks," IEEE Personal Communications, vol.4, (no.1), Feb. 1997. p.36-45.

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