Quality of service on ad-hoc wireless networks

Over the last years, Mobile Ad-hoc Networks (MANETs) have captured the attention of the research community. The flexibility and cost savings they provide, due to the fact that no infrastructure is needed to deploy a MANET, is one of the most attractive possibilities of this technology. However, along with the flexibility, lots of problems arise due to the bad quality of transmission media, the scarcity of resources, etc. Since real-time communications will be common in MANETs, there has been an increasing motivation on the introduction of Quality of Service (QoS) in such networks. However, many characteristics of MANETs make QoS provisioning a difficult problem.In order to avoid congestion, a reservation mechanism that works together with a Connection Admission Control (CAC) seems to be a reasonable solution. However, most of the QoS approaches found in literature for MANETs do not use reservations. One reason for that, is the difficulty on determining the available bandwidth at a node. This is needed to decide whether there are enough resources to accommodate a new connection.This thesis proposes a simple, yet effective, method for nodes in a CSMA-based MANET to compute their available bandwidth in a distributed way. Based on this value, a QoS reservation mechanism called BRAWN (Bandwidth Reservation over Ad-hoc Networks) is introduced for multirate MANETs, allowing bandwidth allocation on a per flow basis. By multirate we refer to those networks where wireless nodes are able to dynamically switch among several link rates. This allows nodes to select the highest possible transmission rate for exchanging data, independently for each neighbor.The BRAWN mechanism not only guarantees certain QoS levels, but also naturally distributes the traffic more evenly among network nodes (i.e. load balancing). It works completely on the network layer, so that no modifications on lower layers are required, although some information about the network congestion state could also be taken into account if provided by the MAC (Medium Access Control) layer. The thesis analyzes the applicability of the proposed reservation mechanism over both proactive and reactive routing protocols, and extensions to such protocols are proposed whenever needed in order to improve their performance on multirate networks. On mobile scenarios, BRAWN also achieves high QoS provisioning levels by letting the nodes to periodically refresh QoS reservations. This extension of the protocol for mobile nodes is referred as BRAWN-R (BRAWN with Refreshments).Summarizing, the outstanding features of the reservation mechanism proposed by this thesis are: (i) Multirate, i.e. it allows wireless nodes to choose among different transmission rates, in order to accommodate to different channel conditions. (ii) Targeted to CSMA-based wireless MAC protocols, e.g. 802.11. (iii) Reservation based, allowing the network nodes to pro-actively protect ongoing QoS flows, and applying an effective CAC. (iv) Adaptive to topology changes introduced by the mobility of the nodes, re-routing QoS flows to more efficient paths. (v) Feasible and simple to implement over existing MANET routing protocols (as it is shown by the prototype presented at the end of the study).Postprint (published version

Mobile Ad Hoc Networks

Guiding readers through the basics of these rapidly emerging networks to more advanced concepts and future expectations, Mobile Ad hoc Networks: Current Status and Future Trends identifies and examines the most pressing research issues in Mobile Ad hoc Networks (MANETs). Containing the contributions of leading researchers, industry professionals, and academics, this forward-looking reference provides an authoritative perspective of the state of the art in MANETs. The book includes surveys of recent publications that investigate key areas of interest such as limited resources and the mobility of mobile nodes. It considers routing, multicast, energy, security, channel assignment, and ensuring quality of service. Also suitable as a text for graduate students, the book is organized into three sections: Fundamentals of MANET Modeling and Simulation—Describes how MANETs operate and perform through simulations and models Communication Protocols of MANETs—Presents cutting-edge research on key issues, including MAC layer issues and routing in high mobility Future Networks Inspired By MANETs—Tackles open research issues and emerging trends Illustrating the role MANETs are likely to play in future networks, this book supplies the foundation and insight you will need to make your own contributions to the field. It includes coverage of routing protocols, modeling and simulations tools, intelligent optimization techniques to multicriteria routing, security issues in FHAMIPv6, connecting moving smart objects to the Internet, underwater sensor networks, wireless mesh network architecture and protocols, adaptive routing provision using Bayesian inference, and adaptive flow control in transport layer using genetic algorithms

Mobile Ad Hoc Networks

Guiding readers through the basics of these rapidly emerging networks to more advanced concepts and future expectations, Mobile Ad hoc Networks: Current Status and Future Trends identifies and examines the most pressing research issues in Mobile Ad hoc Networks (MANETs). Containing the contributions of leading researchers, industry professionals, and academics, this forward-looking reference provides an authoritative perspective of the state of the art in MANETs. The book includes surveys of recent publications that investigate key areas of interest such as limited resources and the mobility of mobile nodes. It considers routing, multicast, energy, security, channel assignment, and ensuring quality of service. Also suitable as a text for graduate students, the book is organized into three sections: Fundamentals of MANET Modeling and Simulation—Describes how MANETs operate and perform through simulations and models Communication Protocols of MANETs—Presents cutting-edge research on key issues, including MAC layer issues and routing in high mobility Future Networks Inspired By MANETs—Tackles open research issues and emerging trends Illustrating the role MANETs are likely to play in future networks, this book supplies the foundation and insight you will need to make your own contributions to the field. It includes coverage of routing protocols, modeling and simulations tools, intelligent optimization techniques to multicriteria routing, security issues in FHAMIPv6, connecting moving smart objects to the Internet, underwater sensor networks, wireless mesh network architecture and protocols, adaptive routing provision using Bayesian inference, and adaptive flow control in transport layer using genetic algorithms

Quality of service aware routing protocols for mobile ad hoc networks

The Ad hoc network is set up with multiple wireless devices without any infrastructure. Its employment is favored in many environments. Thus, many efforts are put on ad hoc networks at both the MAC and routing layers. Meanwhile, QoS aware issues are considered in both MAC and routing layers for ad hoc networks. This thesis work gives a review of ad hoc networks at both the MAC and routing layers. IEEE 802.11 is discussed and routing protocols widely used in ad hoc networks are analyzed and compared. Solutions for QoS aware routing protocols are summarized. Evaluations are presented by doing simulations with both the QAODV and AODV routing protocols. During simulations with NS2, different data rates and node moving speeds are tested in order to see the performance of the QAODV compared with the AODV. The results show that the QAODV outperforms the AODV in terms of end to end delay when traffic on the network is high at the expense of transmitting more routing packets. When the network begins to be saturated, the route discovery and maintenance processes become more important. Not all routes from source to the destination chosen by the AODV routing protocol are suitable for real time traffic transmissions, since there is no QoS considered in the routing protocol, whereas the QAODV which considers QoS shows extremely good results. In addition, prohibiting packets sending from sources to the network when there is no suitable route also helps to prevent wasting the data rate on the network. Thus, from the simulation results and analysis, it can be seen that adding QoS to routing protocols is meaningful to optimize the performance of traffic on the network especially the real time traffic

Estudio del rendimiento de arquitecturas basadas en grupos para WAHSN

[ES] Existen muchos trabajos relacionados con las redes ad hoc y las redes de sensores donde se presentan nuevos protocolos que encaminamiento que aportan mejores características, otros trabajos donde se comparan para ver cual posee un mejor rendimiento ó incluso presentan nuevas aplicaciones basadas en este tipo de redes, pero este trabajo aporta otro punto de vista. ¿Por que no ver la red como un conjunto que se divide en grupos para aportar un mejor rendimiento a la red independientemente del protocolo de encaminamiento utilizado?. Para ello, en este trabajo, vamos a demostrar a través de simulaciones, que la agrupación de nodos en redes WAHSN (Wireless Ad Hoc & Sensor Networks) aporta mejoras a la red en general, disminuyendo el tráfico de encaminamiento, el retardo, el throughput, etc. Este estudio se ha realizado evaluando los protocolos estándar más utilizados (DSR [1], AODV [2] y OLSR [3]), así podemos observar cual de ellos aporta un mejor rendimiento. Finalmente, se propone una arquitectura de red basada en grupos optimizada para las redes WAHSN[EN] There are many works related with ad hoc networks and sensor networks where the authors present new routing protocols with better or enhanced features, others just compare the performance of them or present an application environment, but this work tries to give another point of view. Why don¿t we see the network as a whole and split it intro groups to give better performance to the network regardless of the used routing protocol?. First, we will demonstrate, through simulations, that grouping nodes in WAHSN (Wireless Ad Hoc & Sensor Networks) improves the whole network by diminishing the routing traffic, the delay, the throughput, etc. This study was conducted to assess the most used standard protocols (DSR [1], AODV [2] and OLSR [3]) that gives better performance to the whole network when there are groups of nodes. Finally, a group-based network architecture optimized for WAHSN is proposedGarcía Pineda, M. (2008). Estudio del rendimiento de arquitecturas basadas en grupos para WAHSN. http://hdl.handle.net/10251/13472Archivo delegad

ACODV : Ant Colony Optimisation Distance Vector routing in ad hoc networks

A mobile ad hoc network is a collection of wireless mobile devices which dynamically form a temporary network, without using any existing network infrastructure or centralised administration. Each node in the network effectively becomes a router, and forwards packets towards the packet’s destination node. Ad hoc networks are characterized by frequently changing network topology, multi-hop wireless connections and the need for dynamic, efficient routing protocols. The overarching requirement for low power consumption, as battery powered sensors may be required to operate for years without battery replacement; An emphasis on reliable communication as opposed to real-time communication, it is more important for packets to arrive reliably than to arrive quickly; and Very scarce processing and memory resources, as these sensors are often implemented on small low-power microprocessors. This work provides overviews of routing protocols in ad hoc networks, swarm intelligence, and swarm intelligence applied to ad hoc routing. Various mechanisms that are commonly encountered in ad hoc routing are experimentally evaluated under situations as close to real-life as possible. Where possible, enhancements to the mechanisms are suggested and evaluated. Finally, a routing protocol suitable for such low-power sensor networks is defined and benchmarked in various scenarios against the Ad hoc On-Demand Distance Vector (AODV) algorithm.Dissertation (MSc)--University of Pretoria, 2005.Computer ScienceUnrestricte

TDMAとDCFの組み合わせによるアドホックネットワーク上でのQoS通信の実現方式

　An ad hoc network does not rely on the fixed network infrastructure; it uses a distributed network management method. With the popularity of the smart devices, ad hoc network has received more and more attention, supporting QoS in ad hoc network has become inevitable. Many researches have been done for provision of QoS in ad hoc networks. These researches can be divided into three types.　The first type is contention-based approach which is the most widely used. IEEE 802.11e MAC (media access control) protocol belongs to this type which is an extension of IEEE 802.11 DCF(Distributed Coordination Function). It specifies a procedure to guarantee QoS by providing more transmission opportunities for high priority data. However, since IEEE 802.11eis designed based on the premise that access points are used, when the number of QoS flows increases, packet collisions could occur in multi-hop ad hoc network.　The second type is using TDMA-based approach. The TDMA approach can provide contention-free access for QoS traffics through the appropriate time slot reservation. The current TDMA approaches reserve time slots for both QoS traffics and best-effort traffics. However, it is difficult for TDMA as the only approach to allocating channel access time for best-effort traffics sincet he required bandwidth of the best-effort traffics changes frequently.　We propose a QoS scheme, which takes advantage of both contention-based approach and TDMA-based approach. In the proposed scheme, contention-based approach DCF provides easy and fair channel time for best-effort traffics, and TDMA approach serves the QoS traffics. A time frame structure is designed to manage the bandwidth allocation. A time frame is divided into two periods, specifically the TDMA periods and the DCF periods. The proportion of two periods is decided by QoS traffics. Therefore the QoS traffics are given absolutely higher priority than best-effort traffics. In order to guarantee the transmission of each QoS packet in TDMA period, a time slot assignment algorithm based on QoS data rate has been proposed. The proposed scheme also employs an admission control scheme, which rejects the new QoS user when the channel capacity is reached. In addition, we provide the configuration of the proposed scheme in the mobile environment. The procedures are designed for route changes and new-adding users. 　The proposed scheme is simulated in the QualNet simulator. In the static environment, the performance of the proposed scheme is evaluated in the case of a gradual increase in the number TCP flows and in the case of gradual increase in QoS data rate. Simulation results show that in the static environment the proposed scheme can not only provide effective QoS performance, but also can provide good support for best-effort flows. In the mobile environment, we simulated the performance of the proposed scheme at different moving speed (maximum is 5 Km/h) when the ARF (Auto Rate Fallback) is available. From the simulation results, in a specific mobile environment, the proposed scheme can support the QoS transmission well.電気通信大学201

Design and implementation of an on-demand ad-hoc routing algorithm for a positional communication system.

Thesis (M.Sc.Eng.)-University of Natal, Durban, 2003.A mobile ad-hoc network is an autonomous network of mobile devices that are connected via wireless links. In such networks there is no pre-existing infrastructure and nodes are free to move in a random fashion. Due to this mobility mobile ad-hoc networks have dynamic topologies. A host in the network typically has limited bandwidth and energy resources. Routing is a major challenge in the development of such systems and there have been many solutions proposed in the recent past. The aim of this work is to design and implement a routing scheme for a Positional Communication System (PCS). The PCS is a network of mobile handheld pocket PCs connected via wireless interfaces. The system allows voice and data communication between nodes in the network. This dissertation addresses the process of designing a routing protocol for an ad-hoc network. There have been many proposed algorithms that solve the routing problem in a mobile ad-hoc network. It is a difficult task to compare the performance of'these protocols qualitatively as there are many parameters that affect network performance. Various simulation packages for networks of this type exist. One such package is the Network Simulator (NS-2). It is a discrete time event simulator that can be used to model wired and wireless networks. This dissertation presents NS-2 simulations that compare four recently proposed routing algorithms. From this comparison study it is shown that on-demand algorithms perform best in a mobile ad-hoc environment. The dissertation then describes the design of a novel on-demand routing algorithm. The ondemand algorithms proposed thus far use a blind flooding technique during the route discovery process. This method is inefficient and creates excessive routing overhead. The routing protocol proposed in the dissertation implements a query localization technique that significantly reduces the network traffic. The protocol also introduces a load checking metric in addition to the metric used by most on-demand schemes, namely hop count. Simulation results show that such a scheme makes the on-demand routing algorithm more efficient and scalable than existing ones. It is widely believed that prior to implementing a routing protocol in real world systems it is essential that it is tested and validated on a test-bed. The dissertation presents the implementation of an on-demand routing algorithm in a Positional Communication System test-bed, where each handheld PC in the network runs an embedded Linux operating system

Modeling and simulation of routing protocol for ad hoc networks combining queuing network analysis and ANT colony algorithms

The field of Mobile Ad hoc Networks (MANETs) has gained an important part of the interest of researchers and become very popular in last few years. MANETs can operate without fixed infrastructure and can survive rapid changes in the network topology. They can be studied formally as graphs in which the set of edges varies in time. The main method for evaluating the performance of MANETs is simulation. Our thesis presents a new adaptive and dynamic routing algorithm for MANETs inspired by the Ant Colony Optimization (ACO) algorithms in combination with network delay analysis. Ant colony optimization algorithms have all been inspired by a specific foraging behavior of ant colonies which are able to find, if not the shortest, at least a very good path connecting the colony’s nest with a source of food. Our evaluation of MANETs is based on the evaluation of the mean End-to-End delay to send a packet from source to destination node through a MANET. We evaluated the mean End-to-End delay as one of the most important performance evaluation metrics in computer networks. Finally, we evaluate our proposed ant algorithm by a comparative study with respect to one of the famous On-Demand (reactive) routing protocols called Ad hoc On-Demand Distance Vector (AODV) protocol. The evaluation shows that, the ant algorithm provides a better performance by reducing the mean End-to-End delay than the AODV algorithm. We investigated various simulation scenarios with different node density and pause times. Our new algorithm gives good results under certain conditions such as, increasing the pause time and decreasing node density. The scenarios that are applied for evaluating our routing algorithm have the following assumptions: 2-D rectangular area, no obstacles, bi-directional links, fixed number of nodes operate for the whole simulation time and nodes movements are performed according to the Random Waypoint Mobility (RWM) or the Boundless Simulation Area Mobility (BSAM) model. KEYWORDS: Ant Colony Optimization (ACO), Mobile Ad hoc Network (MANET), Queuing Network Analysis, Routing Algorithms, Mobility Models, Hybrid Simulation

On Design, Evaluation and Enhancement of IP-Based Routing Solutions for Low Power and Lossy Networks

In early 2008, a new IETF Working Group (WG), namely ROLL, was chartered to investigate the suitability of existing IP routing protocols for Low Power Lossy Networks (LLNs), which at the time were suffering compatibility issues due to the pervasive use of proprietary protocols. Given the vision of the Internet of Things (IoT) and the role LLNs would play in the future Internet, the IETF set out to standardize an IPv6 based routing solution for such networks. After surveying existing protocols and determining their unsuitability, the WG started designing a new distance vector protocol called RPL (recently standardized in IETF RFC 6550) to fulfill their charter. Joining the WG efforts, we developed a very detailed RPL simulator and using link and traffic traces for existing networks, contributed with a performance study of the protocol with respect to several metrics of interest, such as path quality, end-to-end delay, control plane overhead, ability to cope with instability, etc. This work was standardized as IETF Informational RFC 6687.This detailed study uncovered performance issues for networks of very large scale. In this thesis, we provide an overview of RPL, summarize our findings from the performance study, analysis and comparison with a reactive lightweight protocol and suggest modifications to the protocol that yield significant performance improvements with respect to control overhead and memory consumption in very large scale networks. For future work, we propose a routing technique, named Hybrid Intelligent Path Computation (HIPC), along with modifications to the original RPL protocol standard, that outperforms solely distributed or centralized routing techniques. Finally, we also show how one can facilitate Quality of Service (QoS), load balancing and traffic engineering provision in the IoT without incurring any extra control overhead in number of packets other than that already consumed by the proposed IETF standard, using a combination of centralized and distributed computation.Ph.D., Computer Science -- Drexel University, 201