20 research outputs found
Energy-aware Dual-path Geographic Routing to Bypass Routing Holes in Wireless Sensor Networks
This is the author accepted manuscript. The final version is available from IEEE via the DOI in this record.Geographic routing has been considered as an attractive approach for resource-constrained wireless sensor networks
(WSNs) since it exploits local location information instead of global topology information to route data. However, this routing approach
often suffers from the routing hole (i.e., an area free of nodes in the direction closer to destination) in various environments such as
buildings and obstacles during data delivery, resulting in route failure. Currently, existing geographic routing protocols tend to walk
along only one side of the routing holes to recover the route, thus achieving suboptimal network performance such as longer delivery
delay and lower delivery ratio. Furthermore, these protocols cannot guarantee that all packets are delivered in an energy-efficient
manner once encountering routing holes. In this paper, we focus on addressing these issues and propose an energy-aware dual-path
geographic routing (EDGR) protocol for better route recovery from routing holes. EDGR adaptively utilizes the location information,
residual energy, and the characteristics of energy consumption to make routing decisions, and dynamically exploits two node-disjoint
anchor lists, passing through two sides of the routing holes, to shift routing path for load balance. Moreover, we extend EDGR into
three-dimensional (3D) sensor networks to provide energy-aware routing for routing hole detour. Simulation results demonstrate that
EDGR exhibits higher energy efficiency, and has moderate performance improvements on network lifetime, packet delivery ratio, and
delivery delay, compared to other geographic routing protocols in WSNs over a variety of communication scenarios passing through
routing holes. The proposed EDGR is much applicable to resource-constrained WSNs with routing holes.This work has been partially supported by the National
Natural Science Foundation of China (No. 61402343,
No. 61672318, No. U1504614, No. 61631013, and No.
61303241), the National Key Research and Development
Program (No. 2016YFB1000102), the Natural Science
Foundation of Suzhou/Jiangsu Province (No.
BK20160385), the EU FP7 QUICK Project (No. PIRSESGA-
2013-612652), and the projects of Tsinghua National
Laboratory for Information Science and Technology
(TNList)
A Mobile Ad Hoc Network Routing Protocols: A Comparative Study
Mobile Ad hoc NETworks (MANET), are complex and distributed networks that are dynamic. Which are infrastructure less and multi-hop in nature. The communication of a node can be either direct or through intermediate nodes without a fixed and dedicated infrastructure. Hence it is necessary to design an efficient routing protocol for ad hoc network which can address the issues of MANET efficiently. In ad hoc, routing algorithms are classified into nine categories namely: source-initiated (reactive), table-driven (proactive), hybrid, hierarchical, multipath, multicast, location-aware, geographical-multicast and power-aware. This paper presents a survey and to review a comparative study about various routing protocols under each of these categories. Additionally, brief discussions about major routing issues are addressed. This survey paper focuses on the taxonomy related to ad hoc routing techniques and compares the features of routing protocols
Routing protocol optimization in challenged multihop wireless networks
Durant ces dernières années, de nombreux travaux de recherches ont été menés dans le domaine des réseaux multi-sauts sans fil à contraintes (MWNs: Multihop Wireless Networks). Grâce à l'évolution de la technologie des systèmes mico-electro-méchaniques (MEMS) et, depuis peu, les nanotechnologies, les MWNs sont une solution de choix pour une variété de problèmes. Le principal avantage de ces réseaux est leur faible coût de production qui permet de développer des applications ayant un unique cycle de vie. Cependant, si le coût de fabrication des nœuds constituant ce type de réseaux est assez faible, ces nœuds sont aussi limités en capacité en termes de: rayon de transmission radio, bande passante, puissance de calcul, mémoire, énergie, etc. Ainsi, les applications qui visent l'utilisation des MWNs doivent être conçues avec une grande précaution, et plus spécialement la conception de la fonction de routage, vu que les communications radio constituent la tâche la plus consommatrice d'énergie.Le but de cette thèse est d'analyser les différents défis et contraintes qui régissent la conception d'applications utilisant les MWNs. Ces contraintes se répartissent tout le long de la pile protocolaire. On trouve au niveau application des contraintes comme: la qualité de service, la tolérance aux pannes, le modèle de livraison de données au niveau application, etc. Au niveau réseau, on peut citer les problèmes de la dynamicité de la topologie réseau, la présence de trous, la mobilité, etc. Nos contributions dans cette thèse sont centrées sur l'optimisation de la fonction de routage en considérant les besoins de l'application et les contraintes du réseau. Premièrement, nous avons proposé un protocole de routage multi-chemin "en ligne" pour les applications orientées QoS utilisant des réseaux de capteurs multimédia. Ce protocole repose sur la construction de multiples chemins durant la transmission des paquets vers leur destination, c'est-à -dire sans découverte et construction des routes préalables. En permettant des transmissions parallèles, ce protocole améliore la transmission de bout-en-bout en maximisant la bande passante du chemin agrégé et en minimisant les délais. Ainsi, il permet de répondre aux exigences des applications orientées QoS.Deuxièmement, nous avons traité le problème du routage dans les réseaux mobiles tolérants aux délais. Nous avons commencé par étudier la connectivité intermittente entre les différents et nous avons extrait un modèle pour les contacts dans le but pouvoir prédire les future contacts entre les nœuds. En se basant sur ce modèle, nous avons proposé un protocole de routage, qui met à profit la position géographique des nœuds, leurs trajectoires, et la prédiction des futurs contacts dans le but d'améliorer les décisions de routage. Le protocole proposé permet la réduction des délais de bout-en-bout tout en utilisant d'une manière efficace les ressources limitées des nœuds que ce soit en termes de mémoire (pour le stockage des messages dans les files d'attentes) ou la puissance de calcul (pour l'exécution de l'algorithme de prédiction).Finalement, nous avons proposé un mécanisme de contrôle de la topologie avec un algorithme de routage des paquets pour les applications orientés évènement et qui utilisent des réseaux de capteurs sans fil statiques. Le contrôle de la topologie est réalisé à travers l'utilisation d'un algorithme distribué pour l'ordonnancement du cycle de service (sleep/awake). Les paramètres de l'algorithme proposé peuvent être réglés et ajustés en fonction de la taille du voisinage actif désiré (le nombre moyen de voisin actifs pour chaque nœud). Le mécanisme proposé assure un compromis entre le délai pour la notification d'un événement et la consommation d'énergie globale dans le réseau.Great research efforts have been carried out in the field of challenged multihop wireless networks (MWNs). Thanks to the evolution of the Micro-Electro-Mechanical Systems (MEMS) technology and nanotechnologies, multihop wireless networks have been the solution of choice for a plethora of problems. The main advantage of these networks is their low manufacturing cost that permits one-time application lifecycle. However, if nodes are low-costly to produce, they are also less capable in terms of radio range, bandwidth, processing power, memory, energy, etc. Thus, applications need to be carefully designed and especially the routing task because radio communication is the most energy-consuming functionality and energy is the main issue for challenged multihop wireless networks.The aim of this thesis is to analyse the different challenges that govern the design of challenged multihop wireless networks such as applications challenges in terms of quality of service (QoS), fault-tolerance, data delivery model, etc., but also networking challenges in terms of dynamic network topology, topology voids, etc. Our contributions in this thesis focus on the optimization of routing under different application requirements and network constraints. First, we propose an online multipath routing protocol for QoS-based applications using wireless multimedia sensor networks. The proposed protocol relies on the construction of multiple paths while transmitting data packets to their destination, i.e. without prior topology discovery and path establishment. This protocol achieves parallel transmissions and enhances the end-to-end transmission by maximizing path bandwidth and minimizing the delays, and thus meets the requirements of QoS-based applications. Second, we tackle the problem of routing in mobile delay-tolerant networks by studying the intermittent connectivity of nodes and deriving a contact model in order to forecast future nodes' contacts. Based upon this contact model, we propose a routing protocol that makes use of nodes' locations, nodes' trajectories, and inter-node contact prediction in order to perform forwarding decisions. The proposed routing protocol achieves low end-to-end delays while using efficiently constrained nodes' resources in terms of memory (packet queue occupancy) and processing power (forecasting algorithm). Finally, we present a topology control mechanism along a packet forwarding algorithm for event-driven applications using stationary wireless sensor networks. Topology control is achieved by using a distributed duty-cycle scheduling algorithm. Algorithm parameters can be tuned according to the desired node's awake neighbourhood size. The proposed topology control mechanism ensures trade-off between event-reporting delay and energy consumption.BORDEAUX1-Bib.electronique (335229901) / SudocSudocFranceF
Recent Trends in Communication Networks
In recent years there has been many developments in communication technology. This has greatly enhanced the computing power of small handheld resource-constrained mobile devices. Different generations of communication technology have evolved. This had led to new research for communication of large volumes of data in different transmission media and the design of different communication protocols. Another direction of research concerns the secure and error-free communication between the sender and receiver despite the risk of the presence of an eavesdropper. For the communication requirement of a huge amount of multimedia streaming data, a lot of research has been carried out in the design of proper overlay networks. The book addresses new research techniques that have evolved to handle these challenges
Internet of Satellites (IoSat): analysis of network models and routing protocol requirements
The space segment has been evolved from monolithic to distributed satellite systems. One of these distributed systems is called the federated satellite system (FSS) which aims at establishing a win-win collaboration between satellites to improve their mission performance by using the unused on-board resources. The FSS concept requires sporadic and direct communications between satellites, using inter satellite links. However, this point-to-point communication is temporal and thus it can break existent federations. Therefore, the conception of a multi-hop scenario needs to be addressed. This is the goal of the Internet of satellites (IoSat) paradigm which, as opposed to a common backbone, proposes the creation of a network using a peer-to-peer architecture. In particular, the same satellites take part of the network by establishing intermediate collaborations to deploy a FSS. This paradigm supposes a major challenge in terms of network definition and routing protocol. Therefore, this paper not only details the IoSat paradigm, but it also analyses the different satellite network models. Furthermore, it evaluates the routing protocol candidates that could be used to implement the IoSat paradigm.Peer ReviewedPostprint (author's final draft
Recommended from our members
Optimising routing and trustworthiness of ad hoc networks using swarm intelligence
This thesis was submitted for the degree of Doctor of Philsophy and awarded by Brunel UniversityThis thesis proposes different approaches to address routing and security of MANETs using swarm technology. The mobility and infrastructure-less of MANET as well as nodes misbehavior compose great challenges to routing and security protocols of such a network. The first approach addresses the problem of channel assignment in multichannel ad hoc networks with limited number of interfaces, where stable route are more preferred to be selected. The channel selection is based on link quality between the nodes. Geographical information is used with mapping algorithm in order to estimate and predict the links’ quality and routes life time, which is combined with Ant Colony Optimization (ACO) algorithm to find most stable route with high data rate. As a result, a better utilization of the channels is performed where the throughput increased up to 74% over ASAR protocol. A new smart data packet routing protocol is developed based on the River Formation Dynamics (RFD) algorithm. The RFD algorithm is a subset of swarm intelligence which mimics how rivers are created in nature. The protocol is a distributed swarm learning approach where data packets are smart enough to guide themselves through best available route in the network. The learning information is distributed throughout the nodes of the network. This information can be used and updated by successive data packets in order to maintain and find better routes. Data packets act like swarm agents (drops) where they carry their path information and update routing information without the need for backward agents. These data packets modify the routing information based on different network metrics. As a result, data packet can guide themselves through better routes.
In the second approach, a hybrid ACO and RFD smart data packet routing protocol is developed where the protocol tries to find shortest path that is less congested to the destination. Simulation results show throughput improvement by 30% over AODV protocol and 13% over AntHocNet. Both delay and jitter have been improved more than 96% over AODV protocol. In order to overcome the problem of source routing introduced due to the use of the ACO algorithm, a solely RFD based distance vector protocol has been developed as a third approach. Moreover, the protocol separates reactive learned information from proactive learned information to add more reliability to data routing. To minimize the power consumption introduced due to the hybrid nature of the RFD routing protocol, a forth approach has been developed. This protocol tackles the problem of power consumption and adds packets delivery power minimization to the protocol based on RFD algorithm.
Finally, a security model based on reputation and trust is added to the smart data packet protocol in order to detect misbehaving nodes. A trust system has been built based on the privilege offered by the RFD algorithm, where drops are always moving from higher altitude to lower one. Moreover, the distributed and undefined nature of the ad hoc network forces the nodes to obligate to cooperative behaviour in order not to be exposed. This system can easily and quickly detect misbehaving nodes according to altitude difference between active intermediate nodes
QoSRP: A cross-layer QoS channel-aware routing protocol for the internet of underwater acoustic sensor networks
Quality of service (QoS)-aware data gathering in static-channel based underwater wireless sensor networks (UWSNs) is severely limited due to location and time-dependent acoustic channel communication characteristics. This paper proposes a novel cross-layer QoS-aware multichannel routing protocol called QoSRP for the internet of UWSNs-based time-critical marine monitoring applications. The proposed QoSRP scheme considers the unique characteristics of the acoustic communication in highly dynamic network topology during gathering and relaying events data towards the sink. The proposed QoSRP scheme during the time-critical events data-gathering process employs three basic mechanisms, namely underwater channel detection (UWCD), underwater channel assignment (UWCA) and underwater packets forwarding (UWPF). The UWCD mechanism finds the vacant channels with a high probability of detection and low probability of missed detection and false alarms. The UWCA scheme assigns high data rates channels to acoustic sensor nodes (ASNs) with longer idle probability in a robust manner. Lastly, the UWPF mechanism during conveying information avoids congestion, data path loops and balances the data traffic load in UWSNs. The QoSRP scheme is validated through extensive simulations conducted by NS2 and AquaSim 2.0 in underwater environments (UWEs). The simulation results reveal that the QoSRP protocol performs better compared to existing routing schemes in UWSNs