I. Stojmenovic and B. Vukojevic, "A routing strategy and quorum based location update scheme for ad hoc wireless networks," SITE, University of Ottawa, Ottawa, Canada, Tech. Rep. TR-99-09, Sept. 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....throughout the network. Queries and registrations are sent to these servers using geographic forwarding. Care is taken such that location queries are sent to servers closer to the querier. Other forms of similar location database services are Quorum Based Service [15] and Homezone [13] and [27]. In Quorum services, location updates are sent to a subset (quorum) of available nodes, and location requests are referred to a potentially different subset. When these subsets are designed in such a way that their intersection is nonempty, it is ensured that an up to date version can always be ....

I. Stojmenovic. A routing strategy and quorum based location update scheme for ad hoc wireless networks. Technical Report TR-99-09, University of Ottawa, 1999.

....is supported by the backbone s ad hoc routing protocol. 10 56 18 34 48 14 31 25 80 29 73 64 57 15 36 43 78 Location Updates Query Fig. 4. GLS subset of all available nodes and a quorum being a small subset of the backbone nodes. Other work based on quorums is presented in [Sto99b] Here, position information for the nodes is propagated in north south direction. Whenever a node whose position is unknown has to be contacted, position information is searched in east west direction until the information is found. While the algorithm described is still at an early stage, it is ....

I. Stojmenovic. A routing strategy and quorum based location update scheme for ad hoc wireless networks. Technical Report TR-99-09, Computer science, SITE, University of Ottawa, 1999.

No context found.

I. Stojmenovic, A routing strategy and quorum based location update scheme for ad hoc wireless networks, Computer science, SITE, University of Ottawa, TR-99-09, September 1999.

....applied outside the region. We extend our unified framework toward unified definition of forwarding region and derive routing and geocasting algorithms for each of three basic methods reviewed in the next section. Versions that require and do not require to memorize past traffic are discussed. In [S1, S2, S3, SRV], it is suggested to solve the mobility problem by separating location update and destination search steps from the actual routing. Based on their mobility, nodes periodically update their location to their smaller or larger neighborhood. When a source wishes to send a message ( long message) to ....

I. Stojmenovic, A routing strategy and quorum based location update scheme for ad hoc wireless networks, SITE, University of Ottawa, TR-99-09, Sept. 1999.

....Location updates schemes used in [APL] is based on doubling size of circles of location updates. This idea has been rediscovered one year later in [LJCKM] GEDIR is often used as basic ingredient in other routines. For instance, it is used in several location update schemes, such as quorum based [S1] and home agent based schemes [BBCGHL, MJKLD, S3, WS] note that the later scheme was independently proposed in four papers) In 2 hop greedy method [SL2] node A selects the best candidate node C among its 1 hop and 2 hop neighbors according to the corresponding criterion. Then A forwards m to ....

I. Stojmenovic, A routing strategy and quorum based location update scheme for ad hoc wireless networks, Computer Science, SITE, University of Ottawa, TR-99-09, September 1999.

....begin by sending message to the latest known location of destination, and modify the information by intermediate nodes as the message approaches destination. Since this approach may not guarantee delivery and may increase hop count significantly, we believe that a better approach (as suggested in [S]) will apply a destination search method using short probe messages (containing search information but not actual message) then routing from destination to sender with short message, and finally routing full (actual) message from source to destination whose location is detected. The destination ....

