On-demand Multipath Routing Protocols for Mobile Ad-Hoc Networks: A Comparative Survey

A Mobile Ad Hoc Network (MANET) is an infrastructure-less, self-organized and multi-hop network with a rapidly changing topology causing the wireless links to be broken at any time. Routing in such a network is challenging due to the mobility of its nodes and the challenge becomes more difficult when the network size increases. Due to the limited capacity of a multi-hop path and the high dynamics of wireless links, the single-path routing approach is unable to provide efficient high data rate transmission in MANETs. The multipath routing is the routing technique of using multiple alternative paths through a network. Furthermore, whenever a link failure is detected on a primary route, the source node can select the optimal route among multiple available routes. Therefore, the multipath routing approach is broadly utilized as one of the possible solutions to overcome the single-path limitation. Most of the multipath routing protocols are based on Ad Hoc On-Demand Distance Vector (AODV). The objective of this paper is to provide a survey and compare sets of multipath routing protocols for mobile ad-hoc networks. This survey will motivate the design of new multipath routing protocols, which overcome the weaknesses identified in this paper

Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks

This book presents collective works published in the recent Special Issue (SI) entitled "Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks”. These works expose the readership to the latest solutions and techniques for MANETs and VANETs. They cover interesting topics such as power-aware optimization solutions for MANETs, data dissemination in VANETs, adaptive multi-hop broadcast schemes for VANETs, multi-metric routing protocols for VANETs, and incentive mechanisms to encourage the distribution of information in VANETs. The book demonstrates pioneering work in these fields, investigates novel solutions and methods, and discusses future trends in these field

ACO-based routing algorithms for wireless mesh networks

The popularity of Wireless Mesh Networks (WMNs) is growing exponentially in recent years, due to their flexible deployment and compatible communication features. As a key technology for next-generation wireless networking, WMNs promise an attractive future to both academic and industrial world. However, current WMNs are short in optimal routing protocols. Instead, many WMNs use the routing algorithms from ad hoc networks, which have different network features. Thus, routing becomes the most urgent issue that needs to be solved. In this thesis, routing problems in WMNs are discussed in different aspects, and then several proposed solutions in state-of-the-art are introduced with their advantages and disadvantages. Ant-In-Mesh routing protocol and the enhanced version are proposed for WMNs, inspired by traditional Ant Colony Optimization (ACO) algorithm, to deal with new challenging characters of WMNs. Periodical Mesh update is performed between neighbors, to keep the network alive. With these updated information at all the hosts, various Ants can collect the fresh routing data while they are launched for different purposes, also, the per-hop and end-to-end routing metrics can be calculated. Upon new connection requests, route discovery is carried out. After the routes are set up, proactive route maintenance is performed on each route. Several popular routing protocols and our algorithms are simulated. and compared using Qualnet. The simulation results show that our algorithms outperform the others, in terms of packet delivery ratio and end-to-end delay, as the mobility and network size increase

A cross-layer middleware architecture for time and safety critical applications in MANETs

Mobile Ad hoc Networks (MANETs) can be deployed instantaneously and adaptively, making them highly suitable to military, medical and disaster-response scenarios. Using real-time applications for provision of instantaneous and dependable communications, media streaming, and device control in these scenarios is a growing research field. Realising timing requirements in packet delivery is essential to safety-critical real-time applications that are both delay- and loss-sensitive. Safety of these applications is compromised by packet loss, both on the network and by the applications themselves that will drop packets exceeding delay bounds. However, the provision of this required Quality of Service (QoS) must overcome issues relating to the lack of reliable existing infrastructure, conservation of safety-certified functionality. It must also overcome issues relating to the layer-2 dynamics with causal factors including hidden transmitters and fading channels. This thesis proposes that bounded maximum delay and safety-critical application support can be achieved by using cross-layer middleware. Such an approach benefits from the use of established protocols without requiring modifications to safety-certified ones. This research proposes ROAM: a novel, adaptive and scalable cross-layer Real-time Optimising Ad hoc Middleware framework for the provision and maintenance of performance guarantees in self-configuring MANETs. The ROAM framework is designed to be scalable to new optimisers and MANET protocols and requires no modifications of protocol functionality. Four original contributions are proposed: (1) ROAM, a middleware entity abstracts information from the protocol stack using application programming interfaces (APIs) and that implements optimisers to monitor and autonomously tune conditions at protocol layers in response to dynamic network conditions. The cross-layer approach is MANET protocol generic, using minimal imposition on the protocol stack, without protocol modification requirements. (2) A horizontal handoff optimiser that responds to time-varying link quality to ensure optimal and most robust channel usage. (3) A distributed contention reduction optimiser that reduces channel contention and related delay, in response to detection of the presence of a hidden transmitter. (4) A feasibility evaluation of the ROAM architecture to bound maximum delay and jitter in a comprehensive range of ns2-MIRACLE simulation scenarios that demonstrate independence from the key causes of network dynamics: application setting and MANET configuration; including mobility or topology. Experimental results show that ROAM can constrain end-to-end delay, jitter and packet loss, to support real-time applications with critical timing requirements

