Private logical neighborhoods for wireless ad hoc networks

Authors:
Kulasekaran Sivakumar;Mahalingam Ramkumar
Affiliations:
Mississippi State University, Mississippi State, MS, USA;Mississippi State University, Mississippi State, MS, USA
Venue:
Proceedings of the 5th ACM symposium on QoS and security for wireless and mobile networks
Year:
2009

Citing 11
Cited 0

An optimal class of symmetric key generation systems

Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Securing ad hoc routing protocols

WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
A Method for Security Enhancements in AODV Protocol

AINA '03 Proceedings of the 17th International Conference on Advanced Information Networking and Applications
SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks

WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing 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
Rushing attacks and defense in wireless ad hoc network routing protocols

WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
SRDP: Securing Route Discovery in DSR

MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
Ariadne: a secure on-demand routing protocol for ad hoc networks

Wireless Networks
Trustworthy Computing under Resource Constraints with the DOWN Policy

IEEE Transactions on Dependable and Secure Computing
On the scalability of an efficient "Nonscalable key distribution scheme

WOWMOM '08 Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks
The capacity of wireless networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In wired networks routers are aware of all other routers to which they are directly connected. In contrast, in mobile ad hoc networks (MANETs) a mobile router (node) will not be aware of all nodes within its transmission range. While many MANET routing protocols have been proposed in the literature, only few of them mandate proactive neighborhood discovery protocols like the Internet message encapsulation protocol (IMEP), for identifying all neighbors within a reliable delivery neighborhood (RDN). We argue why it is especially important for secure routing protocols, which have the additional constraint of the need to "live with" non cooperative nodes, to go beyond simply mandating an RDN, by mandating a private logical neighborhood (PLN).