A generalization of the face routing algorithm to some non-planar networks
Since ad hoc networks run on limited resources, traditional routing algorithms designed for wired networks are not suitable for them. Routing algorithms which use the geographical location information of nodes are called position-based routing algorithms. In such algorithms, the ad hoc network is mo...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
2005
|
| Online Access: | http://spectrum.library.concordia.ca/8252/1/MR04439.pdf Ansari, Sabeel <http://spectrum.library.concordia.ca/view/creators/Ansari=3ASabeel=3A=3A.html> (2005) A generalization of the face routing algorithm to some non-planar networks. Masters thesis, Concordia University. |
| Summary: | Since ad hoc networks run on limited resources, traditional routing algorithms designed for wired networks are not suitable for them. Routing algorithms which use the geographical location information of nodes are called position-based routing algorithms. In such algorithms, the ad hoc network is modeled as a geometric graph known as the unit disk graph. The FACE ROUTING algorithm is one such position-based routing algorithm which guarantees delivery without flooding control packets throughout the network. In this work, we propose an extension to the F ACE ROUTING algorithm for a particular set of non-planar graphs, called Face Routing On Networks with Crossings ( FRONC ). FRONC guarantees delivery on a network that can be obtained from a planar graph by the addition of disjoint crossing edges. |
|---|