Signaling and Reciprocity:Robust Decentralized Information Flows in Social, Communication, and Computer Networks

Complex networks exist for a number of purposes. The neural, metabolic and food networks ensure our survival, while the social, economic, transportation and communication networks allow us to prosper. Independently of the purposes and particularities of the physical embodiment of the networks, one of their fundamental functions is the delivery of information from one part of the network to another. Gossip and diseases diffuse in the social networks, electrochemical signals propagate in the neural networks and data packets travel in the Internet. Engineering networks for robust information flows is a challenging task. First, the mechanism through which the network forms and changes its topology needs to be defined. Second, within a given topology, the information must be routed to the appropriate recipients. Third, both the network formation and the routing mechanisms need to be robust against a wide spectrum of failures and adversaries. Fourth, the network formation, routing and failure recovery must operate under the resource constraints, either intrinsic or extrinsic to the network. Finally, the autonomously operating parts of the network must be incentivized to contribute their resources to facilitate the information flows. This thesis tackles the above challenges within the context of several types of networks: 1) peer-to-peer overlays – computers interconnected over the Internet to form an overlay in which participants provide various services to one another, 2) mobile ad-hoc networks – mobile nodes distributed in physical space communicating wirelessly with the goal of delivering data from one part of the network to another, 3) file-sharing networks – networks whose participants interconnect over the Internet to exchange files, 4) social networks – humans disseminating and consuming information through the network of social relationships. The thesis makes several contributions. Firstly, we propose a general algorithm, which given a set of nodes embedded in an arbitrary metric space, interconnects them into a network that efficiently routes information. We apply the algorithm to the peer-to-peer overlays and experimentally demonstrate its high performance, scalability as well as resilience to continuous peer arrivals and departures. We then shift our focus to the problem of the reliability of routing in the peer-to-peer overlays. Each overlay peer has limited resources and when they are exhausted this ultimately leads to delayed or lost overlay messages. All the solutions addressing this problem rely on message redundancy, which significantly increases the resource costs of fault-tolerance. We propose a bandwidth-efficient single-path Forward Feedback Protocol (FFP) for overlay message routing in which successfully delivered messages are followed by a feedback signal to reinforce the routing paths. Internet testbed evaluation shows that FFP uses 2-5 times less network bandwidth than the existing protocols relying on message redundancy, while achieving comparable fault-tolerance levels under a variety of failure scenarios. While the Forward Feedback Protocol is robust to message loss and delays, it is vulnerable to malicious message injection. We address this and other security problems by proposing Castor, a variant of FFP for mobile ad-hoc networks (MANETs). In Castor, we use the same general mechanism as in FFP; each time a message is routed, the routing path is either enforced or weakened by the feedback signal depending on whether the routing succeeded or not. However, unlike FFP, Castor employs cryptographic mechanisms for ensuring the integrity and authenticity of the messages. We compare Castor to four other MANET routing protocols. Despite Castor's simplicity, it achieves up to 40% higher packet delivery rates than the other protocols and recovers at least twice as fast as the other protocols in a wide range of attacks and failure scenarios. Both of our protocols, FFP and Castor, rely on simple signaling to improve the routing robustness in peer-to-peer and mobile ad-hoc networks. Given the success of the signaling mechanism in shaping the information flows in these two types of networks, we examine if signaling plays a similar crucial role in the on-line social networks. We characterize the propagation of URLs in the social network of Twitter. The data analysis uncovers several statistical regularities in the user activity, the social graph, the structure of the URL cascades as well as the communication and signaling dynamics. Based on these results, we propose a propagation model that accurately predicts which users are likely to mention which URLs. We outline a number of applications where the social network information flow modelling would be crucial: content ranking and filtering, viral marketing and spam detection. Finally, we consider the problem of freeriding in peer-to-peer file-sharing applications, when users can download data from others, but never reciprocate by uploading. To address the problem, we propose a variant of the BitTorrent system in which two peers are only allowed to connect if their owners know one another in the real world. When the users know which other users their BitTorrent client connects to, they are more likely to cooperate. The social network becomes the content distribution network and the freeriding problem is solved by leveraging the social norms and reciprocity to stabilize cooperation rather than relying on technological means. Our extensive simulation shows that the social network topology is an efficient and scalable content distribution medium, while at the same time provides robustness to freeriding

