Securing Weakly-Dominating Virtual Backbones in Mobile Ad Hoc Networks

Authors:
Giovanni Di Crescenzo;Mariusz Fecko;Renwei Ge;Gonzalo R. Arce
Affiliations:
-;Telcordia Technologies, USA;University of Delaware, USA;University of Delaware, USA
Venue:
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
Year:
2006

Citing 5
Cited 0

Fast distributed construction of k-dominating sets and applications

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Geometric Spanners for Wireless Ad Hoc Networks

IEEE Transactions on Parallel and Distributed Systems
Improved topology assumptions for threshold cryptography in mobile ad hoc networks

Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks
CEDAR: a core-extraction distributed ad hoc routing algorithm

IEEE Journal on Selected Areas in Communications
Securing reliable server pooling in MANET against byzantine adversaries

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Virtual backbone structures are of fundamental importance in mobile ad hoc networks (MANET) as they are essential to support various applications such as service discovery and provision, multicast, routing, etc. In this paper we consider a very natural approach for the creation of virtual backbones, based on weakly-dominating sets, and investigate its security properties against Byzantine adversaries that can corrupt up to a given threshold of nodes. We formalize the notion of secure protocols for the creation and management of virtual backbones, and design a distributed protocol generating weakly-dominating virtual backbones, that is both efficient, according to standard MANET metrics, and secure against Byzantine adversaries corrupting up to a given threshold of nodes.