Routing is a must for networks that do not have a fixed point-to-point infrastructure, such as in an ad hoc wireless network that offers unrestricted mobility. A source node in such a network can communicate with a distant destination node after finding a route, relying on the intermediate nodes to transfer the packets. However, some intermediate nodes might act selfishly and drop packets for other nodes in order to save their own battery power.
In this paper, we propose an algorithm to find selfish nodes and deal with them, using a modified Dynamic Source Routing (DSR) protocol, that we call Efficient Secure Dynamic Source Routing (ESDSR). Our results show an increase in the packet delivery ratio in a network containing selfish/unreliable nodes when we compare DSR with our protocol.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. B. Johnson, D. A. Maltz, and J. Broch, DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks in Ad Hoc Networking, edited by Charles E. Perkins, Addison-Wesley, 2001, pp. 139–172.
C. E. Perkins and P. Bhagwat, “Higly dynamic destination-sequenced distance vector (DTDV) for mobile computers,” Proc. of the SIGCOMM 1994 Conference on Communications Architectures, Protocols and Applications, August 1994 pp. 234–244.
C.-C. Chiang, “Routing in clustered multihop, mobile wireless networks with fading channel,” Proc. IEEE SICON’97, April 1997 pp. 197–211.
C. E. Perkins and E. M. Royer, Ad hoc On-Demand Distance Vector Routing Ad hoc Networking, Addison-Wesley Publishers, Ed. Charles Perkins, 2000.
B. Awerbuch, D. Holmer, C. Nita-Rotaru, and H. Rubens, “An on demand secure routing protocol resilient to byzantine failures,” In ACM Workshop on Wireless Security (WiSe), Atlanta, Georgia, USA, September 28, 2002, pp. 21–30.
C. Karlof and D. Wagner, “Secure routing in sensor networks: Attacks and countermeasures,” Elsevier's Ad Hoc Networks Journal, Special Issue on Sensor Network Applications and Protocols, Vol. 1, Iss. 2–3, pp. 293–315, September 2003.
L. Zhou and Z. J. Haas, “Securing ad hoc networks,” IEEE Network Magazine, November/December 1999 pp. 24–30.
B. Dahill, B. N. Levine, E. Royer, and Shields, “A secure routing protocol for ad hoc networks,” 10th International Conference on Networks Protocols (ICND’02), 2002.
Y.-C. Hu, A. Perrig, and D. B. Johnson, “Ariadne: A secure on-demand routing protocol for ad hoc networks,” Proceedings of the eighth annual international conference on Mobile computing and networking (MobiCom 2002), Atlanta, Georgia, USA, September 23–28, 2002, pp. 12–23.
A. Perrig, R. Canetti, J. D. Tygar, and D. Song, “The TESLA broadcast authentication protocol,” RSA CryptoBytes, Volume 5, Summer 2002.
Y.-C. Hu, A. Perrig, and D. B. Johnson, “SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks,” Ad Hoc Networks, Elsevier, July 2003 pp. 175–192.
F. Stajano and R. Anderson, “The resurrecting duckling: Security issues for ad hoc wireless networks,” The 7th International Workshop on Security Protocols, LNCS 1796, Springer, 1999.
P. Papadimitratos and Z. J. Haas, “Secure routing for mobile ad hoc networks,” SCS Communication Networks and Distributed Systems (CNDS 2002), January 27–31, 2002.
S. Buchegger and J.-Y. Le Boudec, “Cooperative routing in mobile ad-hoc networks,” Mobile Internet Workshop at Informatik, October 2002.
S. Buchegger and J.-Y. Le Boudec, “Performance analysis of the CONFIDANT protocol (cooperation of nodes: Fairness in dynamic ad-hoc networks),” Proceedings of The Third ACM International Symposium on Mobile Ad Hoc Networking and Computing, June 2002 pp. 226–236.
S. Marti, T. J. Giuli, K. Lai, and M. Baker, “Mitigating routing misbehavior in mobile ad hoc networks,” in Proceedings of the Sixth annual ACM/IEEE International Conference on Mobile Computing and Networking, 2000, pp. 255–265.
S. Zhong, J. Chen, and Y. R. Yang, “Sprite: A simple, cheat-proof, credit-based system for mobile ad-hoc networks,” INFOCOM, 2003.
W. Diffie and M. Hellman, “New directions in cryptography,” IEEE Trans. Inform. Theory IT-22, November 1976, pp. 644–654.
ns-2 Network Simulator, http://www.isi.edu/nsnam/ns/, University of Southern California, Information Sciences Institute, accessed October 2004.
G. Altun, Security in Wireless Ad Hoc Network Routing Protocols, Georgia State University Master's Thesis, November 7, 2003.
V. Miller, “Uses of elliptic curves in cryptography,” Advances in Cryptology -- CRYPTO ‘85, Lecture Notes in Computer Science, Vol. 218, Springer-Verlag, 1986, pp. 417–426.
This research was supported by the State of Georgia's Yamacraw project, and the Turkpetrol Foundation.
Author information
Authors and Affiliations
Corresponding author
Additional information
Michael Weeks graduated from the University of Louisville in 1993 (B.E.S.) and 1994 (M.Eng.), then the University of Louisiana at Lafayette (formerly the University of Southwestern Louisiana), in 1996 (M.S.) and 1998 (Ph.D.). He is currently an Associate Professor in the Computer Science Department at Georgia State University.
Gulsah Altun graduated from Georgia State University with an M.S. in 2003. She is currently still at Georgia State University, pursuing a Ph.D. in Computer Science.
Rights and permissions
About this article
Cite this article
Weeks, M., Altun, G. Efficient, Secure, Dynamic Source Routing for Ad-hoc Networks. J Netw Syst Manage 14, 559–581 (2006). https://doi.org/10.1007/s10922-006-9043-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10922-006-9043-8