Telecommunications Networks

This book guides readers through the basics of rapidly emerging networks to more advanced concepts and future expectations of Telecommunications Networks. It identifies and examines the most pressing research issues in Telecommunications and it contains chapters written by leading researchers, academics and industry professionals. Telecommunications Networks - Current Status and Future Trends covers surveys of recent publications that investigate key areas of interest such as: IMS, eTOM, 3G/4G, optimization problems, modeling, simulation, quality of service, etc. This book, that is suitable for both PhD and master students, is organized into six sections: New Generation Networks, Quality of Services, Sensor Networks, Telecommunications, Traffic Engineering and Routing

Mobility Management and Congestion Control in Wireless Mesh Networks

Today, wireless mesh networks are increasingly popular. In order to be better adapted to the increasing number of offered services in telecommunications, many Quality of Service (QoS) problems are being considered. Some of the important issues are: admission control, congestion control, and handoff management of the network. Our research focuses on those issues individually and combining them together in order to find solutions to enhance the quality of service provided to each user as demanded in their SLA. A novel Markov Decision-based Admission Control and Routing (MDACR) algorithm is proposed. The MDACR algorithm finds a sub-optimal solution using the value iteration method. Admission rate increases for both types of user associations (handoff and new user association request), which is addressed by a proposed multi-homing admission and routing algorithm. This algorithm associates the user with two different access points. This is beneficial in a highly congested network, which permits a new routing metric to assure seamless handoff in the network. When a user is moving, MDACR algorithm finds a maximally jointed route with the old route, which decreases the handoff delay. Another aspect is considered in order to improve the QoS in WMN, which is the congestion control, a novel proactive approach is proposed. Where a Variable Order Markov (VOM) prediction model is introduced to predict the congestion status in each link in the network, a new route is established for the traffic based on the output of the VOM model, and the transmission rate is adjusted based on the link congestion status to increase the overall user satisfaction. Sub-optimal model is introduced and solved using Lagrange method. Based on the predicted link congestion, rerouting algorithm is implemented in order to insure load balancing and to mitigate congestion over WMN network. Our ultimate goal is to improve the QoS in WMN by dealing individually with the issues stated above and try to combine them together and provide QoS framework which deals with many types of services

An Investigation into Trust and Reputation Frameworks for Autonomous Underwater Vehicles

As Autonomous Underwater Vehicles (AUVs) become more technically capable and economically feasible, they are being increasingly used in a great many areas of defence, commercial and environmental applications. These applications are tending towards using independent, autonomous, ad-hoc, collaborative behaviour of teams or fleets of these AUV platforms. This convergence of research experiences in the Underwater Acoustic Network (UAN) and Mobile Ad-hoc Network (MANET) fields, along with the increasing Level of Automation (LOA) of such platforms, creates unique challenges to secure the operation and communication of these networks. The question of security and reliability of operation in networked systems has usually been resolved by having a centralised coordinating agent to manage shared secrets and monitor for misbehaviour. However, in the sparse, noisy and constrained communications environment of UANs, the communications overheads and single-point-of-failure risk of this model is challenged (particularly when faced with capable attackers). As such, more lightweight, distributed, experience based systems of “Trust” have been proposed to dynamically model and evaluate the “trustworthiness” of nodes within a MANET across the network to prevent or isolate the impact of malicious, selfish, or faulty misbehaviour. Previously, these models have monitored actions purely within the communications domain. Moreover, the vast majority rely on only one type of observation (metric) to evaluate trust; successful packet forwarding. In these cases, motivated actors may use this limited scope of observation to either perform unfairly without repercussions in other domains/metrics, or to make another, fair, node appear to be operating unfairly. This thesis is primarily concerned with the use of terrestrial-MANET trust frameworks to the UAN space. Considering the massive theoretical and practical difference in the communications environment, these frameworks must be reassessed for suitability to the marine realm. We find that current single-metric Trust Management Frameworks (TMFs) do not perform well in a best-case scaling of the marine network, due to sparse and noisy observation metrics, and while basic multi-metric communications-only frameworks perform better than their single-metric forms, this performance is still not at a reliable level. We propose, demonstrate (through simulation) and integrate the use of physical observational metrics for trust assessment, in tandem with metrics from the communications realm, improving the safety, security, reliability and integrity of autonomous UANs. Three main novelties are demonstrated in this work: Trust evaluation using metrics from the physical domain (movement/distribution/etc.), demonstration of the failings of Communications-based Trust evaluation in sparse, noisy, delayful and non-linear UAN environments, and the deployment of trust assessment across multiple domains, e.g. the physical and communications domains. The latter contribution includes the generation and optimisation of cross-domain metric composition or“synthetic domains” as a performance improvement method

