This paper presents the expected transmission count metric (ETX), which finds high-throughput paths on multi-hop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination. The ETX metric incorporates the effects of link loss ratios, asymmetry in the loss ratios between the two directions of each link, and interference among the successive links of a path. In contrast, the minimum hop-count metric chooses arbitrarily among the different paths of the same minimum length, regardless of the often large differences in throughput among those paths, and ignoring the possibility that a longer path might offer higher throughput.This paper describes the design and implementation of ETX as a metric for the DSDV and DSR routing protocols, as well as modifications to DSDV and DSR which allow them to use ETX. Measurements taken from a 29-node 802.11b test-bed demonstrate the poor performance of minimum hop-count, illustrate the causes of that poor performance, and confirm that ETX improves performance. For long paths the throughput improvement is often a factor of two or more, suggesting that ETX will become more useful as networks grow larger and paths become longer.

/pdf/a-high-throughput-path-metric-for-multi-hop-wireless-routing-1p4xa8p0kv.pdf

A high-throughput path metric for multi-hop wireless routing

GLS is a new distributed location service which tracks mobile node locations. GLS combined with geographic forwarding allows the construction of ad hoc mobile networks that scale to a larger number of nodes than possible with previous work. GLS is decentralized and runs on the mobile nodes themselves, requiring no fixed infrastructure. Each mobile node periodically updates a small set of other nodes (its location servers) with its current location. A node sends its position updates to its location servers without knowing their actual identities, assisted by a predefined ordering of node identifiers and a predefined geographic hierarchy. Queries for a mobile node's location also use the predefined identifier ordering and spatial hierarchy to find a location server for that node.Experiments using the ns simulator for up to 600 mobile nodes show that the storage and bandwidth requirements of GLS grow slowly with the size of the network. Furthermore, GLS tolerates node failures well: each failure has only a limited effect and query performance degrades gracefully as nodes fail and restart. The query performance of GLS is also relatively insensitive to node speeds. Simple geographic forwarding combined with GLS compares favorably with Dynamic Source Routing (DSR): in larger networks (over 200 nodes) our approach delivers more packets, but consumes fewer network resources.

/pdf/a-scalable-location-service-for-geographic-ad-hoc-routing-4n0a5k9xww.pdf

A scalable location service for geographic ad hoc routing

An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing problem in a non-adversarial setting, assuming a trusted environment. In this paper, we present attacks against routing in ad hoc networks, and we present the design and performance evaluation of a new secure on-demand ad hoc network routing protocol, called Ariadne. Ariadne prevents attackers or compromised nodes from tampering with uncompromised routes consisting of uncompromised nodes, and also prevents many types of Denial-of-Service attacks. In addition, Ariadne is efficient, using only highly efficient symmetric cryptographic primitives.

/pdf/ariadne-a-secure-on-demand-routing-protocol-for-ad-hoc-pug3drdfej.pdf

Ariadne: a secure on-demand routing protocol for ad hoc networks

With the advances in acoustic modem technology that enabled high-rate reliable communications, current research focuses on communication between various remote instruments within a network environment. Underwater acoustic (UWA) networks are generally formed by acoustically connected ocean-bottom sensors, autonomous underwater vehicles, and a surface station, which provides a link to an on-shore control center. While many applications require long-term monitoring of the deployment area, the battery-powered network nodes limit the lifetime of UWA networks. In addition, shallow-water acoustic channel characteristics, such as low available bandwidth, highly varying multipath, and large propagation delays, restrict the efficiency of UWA networks. Within such an environment, designing an UWA network that maximizes throughput and reliability while minimizing the power consumption becomes a very difficult task. The goal of this paper is to survey the existing network technology and its applicability to underwater acoustic channels. In addition, we present a shallow-water acoustic network example and outline some future research directions.

https://www.mit.edu/~millitsa/resources/pdfs/joema.pdf

Underwater acoustic networks

The rapid proliferation of wireless networks and mobile computing applications has changed the landscape of network security. The traditional way of protecting networks with firewalls and encryption software is no longer sufficient and effective. We need to search for new architecture and mechanisms to protect the wireless networks and mobile computing application. In this paper, we examine the vulnerabilities of wireless networks and argue that we must include intrusion detection in the security architecture for mobile computing environment. We have developed such an architecture and evaluated a key mechanism in this architecture, anomaly detection for mobile ad-hoc network, through simulation experiments.

/pdf/intrusion-detection-techniques-for-mobile-wireless-networks-m4iarkhvhv.pdf

Intrusion detection techniques for mobile wireless networks

AD HOC is characterized by simple organizing, low cost, strong survival ability, and adaptation to many applications and so on. The routing principles play an important role in the realization of the above target. This paper presents and discusses some basic principles of routing and pays high attention to how these differ from conventional routing.

Wang Heng-jun

Papers

Routing in AD HOC Networks of Mobile Hosts