Research on Quality of Service Based Routing Protocols for Mobile Ad Hoc Networks

Quality of service (QoS) based routing protocols play a significant role in MANETs to maintain proper flow of data with efficient power consumption and without data loss. However, several network resource based technical challenges or issues are encountered in the design and implementation of QoS routing protocols that perform their routing function by considering the shortest route or the lowest cost. Furthermore, a secondary route is not reserved and alternative routes are not searched unless the established route is broken. The current structures of the state-of-the-art protocols for MANETs are not appropriate for today's high bandwidth and mobility requirements. Therefore, research on new routing protocols is needed, considering energy level, coverage, location, speed, movement, and link stability instead of only shortest path and lowest cost. This paper summarizes the main characteristics of QoS-based routing protocols to facilitate researchers to design and select QoS-based routing protocols. In this study, a wide range of protocols with their characteristics were classified according to QoS routing strategy, routing information update mechanism, interaction between network and MAC layer, QoS constraints, QoS guarantee type and number of discovered routes. In addition, the protocols were compared in terms of properties, design features, challenges and QoS metrics

Reliable on-demand routing protocols for mobile ad-hoc networks

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University London.Mobile Ad-Hoc Network (MANET) facilitates the creation of dynamic reconfigurable networks, without centralized infrastructure. MANET routing protocols have to face high challenges like link instability, node mobility, frequently changing topologies and energy consumption of node, due to these challenges routing becomes one of the core issues in MANETs. This Thesis mainly focuses on the reactive routing protocol such as Ad-Hoc On-Demand Distance Vector (AODV) routing protocol. Reliable and Efficient Reactive Routing Protocol (RERRP) for MANET has been proposed to reduce the link breakages between the moving nodes. This scheme selects a reliable route using Reliability Factor (RF); the RF considers Route Expiration Time and Hop Count to select a routing path with high reliability and have less number of hops. The simulation result shows that RERRP outperforms AODV and enhance the packet delivery fraction (PDF) by around 6% and reduces the network routing load (NRL) by around 30%. Broadcasting in MANET could cause serious redundancy, contention, and collision of the packets. A scheme, Effective Broadcast Control Routing Protocol (EBCRP) has been proposed for the controlling of broadcast storm problem in a MANET. The EBCRP is mainly selects the reliable node while controlling the redundant re-broadcast of the route request packet. The proposed algorithm EBCRP is an on-demand routing protocol, therefore AODV route discovery mechanism was selected as the base of this scheme. The analysis of the performance of EBCRP has revealed that the EBCRP have controlled the routing overhead significantly, reduces it around 70% and enhance the packet delivery by 13% as compared to AODV. An Energy Sensible and Route Stability Based Routing Protocol (ESRSBR) have also been proposed that mainly focuses on increasing the network lifetime with better packet delivery. The ESRSBR supports those nodes to participate in the data transfer that have more residual energy related to their neighbour nodes. The proposed protocol also keeps track of the stability of the links between the nodes. Finally, the ESRSBR selects those routes which consist of nodes that have more residual energy and have stable links. The comparative analysis of ESRSBR with AODV and recently proposed routing protocol called Link Stability and Energy Aware (LSEA) routing protocol revealed that the proposed protocol ESRSBR has a significantly affect the network lifetime, increases it around 10% and 13% as compared to LSEA and AODV protocols respectively. The ESRSBR also decreases the routing overhead by 22% over LSEA and by 38% over AODV.Higher Education Commission of Pakistan and NED University of Engineering and Technology Karach

Cognitive Radio Assisted OLSR Routing for Vehicular Sensor Networks

AbstractVehicular Sensor Network (VSN) emerged due to recent developments in Wireless Sensor Network (WSN) and functioning as a way for observing metropolitan environments and enabling vehicles to share relevant sensor data to assist safety, convenience and commercial applications. Data dissemination is an important aspect of these networks and requires timely delivery of important sensor information. In VSNs, rapid mobility of the vehicles causes recurrent topography modifications. The possibility of on-demand protocols that makes routing decisions reactively in Vehicular Networks are restricted owing to its structural instability and current routing protocols, operating in a table-driven fashion like OLSR are unable to cope up with the high demands imposed by vehicular applications. Furthermore, sensor data transmissions are accompanied by rapid fluctuations in the convention of licensed spectrum and acquire more number of channels to transmit huge bandwidth data and result in spectrum scarcity. Existing works on OLSR protocol failed to examine spectrum conditions and calculate utilization of channel. Cognitive Radio (CR) is a possible solution for guiding OLSR to discover unused frequency bands and utilize them opportunistically. This paper presents an optimal OLSR routing for efficient data communication using Cognitive Radio enabled Vehicular Sensor Networks (CR-VSNs). The proposed model was tested under simulated traffic of Chennai urban road map. Delay is observed to be minimal for data communications in CR-VSN

Data aggregation in wireless sensor networks

Energy efficiency is an important metric in resource constrained wireless sensor networks (WSN). Multiple approaches such as duty cycling, energy optimal scheduling, energy aware routing and data aggregation can be availed to reduce energy consumption throughout the network. This thesis addresses the data aggregation during routing since the energy expended in transmitting a single data bit is several orders of magnitude higher than it is required for a single 32 bit computation. Therefore, in the first paper, a novel nonlinear adaptive pulse coded modulation-based compression (NADPCMC) scheme is proposed for data aggregation. A rigorous analytical development of the proposed scheme is presented by using Lyapunov theory. Satisfactory performance of the proposed scheme is demonstrated when compared to the available compression schemes in NS-2 environment through several data sets. Data aggregation is achieved by iteratively applying the proposed compression scheme at the cluster heads. The second paper on the other hand deals with the hardware verification of the proposed data aggregation scheme in the presence of a Multi-interface Multi-Channel Routing Protocol (MMCR). Since sensor nodes are equipped with radios that can operate on multiple non-interfering channels, bandwidth availability on each channel is used to determine the appropriate channel for data transmission, thus increasing the throughput. MMCR uses a metric defined by throughput, end-to-end delay and energy utilization to select Multi-Point Relay (MPR) nodes to forward data packets in each channel while minimizing packet losses due to interference. Further, the proposed compression and aggregation are performed to further improve the energy savings and network lifetime --Abstract, page iv