Quality-of-Service Routing Using Path and Power Aware Techniques in Mobile Ad Hoc Networks

Mobile ad hoc network (MANET) is a collection of wireless mobile hosts dynamically forming a temporary network without the aid of any existing established infrastructure. Quality of service (QoS) is a set of service requirements that needs to be met by the network while transporting a packet stream from a source to its destination. QoS support MANETs is a challenging task due to the dynamic topology and limited resources. The main objective of this paper is to enhance the QoS routing for MANET using temporally ordered routing algorithm (TORA) with self-healing and optimized routing techniques (SHORT). SHORT improves routing optimality by monitoring routing paths continuously and redirecting the path whenever a shortcut path is available. In this paper, the performance comparison of TORA and TORA with SHORT has been analyzed using network simulator for various parameters. TORA with SHORT enhances performance of TORA in terms of throughput, packet loss, end-to-end delay, and energy

CONNECTION SURVIVAL USING POSITION-BASED ROUTING IN MOBILE AD HOC NETWORKS

Connection Survival using Position-Based Routing in Mobile Ad Hoc Networks Abedalmotaleb Zadin Concordia University, 2015 Mobile ad hoc networks (MANETs) have witnessed a tremendous growth in the recent years thanks to technological advancements and energy saving techniques that have made possible the creation of autonomous mobile communicating systems. Still, MANETs face many challenges in terms of stability, power consumption and quality of service. Typically, stability is assured through the use of reliable communication channels protected by failure recovery protocols. In this thesis, we examine the stability problem by the elaboration of new position based routing algorithms that maintain stable connections between nodes in MANETs. The positions of the nodes are updated by the regular beacon broadcasts. Specifically, we have extended the backup path mechanism used by Yang et al.'s 2011 Greedy- Based stable multi-path Routing protocol (GBR), that have been recently used in MANETs. In terms of stability alone, our algorithms have explored using more general backup paths; re-establishing broken paths from the last reachable node; or using a conservative range for neighbor next-hop selection. The latter protocol (GBR-CNR), using a Conservative Neighborhood Range (CNR), is the most efficient in simulations. To be able to accommodate energy constraints typical in MANETs, we study energy efficient variations of these stable position-based routing algorithms. We study the use of Dynamic Transmission Ranges (DTR) or energy-aware neighbor next-hop selection, such as the LEARN algorithm, to assure energy efficiency while preserving connection stability. Out of all the algorithms considered, the combination of CNR and DTR, GBR-CNR-DTR, outperforms the rest in simulation. Concerning the Quality of Service (QoS), we consider variations of GBR-CNR that improve QoS through the reduction of interference that affect the quality of communications. We develop stable communication protocols that mitigate interference between mobile nodes by minimizing the number of corrupted packets through the use of different techniques such as defining new methods to choose the hereafter hop in a communication process. Overall, this thesis presents several new stable position-based routing algorithms that improve energy consumption and QoS in MANETs. Several of the introduced algorithms are shown to have better capabilities than previously published algorithms as demonstrated in the simulation results

QoS routing in ad-hoc networks using GA and multi-objective optimization

Much work has been done on routing in Ad-hoc networks, but the proposed routing solutions only deal with the best effort data traffic. Connections with Quality of Service (QoS) requirements, such as voice channels with delay and bandwidth constraints, are not supported. The QoS routing has been receiving increasingly intensive attention, but searching for the shortest path with many metrics is an NP-complete problem. For this reason, approximated solutions and heuristic algorithms should be developed for multi-path constraints QoS routing. Also, the routing methods should be adaptive, flexible, and intelligent. In this paper, we use Genetic Algorithms (GAs) and multi-objective optimization for QoS routing in Ad-hoc Networks. In order to reduce the search space of GA, we implemented a search space reduction algorithm, which reduces the search space for GAMAN (GA-based routing algorithm for Mobile Ad-hoc Networks) to find a new route. We evaluate the performance of GAMAN by computer simulations and show that GAMAN has better behaviour than GLBR (Genetic Load Balancing Routing).Peer ReviewedPostprint (published version

A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks

This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks. The objective of a multicast routing protocol for MANETs is to support the propagation of data from a sender to all the receivers of a multicast group while trying to use the available bandwidth efficiently in the presence of frequent topology changes. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Secure multicast routing plays a significant role in MANETs. However, offering energy efficient and secure multicast routing is a difficult and challenging task. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and use different mechanismsComment: 15 page

Robotic Wireless Sensor Networks

In this chapter, we present a literature survey of an emerging, cutting-edge, and multi-disciplinary field of research at the intersection of Robotics and Wireless Sensor Networks (WSN) which we refer to as Robotic Wireless Sensor Networks (RWSN). We define a RWSN as an autonomous networked multi-robot system that aims to achieve certain sensing goals while meeting and maintaining certain communication performance requirements, through cooperative control, learning and adaptation. While both of the component areas, i.e., Robotics and WSN, are very well-known and well-explored, there exist a whole set of new opportunities and research directions at the intersection of these two fields which are relatively or even completely unexplored. One such example would be the use of a set of robotic routers to set up a temporary communication path between a sender and a receiver that uses the controlled mobility to the advantage of packet routing. We find that there exist only a limited number of articles to be directly categorized as RWSN related works whereas there exist a range of articles in the robotics and the WSN literature that are also relevant to this new field of research. To connect the dots, we first identify the core problems and research trends related to RWSN such as connectivity, localization, routing, and robust flow of information. Next, we classify the existing research on RWSN as well as the relevant state-of-the-arts from robotics and WSN community according to the problems and trends identified in the first step. Lastly, we analyze what is missing in the existing literature, and identify topics that require more research attention in the future