742 research outputs found
Would Current Ad Hoc Routing Protocols be Adequate for the Internet of Vehicles? A Comparative Study
In recent years we have seen a great proliferation of smart vehicles, ranging from cars to little drones (both terrestrial and aerial), all endowed with sensors and communication capabilities. It is hence easy to foresee a future with even more smart and connected vehicles moving around, occupying space and creating an Internet of Vehicles (IoV). In this IoV, a multitude of nodes (both static and mobile) will generate a continuous multihop flow of local information to support local smart environment applications. Therefore, one interesting environment for the IoV would be in the form of 3-D mobile ad-hoc networks (MANETs). Unfortunately, MANET routing protocols have generally been designed and analyzed keeping in mind a 2-D scenario; there is no guarantee on how they would support a 3-D topology of the IoV. To this end, we have considered routing protocols deemed as the state-of-the-art for classic MANETs and tested them over 3-D topologies to evaluate their assets and technical challenges
Position-based routing algorithms for three-dimensional ad hoc networks
In position-based routing algorithms, the nodes use the geographical information to make routing decisions. Recent research in this field addresses such routing algorithms in two-dimensional (2 D ) space. However, in real applications, the nodes may be distributed in three-dimensional (3 D ) space. Transition from 2 D to 3 D is not always easy, since many problems in 3 D are significantly harder than their 2 D counterparts. This dissertation focuses on providing a reliable and efficient position-based routing algorithms with the associated pre-processing algorithms for various 3 D ad hoc networks. In the first part of this thesis, we propose a generalization of the Yao graph where the cones used are adaptively centered on the nearest set of neighbors for each node, thus creating a directed or undirected spanning subgraph of a given unit disk graph (UDG). We show that these locally constructed spanning subgraphs are strongly connected, have bounded out-degree, are t -spanners with bounded stretch factor, contain the Euclidean minimum spanning tree as a subgraph, and are orientation-invariant. Then we propose the first local, constant time algorithm that constructs an independent dominating set and connected dominating set of a Unit Disk Graph in a 3 D environment. We present a truncated octahedral tiling system of the space to assign to each node a class number depending on the position of the node within the tiling system. Then, based on the tiling system, we present our local algorithms for constructing the dominating sets. The new algorithms have a constant time complexity and have approximation bounds that are completely independent of the size of the network. In the second part of this thesis, we implement 3 D versions of many current 2 D position-based routing algorithms in addition to creating many new algorithms that are specially designed for a 3 D environment. We show experimentally that these new routing algorithms can achieve nearly guaranteed delivery while discovering routes significantly closer in length to a shortest path. Because many existing position-based routing algorithms for ad hoc and sensor networks use the maximum transmission power of the nodes to discover neighbors, which is a very power-consuming process. We propose several localized power-aware 3 D position-based routing algorithms that increase the lifetime of a network by maximizing the average lifetime of its nodes. These new algorithms use the idea of replacing the constant transmission power of a node with an adjusted transmission power during two stages. The simulation results show a significant improvement in the overall network lifetime over the current power-aware routing algorithm
Data Gathering and Dissemination over Flying Ad-hoc Networks in Smart Environments
The advent of the Internet of Things (IoT) has laid the foundations for new possibilities in our life. The ability to communicate with any electronic device has become a fascinating opportunity. Particularly interesting are UAVs (Unmanned Airborne Vehicles), autonomous or remotely controlled flying devices able to operate in many contexts thanks to their mobility, sensors, and communication capabilities. Recently, the use of UAVs has become an important asset in many critical and common scenarios; thereby, various research groups have started to consider UAVs’ potentiality applied on smart environments. UAVs can communicate with each other forming a Flying Ad-hoc Network (FANET), in order to provide complex services that requires the coordination of several UAVs; yet, this also generates challenging communication issues. This dissertation starts from this standpoint, firstly focusing on networking issues and potential solutions already present in the state-of-the-art. To this aim, the peculiar issues of routing in mobile, 3D shaped ad-hoc networks have been investigated through a set of simulations to compare different ad-hoc routing protocols and understand their limits. From this knowledge, our work takes into consideration the differences between classic MANETs and FANETs, highlighting the specific communication performance of UAVs and their specific mobility models. Based on these assumptions, we propose refinements and improvements of routing protocols, as well as their linkage with actual UAV-based applications to support smart services. Particular consideration is devoted to Delay/Disruption Tolerant Networks (DTNs), characterized by long packet delays and intermittent connectivity, a critical aspect when UAVs are involved. The goal is to leverage on context-aware strategies in order to design more efficient routing solutions. The outcome of this work includes the design and analysis of new routing protocols supporting efficient UAVs’ communication with heterogeneous smart objects in smart environments. Finally, we discuss about how the presence of UAV swarms may affect the perception of population, providing a critical analysis of how the consideration of these aspects could change a FANET communication infrastructure
Geographic Routing for Point to Point Data Delivery in Wireless Sensor Network
Ph.DDOCTOR OF PHILOSOPH
Connectivity, Coverage and Placement in Wireless Sensor Networks
Wireless communication between sensors allows the formation of flexible sensor networks, which can be deployed rapidly over wide or inaccessible areas. However, the need to gather data from all sensors in the network imposes constraints on the distances between sensors. This survey describes the state of the art in techniques for determining the minimum density and optimal locations of relay nodes and ordinary sensors to ensure connectivity, subject to various degrees of uncertainty in the locations of the nodes
Joint optimization for wireless sensor networks in critical infrastructures
Energy optimization represents one of the main goals in wireless sensor network design
where a typical sensor node has usually operated by making use of the battery with
limited-capacity. In this thesis, the following main problems are addressed: first, the
joint optimization of the energy consumption and the delay for conventional wireless sensor networks is presented. Second, the joint optimization of the information quality and
energy consumption of the wireless sensor networks based structural health monitoring
is outlined. Finally, the multi-objectives optimization of the former problem under several constraints is shown. In the first main problem, the following points are presented:
we introduce a joint multi-objective optimization formulation for both energy and delay
for most sensor nodes in various applications. Then, we present the Karush-Kuhn-Tucker
analysis to demonstrate the optimal solution for each formulation. We introduce a method
of determining the knee on the Pareto front curve, which meets the network designer interest for focusing on more practical solutions. The sensor node placement optimization has
a significant role in wireless sensor networks, especially in structural health monitoring.
In the second main problem of this work, the existing work optimizes the node placement
and routing separately (by performing routing after carrying out the node placement).
However, this approach does not guarantee the optimality of the overall solution. A joint
optimization of sensor placement, routing, and flow assignment is introduced and is solved
using mixed-integer programming modelling. In the third main problem of this study, we
revisit the placement problem in wireless sensor networks of structural health monitoring by using multi-objective optimization. Furthermore, we take into consideration more
constraints that were not taken into account before. This includes the maximum capacity
per link and the node-disjoint routing. Since maximum capacity constraint is essential
to study the data delivery over limited-capacity wireless links, node-disjoint routing is
necessary to achieve load balancing and longer wireless sensor networks lifetime. We list
the results of the previous problems, and then we evaluate the corresponding results
In-Network Outlier Detection in Wireless Sensor Networks
To address the problem of unsupervised outlier detection in wireless sensor
networks, we develop an approach that (1) is flexible with respect to the
outlier definition, (2) computes the result in-network to reduce both bandwidth
and energy usage,(3) only uses single hop communication thus permitting very
simple node failure detection and message reliability assurance mechanisms
(e.g., carrier-sense), and (4) seamlessly accommodates dynamic updates to data.
We examine performance using simulation with real sensor data streams. Our
results demonstrate that our approach is accurate and imposes a reasonable
communication load and level of power consumption.Comment: Extended version of a paper appearing in the Int'l Conference on
Distributed Computing Systems 200
- …