A QoS Routing Protocol with Bandwidth Allocation in Multichannel Ad Hoc Networks

Mobile multimedia applications have recently generated much interest in mobile ad hoc networks (MANETs) supporting quality-of-service (QoS) communications. Multiple non-interfering channels are available in 802.11 and 802.15 based wireless networks. Capacity of such channels can be combined to achieve higher QoS performance than for single channel networks. The capacity of MANETs can be substantially increased by equipping each network node with multiple interfaces that can operate on multiple non-overlapping channels. However, new scheduling, channel assignment, and routing protocols are required to utilize the increased bandwidth in multichannel MANETs. In this paper, we propose an on-demand routing protocol M-QoS-AODV in multichannel MANETs that incorporates a distributed channel assignment scheme and routing discovery process to support multimedia communication and to satisfy QoS bandwidth requirement. The proposed channel assignment scheme can efficiently express the channel usage and interference information within a certain range, which reduces interference and enhances channel reuse rate. This cross-layer design approach can significantly improve the performance of multichannel MANETs over existing routing algorithms. Simulation results show that the proposed M-QoS-AODV protocol can effectively increase throughput and reduce delay, as compared to AODV and M-AODV-R protocols.     

A Cross-layer Approach to Channel Assignment in Wireless Ad Hoc Networks

To improve the capacity of wireless ad hoc networks by exploiting multiple available channels, we propose a distributed channel assignment protocol that is based on a cross-layer approach. By combining channel assignment with routing protocols, the proposed channel assignment protocol is shown to require fewer channels and exhibit lower communication, computation, and storage complexity than existing channel assignment schemes. A multi-channel MAC (MC-MAC) protocol that works with the proposed channel assignment protocol is also presented. We prove the correctness of the proposed channel assignment protocol. In addition, through a performance study, we show that the proposed protocol can substantially increase throughput and reduce delay in wireless ad hoc networks, compared to the IEEE 802.11 MAC protocol and an existing multi-channel scheme.

A routing protocol based on interference-aware and channel-load in multi-radio multi-channel ad hoc networks

Improving capacity and reducing delay are the most challenging topics in wireless ad hoc networks. Nodes that equip multiple radios working on different channels simultaneously permit effective utility of frequency spectrum and can also reduce interference. In this paper, after analyzing several current protocols in Multi-Radio Multi-Channel (MR-MC) ad hoc networks, a new multichannel routing metric called Integrative Route Metric (IRM) is designed. It takes channel load, interflow, and intra-flow interference into consideration. In addition, an MR-MC routing protocol based on Interference-Aware and Channel-Load (MR-IACL) is also presented. The MR-IACL can assign channels and routings for nodes according to channel load and interference degree of links, and optimize channel distribution dynamically to satisfy the features of topology changing and traffic frequent fluctuation during network running. The simulation results show that the new protocol outperforms others in terms of network throughput, end-to-end delay, routing overhead, and network lifetime.     

A Distributed Channel Access Protocol for Ad Hoc Networks with Feedback Power Control

Distributed power control schemes are extensively employed in the cellular networks and are capable of improving the capacity of the network. However, the power control schemes from the cellular networks suffer from performance degradation due to self and direct-interference and hidden-terminal problems when directly employed in ad hoc networks. Most of the existing channel reservation-based power control protocols for ad hoc networks employ incremental power allocation rather than global allocation of the power to the incoming links; thus, they may not effectively utilize the spatial frequency reuse in the network. This paper presents a distributed channel access protocol that couples the channel reservation and the iterative/global transmission power control schemes in ad hoc networks. The designed protocol considers the convergence problem of the global power control in ad hoc networks. The designed access criteria employ the local admission control based on the sufficient criteria for admissibility and global power control for balancing the SIR (signal to interference ratio) of the links. In the performance evaluation study of the designed protocol, an almost twofold increase in the throughput and capacity is observed compared to the existing power-controlled protocol for ad hoc networks.     