....and finally routing full (actual) message from source to destination whose location is detected. The destination search step may apply a flooding with reduced number of retransmissions (such as one based on internal nodes [SSZ] or another method that is linked to location update scheme (e.g. [S]) In this scenario, delivery is guaranteed unless node movement is significant with respect to message speed (in which case flooding may be the only feasible solution [HOTV] Moreover, in this application, the network can be considered static in the analysis of algorithm performance, without ....

I. Stojmenovic, A routing strategy and quorum based location update scheme for ad hoc wireless networks, SITE, University of Ottawa, TR-99-09, September 1999.

....and possibly creating a route for the source. The source node then sends full data message ( long message) toward exact location of destination. The efficiency of destination search depends on the corresponding location update scheme. A quorum based location update scheme is being developed in [S2]. Other schemes may be used, with various trade offs between the success and flooding rates (including an occasional flooding) If the routing problem is divided as described, the mobility issue is algorithmically separated from the routing issue, which allows us to consider (in this paper) only ....

....the choice. In case of ties (that is, more than one neighbor connected to the closest 2 hop neighbor) choose the one that is closest to destination. This review did not include various flooding based or multiple paths routing algorithms or methods for sending control messages to update positions [BCSW, KV, S2]. Our primary interest in this paper is to examine power consumption under assumption that nodes have accurate information about the location of their neighbors and destination node (e.g. static networks, sourceinitiated on demand routing, or networks with superb location update scheme) 12 4. ....

I. Stojmenovic, A routing strategy and quorum based location update scheme for ad hoc wireless networks, Computer Science, SITE, University of Ottawa, TR-99-09, September 1999.

.... Ottawa, Ontario K1N 6N5, Canada Ivan site.uottawa.ca Abstract All previously proposed position based routing algorithms for wireless ad hoc networks were based on forwarding the actual message along multiple paths toward an area where destination is hopefully located (except our previous report [SV]) In [SV] we proposed to reduce significantly the communication overhead by changing the routing strategy. The source node issues several search tickets (each ticket is a short message containing sender s id and location, destination s best known location and time that location is reported, ....

.... K1N 6N5, Canada Ivan site.uottawa.ca Abstract All previously proposed position based routing algorithms for wireless ad hoc networks were based on forwarding the actual message along multiple paths toward an area where destination is hopefully located (except our previous report [SV] In [SV], we proposed to reduce significantly the communication overhead by changing the routing strategy. The source node issues several search tickets (each ticket is a short message containing sender s id and location, destination s best known location and time that location is reported, and ....

[Article contains additional citation context not shown here]

Ivan Stojmenovic and Bosko Vukojevic, A routing strategy and quorum based location update scheme for ad hoc wireless networks, Computer science, SITE, University of Ottawa, TR-99-09, September 1999.

....outside the region. We extend our unified framework toward unified definition of forwarding region and derive routing and geocasting algorithms for each of three basic methods (DIR, MFR, GEDIR) discussed in [SL] Versions that require and do not require to memorize past traffic are discussed. In [SV], it is suggested to solve the mobility problem by separating location update and destination search steps from the actual routing. Based on their mobility, nodes periodically update their location to their smaller or larger neighborhood. When a source wishes to send a message ( long message) to ....

Ivan Stojmenovic and Bosko Vukojevic, A routing strategy and quorum based location update scheme for ad hoc wireless networks, Computer science, SITE, University of Ottawa, TR-99-09, September 1999.

....rate is the ratio of numbers of messages received by destination and sent by senders. For a shortest path algorithm, and for algorithms that guarantee delivery in a connected graph, this ratio is 1. Some of existing algorithms do not produce a unique path between a source and a destination (e.g. [BCSW, KV, SV]) Flooding rate is more appropriate measure for such algorithms. It is defined as the ratio of number of transmissions required by a method (in case of algorithms that produce a path, e.g. SL, BMSU] and this paper, it is equivalent to the hop count) and hop count of a shortest path algorithm. ....

....on mobility patterns. If an accurate location of destination is needed, destination search message is initiated from the source. In this scheme, the actual (long) message is sent after the destination reports back to the sender. Location updates and destination search problems are discussed in [BCSW, KV, SV, S1]. The proposed DFS algorithm guarantees delivery even if position of destination is not known accurately, and not consistent at various nodes. Several localized routing algorithms are proposed recently in literature. One such method, GEDIR (geographic distance routing) based on the location ....

I. Stojmenovic and B. Vukojevic, A routing strategy and quorum based location update scheme for ad hoc wireless networks, Computer Science, SITE, University of Ottawa, TR99 -09, September 1999.

....routing algorithms (e.g. BCSW, KV] for wireless ad hoc networks were based on forwarding the actual message along multiple paths toward an area where destination is hopefully located. The significant 2 communication overhead can be avoided if the routing strategy is changed, as suggested in [SV]. In the strategy [SV] the source node issues several search tickets (each ticket is a short message containing sender s id and location, destination s best known location and time when that location was reported, and constant amount of additional information) that will look for the exact ....

....(e.g. BCSW, KV] for wireless ad hoc networks were based on forwarding the actual message along multiple paths toward an area where destination is hopefully located. The significant 2 communication overhead can be avoided if the routing strategy is changed, as suggested in [SV] In the strategy [SV], the source node issues several search tickets (each ticket is a short message containing sender s id and location, destination s best known location and time when that location was reported, and constant amount of additional information) that will look for the exact position of destination ....

[Article contains additional citation context not shown here]

I. Stojmenovic and B. Vukojevic, A routing strategy and quorum based location update scheme for ad hoc wireless networks, Computer Science, SITE, University of Ottawa, TR99 -09, September 1999.

No context found.

I. Stojmenovic and B. Vukojevic, "A routing strategy and quorum based location update scheme for ad hoc wireless networks," SITE, University of Ottawa, Ottawa, Canada, Tech. Rep. TR-99-09, Sept. 1999.

No context found.

I. Stojmenovic, "A routing strategy and quorum based location update scheme for ad hoc wireless networks," Tech. Rep. TR-99-09, Computer Science, SITE, University of Ottawa, 1999.

No context found.

I. Stojmenovic and B. Vukojevic, "A routing strategy and quorum based location update scheme for ad hoc wireless networks," SITE, University of Ottawa, Ottawa, Canada, Tech. Rep. TR-99-09, Sept. 1999.

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