Loading...

On the necessity of using delaunay triangulation substrate in greedy routing based networks

Ghaffari, M ; Sharif University of Technology | 2010

510 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/LCOMM.2010.03.092045
  3. Publisher: 2010
  4. Abstract:
  5. Large scale decentralized communication systems have motivated a new trend towards online routing where routing decisions are performed based on a limited and localized knowledge of the network. Geometrical greedy routing has been among the simplest and most common online routing schemes. While a geometrical online routing scheme is expected to deliver each packet to the point in the network that is closest to the destination, geometrical greedy routing, when applied over generalized substrate graphs, does not guarantee such delivery as its forwarding decision might deliver packets to a localized minimum instead. This letter investigates the necessary and sufficient conditions of greedy supporting graphs that would guarantee such delivery when used as a greedy routing substrate
  6. Keywords:
  7. Delaunay triangulation ; Geometric routing ; Greedy routing ; P2P network ; P2P networks ; Client server computer systems ; Communication systems ; Online systems ; Routing protocols ; Triangulation ; Wireless networks ; Peer to peer networks
  8. Source: IEEE Communications Letters ; Volume 14, Issue 3 , 2010 , Pages 266-268 ; 10897798 (ISSN)
  9. URL: http://ieeexplore.ieee.org/document/5426604/?reload=true