603 research outputs found
A fast and reliable broadcast service for LTE-advanced exploiting multihop device-to-device transmissions
Several applications, from the Internet of Things for smart cities to those for vehicular networks, need fast and reliable proximity-based broadcast communications, i.e., the ability to reach all peers in a geographical neighborhood around the originator of a message, as well as ubiquitous connectivity. In this paper, we point out the inherent limitations of the LTE (Long-Term Evolution) cellular network, which make it difficult, if possible at all, to engineer such a service using traditional infrastructure-based communications. We argue, instead, that network-controlled device-to-device (D2D) communications, relayed in a multihop fashion, can efficiently support this service. To substantiate the above claim, we design a proximity-based broadcast service which exploits multihop D2D. We discuss the relevant issues both at the UE (User Equipment), which has to run applications, and within the network (i.e., at the eNodeBs), where suitable resource allocation schemes have to be enforced. We evaluate the performance of a multihop D2D broadcasting using system-level simulations, and demonstrate that it is fast, reliable and economical from a resource consumption standpoint
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 data dissemination in vehicular Ad Hoc networks
Des systĂšmes de transport intelligents (STI) seront Ă©ventuellement fournis dans un proche avenir pour la sĂ©curitĂ© et le confort des personnes lors de leurs dĂ©placements sur les routes. Les rĂ©seaux ad-hoc vĂ©hiculaires (VANETs) reprĂ©sentent l'Ă©lĂ©ment clĂ© des STI. Les VANETs sont formĂ©s par des vĂ©hicules qui communiquent entre eux et avec l'infrastructure. En effet, les vĂ©hicules pourront Ă©changer des messages qui comprennent, par exemple, des informations sur la circulation routiĂšre, les situations d'urgence et les divertissements. En particulier, les messages d'urgence sont diffusĂ©s par des vĂ©hicules en cas d'urgence (p.ex. un accident de voiture); afin de permettre aux conducteurs de rĂ©agir Ă temps (p.ex., ralentir), les messages d'urgence doivent ĂȘtre diffusĂ©s de maniĂšre fiable dans un dĂ©lai trĂšs court. Dans les VANETs, il existe plusieurs facteurs, tels que le canal Ă pertes, les terminaux cachĂ©s, les interfĂ©rences et la bande passante limitĂ©e, qui compliquent Ă©normĂ©ment la satisfaction des exigences de fiabilitĂ© et de dĂ©lai des messages d'urgence. Dans cette thĂšse, en guise de premiĂšre contribution, nous proposons un schĂ©ma de diffusion efficace Ă plusieurs sauts, appelĂ© Dynamic Partitioning Scheme (DPS), pour diffuser les messages d'urgence. DPS calcule les tailles de partitions dynamiques et le calendrier de transmission pour chaque partition; Ă l'intĂ©rieur de la zone arriĂšre de l'expĂ©diteur, les partitions sont calculĂ©es de sorte qu'en moyenne chaque partition contient au moins un seul vĂ©hicule; l'objectif est de s'assurer que seul un vĂ©hicule dans la partition la plus Ă©loignĂ©e (de l'expĂ©diteur) est utilisĂ© pour diffuser le message, jusqu'au saut suivant; ceci donne lieu Ă un dĂ©lai d'un saut plus court. DPS assure une diffusion rapide des messages d'urgence. En outre, un nouveau mĂ©canisme d'Ă©tablissement de liaison, qui utilise des tonalitĂ©s occupĂ©es, est proposĂ© pour rĂ©soudre le problĂšme du problĂšme de terminal cachĂ©.
Dans les VANETs, la Multidiffusion, c'est-à -dire la transmission d'un message d'une source à un nombre limité de véhicules connus en tant que destinations, est trÚs importante. Par rapport à la diffusion unique, avec Multidiffusion, la source peut simultanément prendre en charge plusieurs destinations, via une arborescence de multidiffusion, ce qui permet d'économiser de la bande passante et de réduire la congestion du réseau. Cependant, puisque les VANETs ont une topologie dynamique, le maintien de la connectivité de l'arbre de multidiffusion est un problÚme majeur. Comme deuxiÚme contribution, nous proposons deux approches pour modéliser l'utilisation totale de bande passante d'une arborescence de multidiffusion: (i) la premiÚre approche considÚre le nombre de segments de route impliqués dans l'arbre de multidiffusion et (ii) la seconde approche considÚre le nombre d'intersections relais dans l'arbre de multidiffusion. Une heuristique est proposée pour chaque approche. Pour assurer la qualité de service de l'arbre de multidiffusion, des procédures efficaces sont proposées pour le suivi des destinations et la surveillance de la qualité de service des segments de route.
Comme troisiĂšme contribution, nous Ă©tudions le problĂšme de la congestion causĂ©e par le routage du trafic de donnĂ©es dans les VANETs. Nous proposons (1) une approche de routage basĂ©e sur lâinfonuagique qui, contrairement aux approches existantes, prend en compte les chemins de routage existants qui relaient dĂ©jĂ les donnĂ©es dans les VANETs. Les nouvelles demandes de routage sont traitĂ©es de sorte qu'aucun segment de route ne soit surchargĂ© par plusieurs chemins de routage croisĂ©s. Au lieu d'acheminer les donnĂ©es en utilisant des chemins de routage sur un nombre limitĂ© de segments de route, notre approche Ă©quilibre la charge des donnĂ©es en utilisant des chemins de routage sur l'ensemble des tronçons routiers urbains, dans le but d'empĂȘcher, dans la mesure du possible, les congestions locales dans les VANETs; et (2) une approche basĂ©e sur le rĂ©seau dĂ©fini par logiciel (SDN) pour surveiller la connectivitĂ© VANET en temps rĂ©el et les dĂ©lais de transmission sur chaque segment de route. Les donnĂ©es de surveillance sont utilisĂ©es en entrĂ©e de l'approche de routage.Intelligent Transportation Systems (ITS) will be eventually provided in the near future for both safety and comfort of people during their travel on the roads. Vehicular ad-hoc Networks (VANETs), represent the key component of ITS. VANETs consist of vehicles that communicate with each other and with the infrastructure. Indeed, vehicles will be able to exchange messages that include, for example, information about road traffic, emergency situations, and entertainment. Particularly, emergency messages are broadcasted by vehicles in case of an emergency (e.g., car accident); in order to allow drivers to react in time (e.g., slow down), emergency messages must be reliably disseminated with very short delay. In VANETs, there are several factors, such as lossy channel, hidden terminals, interferences and scarce bandwidth, which make satisfying reliability and delay requirements of emergency messages very challenging. In this thesis, as the first contribution, we propose a reliable time-efficient and multi-hop broadcasting scheme, called Dynamic Partitioning Scheme (DPS), to disseminate emergency messages. DPS computes dynamic partition sizes and the transmission schedule for each partition; inside the back area of the sender, the partitions are computed such that in average each partition contains at least a single vehicle; the objective is to ensure that only a vehicle in the farthest partition (from the sender) is used to disseminate the message, to next hop, resulting in shorter one hop delay. DPS ensures fast dissemination of emergency messages. Moreover, a new handshaking mechanism, that uses busy tones, is proposed to solve the problem of hidden terminal problem.
In VANETs, Multicasting, i.e. delivering a message from a source to a limited known number of vehicles as destinations, is very important. Compared to Unicasting, with Multicasting, the source can simultaneously support multiple destinations, via a multicast tree, saving bandwidth and reducing overall communication congestion. However, since VANETs have a dynamic topology, maintaining the connectivity of the multicast tree is a major issue. As the second contribution, we propose two approaches to model total bandwidth usage of a multicast tree: (i) the first approach considers the number of road segments involved in the multicast tree and (ii) the second approach considers the number of relaying intersections involved in the multicast tree. A heuristic is proposed for each approach. To ensure QoS of the multicasting tree, efficient procedures are proposed for tracking destinations and monitoring QoS of road segments.
As the third contribution, we study the problem of network congestion in routing data traffic in VANETs. We propose (1) a Cloud-based routing approach that, in opposition to existing approaches, takes into account existing routing paths which are already relaying data in VANETs. New routing requests are processed such that no road segment gets overloaded by multiple crossing routing paths. Instead of routing over a limited set of road segments, our approach balances the load of communication paths over the whole urban road segments, with the objective to prevent, whenever possible, local congestions in VANETs; and (2) a Software Defined Networking (SDN) based approach to monitor real-time VANETs connectivity and transmission delays on each road segment. The monitoring data is used as input to the routing approach
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
Traffic locality oriented route discovery algorithms for mobile ad hoc networks
There has been a growing interest in Mobile Ad hoc Networks (MANETs) motivated by the advances in wireless technology and the range of potential applications that might be realised with such technology. Due to the lack of an infrastructure and their dynamic nature, MANETs demand a new set of networking protocols to harness the full benefits of these versatile communication systems.
Great deals of research activities have been devoted to develop on-demand routing algorithms for MANETs. The route discovery processes used in most on-demand routing algorithms, such as the Dynamic Source Routing (DSR) and Ad hoc On-demand Distance Vector (AODV), rely on simple flooding as a broadcasting technique for route discovery. Although simple flooding is simple to implement, it dominates the routing overhead, leading to the well-known broadcast storm problem that results in packet congestion and excessive collisions. A number of routing techniques have been proposed to alleviate this problem, some of which aim to improve the route discovery process by restricting the broadcast of route request packets to only the essential part of the network. Ideally, a route discovery should stop when a receiving node reports a route to the required destination. However, this cannot be achieved efficiently without the use of external resources; such as GPS location devices.
In this thesis, a new locality-oriented route discovery approach is proposed and exploited to develop three new algorithms to improve the route discovery process in on-demand routing protocols. The proposal of our algorithms is motivated by the fact that various patterns of traffic locality occur quite naturally in MANETs since groups of nodes communicate frequently with each other to accomplish common tasks. Some of these algorithms manage to reduce end-to-end delay while incurring lower routing overhead compared to some of the existing algorithms such as simple flooding used in AODV. The three algorithms are based on a revised concept of traffic locality in MANETs which relies on identifying a dynamic zone around a source node where the zone radius depends on the distribution of the nodes with which that the source is âmostlyâ communicating.
The traffic locality concept developed in this research form the basis of our Traffic Locality Route Discovery Approach (TLRDA) that aims to improve the routing discovery process in on-demand routing protocols. A neighbourhood region is generated for each active source node, containing âmostâ of its destinations, thus the whole network being divided into two non-overlapping regions, neighbourhood and beyond-neighbourhood, centred at the source node from that source node prospective. Route requests are processed normally in the neighbourhood region according to the routing algorithm used. However, outside this region various measures are taken to impede such broadcasts and, ultimately, stop them when they have outlived their usefulness. The approach is adaptive where the boundary of each source nodeâs neighbourhood is continuously updated to reflect the communication behaviour of the source node.
TLRDA is the basis for the new three route discovery algorithms; notably: Traffic Locality Route Discovery Algorithm with Delay (TLRDA D), Traffic Locality Route Discovery Algorithm with Chase (TLRDA-C), and Traffic Locality Expanding Ring Search (TL-ERS). In TLRDA-D, any route request that is currently travelling in its source nodeâs beyond-neighbourhood region is deliberately delayed to give priority to unfulfilled route requests. In TLRDA-C, this approach is augmented by using chase packets to target the route requests associated with them after the requested route has been discovered. In TL-ERS, the search is conducted by covering three successive rings. The first ring covers the source node neighbourhood region and unsatisfied route requests in this ring trigger the generation of the second ring which is double that of the first. Otherwise, the third ring covers the whole network and the algorithm finally resorts to flooding.
Detailed performance evaluations are provided using both mathematical and simulation modelling to investigate the performance behaviour of the TLRDA D, TLRDA-C, and TL-ERS algorithms and demonstrate their relative effectiveness against the existing approaches. Our results reveal that TLRDA D and TLRDA C manage to minimize end-to-end packet delays while TLRDA-C and TL-ERS exhibit low routing overhead. Moreover, the results indicate that equipping AODV with our new route discovery algorithms greatly enhance the performance of AODV in terms of end to end delay, routing overhead, and packet loss
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
Recommended from our members
Efficient route discovery for reactive routing
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Information on the location of mobile nodes in Mobile Ad-hoc Networks (MANETs) has
the potential to significantly improve network performance. This thesis uses node location information to develop new techniques for route discovery in on-demand routing protocols such as the Ad-hoc On-Demand Distance Vector (AODV), thus making an important contribution to enhancing the experience of using mobile networks.
A Candidate Neighbours to Rebroadcast the Route Request (CNRR) approach has been
proposed to reduce the deleterious impact, known as the broadcast storm, of RREQ packets
flooding in traditional on-demand routing protocols. The main concept behind CNRR is
specifying a set of neighbours which will rebroadcast the received RREQ. This is a departure from the traditional approach of all receiving nodes rebroadcasting RREQs and has the effect of reducing the problem of redundancy from which mobile networks suffer. The proposed protocol has been developed in two phases: Closest-CNRR and Furthest-CNRR. The simulation results show that the proposed algorithms have a significant effect as they reduce the routing overhead of the AODV protocol by up to 28% compared to the C-CNRR, and by up to 17.5% compared to the F-CNRR. Notably, the proposed algorithms simultaneously achieve better throughput and less data dropping.
The Link Stability and Energy Aware protocol (LSEA) has been developed to reduce the
overhead while increasing network lifetimes. The LSEA helps to control the global
dissemination of RREQs in the network by eliminating those nodes that have a residual
energy level below a specific threshold value from participation in end-to-end routes. The proposed LSEA protocol significantly increases network lifetimes by up to 19% compared with other on-demand routing protocols while still managing to obtain the same packet delivery ratio and network throughput levels. Furthermore, merging the LSEA and CNRR concepts has the great advantage of reducing the dissemination of RREQs in the network without loss of reachability among the nodes.
This increases network lifetimes, reduces the overhead and increases the amount of data
sent and received. Accordingly, a Position-based Selective Neighbour (PSN) approach has
been proposed which combines the advantages of zoning and link stability. The results
show that the proposed technique has notable advantages over both the AODV and MAAODV
as it improves delivery ratios by 24.6% and 18.8%, respectively.Funded by National Council for Training -
Sudan and the Sudan Academy of Science
Bandwidth and Energy-Efficient Route Discovery for Noisy Mobile Ad-Hoc Networks
Broadcasting is used in on-demand routing protocols to discover routes in Mobile Ad-hoc Networks (MANETs). On-demand routing protocols, such as Ad-hoc On-demand Distance Vector (AODV) commonly employ pure flooding based broadcasting to discover new routes. In pure flooding, a route request (RREQ) packet is broadcast by the source node and each receiving node rebroadcasts it. This continues until the RREQ packet arrives at the destination node. Pure flooding generates excessive redundant routing traffic that may lead to the broadcast storm problem (BSP) and deteriorate the performance of MANETs significantly.
A number of probabilistic broadcasting schemes have been proposed in the literature to address BSP. However, these schemes do not consider thermal noise and interference which exist in real life MANETs, and therefore, do not perform well in real life MANETs. Real life MANETs are noisy and the communication is not error free.
This research argues that a broadcast scheme that considers the effects of thermal noise, co-channel interference, and node density in the neighbourhood simultaneously can reduce the broadcast storm problem and enhance the MANET performance. To achieve this, three investigations have been carried out: First, the effect of carrier sensing ranges on on-demand routing protocol such as AODV and their impact on interference; second, effects of thermal noise on on-demand routing protocols and third, evaluation of pure flooding and probabilistic broadcasting schemes under noisy and noiseless conditions. The findings of these investigations are exploited to propose a Channel Adaptive Probabilistic Broadcast (CAPB) scheme to disseminate RREQ packets efficiently.
The proposed CAPB scheme determines the probability of rebroadcasting RREQ packets on the fly according to the current Signal to Interference plus Noise Ratio (SINR) and node density in the neighbourhood. The proposed scheme and two related state of the art (SoA) schemes from the literature are implemented in the standard AODV to replace the pure flooding based broadcast scheme. Ns-2 simulation results show that the proposed CAPB scheme outperforms the other schemes in terms of routing overhead, average end-to-end delay, throughput and energy consumption
Cellular Multihop Networks: State of the Art
This paper presents the summary of some research in the area of cellular multihop networks that contains the improvement in network performance also the difficulties and the complexities of the networks. The combination of two different networks, mobile cellular networks and WLAN ad hoc networks will be presented. The main purpose of the combination is to minimize the weaknesses of both network types when they are deployed separately. By having this combination then it is possible to provide higher mobility for WLAN ad hoc networks user and higher data transfer rate for cellular network users in multimedia applications. The cellular multihop networks will reduce blocking probability, balance the cells load and increase the network capacities. Although there are improvement on the performance of the combine networks, but there are additional aspects that should be considered seriously, especially for WLAN ad hoc users. Authentication, Authorization and Accounting (AAA) functions, the dynamic routing and relay path discovery, maintenance and security issues are aspects to be considered for cellular multihop network
- âŠ