Secure Dynamic Distributed Routing Algorithm for Ad Hoc Wireless Networks

Download
  1. (PDF, 275 KB)
AuthorSearch for: ; Search for: ; Search for: ; Search for:
TypeArticle
ConferenceFirst International Workshop on Wireless Security and Privacy (WiSPr 2003) Kaohsiung, October 6, 2003., Taiwan
AbstractAn ad hoc wireless network permits wireless mobile nodes to communicate without prior infrastructure. Due to the limited range of each wireless node, communication sessions between two nodes are usually established through a number of intermediate nodes. Unfortunately, some of these intermediate nodes might be malicious, forming a threat to the security or confidentiality of exchanged data. While data encryption can protect the content exchanged between nodes, analysis of communication patterns may reveal valuable information about end users and their relationships. Using anonymous paths for communication provides security and privacy against traffic analysis. To establish these anonymous paths, all nodes build a global view of the network by exchanging routing information. In dynamic ad hoc networks, building this global view is not an option. In this paper, we propose and analyze a distributed route construction algorithm for use in the establishment of anonymous routing paths in ad hoc wireless networks.
Publication date
LanguageEnglish
AffiliationNRC Institute for Information Technology; National Research Council Canada
Peer reviewedNo
NRC number46517
NPARC number5765633
Export citationExport as RIS
Report a correctionReport a correction
Record identifier10e33206-c092-463c-b7e1-e2e2419a4f20
Record created2009-03-29
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)