Existing position-based unicast routing algorithms which forward packets in the geographic direction of the destination require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages each node sends out periodically. Due to mobility, the information that a node receives about its neighb...

The packets in a mobile wireless ad-hoc network (MANET) are vulnerable to various packet-dropping attacks. Due to the lack of a centralized monitoring mechanism, it is a challenging problem to identify the attackers that launch the packet-dropping attacks in MANET. The existing DoS defensive techniques have not provided a scheme to efficiently and effectively solve this challenging problem. Hen...

This paper presents our work with an ODMRP (on demand multicast Routing Protocol) to extend its functionality to work with asymmetric links in a Linux Environment. We were given the functional code for the ODMRP protocol, as well as a test-bed to work with which consisted of five Dell Lattitude laptops equipped with Lucent Wireless PCMCIA 802.11 cards. Our implementation consists of adding to t...

We initiate a competitive analysis of packet forwarding policies for maximum and average flow in a line network. We show that the policies Earliest Arrival and Furthest-To-Go are scalable, but not constant competitive, for maximum flow. We show that there is no constant competitive algorithm for average flow.

This report discusses our proposed improvements to Fast Hash Tables (FHT) which we name ’Efficient Hash Table’ (EHT) where ’efficient’ relates to both memory efficiency and lookup performance. The mechanism we use to design the EHT lead to improvements in terms of sram memory requirements by the factor of ten over the FHT. Our results back the theoretical analysis and allow accurate predictions...

Flooding is a fundamental operation in wireless ad hoc networks to propagate control messages in the entire network. The traditional flooding scheme generates excessive packet retransmissions, resource contention, and collisions since every node forwards the packet at least once. Several flooding schemes have been proposed to avoid these problems. However, these unnecessary forwarding nodes rem...

Opportunistic routing (OR) takes advantages of the spatial diversity and broadcast nature of wireless networks to combat the time-varying links by involving multiple neighboring nodes (forwarding candidates) for each packet relay. This dissertation studies the properties, energy efficiency, capacity, throughput, protocol design and security issues about OR in multihop wireless networks. Firstly...

Wireless mesh Network (WMN) is a multi hop low cost, with easy maintenance robust network providing reliable service coverage. WMNs consist of mesh routers and mesh clients. In this architecture, while static mesh routers form the wireless backbone, mesh clients access the network through mesh routers as well as directly meshing with each other. Different from traditional wireless networks, WMN...

Routing protocols for multi-hop wireless networks have traditionally focused on finding the best path for forwarding packets between a pair of nodes. While such single-path forwarding is suitable for wired networks with relatively stable point-topoint links, it is not an ideal approach for wireless networks with broadcast links of time varying qualities. Opportunistic routing schemes, which exp...

In previous work[1-3] it has been shown how open-source routers on new PC hardware allows for forwarding speeds of 10Gb/s and above. In this work we extend the applicability of the results by showing how the new 10Gb/s interface classification techniques can be used to separate packet forwarding from control plane operation. It is important to isolate the control-plane from forwarding load, sin...