Energy-efficient routing algorithms based on swarm intelligence for wireless sensor networks

High efficient routing is an important factor to be considered in the design of limited energy resource Wireless Sensor Networks (WSNs). WSN environment has limited resources in terms of on-board energy, transmission power, processing, and storage, and this prompt for careful resource management and new routing protocol so as to counteract the challenges. This work first introduces the concept of wireless sensor networks, routing in WSNs, and its design factors as they affect routing protocols. Next, a comprehensive review of the most prominent routing protocols in WSN, from the classical routing protocols to swarm intelligence based protocols is presented. From the literature study, it was found that comparing routing protocols in WSNs is currently a very challenging task for protocol designers. Often, much time is required to re-create and re-simulate algorithms from descriptions in published papers to perform the comparison. Compounding the difficulty is that some simulation parameters and performance metrics may not be mentioned. We then see a need in the research community to have standard simulation and performance metrics for comparing different protocols. To this end, we re-simulate different protocols using a Matlab based simulator; Routing Modeling Application Simulation Environment (RMASE), and gives simulation results for standard simulation and performance metrics which we hope will serve as a benchmark for future comparisons for the research community. Also, from the literature study, Energy Efficient Ant-Based Routing (EEABR) protocol was found to be the most efficient protocol due to its low energy consumption and low memory usage in WSNs nodes. Following this efficient protocol, an Improved Energy Efficient Ant-Based Routing (IEEABR) Protocol was proposed. Simulation were performed using Network Simulator-2 (NS-2), and from the results, our proposed algorithm performs better in terms of energy utilization efficiency, average energy of network nodes, and minimum energy of nodes. We further improved on the proposed protocol and simulation performed in another well-known WSNs MATLAB-based simulator; Routing Modeling Application Simulation Environment (RMASE), using static, mobile and dynamic scenario. Simulation results show that the proposed algorithm increases energy efficiency by up to 9% and 64% in converge-cast and target-tracking scenarios, respectively, over the original EEABR and also found to out-perform other four Ant-based routing protocols. We further show how this algorithm could be used for energy management in sensor network in the presence of energy harvesters. However, high number of control packets is generated by the IEEABR due to the proactive nature of its path establishment. As such, a new routing protocol for WSNs that has less control packets due to its on-demand (reactive) nature is proposed. This new routing protocol termed Termite-hill is borrowed from the principles behind the termite’s mode of communication. We first study the foraging principles of a termite colony and utilize the inspirational concepts to develop a distributed, simple and energy-efficient routing protocol for WSNs. We perform simulation studies to compare the behavior and performance of the Termite-hill design with an existing classical and on-demand protocol (AODV) and other Swarm Intelligence (SI) based WSN protocols in both static, dynamic and mobility scenarios of WSN. The simulation results demonstrate that Termite-hill outperforms its competitors in most of the assumed scenarios and metrics with less latency. Further studies show that the current practice in modeling and simulation of wireless sensor network (WSN) environments has been towards the development of functional WSN systems for event gathering, and optimization of the necessary performance metrics using heuristics and intuition. The evaluation and validation are mostly done using simulation approaches and practical implementations. Simulation studies, despite their wide use and merits of network systems and algorithm validation, have some drawbacks like long simulation times, and practical implementation might be cost ineffective if the system is not properly studied before the design. We therefore argue that simulation based validation and practical implementation of WSN systems and environments should be further strengthened through mathematical analysis. To conclude this work and to gain more insight on the behavior of the termite-hill routing algorithm, we developed our modeling framework for WSN topology and information extraction in a grid based and line based randomly distributed sensor network. We strengthen the work with a model of the effect of node mobility on energy consumption of Termite-hill routing algorithm as a function of event success rate and occasional change in topology. The results of our mathematical analysis were also compared with the simulation results