S. Giordano and I. Stojmenovic. Position based routing algorithms for ad hoc networks: A taxonomy. In X. Cheng, X. Huang, and D. Du, editors, Ad Hoc Wireless Networking, pages 103--136. Kluwer, 2004.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....maintaining full networks information, including position of all nodes and activity status of all nodes, including static ones. More detailed discussion is given in two survey papers, one on location updates for efficient routing [S2] and one on position based routing schemes in ad hoc networks [GSB]. This paper deals solely with localized location based routing algorithms. Location information is available to nodes either through low power low cost GPS receivers or by measuring signal strengths and calculating relative coordinates [CHH] The main goal of this paper is to describe a scalable ....

....generalized in 3 [BFNO] for wider ranges of graphs. Power aware routing is discussed in [SL2] The concept of internal nodes is introduced in [WL] and it significantly improves delivery rates and hop counts in routing algorithms [SSW] Detailed survey on position based routing schemes in given in [GSB]. A detailed literature review on location update schemes for efficient routing in ad hoc networks is given in recent survey [S2] The survey includes the DREAM algorithm [BCSW] LAR schemes [KV] ant based location updates [CL] Voronoi diagram and convex hull based approaches [S1] and doubling ....

S. Giordano, I. Stojmenovic, Lj. Blazevic, Position based routing algorithms for ad hoc networks: A taxonomy, July 2001, http://uxdea4.iimas.unam.mx/~ivan.

....Copyright 200X ACM X XXXXX XX X XX XX . 5.00. through a series of intermediate nodes a process known as multi hop routing. Routing is the foremost problem for mobile ad hoc networks, thus it is not surprising that the research community has produced dozens of algorithmic proposals for routing [5, 11, 19, 21]. Why did researchers propose algorithms in such abundance One possible answer to this question is that mobile ad hoc networks have many parameters, such as transmission power, signal attenuation, interference, physical obstacles, type and extent of mobility, just to mention a few. Indeed with ....

S. Giordano, I. Stojmenovic, and L. Blazevic. Position based routing algorithms for ad hoc networks: a taxonomy, July 2001.

.... use an overlay peer to peer net work to maintain the position of all destinations [16] Last but not least one could imagine that we want to send a message to any node in a given area, a routing concept that is known as geocasting [13, 19] Overviews of geometric routing algorithms are given in [9, 18, 20]. Figure 1: Greedy routing fails with nodes dis tributed on the letter C . The first geometric routing algorithms were purely greedy: The message is always forwarded to the neighboring node that is closest to the destination [7, 11, 23] It was shown that even simple location configurations do ....

S. Giordano, I. Stojmenovic, and L. Blazevie. Position based routing algorithms for ad hoc networks: a taxonomy, July 2001. http: / /www.site.uottawa.ca/-ivan/routing-survey. pdf.

....based on the convex hull on neighboring nodes, while the analogous R DIR is modified from [BCSW, KV] The methods proposed here are originally described in [S5, S2] The next section presents the survey of relevant routing algorithms and location update schemes. More detailed surveys are given in [GS, S2, S4]. 2. Position based routing Several GPS based methods were proposed in 1984 86 by using the notion of progress. Define progress as the distance between the transmitting node and receiving node projected onto a line drawn from transmitter toward the final destination. Takagi and Kleinrock [TK] ....

S. Giordano, I. Stojmenovic, Position based routing algorithms for ad hoc networks: A taxonomy, in: Ad Hoc Wireless Networking, X. Cheng, X. Huang and D.Z. Du (eds.), Kluwer, 2003, to appear, www.site.uottawa.ca/~ivan .

No context found.

S. Giordano and I. Stojmenovic. Position based routing algorithms for ad hoc networks: A taxonomy. In X. Cheng, X. Huang, and D. Du, editors, Ad Hoc Wireless Networking, pages 103--136. Kluwer, 2004.

No context found.

S. Giordano, I. Stojmenovic, and L. Blazevic. Position based routing algorithms for ad hoc networks: a taxonomy, July 2001. http://www.site.uottawa.ca/ivan/routing-survey.pdf.

No context found.

S. Giordano, I. Stojmenovic, L. Blazevic, "Position Based Routing Algorithms for Ad Hoc Networks: A Taxonomy," Ad Hoc Wireless Networking, Kluwer, 2003

No context found.

S. Giordano, I. Stojmenovic, and L. Blazevic, "Position based routing algorithms for ad hoc networks: A taxonomy," in Ad Hoc Wireless Networking. Kluwer, 2003, to appear.

No context found.

S. Giordano, I. Stojmenovic, and L. Blazevic, "Position-Based Routing Algorithms for AdHoc Networks: A Taxonomy," in Ad Hoc Wireless Networking, D.-Z. Du, Ed. Boston: Kluwer Academic Publishers, November 2003.

No context found.

S. Giordano, I. Stojmenovic, and L. Blazevic, "Position based routing algorithms for ad hoc networks: A taxonomy," in Ad Hoc Wireless Networking. Kluwer, 2003, to appear.

No context found.

S. Giordano, I. Stojmenovic, and L. Bl azevi c. Position based routing algorithms for ad hoc networks: A taxonomy. In X. Cheng, X. Huang, and D.Z. Du, editors, Ad Hoc Wireless Networking. Kluwer Academic Publishers, 2003.

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