A power-controlled MAC supporting service differentiation in mobile ad hoc networks

The original power controlled multiple access (PCMA) protocol does not support service differentiation. In this paper, we extend PCMA to form a new media access control protocol supporting service differentiation in mobile ad hoc networks. To support QoS, we first introduce the in-station access category concept in 802.1 le to PCMA. For service differentiation between access categories, our major contribution is to propose a sender-initiated busy tone based mechanism that allows a user to gain quick channel access. This quick access mechanism is only performed when the number of access failures exceeds a threshold. An access category with higher priority is assigned a lower threshold for easier channel access, and vice versa. Through analysis and simulation, we demonstrate that our protocol can provide better quality of service than 802.11e in terms of throughput, delay, loss, and fairness. © 2005 IEEE.published_or_final_versio

Fair power-controlled multiple access in mobile ad hoc networks

Previous power-controlled media access control (MAC) protocols for mobile ad hoc networks (MANET) suffer from the unfair channel access problem, i.e., it is difficult for a node to communicate with a distant node because of nearby ongoing communications. In this paper, we propose a fair power-controlled MAC protocol (FPCMA) by integrating senderinitiated busy tone with traditional power-controlled protocol. The sender-initiated busy tone is used to assist in channel access, and will be set up when a node finds it difficult to access the channel. Nearby nodes overhearing the tone will yield their transmission rights to the attempting node, thus solving the unfairness problem. Through analysis and simulation, we demonstrate that our protocol is able to balance the tradeoff between fair channel access and throughput, and is therefore more flexible than both the traditional dual busy tone and power-controlled MAC protocols.published_or_final_versio

Topology Control for Maintaining Network Connectivity and Maximizing Network Capacity Under the Physical Model

In this paper we study the issue of topology control under the physical Signal-to-Interference-Noise-Ratio (SINR) model, with the objective of maximizing network capacity. We show that existing graph-model-based topology control captures interference inadequately under the physical SINR model, and as a result, the interference in the topology thus induced is high and the network capacity attained is low. Towards bridging this gap, we propose a centralized approach, called Spatial Reuse Maximizer (MaxSR), that combines a power control algorithm T4P with a topology control algorithm P4T. T4P optimizes the assignment of transmit power given a fixed topology, where by optimality we mean that the transmit power is so assigned that it minimizes the average interference degree (defined as the number of interferencing nodes that may interfere with the on-going transmission on a link) in the topology. P4T, on the other hand, constructs, based on the power assignment made in T4P, a new topology by deriving a spanning tree that gives the minimal interference degree. By alternately invoking the two algorithms, the power assignment quickly converges to an operational point that maximizes the network capacity. We formally prove the convergence of MaxSR. We also show via simulation that the topology induced by MaxSR outperforms that derived from existing topology control algorithms by 50%-110% in terms of maximizing the network capacity

Medium Access Control Protocols for Ad-Hoc Wireless Networks: A Survey

Studies of ad hoc wireless networks are a relatively new field gaining more popularity for various new applications. In these networks, the Medium Access Control (MAC) protocols are responsible for coordinating the access from active nodes. These protocols are of significant importance since the wireless communication channel is inherently prone to errors and unique problems such as the hidden-terminal problem, the exposed-terminal problem, and signal fading effects. Although a lot of research has been conducted on MAC protocols, the various issues involved have mostly been presented in isolation of each other. We therefore make an attempt to present a comprehensive survey of major schemes, integrating various related issues and challenges with a view to providing a big-picture outlook to this vast area. We present a classification of MAC protocols and their brief description, based on their operating principles and underlying features. In conclusion, we present a brief summary of key ideas and a general direction for future work

Power control and scheduling for wireless data communications

Master'sMASTER OF ENGINEERIN

Power-Stepped Protocol: Enhancing Spatial Utilization in a Clustered Mobile Ad Hoc Network

