loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2003 International Conference on Parallel Processing Workshops (ICPPW'03)
Secure Dynamic Distributed Routing Algorithm for Ad Hoc Wireless Networks
Kaohsiung, Taiwan
October 06-October 09
ISBN: 0-7695-2018-9
Khalil El-Khatib, National Research Council of Canada
Larry Korba, National Research Council of Canada
Ronggong Song, National Research Council of Canada
George Yee, National Research Council of Canada
An 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.
Citation:
Khalil El-Khatib, Larry Korba, Ronggong Song, George Yee, "Secure Dynamic Distributed Routing Algorithm for Ad Hoc Wireless Networks," icppw, pp.359, 2003 International Conference on Parallel Processing Workshops (ICPPW'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.