Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
The quest for security in mobile ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Ariadne: a secure on-demand routing protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A Survey of Secure Wireless Ad Hoc Routing
IEEE Security and Privacy
TrueLink: A Practical Countermeasure to the Wormhole Attack in Wireless Networks
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
A Ferry-based Intrusion Detection Scheme for Sparsely Connected Ad Hoc Networks
MOBIQUITOUS '07 Proceedings of the 2007 Fourth Annual International Conference on Mobile and Ubiquitous Systems: Networking&Services (MobiQuitous)
Authenticated routing for ad hoc networks
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
In this paper, we present an efficient, low-bandwidth cost and security-enhancing data encryption d-key protocol via dynamic re-keying during end-to-end communication. Unlike others, the secret d-key is generated using the previous data as the seed and as next packet encryption; therefore, only valid sender and receiver are able to decrypt the cipher text using the unique d-key in their possession, which prevents sensitive data from being access by unauthorized recipients. In addition, test results indicate d-key protocol can perform as efficiently as a non-security routing protocol while providing stronger data privacy with low computational overhead in data encryption and decryption.