S. Datta, I. Stojmenovic, and J. Wu. Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks. In Cluster Computing 5, pages 169--178. Kluwer Academic Publishers, 2002.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....topologies from source s to destination t. We only consider the pairs when a path is found by the routing method. In our experiment, we found that the ratios #st# are small. We also conducted extensive simulations of the Face routing method [11] and the GreedyFace Greedy (GFG) routing method [37] on Gabriel graph and the local Delaunay triangulation 21 TABLE I The delivery rate of different localized routing methods on various network topologies. FN 97.5 49 81.7 92.1 97 97.6 Cmp 100 86.6 99.6 100 100 100 RndCmp 100 91.7 99.9 100 100 100 Grdy 100 87.5 99.6 100 100 100 TABLE II ....

S. Datta, I. Stojmenovic, and J. Wu, "Internal node and shortcut based routing with guaranteed delivery in wireless networks," IEEE Int. Conf. on Distributed Computing and Systems, pages 461-466, 2001. VII. APPENDIX We start this with the proof of Lemma 4, which we restate below:

....To overcome this problem, each locally northernmost node may switch to FACE mode [BMSU] until another node, more northern, is found on a face. Such nodes may return back to regular upward move. This switch can be repeated few times. The FACE algorithm can be improved by applying a short cut scheme [DSW]. The final result will be that all nodes at the outer face of the network will receive location update. This method guarantees that horizontal destination search and vertical location update will intersect at one of nodes on the outer face. The drawback is that these nodes will have more ....

S. Datta, I. Stojmenovic, J. Wu, Internal nodes and shortcut based routing with guaranteed delivery in wireless networks, Cluster Computing, to appear.

....active next hop AN p to accomodate this. The active next hop is the average number of active links per node (when an active link breaks, a topology broadcast has to be carried out) Proactive protocols can benefit from their knowledge of the topology in order to to optimize broadcasting [14] [8], 2] Ideally, N= emissions are sufficient to broadcast an information to every node, compared to N emissions for a complete flooding. The parameter B p is the average number of emissions to achieve a topology broadcast, and we denote by o p the broadcast optimization factor, i.e. o p = B p =N ....

S. Datta, I. Stojmenovic, and J. Wu. Internal node and shortcut based routing with guaranteed deliv ery in wireless networks. In Proc. IEEE Int. Conf. on Distributed Computing and Systems, April 16-19 2001. Phoenix, AR.

....is unsatisfactory, since also a simple flooding algorithm will reach the destination with O(n) messages. Additionally it would be desirable to see the algorithm cost depend on the distance between the source and the destination. Other geometric routing algorithms guarantee to find the destination [4, 6], partly on special graphs, such as triangulations or convex subdivisions [3] have been suggested. However none of these algorithms could show significant improvement over original Face Routing. As an exception, it was shown that on Delaunay triangulations there is an algorithm which is ....

....was even shown to be asymptotically optimal. We will describe AFR more precisely later in the paper. Despite its asymptotic optimality AFR is not practicable due to its pure face routing concept. For practical purposes there have been earlier attempts to combine greedy approaches and face routing [4, 6, 14]. None of them is however worst case competitive with the shortest path; performance assessments were carried out by means of simulation. 3. MODEL AND PRELIMINARIES The networks considered in this paper both in the theoretical and the simulations part are modeled as Unit Disk Graphs. The nodes of ....

S. Datta, I. Stojmenovic, and J. Wu. Internal node and shortcut based routing with guaranteed delivery in wireless networks. In Proc. IEEE Int. Conf. on Distributed Computing and Systems Workshops, pages 461--466, Phoenix, AR, USA, April 2001.

.... area (also called geocasting [16, 22] Since none of the intermediate nodes is required to maintain routing lists, geometric routing can be considered a lean version of source routing [14] Our geometric routing algorithm GOAFR as gopher plus ) combines similarly to earlier proposals [4, 6, 15, 20] two concepts called greedy routing and face routing. In greedy routing mode the algorithm forwards the routed message at each network node to the neighbor closest to the destination. Already in simple configurations, the message can however reach a dead end , a node without any better ....

