Ad hoc wireless distribution service

About: Ad hoc wireless distribution service is a research topic. Over the lifetime, 17734 publications have been published within this topic receiving 488205 citations.

High Throughput Route Selection in Multi-rate Ad Hoc Wireless Networks

Abstract: Modern wireless devices, such as those that implement the 802.11b standard, utilize multiple transmission rates in order to accommodate a wide range of channel conditions. Traditional ad hoc routing protocols typically use minimum hop paths. These paths tend to contain long range links that have low effective throughput and reduced reliability in multi-rate networks. In this work, we present the Medium Time Metric (MTM), which is derived from a general theoretical model of the attainable throughput in multi-rate ad hoc wireless networks. MTM avoids using the long range links favored by shortest path routing in favor of shorter, higher throughput, more reliable links. We present NS2 simulations that show that using MTM yields an average total network throughput increase of 20% to 60%, depending on network density. In addition, by combining the MTM with a medium time fair MAC protocol, average total network throughput increases of 100% to 200% are obtained over traditional route selection and packet fairness techniques.

Secure data transmission in mobile ad hoc networks

Abstract: The vision of nomadic computing with its ubiquitous access has stimulated much interest in the Mobile Ad Hoc Networking (MANET) technology. However, its proliferation strongly depends on the availability of security provisions, among other factors. In the open, collaborative MANET environment practically any node can maliciously or selfishly disrupt and deny communication of other nodes. In this paper, we present and evaluate the Secure Message Transmission (SMT) protocol, which safeguards the data transmission against arbitrary malicious behavior of other nodes. SMT is a lightweight, yet very effective, protocol that can operate solely in an end-to-end manner. It exploits the redundancy of multi-path routing and adapts its operation to remain efficient and effective even in highly adverse environments. SMT is capable of delivering up to 250% more data messages than a protocol that does not secure the data transmission. Moreover, SMT outperforms an alternative single-path protocol, a secure data forwarding protocol we term Secure Single Path (SSP) protocol. SMT imposes up to 68% less routing overhead than SSP, delivers up to 22% more data packets and achieves end-to-end delays that are up to 94% lower than those of SSP. Thus, SMT is better suited to support QoS for real-time communications in the ad hoc networking environment. The security of data transmission is achieved without restrictive assumptions on the network nodes' trust and network membership, without the use of intrusion detection schemes, and at the expense of moderate multi-path transmission overhead only.

PARO: supporting dynamic power controlled routing in wireless ad hoc networks

Abstract: This paper introduces PARO, a dynamic power controlled routing scheme that helps to minimize the transmission power needed to forward packets between wireless devices in ad hoc networks. Using PARO, one or more intermediate nodes called "redirectors" elects to forward packets on behalf of source-destination pairs thus reducing the aggregate transmission power consumed by wireless devices. PARO is applicable to a number of networking environments including wireless sensor networks, home networks and mobile ad hoc networks. In this paper, we present the detailed design of PARO and evaluate the protocol using simulation and experimentation. We show through simulation that PARO is capable of outperforming traditional broadcast-based routing protocols (e.g., MANET routing protocols) due to its energy conserving point-to-point on-demand design. We discuss our experiences from an implementation of the protocol in an experimental wireless testbed using off-the-shelf radio technology. We also evaluate the impact of dynamic power controlled routing on traditional network performance metrics such as end-to-end delay and throughput.

A trust model based routing protocol for secure ad hoc networks

Abstract: Security issues have been emphasized when mobile ad hoc networks (MANETs) are employed into military and aerospace fields. We design a novel secure routing protocol for MANETs. This protocol TAODV (Trusted AODV) extends the widely used AODV (ad hoc on-demand distance vector) routing protocol and employs the idea of a trust model to protect routing behaviors in the network layer of MANETs. In the TAODV, trust among nodes is represented by opinion, which is an item derived from subjective logic. The opinions are dynamic and updated frequently as our protocol specification: if one node performs normal communications, its opinion from other nodes' points of view can be increased; otherwise, if one node performs some malicious behaviors, it is ultimately denied by the whole network. A trust recommendation mechanism is also designed to exchange trust information among nodes. The salient feature of TAODV is that, using trust relationships among nodes, there is no need for a node to request and verify certificates all the time. This greatly reduces the computation overheads. Meanwhile, with neighbors' trust recommendations, a node can make objective judgement about another node's trustworthiness to maintain the whole system at a certain security level.

Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks

Abstract: Routing is one of the most basic networking functions in mobile ad hoc networks. Hence, an adversary can easily paralyze the operation of the network by attacking the routing protocol. This has been realized by many researchers and several "secure" routing protocols have been proposed for ad hoc networks. However, the security of those protocols has mainly been analyzed by informal means only. In this paper, we argue that flaws in ad hoc routing protocols can be very subtle, and we advocate a more systematic way of analysis. We propose a mathematical framework in which security can be precisely defined and routing protocols for mobile ad hoc networks can be proved to be secure in a rigorous manner. Our framework is tailored for on-demand source routing protocols, but the general principles are applicable to other types of protocols too. Our approach is based on the simulation paradigm, which has already been used extensively for the analysis of key establishment protocols, but, to the best of our knowledge, it has not been applied in the context of ad hoc routing so far. We also propose a new on-demand source routing protocol, called endairA, and we demonstrate the use of our framework by proving that it is secure in our model