Title :
Performance comparison of two location based routing protocols for ad hoc networks
Author :
Camp, Tracy ; Boleng, Jeff ; Williams, Brad ; Wilcox, Lucas ; Navidi, William
Author_Institution :
Dept. of Math. & Comput. Sci., Colorado Sch. of Mines, Golden, CO, USA
Abstract :
Many location based routing protocols have been developed for ad hoc networks. This paper presents the results of a detailed performance evaluation on two of these protocols: location-aided routing (LAR) and distance routing effect algorithm for mobility (DREAM). We compare the performance of these two protocols with the dynamic source routing (DSR) protocol and a minimum standard (i.e., a protocol that floods all data packets). We used NS-2 to simulate 50 nodes moving according to the random waypoint model. Our main goal for the performance investigation was to stress the evaluated protocols with high data loads during both low and high speeds. Our performance investigation produced the following conclusions. First, the added protocol complexity of DREAM does not appear to provide benefits over a flooding protocol. Second, promiscuous mode operation improves the performance of DSR significantly. Third, adding location information to DSR (i.e., similar to LAR) increases both the network load and the data packet delivery ratio; our results conclude that the increase in performance is worth the increase in cost. Lastly, our implementation of DREAM provides a simple location service that could be used with other ad hoc network routing protocols.
Keywords :
ad hoc networks; computational complexity; mobile radio; routing protocols; ad hoc networks; data packet delivery ratio; distance routing effect algorithm for mobility; dynamic source routing protocols; flooding protocol; location-aided routing; network load; promiscuous mode operation; random waypoint model; Ad hoc networks; Computer networks; Costs; Floods; Performance evaluation; Routing protocols; Stress; Unicast;
Conference_Titel :
INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE
Print_ISBN :
0-7803-7476-2
DOI :
10.1109/INFCOM.2002.1019421