Securing wireless mesh networks

IEEE Wireless CommunicationsPublished 1 April 2006Open access

Naouel Ben Salem, Jean‐Pierre Hubaux

DOI10.1109/mwc.2006.1632480

Citations183

TL;DR

The specifics of WMNs are described and three fundamental network operations that need to be secured are identified, which allow fast, easy, and inexpensive network deployment.

Abstract

Using wireless mesh networks to offer Internet connectivity is becoming a popular choice for wireless Internet service providers as it allows fast, easy, and inexpensive network deployment. However, security in WMNs is still in its infancy as very little attention has been devoted thus far to this topic by the research community. In this article we describe the specifics of WMNs and identify three fundamental network operations that need to be secured

Keywords

Computer ScienceEngineering

The feasibility of launching and detecting jamming attacks in wireless networks

1,312 Citations2005Wenyuan Xu, Wade Trappe +2 more

This paper proposes four different jamming attack models that can be used by an adversary to disable the operation of a wireless network, and evaluates their effectiveness in terms of how each method affects the ability of a Wireless node to send and receive packets.

The security of vehicular ad hoc networks

970 Citations2005Maxim Raya, Jean‐Pierre Hubaux

A set of security protocols are provided, it is shown that they protect privacy and the robustness of these protocols are analyzed, and a quantitative assessment of the proposed solution is carried out.

View PDF

Tamper resistance: a cautionary note

909 Citations1996Ross Anderson, Markus Kühn

Characterizing the capacity region in multi-radio multi-channel wireless mesh networks

758 Citations2005Murali Kodialam, Thyaga Nandagopal

This paper provides necessary conditions to verify the feasibility of rate vectors in next generation fixed wireless broadband networks, and uses them to derive upper bounds on the capacity in terms of achievable throughput, using a fast primal-dual algorithm.

Architecture and evaluation of an unplanned 802.11b mesh network

753 Citations2005John Bicket, Daniel Aguayo +2 more

This paper evaluates the ability of a wireless mesh architecture to provide high performance Internet access while demanding little deployment planning or operational management, and the usefulness of the highly connected mesh afforded by omni-directional antennas for robustness and throughput.

SWATT: software-based attestation for embedded devices

688 Citations2004Abhijith Seshadri, Adrian Perrig +2 more

This paper presents an implementation of SWATT in off-the-shelf sensor network devices, which enables us to verify the contents of the program memory even while the sensor node is running.

Distributed Detection of Node Replication Attacks in Sensor Networks

681 Citations2005Bryan Parno, Adrian Perrig +1 more

It is shown that emergent algorithms represent a promising new approach to sensor network security; moreover, the results naturally extend to other classes of networks in which nodes can be captured, replicated and re-inserted by an adversary.

IEEE Security & PrivacyA survey of secure wireless ad hoc routing

546 Citations2004Yih‐Chun Hu, Adrian Perrig

The article reviews attacks on ad hoc networks and discusses current approaches for establishing cryptographic keys in ad hoc Networks, and describes the state of research in secure ad hoc routing protocols and its research challenges.

End-to-end performance and fairness in multihop wireless backhaul networks

387 Citations2004Violeta Gambiroza, Bahareh Sadeghi +1 more

A formal reference model is developed that characterizes objectives such as removing spatial bias and providing performance that is independent of the number of wireless hops to a wire and a distributed layer 2 fairness algorithm is developed to achieve the fairness of the reference model without modification to TCP.

IEEE Workshop on Wireless Mesh NetworksA Fair Scheduling for Wireless Mesh Networks

109 Citations2005Naouel Ben Salem, Jean‐Pierre Hubaux

This paper proposes a fair scheduling mechanism that optimizes the bandwidth utilization in the mesh network and assigns transmission rights to the links in the WMN and maximizes the spatial reuse.