Anonymous and authenticated routing in multi-hop cellular networks

Authors:
Mohamed Elsalih Mahmoud;Xuemin Shen
Affiliations:
Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario, Canada;Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario, Canada
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 8
Cited 1

Handbook of Applied Cryptography

Handbook of Applied Cryptography
Location Privacy in Pervasive Computing

IEEE Pervasive Computing
The Sybil Attack

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
SDAR: A Secure Distributed Anonymous Routing Protocol for Wireless and Mobile Ad Hoc Networks

LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
ARM: Anonymous Routing Protocol for Mobile Ad hoc Networks

AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 02
Multihop cellular networks: Technology and economics

Computer Networks: The International Journal of Computer and Telecommunications Networking
Impact of Mobile Relays on Throughput and Delays in Multihop Cellular Network

ICWMC '08 Proceedings of the 2008 The Fourth International Conference on Wireless and Mobile Communications

Stimulating cooperation in multi-hop wireless networks using cheating detection system

INFOCOM'10 Proceedings of the 29th conference on Information communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multi-hop cellular network is a promising architecture aiming to improve the performance of current cellular network. However, there are many security challenges due to the participation of the mobile nodes in the routing process. In this paper, we address two challenges: route anonymity, aiming to prevent attackers from tracking a packet flow to its source or destination; and location privacy, aiming to prevent attackers from detecting the nodes' locations. Most of the existing solutions require much computational power and energy. We propose a routing protocol that provides anonymous communication by protecting the user's anonymity and location privacy. The user's anonymity is preserved for a large number of compromised nodes. Simulations results show that the proposed protocol is efficient and can be implemented with an acceptable overhead.