634 research outputs found
Multipath Routing in Wireless Sensor Networks: Survey and Research Challenges
A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks
The design and performance evaluation of a proactive multipath routing protocol for mobile ad hoc networks
Due to unpredictable network topology changes, routing in Mobile Ad Hoc Networks
(MANET) is an important and challenging research area. The routing protocol
should detect and maintain a good route(s) between source and destination nodes in
these dynamic networks. Many routing protocols have been proposed for mobile ad
hoc networks, and none can be considered as the best under all conditions.
This thesis presents the design and implementation of a new proactive multipath
MANET routing protocol. The protocol, named Multipath Destination Sequenced
Distance Vector (MDSDV), is based on the well known single path Destination Sequenced
Distance Vector (DSDV). We show that the protocol finds node-disjoint
paths, i.e., paths which do not have any nodes in common, except for the source
and the destination.
The thesis presents a systematic evaluation of MDSDV in comparison with three
well known protocols: one proactive (DSDV), and two reactive (AODV) and (DSR).
MDSDV behaves very well in terms of its packet delivery fraction and data dropped in
both static and dynamic networks. It delivers nearly 100% of data in dense networks
(networks with more than 20 nodes). The speed of the nodes and the number of
sources have a low impact on its performance
Improving routing performance of multipath ad hoc on-demand distance vector in mobile add hoc networks.
The aim of this research is to improve routing fault tolerance in Mobile Ad hoc Networks (MANETs) by optimising mUltipath routing in a well-studied reactive and single path routing protocol known as Ad hoc On-demand Distance Vector (AODV). The research also aims to prove the effect of varying waiting time of Route Reply (RREP) procedure and utilising the concept of efficient routes on the performance of multipath extensions to AODV. Two novel multipath routing approaches are developed in this thesis as new extensions to AODV to optimise routing overhead by improving Route Discovery Process (RDP) and Route Maintenance Process (RMP) of multipath AODV. The first approach is a Iinkdisjoint multipath extension called 'Thresho)d efficient Routes in multipath AODV' (TRAODV) that optimises routing packets ~verhead by improving the RDP of AODV which is achieved by detecting the waiting time required for RREP procedure to receive a threshold number of efficient routes. The second approach is also a link-disjoint mUltipath extension called 'On-demand Route maintenance in Multipath AoDv' (ORMAD) which is an extension to TRAODV that optimises routing packets and delay overhead by improving the RMP of TRAODV. ORMAD applies the concepts of threshold waiting time and efficient routes to both phases RDP and RMP. It also applies RMP only to efficient routes which are selected in the RDP and when a route fails, it invokes a local repair procedure between upstream and downstream nodes of the broken link. This mechanism produces a set of alternative subroutes with less number of hops which enhances route efficiency and consequently minimises the routing overhead. TRAODV and ORMAD are implemented and evaluated against two existing multipath extensions to,AODV protocol and two traditional multipath protocols. The existing extensions to AODV used in the evaluation are a well-known protocol called Ad hoc On-demand Multipath Distance Vector (AOMDV) and a recent extension called Multiple Route AODV (MRAODV) protocol which is extended in this thesis to the new approach TRAODV while the traditional multipath protocols used in the evaluation are Dynamic Source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA). Protocols are implemented using NS2 and evaluated under the same simulation environment in terms of four performance metrics; packet delivery fraction, average end-to-end delay, routing packets overhead, and throughput. Simulation results of TRAODV evaluation show that the average number of routes stored in a routing table of MRAODV protocol is always larger than the average number of routes in TRAODV. Simulation results show that TRAODV reduces the overall routing packets overhead compared to both extensions AOMDV and MRAODV, especially for large network size and high mobility. A vital drawback of TRAODV is that its performance is reduced compared to AOMDV and MRAODV in terms of average end-to-end delay. Additionally, TORA still outperforms TRAODV and the other extensions to AODV in terms of routing packets overhead. In order to overcome the drawbacks of TRAODV, ORMAD is developed by improving the RDP of TRAODV. The performance of ORMAD is evaluated against RREP waiting time using the idea of utilising the efficient routes in both phases RDP and RMP. Simulation results of ORMAD show that the performance is affected by varying the two RREP waiting times of both RDP and RMP in different scenarios. As shown by the simulation results, applying the short and long waiting times in both phases tends to less performance in terms of routing packets overhead while applying the moderate waiting times tends to better performance. ORMAD enhances routing packets overhead and the average end-to-end delay compared to TRAODV, especially in high mobility scenarios. ORMAD has the closest performance to TORA protocol in terms of routing packets overhead compared to ~M~a~M~OW . Relevant concepts are formalised for ORMAD approach and conducted as an analytical model in this thesis involving the\vhole process of multipath routing in AODV extensions. ORMAD analytical model describes how the two phases RDP and RMP interact with each other with regard to two performance metrics; total number of detected routes and Route Efficiency.EThOS - Electronic Theses Online ServiceGBUnited Kingdo
Mobile Ad-Hoc Networks
Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of-the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: quality-of-service and video communication, routing protocol and cross-layer design. A few interesting problems about security and delay-tolerant networks are also discussed. This book is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks
Multipath Routing in VANET: Multi-Agent based Approach
In VANET routing of data is a exciting task owing to the high dynamics involved in this network. Delivery of data to the projected destination turns out to be very puzzling. Single path routing suffers from drawbacks like unreliability and etc. To manage such situation multipath data delivery is very nominal. In multipath routing more than one path discovered between source and destination node. Data packet can be sent simultaneously in all paths or data packet can be send by selecting path one after another. It is up to the routing algorithm to select path thoughtfully to deliver data proficiently. However existing multipath routing protocols even though compute multipath, only one path will be engaged in actual communication at any given time. Hence this work proposes Multipath Routing in VANET: Multi-agent based Approach which calculates multiple paths amongst source and destination. Further, all such computed paths will be employed for information dissemination. NS2 simulation of the proposed approach in realistic mobility models show that it can select more stable link and improve the network performance
Load Balancing in MANET: Alleviating the center node
Load balancing is an essential requirement of any multi-hop wireless network. A wireless routing protocol is accessed on its ability to distribute traffic over the network nodes and a good routing protocol achieves this without introducing un- acceptable delay. The most obvious benefitt is manifested in increasing the life of a battery operated node which can eventually increase the longevity of the en- tire network. In the endeavor of finding the shortest distance between any two nodes to transmit data fast the center nodes become the famous picks. The centrally located nodes connect many sub networks and serve as gateways to some sub networks that become partitioned from the rest of the network in its absence. Thus, the lifetime of the center nodes become a bottleneck for connectivity of a sub network prior to its partition from the rest of the network. An unbiased load can cause congestion in the network which impacts the overall throughput, packet delivery ratio and the average end to end delay. In, this thesis we have mitigated the unbiased load distribution on centrally located nodes by pushing traffic further to the peripheral nodes without compromising the average end to end delay for a greater network longevity and performances. We proposed a novel routing metric , load and a minimization criterion to decide a path that involves nodes with less load burden on them. The simulations of the proposed mechanism run on NS-2.34 for 16 and 50 nodes have revealed an average 2.26% reduction of load on the center node in comparison with AOMDV. . .
Mobility in wireless sensor networks : advantages, limitations and effects
The primary aim of this thesis is to study the benefits and limitations of using a mobile base station for data gathering in wireless sensor networks. The case of a single mobile base station and mobile relays are considered.
A cluster-based algorithm to determine the trajectory of a mobile base station for data gathering within a specified delay time is presented. The proposed algorithm aims for an equal number of sensors in each cluster in order to achieve load balance among the cluster heads. It is shown that there is a tradeoff between data-gathering delay and balancing energy consumption among sensor nodes. An analytical solution to the problem is provided in terms of the speed of the mobile base station. Simulation is performed to evaluate the performance of the proposed algorithm against the static case and to evaluate the distribution of energy consumption among the cluster heads. It is demonstrated that the use of clustering with a mobile base station can improve the network lifetime and that the proposed algorithm balances energy consumption among cluster heads. The effect of the base station velocity on the number of packet losses is studied and highlights the limitation of using a mobile base station for a large-scale network.
We consider a scenario where a number of mobile relays roam through the sensing field and have limited energy resources that cannot reach each other directly. A routing scheme based on the multipath protocol is proposed, and explores how the number of paths and spread of neighbour nodes used by the mobile relays to communicate affects the network overhead. We introduce the idea of allowing the source mobile relay to cache multiple routes to the destination through its neighbour nodes in order to provide redundant paths to destination. An analytical model of network overhead is developed and verified by simulation. It is shown that the desirable number of routes is dependent on the velocity of the mobile relays. In most cases the network overhead is minimized when the source mobile relay caches six paths via appropriately distributed neighbours at the destination.
A new technique for estimating routing-path hop count is also proposed. An analytical model is provided to estimate the hop count between source-destination pairs in a wireless network with an arbitrary node degree when the network nodes are uniformly distributed in the sensing field. The proposed model is a significant improvement over existing models, which do not correctly address the low-node density situation
TCP performance enhancement over wireless mesh networks by means of the combination of multi-RAT devices and the MPTCP protocol
The last trends at communications realms, in particular, wireless technologies, where it is more and more usual that devices carry more than one interface (i.e. multi-RAT, Radio Access Technology), to get access to the Internet, question the classic single-path paradigm, imposed by the mainstream transport protocol, TCP. In this work we assess the behavior of Multipath TCP (MPTCP), which allows the transparent breakdown of a single TCP session into multiple simultaneous subflows. This straightforward feature might lead to remarkable performance enhancements, yielding as well a stronger resilience against failures within any of the routes. Moreover, we evaluate three different routing algorithms (link, node and zone disjoint) that aim to discover the optimal route configuration of disjoint paths over a Wireless Mesh Network (WMN), exploiting the possibilities arisen by this brand new protocol. We use the obtained results to evaluate, by means of simulation, the behavior of the MPTCP protocol, showing that the aggregated performance is significatively higher than that of achieved by the traditional single-path and single-flow TCP.The authors would like to express their gratitude to the Spanish government for its funding in
the project âConnectivity as a Service: Access for the Internet of the Futureâ, COSAIF (TEC2012-38574-C02-01)
Routing Protocols for Underwater Acoustic Sensor Networks: A Survey from an Application Perspective
Underwater acoustic communications are different from terrestrial radio communications; acoustic channel is asymmetric and has large and variable endâtoâend propagation delays, distanceâdependent limited bandwidth, high bit error rates, and multiâpath fading. Besides, nodesâ mobility and limited battery power also cause problems for networking protocol design. Among them, routing in underwater acoustic networks is a challenging task, and many protocols have been proposed. In this chapter, we first classify the routing protocols according to application scenarios, which are classified according to the number of sinks that an underwater acoustic sensor network (UASN) may use, namely singleâsink, multiâsink, and noâsink. We review some typical routing strategies proposed for these application scenarios, such as crossâlayer and reinforcement learning as well as opportunistic routing. Finally, some remaining key issues are highlighted
Multipath routing and QoS provisioning in mobile ad hoc networks
PhDA Mobile Ad Hoc Networks (MANET) is a collection of mobile nodes that can
communicate with each other using multihop wireless links without utilizing any
fixed based-station infrastructure and centralized management. Each mobile node
in the network acts as both a host generating flows or being destination of flows
and a router forwarding flows directed to other nodes.
Future applications of MANETs are expected to be based on all-IP
architecture and be capable of carrying multitude real-time multimedia
applications such as voice and video as well as data. It is very necessary for
MANETs to have an efficient routing and quality of service (QoS) mechanism to
support diverse applications.
This thesis proposes an on-demand Node-Disjoint Multipath Routing protocol
(NDMR) with low broadcast redundancy. Multipath routing allows the
establishment of multiple paths between a single source and single destination
node. It is also beneficial to avoid traffic congestion and frequent link breaks in
communication because of the mobility of nodes. The important components of
the protocol, such as path accumulation, decreasing routing overhead and
selecting node-disjoint paths, are explained. Because the new protocol
significantly reduces the total number of Route Request packets, this results in an
increased delivery ratio, smaller end-to-end delays for data packets, lower control
overhead and fewer collisions of packets.
Although NDMR provides node-disjoint multipath routing with low route
overhead in MANETs, it is only a best-effort routing approach, which is not
enough to support QoS. DiffServ is a standard approach for a more scalable way
to achieve QoS in any IP network and could potentially be used to provide QoS
in MANETs because it minimises the need for signalling. However, one of the
biggest drawbacks of DiffServ is that the QoS provisioning is separate from the
routing process. This thesis presents a Multipath QoS Routing protocol for
iv
supporting DiffServ (MQRD), which combines the advantages of NDMR and
DiffServ. The protocol can classify network traffic into different priority levels
and apply priority scheduling and queuing management mechanisms to obtain
QoS guarantees
- âŠ