Distributed power control over multiple channels for ad hoc wireless networks

In this paper, we investigate the deficiency of uncontrolled asymmetrical transmission power over multiple channels in ad hoc environments. We further propose a novel distributed transmission power control protocol called the distributed power level (DPL) protocol for multi‐channel ad hoc networks without requiring clock synchronization. Specifically, different transmission power levels are assigned to different channels, and nodes search for an idle channel on the basis of the received power so that the maximum allowable power of the preferred data channel is larger than or equal to the received power. If the most preferred channel of the least maximum power is busy, the nodes are able to select the next channel and so forth. As a result, interference is reduced over channels because the nodes that require higher transmission power are separated from interfering with the nodes that require lower transmission power. Two transmission power control modes are introduced for DPL: symmetrical and asymmetrical. For the symmetrical DPL protocol (mode), nodes transmit at the same power level assigned to the selected channel. On the other hand, for the asymmetrical DPL protocol, nodes are allowed to transmit at a lower or equal power level that is assigned to the selected channel. Extensive ns‐2‐based simulation results are presented to demonstrate that the proposed protocols can enhance the network throughput compared with the existing uncontrolled asymmetrical transmission power protocol. Copyright © 2012 John Wiley & Sons, Ltd.     

Delay and capacity in MANETs under random walk mobility model

The closed-form results for delay and capacity in mobile ad hoc networks are important for the performance analysis of different transmission protocols. Most existing works focus on independent and identically distributed mobility model, which is always regarded as an idealized global model. In this paper, we extend the investigation to the random walk model, which characterizes practical situations more accurately. Some local movements cause a series of complicated probabilistic problem, we develop a method to calculate the meeting probability between two randomly selected nodes under random walk mobility model. Targeting at the most commonly used routing schemes which are modeled by 2HR-f algorithm, we obtain the closed-form solutions for delay and capacity, where the wireless interference and medium access contention among nodes are considered. Extensive simulations demonstrate the accuracy of our theoretical results.     

A hotspot mitigation protocol for ad hoc networks

Hotspots represent transient but highly congested regions in wireless ad hoc networks that result in increased packet loss, end-to-end delay, and out-of-order packets delivery. We present a simple, effective, and scalable hotspot mitigation protocol (HMP) where mobile nodes independently monitor local buffer occupancy, packet loss, and MAC contention and delay conditions, and take local actions in response to the emergence of hotspots, such as, suppressing new route requests and rate controlling TCP flows. We use analysis, simulation, and experimental results from a wireless testbed to demonstrate the effectiveness of HMP in mobile ad hoc networks. HMP balances resource consumption among neighboring nodes, and improves end-to-end throughput, delay, and packet loss. Our results indicate that HMP can also improve the network connectivity preventing premature network partitions. We present analysis of hotspots, and the detailed design of HMP. We evaluate the protocol’s ability to effectively mitigate hotspots in mobile ad hoc networks that are based on on-demand and proactive routing protocols.     

无线Ad Hoc网络中基于业务感知的多信道MAC协议(英文)

Existing multi-channel Medium Access Control (MAC) protocols have been demonstrated to significantly increase wireless network performance compared to single channel MAC protocols. Traditionally, the channelization structure in IEEE 802.11 based wireless networks is pre-configured, and the entire available spectrum is divided into subchannels and equal channel widths. In contrast, this paper presents a Traffic-Aware Channelization MAC (TAC-MAC) protocol for wireless ad hoc networks, where each node is equipped with a single half duplex transceiver. TAC-MAC works in a distributed, fine-grai-ned manner, which dynamically divides variable-width subchannels and allocates subchannel width based on the Orthogonal Frequency Division Multiplexing (OFDM) technique according to the traffic demands of nodes. Simulations show that the TAC-MAC can significantly improve network throughput and reduce packet delay compared with both fixed-width multi-channel MAC and single channel 802.11 protocols, which illustrates a new paradigm for high-efficient multi-channel MAC design in wireless ad hoc networks.     

