We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in per-router state than shortest-path and ad-hoc routing protocols as the number of network destinations increases. Under mobility's frequent topology changes, GPSR can use local topology information to find correct new routes quickly. We describe the GPSR protocol, and use extensive simulation of mobile wireless networks to compare its performance with that of Dynamic Source Routing. Our simulations demonstrate GPSR's scalability on densely deployed wireless networks.

/pdf/gpsr-greedy-perimeter-stateless-routing-for-wireless-59gz21qf8y.pdf

GPSR: greedy perimeter stateless routing for wireless networks

https://www.cs.montana.edu/courses/csci566/Ref/CR-Survey.pdf

NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey

Advances in processor, memory and radio technology will enable small and cheap nodes capable of sensing, communication and computation. Networks of such nodes can coordinate to perform distributed sensing of environmental phenomena. In this paper, we explore the directed diffusion paradigm for such coordination. Directed diffusion is datacentric in that all communication is for named data. All nodes in a directed diffusion-based network are application-aware. This enables diffusion to achieve energy savings by selecting empirically good paths and by caching and processing data in-network. We explore and evaluate the use of directed diffusion for a simple remote-surveillance sensor network.

/pdf/directed-diffusion-a-scalable-and-robust-communication-4tsx5vxsas.pdf

Directed diffusion: a scalable and robust communication paradigm for sensor networks

"A Survey of Mobility Models for Ad Hoc Network Research," Wireless Comm. & Mobile Computing (WCMC) : Special issue on Mobile Ad Hoc Networking : Research

In the performance evaluation of a protocol for an ad hoc network, the protocol should be tested under realistic conditions including, but not limited to, a sensible transmission range, limited buffer space for the storage of messages, representative data traffic models, and realistic movements of the mobile users (i.e., a mobility model). This paper is a survey of mobility models that are used in the simulations of ad hoc networks. We describe several mobility models that represent mobile nodes whose movements are independent of each other (i.e., entity mobility models) and several mobility models that represent mobile nodes whose movements are dependent on each other (i.e., group mobility models). The goal of this paper is to present a number of mobility models in order to offer researchers more informed choices when they are deciding upon a mobility model to use in their performance evaluations. Lastly, we present simulation results that illustrate the importance of choosing a mobility model in the simulation of an ad hoc network protocol. Specifically, we illustrate how the performance results of an ad hoc network protocol drastically change as a result of changing the mobility model simulated.

/pdf/a-survey-of-mobility-models-for-ad-hoc-network-research-ygkxat400x.pdf

A survey of mobility models for ad hoc network research

A mobile ad hoc network consists of wireless hosts that may move often. Movement of hosts results in a change in routes, requiring some mechanism for determining new routes. Several routing protocols have already been proposed for ad hoc networks. This report suggests an approach to utilize location information (for instance, obtained using the global positioning system) to improve performance of routing protocols for ad hoc networks.

/pdf/location-aided-routing-lar-in-mobile-ad-hoc-networks-4ijy8yjn7d.pdf

Location-aided routing (LAR) in mobile ad hoc networks

This paper proposes a medium access control (MAC) protocol for ad hoc wireless networks that utilizes multiple channels dynamically to improve performance. The IEEE 802.11 standard allows for the use of multiple channels available at the physical layer, but its MAC protocol is designed only for a single channel. A single-channel MAC protocol does not work well in a multi-channel environment, because of the multi-channel hidden terminal problem . Our proposed protocol enables hosts to utilize multiple channels by switching hannels dynamically, thus increasing network throughput. The protocol requires only one transceiver per host, but solves the multi-channel hidden terminal problem using temporal synchronization. Our scheme improves network throughput signifiantly, especially when the network is highly congested. The simulation results show that our protocol successfully exploits multiple hannels to achieve higher throughput than IEEE 802.11. Also, the performance of our protocol is comparable to another multi-hannel MAC protocol that requires multiple transceivers per host. Since our protocol requires only one transceiver per host, it an be implemented with a hardware complexity comparable to IEEE 802.11.

/pdf/multi-channel-mac-for-ad-hoc-networks-handling-multi-channel-9904agjtef.pdf

Multi-channel mac for ad hoc networks: handling multi-channel hidden terminals using a single transceiver

Wireless local area networks (W-LANs) have become increasingly popular due to the recent availability of affordable devices that are capable of communicating at high data rates. These high rates are possible, in part, through new modulation schemes that are optimized for the channel conditions bringing about a dramatic increase in bandwidth efficiency. Since the choice of which modulation scheme to use depends on the current state of the transmission channel, newer wireless devices often support multiple modulation schemes, and hence multiple datarates, with mechanisms to switch between them Users are given the option to either select an operational datarate manually or to let the device automatically choose the appropriate modulation scheme (data rate) to match the prevailing conditions. Automatic rate selection protocols have been studied for cellular networks but there have been relatively few proposals for W-LANs. In this paper we present a rate adaptive MAC protocol called the Receiver-Based AutoRate (RBAR) protocol. The novelty of RBAR is that its rate adaptation mechanism is in the receiver instead of in the sender. This is in contrast to existing schemes in devices like the WaveLAN II [15]. We show that RBAR is better because it results in a more efficient channel quality estimation which is then reflected in a higher overall throughput Our protocol is based on the RTS/CTS mechanism and consequently it can be incorporated into many medium access control protocols including the widely popular IEEE 802.11 protocol. Simulation results of an implementation of RBAR inside IEEE 802.11 show that RBAR performs consistently well.

/pdf/a-rate-adaptive-mac-protocol-for-multi-hop-wireless-networks-1ofa5fd9t5.pdf

A rate-adaptive MAC protocol for multi-Hop wireless networks

A mobile ad hoc network consists of wireless hosts that may move often. Movement of hosts results in a change in routes, requiring some mechanism for determining new routes. Several routing protocols have already been proposed for ad hoc networks. This paper suggests an approach to utilize location information (for instance, obtained using the global positioning system) to improve performance of routing protocols for ad hoc networks. By using location information, the proposed Location‐Aided Routing (LAR) protocols limit the search for a new route to a smaller “request zone” of the ad hoc network. This results in a significant reduction in the number of routing messages. We present two algorithms to determine the request zone, and also suggest potential optimizations to our algorithms.

Mobile ad hoc networks have gained a lot of attention lately as a means of providing continuous network connectivity to mobile computing devices regardless of physical location. Recently, a large amount of research has focused on the routing protocols needed in such an environment. In this two-part report, we investigate the effects that link breakage due to mobility has on TCP performance. Through simulation, we show that TCP throughput drops significantly when nodes move because of TCP''s inability to recognize the difference between link failure and congestion. We also analyze specific examples, such as a situation where throughput is zero for a particular connection. We introduce a new metric, expected throughput, for the comparison of throughput in multi-hop networks, and then use this metric to show how the use of explicit link failure notification (ELFN) techniques can significantly improve TCP performance. In Part I of this report, we presented the problem and an analysis of the simulation results. In this paper (Part II of the report), we present the simulation in more detail and provide additional results.

Nitin H. Vaidya

Papers

Location-aided routing (LAR) in mobile ad hoc networks

Multi-channel mac for ad hoc networks: handling multi-channel hidden terminals using a single transceiver

A rate-adaptive MAC protocol for multi-Hop wireless networks

Location-aided routing (LAR) in mobile ad hoc networks

Analysis of TCP Performance over Mobile Ad Hoc Networks -- Part II: Simulation Details and Results