Information Technology Reference
In-Depth Information
In restricted directional flooding the packets are broadcasted in the general
direction of the destination. On their way, the position information in the packets
may be updated if a node has more current information about the destination's posi-
tion. Restricted directional flooding has higher packet overhead and less scalability.
However, its opportunity to find the shortest path is higher. Using restricted direc-
tional flooding to set up a route in an efficient manner (such as in LAR) increases
the probability of finding the optimal path and is suitable for the cases that require
high volume of data transmissions. However, when it is used to forward the data
packets themselves (such as in DREAM) it will be more suitable for situations
where a small number of packets needs to be transmitted very reliably.
Using hierarchical approaches increases the approach scalability. This may be done
through the usage of zone-based routing, dominating sets, or by means of a posi-
tion-independent protocol at the local level and a greedy variant at the long-distance
level.
Security has recently gained a lot of attention in topology-based routing proto-
cols and many attempts in proposing end-to-end security schemes have been done.
However, it is obvious from the analysis that few research efforts have addressed
position-based security issues. Moreover, using multiple paths between source and
destination helps in increasing the robustness of transmitted data confidentiality.
However, multipath routing may cause more collision among different routes
which in turn degrades network performance such as packet delivery ratio. Finally,
a few researchers have considered the power efficiency metric while developing
their protocols.
The main prerequisite for position-based routing is that a sender can obtain the
current position of the destination. Therefore, our next step is making a survey
about existing location services.
References
1. Giruka V, Singhal M (2005) Angular routing protocol for mobile ad-hoc networks. In: Procee
dings of the 25th IEEE international conference on distributed computing systems workshops
(ICDCSW'05). Kentucky University, Lexington, KY, pp 551-557
2. Perkins C, Royer E (1999) Ad hoc on-demand distance vector routing. IEEE proceedings of
the 2nd IEEE workshop on mobile computing systems and applications, New Orleans, LA,
pp 90-100
3. Abolhasan M, Wysocki T, Dutkiewicz E (2004) A review of routing protocols for mobile ad
hoc networks. Ad hoc Netw 2(1):1-22, Elsevier
4. Cao Y, Xie S (2005) A position based beaconless routing algorithm for mobile ad hoc
networks. Proc Int Conf Commun Circuits Syst 1(1):303-307, IEEE
5. Carter S, Yasinsac A (2002) Secure position aided ad hoc routing. Proceedings of the IASTED
international conference on communications and computer networks (CCN02), Cambridge,
pp 329-334
6. Mauve M, Widmer J, Hartenstein H (2001) A survey on position-based routing in mobile ad-hoc
networks. IEEE Netw 15(6):30-39
7. Qabajeh LK, Kiah M, Qabajeh M (2009) A qualitative comparison of position-based routing
protocols for ad-hoc networks. IJCSNS 9(2):131-140
Search WWH ::




Custom Search