The paper presents issues concerning the construction of globally connected wireless networks based on the IPv6 protocol. Prospects of implementation of IPv6 in wireless networks and IPv6 features and mechanisms important in such applications are discussed. Concepts presented here apply to wireless ad hoc mesh networks. In ad hoc networks (MANETs), wireless nodes spontaneously collaborate to ro...

This thesis proposes and discusses solutions to enable network-layer mobility in wireless ad hoc access networks. The deployment of wireless access networks has made them ubiquitous and current research strives to make them pervasive. Users having wireless access to wired IP networks and the Internet are driving the demand for mobile and heterogeneous solutions. To enable all kinds of mobility ...

Most ad hoc networks do not implement any network access control, leaving these networks vulnerable to resource consumption attacks where a malicious node injects packets into the network with the goal of depleting the resources of the nodes relaying the packets. To thwart or prevent such attacks, it is necessary to employ authentication mechanisms to ensure that only authorized nodes can injec...

This paper proposes and analyzes a Running Variance Metric performance measurement of wireless local area networks and its formal aspects. Our approach evaluates the performance of wireless local area networks in infrastructure mode as well as in ad hoc mode. The Running Variance Metric is used to discover relative traffic loads of available accesspoints/gateways at the network layer in order t...

In this thesis, starvation is defined as the phenomena where a flow receives throughput persistently and severely lower than its reference rate. Throughout the thesis, I investigate the cause of starvation, explore its solution space, and present mechanisms to counter starvation in both ad-hoc and mesh networks where CSMA protocols are deployed as the medium access mechanism. I first show that ...

The current generation of ad hoc networks relies on other nodes in the network for routing information and for routing the packets. These networks are based on the fundamental assumption that the nodes will cooperate and not cheat. This assumption becomes invalid when the network nodes have tangential or contradictory goals. A novel method of enhancing routing strategies, and enhancing cooperat...

In this paper we evaluate several routing protocols for mobile, wireless, ad hoc networks via packet-level simulations. The ad hoc networks are multi-hop wireless networks with dynamically changing network connectivity owing to mobility. The protocol suite includes several routing protocols specifically designed for ad hoc routing, as well as more traditional protocols, such as link state and d...

This study investigates the potential of using transmission power control in wireless packet networks with differing number of hops between source and destination. Here we exploit the benefits of power control in the context of multi-hop wireless ad hoc type networks with a distributed media access control. For our investigations we choose several general ad hoc network topologies and studied t...

OF THE DISSERTATION Algorithms and LP-Duality Based Lower Bounds in Ad-hoc Radio Networks by Rohan Jude Fernandes Dissertation Director: Mart́ın Farach-Colton An Ad-hoc Radio Network consists of nodes with no knowledge of its neighbors and knowledge of its own ID and n, the size of the network. In this thesis, we present algorithms and lower bounds related to ad-hoc network initialization. Senso...

In this paper, we study the delay and capacity trade-off in mobile ad hoc networks. We consider an ad hoc network with n nodes distributed uniformly on a sphere. The nodes are mobile, and move in accordance with the random way-point mobility model, used widely in the ad hoc networks literature. We show that the 2-hop relaying algorithm proposed by Grossglauser and Tse (2001), incurs an expected...