While most previous studies on mobile ad hoc networks (MANETs) rely on the assumption that nodes are randomly distributed in the network coverage area, this assumption is unlikely to hold, as nodes tend to be cluttered around hot spots like the site of an accident or disaster. We refer to this as a clustered layout. Intuitively, a MANET with the clustered layout may suffer from serious performance degradation due to the excessive collisions in congested hot spots and space underutilization of sparse areas. In this paper, we propose a power-controlled network protocol, called the power-stepped protocol (PSP), that maximizes the spatial utilization of limited channel bandwidth. Using a number of discrete power levels available for the underlying wireless network hardware, PSP finds the appropriate power level for each node in a distributed and a coordinated manner without causing any serious problem at the medium access control and network routing layers. A unique feature of this approach is the use the chosen radio power for both data and control packets, and thus, it requires neither any special mechanism (e.g., a separate control channel) nor frequent power adjustments. Our extensive ns-2-based simulation results have shown the proposed PSP provides excellent performance in terms of packet delivery ratio and delay, as well as the network capacity

Performance improvement of ad hoc networks using directional antennas and power control

Au cours de la dernière décennie, un intérêt remarquable a été éprouvé en matière des réseaux ad hoc sans fil capables de s'organiser sans soutien des infrastructures. L'utilisation potentielle d'un tel réseau existe dans de nombreux scénarios, qui vont du génie civil et secours en cas de catastrophes aux réseaux de capteurs et applications militaires. La Fonction de coordination distribuée (DCF) du standard IEEE 802.11 est le protocole dominant des réseaux ad hoc sans fil. Cependant, la méthode DCF n'aide pas à profiter efficacement du canal partagé et éprouve de divers problèmes tels que le problème de terminal exposé et de terminal caché. Par conséquent, au cours des dernières années, de différentes méthodes ont été développées en vue de régler ces problèmes, ce qui a entraîné la croissance de débits d'ensemble des réseaux. Ces méthodes englobent essentiellement la mise au point de seuil de détecteur de porteuse, le remplacement des antennes omnidirectionnelles par des antennes directionnelles et le contrôle de puissance pour émettre des paquets adéquatement. Comparées avec les antennes omnidirectionnelles, les antennes directionnelles ont de nombreux avantages et peuvent améliorer la performance des réseaux ad hoc. Ces antennes ne fixent leurs énergies qu'envers la direction cible et ont une portée d'émission et de réception plus large avec la même somme de puissance. Cette particularité peut être exploitée pour ajuster la puissance d'un transmetteur en cas d'utilisation d'une antenne directionnelle. Certains protocoles de contrôle de puissance directionnel MAC ont été proposés dans les documentations. La majorité de ces suggestions prennent seulement la transmission directionnelle en considération et, dans leurs résultats de simulation, ces études ont l'habitude de supposer que la portée de transmission des antennes omnidirectionnelles et directionnelles est la même. Apparemment, cette supposition n'est pas toujours vraie dans les situations réelles. De surcroît, les recherches prenant l'hétérogénéité en compte dans les réseaux ad hoc ne sont pas suffisantes. Le présent mémoire est dédié à proposer un protocole de contrôle de puissance MAC pour les réseaux ad hoc avec des antennes directionnelles en prenant tous ces problèmes en considération. ______________________________________________________________________________ MOTS-CLÉS DE L’AUTEUR : Réseaux ad hoc, Antennes directives, Contrôle de puissance

Optimal Distributed Scheduling in Wireless Networks under the SINR interference model

Radio resource sharing mechanisms are key to ensuring good performance in wireless networks. In their seminal paper \cite{tassiulas1}, Tassiulas and Ephremides introduced the Maximum Weighted Scheduling algorithm, and proved its throughput-optimality. Since then, there have been extensive research efforts to devise distributed implementations of this algorithm. Recently, distributed adaptive CSMA scheduling schemes \cite{jiang08} have been proposed and shown to be optimal, without the need of message passing among transmitters. However their analysis relies on the assumption that interference can be accurately modelled by a simple interference graph. In this paper, we consider the more realistic and challenging SINR interference model. We present {\it the first distributed scheduling algorithms that (i) are optimal under the SINR interference model, and (ii) that do not require any message passing}. They are based on a combination of a simple and efficient power allocation strategy referred to as {\it Power Packing} and randomization techniques. We first devise algorithms that are rate-optimal in the sense that they perform as well as the best centralized scheduling schemes in scenarios where each transmitter is aware of the rate at which it should send packets to the corresponding receiver. We then extend these algorithms so that they reach throughput-optimality