Performances of geographical routing protocols combined with a position estimation process in wireless heterogenous networks

This paper addresses the performance of geographical routing protocol in wireless networks, where only few nodes possess self- locating capability such as GPS. To be able to apply end-to-end geographical routing protocols, it is necessary every node know their position coordinates. We propose a method to infer such positioning information to any node, based only on connectivity and localization information obtained from the neighborhood. Three metrics are used to evaluate the performance of such a scheme: the density of useful nodes for geographical routing protocol, the reachability and the path length.8th IFIP/IEEE International conference on Mobile and Wireless CommunicationRed de Universidades con Carreras en Informática (RedUNCI

Performances of geographical routing protocols combined with a position estimation process in wireless heterogenous networks

This paper addresses the performance of geographical routing protocol in wireless networks, where only few nodes possess self- locating capability such as GPS. To be able to apply end-to-end geographical routing protocols, it is necessary every node know their position coordinates. We propose a method to infer such positioning information to any node, based only on connectivity and localization information obtained from the neighborhood. Three metrics are used to evaluate the performance of such a scheme: the density of useful nodes for geographical routing protocol, the reachability and the path length.8th IFIP/IEEE International conference on Mobile and Wireless CommunicationRed de Universidades con Carreras en Informática (RedUNCI

Energy-efficient routing protocols in heterogeneous wireless sensor networks

Sensor networks feature low-cost sensor devices with wireless network capability, limited transmit power, resource constraints and limited battery energy. The usage of cheap and tiny wireless sensors will allow very large networks to be deployed at a feasible cost to provide a bridge between information systems and the physical world. Such large-scale deployments will require routing protocols that scale to large network sizes in an energy-efficient way. This thesis addresses the design of such network routing methods. A classification of existing routing protocols and the key factors in their design (i.e., hardware, topology, applications) provides the motivation for the new three-tier architecture for heterogeneous networks built upon a generic software framework (GSF). A range of new routing algorithms have hence been developed with the design goals of scalability and energy-efficient performance of network protocols. They are respectively TinyReg - a routing algorithm based on regular-graph theory, TSEP - topological stable election protocol, and GAAC - an evolutionary algorithm based on genetic algorithms and ant colony algorithms. The design principle of our routing algorithms is that shortening the distance between the cluster-heads and the sink in the network, will minimise energy consumption in order to extend the network lifetime, will achieve energy efficiency. Their performance has been evaluated by simulation in an extensive range of scenarios, and compared to existing algorithms. It is shown that the newly proposed algorithms allow long-term continuous data collection in large networks, offering greater network longevity than existing solutions. These results confirm the validity of the GSF as an architectural approach to the deployment of large wireless sensor networks

Exploiting Asymmetric Links in a Convergecast Routing Protocol for WSNs

Most of the existing routing protocol designed for WSNs assume that links are symmetric which is in contradiction to the reality of these networks. Indeed, asymmetric links cannot be ignored in WSNs as they can be predominant. The apparition of asymmetric links can dramatically decrease routing protocols that are not designed to support them by decreasing the delivery ratio and increasing the duplicated packet received at the destination. Obviously, most of the existing routing protocols prune the asymmetric links and only maintain the symmetric ones. From our point of view, the asymmetric links have to be considered as they can be effective in the network connectivity insurance. Moreover, they open new opportunities to improve the performance of routing protocols. From this perspective and in order to take benefit from asymmetric links, we propose a routing protocol for data collection in WSNs called AsymRP (Asymmetric Routing Protocol). AsymRP is a convergecast routing protocol which is based on a 2-hop neighbor knowledge combined with implicit and explicit source routing acknowledgment. Our proposal takes advantage of asymmetric links, enables the network to achieve higher delivery ratio while reducing significantly the number of duplicated packets and hop counts. Our simulation results show that our proposal AsymRP can significantly outperform traditional routing protocols in the presence of asymmetric links in the network

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

Cognitive virtual ad hoc mobile cloud-based networking architecture

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University LondonThis thesis proposed cognitive techniques and intelligent algorithms that offered adaptive and advanced facilities to cloud-based networking by using Virtual Ad Hoc Mobile Cloud Computing Networks architecture (VAMCCNs). This is presented as a working case to address their global network challenges and to add cognitive support to the network design and implementation for better meeting traffic management and application requirements in mission objectives. The thesis concentrates on three main contributions. Firstly, an adaptive model, namely: a Heterogeneous Mobile Cloud Computing Network (HMCCN), was proposed to integrate different cloud networks architectures into one workflow. The cognitive data offloading task and the routing decision methods were applied using two different approaches: Fuzzy Analytic Hierarchy system (FAH) as a first approach and cognitive Software Defined Network (SDN) model as a second centralised approach. Experimental results show improvement in network reliability and throughputs, minimised in both nodes’ energy consumption and network latency with efficient intelligent data load balance and network resources allocation with best cloud model selection. Secondly, based on a virtual Ad Hoc cloud network with a realistic Random Waypoint Motion (RWM) model, an innovative cognitive routing algorithm was presented to improve efficient and reliable route selection among multiple possible routes. Routing protocols based on conventional, Fuzzy logic used important parameters with two data collections and decisions techniques and a new adaptive Intelligent Hybrid Fuzzy-Neural routing protocol (IHFN) that included prior knowledge to the network of the underlying motion and energy parameters were all proposed and compared. Results with the new hybrid algorithm shown a significant improvement to solve the network end-to-end performance degradation problem. The new hybrid protocol improved network throughput with an average of 20% higher than traditional Ad Hoc On-Demand Distance Vector (AODV) Routing protocol, improved the usage of network resources and reduced the maintenance process in adynamic topologies network. Finally, based on datasets collected from a realistic motion RWM model in a virtual Ad Hoc cloud network, the performance behaviour of six selected deep learning algorithms to predict the next steps of positions, speed and residual battery energy values of these mobile nodes have been evaluated and compared. This work goes further by presenting two algorithm's training techniques to predict the next 300-time steps of position, speed, and energy. Results and dissuasion show the differences concerning prediction accuracy between using the single node dataset model or Multiple node's dataset model

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