....routing algorithm that does guarantee delivery was Face Routing introduced in [17] called Compass Routing II there) Face Routing reaches the destination after O(n) steps, n being the number of network nodes. There have been later suggestions for algorithms with guaranteed message delivery [4, 6]; at least in the worst case, however, none of them outperforms original Face Routing. Yet other geometric routing algorithms have been shown to reach the destination on special planar graphs without any runtime guarantees [2] 3] proposed an algorithm competitive with the shortest path between ....

[Article contains additional citation context not shown here]

S. Datta, I. Stojmenovic, and J. Wu. Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks. In Cluster Computing 5, pages 169--178. Kluwer Academic Publishers, 2002.

....are close, we would like to have an algorithm that terminates earlier. In particular, we are interested in the competitive ratio of the route found by the algorithm over the best possible route. There have been other suggestions for geometric rout ing algorithms with guaranteed delivery [3, 5], but in the worst case (to the best of our knowledge) none of them is better than the original Face Routing algorithm. Other (partly non deterministic) greedy routing algorithms have been shown to find the destination on special planar graphs, such as triangulations or convex subdivisions [2] ....

S. Datta, I. Stojmenovic, and J. Wu. Internal node and shortcut based routing with guaranteed delivery in wireless networks. In Proc. IEEE Int. Conf. on Distributed Computing and Systems Workshops; Cluster Computing, to appear, pages 461 466, 2001.

No context found.

S. Datta, I. Stojmenovic, J. Wu, Internal node and shortcut based routing with guaranteed delivery in wireless networks, 2000.

....with Guaranteed Delivery Nearly Stateless Routing with Guaranteed Delivery are schemes where nodes maintain only some local information to perform routing. The Face Routing and GFG (Greedy Face Greedy) schemes were described by Bose, Morin, Stojmenovic and Urrutia [BMSU] subsequently improved in [DSW] by applying dominating set concept and adding a shortcut 2 hop procedure. 12 Recently, Barriere, Fraigniaud, Narayanan and Opatrny [BFNO] made them robust against intereferences. Karp and Kung [KK] transformed GFG algorithm into GPSR (Greedy Perimeter Stateless Routing) protocol by including ....

....main strategies used to combine nodes location and hierarchical network structures are the Zone Based Routing and the Dominating Set Routing. The Peer To Peer Zone Based Two Level Link State Routing [JL] and the Online Power Aware Routing [LAR] schemes are example of the Zone Based Routing. In [DSW] and [SRV] as well as in GRID algorithm [LTS] the Dominating Set concept is introduced in routing schemes. Joa Ng and Lu [JL] apply the shortest path algorithm on the hierarchical graph, where a network is divided into zones. Nodes within a zone update their location between themselves regularly ....

[Article contains additional citation context not shown here]

S. Datta, I. Stojmenovic, J. Wu, Internal nodes and shortcut based routing with guaranteed delivery in wireless networks, Cluster Computing, to appear.

No context found.

S. Datta, I. Stojmenovic, and J. Wu, "Internal Nodes and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks," Cluster Computing, to appear.

No context found.

S. Datta, I. Stojmenovic, and J. Wu. Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks. In Cluster Computing 5, pages 169--178. Kluwer Academic Publishers, 2002.

No context found.

S. Datta, I. Stojmenovic, and J. Wu. Internal node and shortcut based routing with guaranteed delivery in wireless networks. In Proc. IEEE Int. Conf. on Distributed Computing and Systems Workshops; Cluster Computing, to appear, pages 461--466, 2001.

No context found.

S. Datta, I. Stojmenovic, and J. Wu. Internal node and shortcut based routing with guaranteed delivery in wireless networks. In Proceedings of the IEEE International Conference on Distributed Computing Systems Workshop, pages 461--466, 2001.

No context found.

S. Datta, I. Stojmenovic, and J. Wu, \Internal node and shortcut based routing with guaranteed delivery in wireless networks," Cluster Computing, vol. 5, no. 2, pp. 169-178, 2002.

No context found.

Datta, S., Stojmenovic, I., and Wu, J. Internal node and shortcut based routing with guaranteed delivery in wireless networks. In Proc. IEEE Int. Conf. on Distributed Computing and Systems Workshops, Phoenix, AR (2001), pp. 461-466.

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