A quantitative comparison of ad hoc routing protocols with and without channel adaptation

To efficiently support tetherless applications in ad hoc wireless mobile computing networks, a judicious ad hoc routing protocol is needed. Much research has been done on designing ad hoc routing protocols and some well-known protocols are also being implemented in practical situations. However; one major imperfection in existing protocols is that the time-varying nature of the wireless channels among the mobile-terminals is ignored; let alone exploited. This could be a severe design drawback because the varying channel quality can lead to very poor overall route quality in turn, resulting in low data throughput. Indeed, better performance could be achieved if a routing protocol dynamically changes the routes according to the channel conditions. In this paper, we first propose two channel adaptive routing protocols which work by using an adaptive channel coding and modulation scheme that allows a mobile terminal to dynamically adjust the data throughput via changing the amount of error protection incorporated. We then present a qualitative and quantitative comparison of the two classes of ad hoc routing protocols. Extensive simulation results indicate that channel adaptive ad hoc routing protocols are more efficient in that shorter delays and higher rates are achieved, at the expense of a higher overhead in route set-up and maintenance.     

Tone Dual‐Channel MAC Protocol with Directional Antennas for Mobile Ad Hoc Networks

The directional medium access control (MAC) protocol improves the throughput of mobile ad hoc networks but has a deafness problem and requires location information for neighboring nodes. In the dual‐channel directional MAC protocol [12], the use of omnidirectional packets does not require the exact location of destination node. In this letter, we propose a tone dual‐channel MAC protocol with directional antennas to improve the throughput of mobile ad hoc networks. In the proposed MAC protocol, we use a directional CTS and an out‐of‐band directional DATA tone with a new blocking algorithm to improve the spatial reuse. We confirm the throughput performance of the proposed MAC protocol by computer simulations using the Qualnet simulator.     

Mobility increases the capacity of ad hoc wireless networks

The capacity of ad hoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an ad hoc network where n nodes communicate in random source-destination pairs. These nodes are assumed to be mobile. We examine the per-session throughput for applications with loose delay constraints, such that the topology changes over the time-scale of packet delivery. Under this assumption, the per-user throughput can increase dramatically when nodes are mobile rather than fixed. This improvement can be achieved by exploiting a form of multiuser diversity via packet relaying.     

Joint load balanced stable routing and communication segment assignment in mobile cognitive radio ad‐hoc networks

The fundamental issues in mobile cognitive radio ad‐hoc networks are the selection of the optimal stable paths between nodes and proper assignment of the frequency channels/time slots (communication segments) to the links. In this paper, a joint load balanced stable routing and communication segment assignment algorithm is proposed that considers jointly the mobility prediction, mitigating the co‐channel interference and energy consumption. The novelty of the proposed algorithm lies in the increasing of the path stability, which benefits from the maximum link lifetime parameter and introduced weighting function to keep routes away from the PU's region. This avoids the negative impacts on the PUs' operations and decreases the conflict of the cognitive nodes. In the proposed algorithm, the concept of load balancing is considered that yields in the balancing energy consumption in the network, improving the network performance and distributing traffic loads on all available channels. The effectiveness of the proposed algorithm is verified by evaluating the aggregate interference energy, average end‐to‐end delay, goodput, and the energy usage per packet under 6 scenarios. The results show that the performance of the proposed algorithm is significantly better than the recently proposed joint stable routing and channel assignment protocol.     

A heterogeneous‐network aided public‐key management scheme for mobile ad hoc networks

