Mobile Ad hoc Networking: Imperatives and Challenges

Mobile ad hoc networks (MANETs) represent complex distributed systems that comprise wireless mobile nodes that can freely and dynamically self-organize into arbitrary and temporary, "ad-hoc" network topologies, allowing people and devices to seamlessly internetwork in areas with no pre-existing communication infrastructure, e.g., disaster recovery environments. Ad hoc networking concept is not a new one, having been around in various forms for over 20 years. Traditionally, tactical networks have been the only communication networking application that followed the ad hoc paradigm. Recently, the introduction of new technologies such as the Bluetooth, IEEE 802.11 and Hyperlan are helping enable eventual commercial MANET deployments outside the military domain. These recent evolutions have been generating a renewed and growing interest in the research and development of MANET. This paper attempts to provide a comprehensive overview of this dynamic field. It first explains the important role that mobile ad hoc networks play in the evolution of future wireless technologies. Then, it reviews the latest research activities in these areas, including a summary of MANET\u27s characteristics, capabilities, applications, and design constraints. The paper concludes by presenting a set of challenges and problems requiring further research in the future

Performance enhancements for single hop and multi-hop meshed high data rate wireless personal area networks

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.The High Data Rate (HDR) Wireless Personal Area Networks (WPANs) typically have a limited operating range and are intended to support demanding multi-media applications at high data rates. In order to extend the communication range, HDR WPANs can operate in a wireless mesh configuration (i.e. enable multiple WPAN clusters) to communicate in a multi-hop fashion. HDR WPANs face several research challenges and some of the open key issues are limited capacity, optimum resource allocation to requesting devices and maintaining Quality of Service (QoS) for real time multimedia flows. Although, there have been some scheduling algorithms proposed for HDR WPANs, the main objective is to maintain the QoS in most cases whereas efficient and fair utilization of network capacity is still largely open for research. This thesis mainly intends to resolve the issues related to capacity of HDR WPANs such as admission control, fair allocation of Channel Time Allocations (CTAs), improvement in capacity through transmission power control, and efficient utilization of time by each flow. A technique which re-orders the time slots to reduce queuing delay for meshed WPANs is also proposed and evaluated. The first contribution aims to improve peer-to-peer connectivity in case of two or more independent piconet devices by proposing an inter-PAN communication framework that is augmented by an admission control strategy to handle the cases when the superframe capacity is congested. The queued devices are prioritized by proposing a parameter called the Rejection Ratio. The second contribution consists of a resource allocation framework for meshed WPANs. The main objectives are to reduce the control traffic due to high volume of channel time reservation requests and introduce an element of fairness in the channel time allocated to requesting devices. The objectives are achieved by using traffic prediction techniques and an estimated backoff procedure to reduce control traffic, and define different policies based on offered traffic for fair allocation of channel time. The centralized scheme uses traffic prediction techniques to use the proposed concept of bulk reservations. Based on the bulk reservations and resource allocation policies, the overall overhead is reduced while an element of fairness is shown to be maintained for certain scenarios. In the third contribution, the concepts of Time Efficiency and CTA switching are introduced to improve communication efficiency and utilization of superframe capacity in meshed WPANs. Two metrics known as Switched Time Slot (STS) and Switched Time Slot with Re-ordering (STS-R) are proposed which aim to achieve the purpose. The final contribution proposes and evaluates a technique called CTA overlappnig to improve capacity in single hop and meshed WPANs using tramission power control. Extensive simulation studies are performed to analyze and to evaluate the proposed techniques. Simulation results demonstrate significant improvements in meshed WPANs performance in terms of capacity utilization, improvement in fairness index for CTA allocation by upto 62% in some cases, reduction in control traffic overhead by upto 70% and reduction in delay for real time flows by more than 10% in some cases

Optimal Communication in Bluetooth Piconets

Bluetooth is a low-power, low-cost, short-range wireless communication system operating in the 2.4-GHz industrial, scientific, and medical (ISM) band. Bluetooth links use frequency hopping whereby each packet is sent on a single frequency while different packets are sent on different frequencies. Further, there are a limited number of packet sizes. We show that we can exert indirect control over transmission conditions by choosing the packet size transmitted over each frequency as a function of the channel conditions. Our goal then is to provide a packet-size-selection algorithm that can maximize the throughput in a Bluetooth piconet in the presence of lossy wireless channels. We first develop a renewal-theory-based mathematical model of packet transmission in a frequency-hopping system such as a Bluetooth piconet. We use this model to show that a threshold-based algorithm for choosing the packet lengths maximizes the throughput of the system. We provide an algorithm that determines the optimal thresholds efficiently. We show the optimality of this algorithm without using standard optimization techniques, since it is not clear that these techniques would be applicable given the functions involved. Using simulations, we observe that this strategy leads to significantly better throughput as compared to other baseline strategies, even if the assumptions made to prove optimality are relaxed