A mobile ad hoc network does not require fixed infrastructure to construct connections among nodes. Due to the particular characteristics of mobile ad hoc networks, most existing secure protocols in wired networks do not meet the security requirements for mobile ad hoc networks. Most secure protocols in mobile ad hoc networks, such as secure routing, key agreement and secure group communication protocols, assume that all nodes must have pre‐shared a secret, or pre‐obtained public‐key certificates before joining the network. However, this assumption has a practical weakness for some emergency applications, because some nodes without pre‐obtained certificates will be unable to join the network. In this paper, a heterogeneous‐network aided public‐key management scheme for mobile ad hoc networks is proposed to remedy this weakness. Several heterogeneous networks (such as satellite, unmanned aerial vehicle, or cellular networks) provide wider service areas and ubiquitous connectivity. We adopt these wide‐covered heterogeneous networks to design a secure certificate distribution scheme that allows a mobile node without a pre‐obtained certificate to instantly get a certificate using the communication channel constructed by these wide‐covered heterogeneous networks. Therefore, this scheme enhances the security infrastructure of public key management for mobile ad hoc networks. Copyright © 2006 John Wiley & Sons, Ltd.     

Power-Controlled MAC Protocols with Dynamic Neighbor Prediction for Ad hoc Networks

1　IntroductionMobileadhocnetworksareasetofmobilenodeswhichformandself configurethenetworkwithoutthepre deployedcentraladministrativein frastructure (e.g .thebasestationofWLAN) .Thedemandforadhocnetworkshasbeenbloominginthepastyearsinthecommercialandmilitaryappli cations ,becauseonlyadhocnetworkscanbeappliedinthesituationswherethecentraladministrativein frastructurecan tbe pre installed (e .g .battlefields,disasterrescue)orisnoteconomicaltoinstallbecauseoftemporaryuse (e .g .ameetingintherent…     

Energy efficient multi-channel media access control for dense wireless ad hoc and sensor networks

Traditional single-channel MAC protocols for wireless ad hoc and sensor networks favor energy-efficiency over throughput. More recent multi-channel MAC protocols display higher throughput but less energy efficiency. In this article we propose NAMAC, a negotiator-based multi-channel MAC protocol in which specially designated nodes called negotiators maintain the sleeping and communication schedules of nodes within their communication ranges in static wireless ad hoc and sensor networks. Negotiators facilitate the assignation of channels and coordination of communications windows, thus allowing individual nodes to sleep and save energy. We formally define the problem of finding the optimal set of negotiators (i.e., minimizing the number of selected negotiators while maximizing the coverage of the negotiators) and prove that the problem is NP-Complete. Accordingly, we propose a greedy negotiator-election algorithm as part of NAMAC. In addition, we prove the correctness of NAMAC through a rigorous model checking and analyze various characteristics of NAMAC—the throughput of NAMAC, impact of negotiators on network capacity, and storage and computational overhead. Simulation results show that NAMAC, at high network loads, consumes 36 % less energy while providing 25 % more throughput than comparable state-of-art multi-channel MAC protocols for ad hoc networks. Additionally, we propose a lightweight version of NAMAC and show that it outperforms (55 % higher throughput with 36 % less energy) state-of-art MAC protocols for wireless sensor networks.     

移动Ad Hoc网络中一种分布式QoS保证的多址接入协议

基于随机竞争和冲突解决的思想,本文为多跳移动Ad Hoc网络提出了一种分布式服务质量(QoS)保证的多址接入(QMA)协议.该协议中,节点在发送业务分组前利用预报突发进行竞争接入,节点根据业务分组时延情况和最早失效优先原则确定预报突发的长度,所发预报突发能持续到最后的节点优先获得接入.同时,具有实时业务的节点可以按照其优先级在更早的竞争微时隙中开始发送预报突发,而有非实时业务的节点只能在前面竞争微时隙空闲的情况下,才能在后面的微时隙开始发送预报突发,因此发送实时业务的节点可以比发送非实时业务的节点更优先接入信道,从而在移动Ad Hoc网络中实现了对多媒体业务的QoS保证.最后利用OPNET仿真评估了QMA协议的多址性能,并与IEEE 802.11e协议的性能做了比较,结果表明QMA协议可以提供较高的吞吐量和较低的实时业务时延.     

TCP with delayed ack for wireless networks

This paper studies the TCP performance with delayed ack in wireless networks (including ad hoc and WLANs) which use IEEE 802.11 MAC protocol as the underlying medium access control. Our analysis and simulations show that TCP throughput does not always benefit from an unrestricted delay policy. In fact, for a given topology and flow pattern, there exists an optimal delay window size at the receiver that produces best TCP throughput. If the window is set too small, the receiver generates too many acks and causes channel contention; on the other hand, if the window is set too high, the bursty transmission at the sender triggered by large cumulative acks will induce interference and packet losses, thus degrading the throughout. In wireless networks, packet losses are also related to the length of TCP path; when traveling through a longer path, a packet is more likely to suffer interference. Therefore, path length is an important factor to consider when choosing appropriate delay window sizes. In this paper, we first propose an adaptive delayed ack mechanism which is suitable for ad hoc networks, then we propose a more general adaptive delayed ack scheme for ad hoc and hybrid networks. The simulation results show that our schemes can effectively improve TCP throughput by up to 25% in static networks, and provide more significant gain in mobile networks. The proposed schemes are simple and easy to deploy. The real testbed experiments are also presented to verify our approaches. Furthermore, a simple and effective receiver-side probe and detection is proposed to improve friendliness between the standard TCP and our proposed TCP with adaptive delayed ack.     

Efficient routing for wireless mesh networks using a backup path

Wireless mesh networks (WMNs) have a proven record in providing viable solutions for some of the fundamental issues in wireless networks such as capacity and range limitations. WMN infrastructure includes clusters of mobile ad‐hoc networks connected through a fixed backbone of mesh routers. The mesh network can be constrained severely because of various reasons, which could result in performance degradation such as a drop in throughput or long delays. Solutions to this problem often focus on multipath or multichannel extensions to the existing ad‐hoc routing protocols. In this paper, we propose a novel solution by introducing an alternative path to the mesh backbone that traverses the mobile ad‐hoc networks part of the WMN. The new routing solution allows the mobile nodes (MNs) to establish direct communication among peers without going through the backbone. The proposed alternative ad‐hoc path is used only when the mesh backbone is severely constrained. We also propose, for the first time in WMNs, using MNs with two interfaces, one used in the mesh backbone communication and the other engaged in the ad‐hoc network. A scheme is presented for making the MN aware of link quality measures by providing throughput values to the ad‐hoc on‐demand distance vector protocol. We use piggybacking on route reply messages in ad‐hoc on‐demand distance vector to avoid incurring additional costs. We implemented our solution in an OPNET simulator and evaluated its performance under a variety of conditions. Simulation results show that the alternative ad‐hoc path provides higher throughput and lower delays. Delay analysis show that the throughput improvement does not impose additional costs. Copyright © 2012 John Wiley & Sons, Ltd.     

Polarization-based cooperative directional MAC protocol for ad hoc networks

Numerous directional medium access control (DMAC) protocols have been developed to enhance the capacity of ad hoc networks using the underlying advanced physical layer techniques, such as beam-forming, multiuser detection (MUD), and multiple-input–multiple-output (MIMO). In this paper, we propose an innovative fully distributed DMAC protocol that cooperatively makes use of polarization diversity in low-mobility urban/suburban outdoor wireless ad hoc network environment. In the proposed cooperative polarization DMAC protocol (CPDMAC), each node directionally senses on both vertical and horizontal polarizations and dynamically adapts polarization that minimizes overall interference in the ad hoc network. Analysis is performed to establish relationship between vertically and horizontally polarized nodes in the network. Further, a theoretical lower bound is derived for probability of successful transmission to show capacity improvement as a function of cross polarization ratio (CPR). Simulation results confirm from 2% up to 400% improvement in average node throughput at data rate of 1.95 Mbps when compared to the traditional DMAC protocol. Moreover, our study clearly shows that the average throughput difference increases with increasing node density when compared to the traditional DMAC protocol.