Energy efficient geographic routing for wireless sensor networks.

A wireless sensor network consists of a large number of low-power nodes equipped with wireless radio. For two nodes not in mutual transmission range, message exchanges need to be relayed through a series of intermediate nodes, which is a process known as multi-hop routing. The design of efficient routing protocols for dynamic network topologies is a crucial for scalable sensor networks. Geographic routing is a recently developed technique that uses locally available position information of nodes to make packet forwarding decisions. This dissertation develops a framework for energy efficient geographic routing. This framework includes a path pruning strategy by exploiting the channel listening capability, an anchor-based routing protocol using anchors to act as relay nodes between source and destination, a geographic multicast algorithm clustering destinations that can share the same next hop, and a lifetime-aware routing algorithm to prolong the lifetime of wireless sensor networks by considering four important factors: PRR (Packet Reception Rate), forwarding history, progress and remaining energy. This dissertation discusses the system design, theoretic analysis, simulation and testbed implementation involved in the aforementioned framework. It is shown that the proposed design significantly improves the routing efficiency in sensor networks over existing geographic routing protocols. The routing methods developed in this dissertation are also applicable to other location-based wireless networks

Developing a New Wireless Sensor Network Platform and Its Application in Precision Agriculture

Wireless sensor networks are gaining greater attention from the research community and industrial professionals because these small pieces of “smart dust” offer great advantages due to their small size, low power consumption, easy integration and support for “green” applications. Green applications are considered a hot topic in intelligent environments, ubiquitous and pervasive computing. This work evaluates a new wireless sensor network platform and its application in precision agriculture, including its embedded operating system and its routing algorithm. To validate the technological platform and the embedded operating system, two different routing strategies were compared: hierarchical and flat. Both of these routing algorithms were tested in a small-scale network applied to a watermelon field. However, we strongly believe that this technological platform can be also applied to precision agriculture because it incorporates a modified version of LORA-CBF, a wireless location-based routing algorithm that uses cluster-based flooding. Cluster-based flooding addresses the scalability concerns of wireless sensor networks, while the modified LORA-CBF routing algorithm includes a metric to monitor residual battery energy. Furthermore, results show that the modified version of LORA-CBF functions well with both the flat and hierarchical algorithms, although it functions better with the flat algorithm in a small-scale agricultural network

Collaborative Approach for Improving the Scheduling and Providing Advanced Security in Wireless Sensor Network

Recent advances in Wireless Sensor Networks (WSN) have focused towards Geographic forwarding mechanism. It is a promising routing scheme in wireless sensor networks, in which the forwarding decision is determined purely based on the location of each node. Such type of Routing in Geographic domain is also useful for large multi-hop wireless networks where the nodes are not reliable and network topology is frequently changing. This routing requires propagation of single hop topology information that is the best neighbor, to make correct forwarding decisions. The research of Geographic routing has now moved towards duty cycled wireless sensor networks (WSNs). In such type of network, sensors are sleep scheduled which helps in reduction of energy consumption. It works by dynamically putting the nodes to sleep when not in use and reactivate it, when required, by using some sleep scheduling algorithms. Geographic routing is usually based on distance which is considered as its main parameter. This routing uses geographic routing oriented sleep scheduling (GSS) algorithm & geographic-distance-based connected-k neighborhood (GCKN) algorithm. The existing research was done to find out the shortest path from source to destination in Duty-Cycled Mobile sensor networks along with geographic routing, using distance as a parameter. But there may be the case when shortest path is available and the nodes are heavily loaded. Therefore, load balancing also proves to be equally important factor. Hence, this research work proposes the system that will calculate the best optimal path from source node to destination by taking into consideration the load on each node and delay incurred by each node in Duty-Cycled Mobile sensor networks along with geographic routing. The experimental results and performance analysis shows that the newly proposed approach achieves the best results in comparison with the existing system

Location based services in wireless ad hoc networks

In this dissertation, we investigate location based services in wireless ad hoc networks from four different aspects - i) location privacy in wireless sensor networks (privacy), ii) end-to-end secure communication in randomly deployed wireless sensor networks (security), iii) quality versus latency trade-off in content retrieval under ad hoc node mobility (performance) and iv) location clustering based Sybil attack detection in vehicular ad hoc networks (trust). The first contribution of this dissertation is in addressing location privacy in wireless sensor networks. We propose a non-cooperative sensor localization algorithm showing how an external entity can stealthily invade into the location privacy of sensors in a network. We then design a location privacy preserving tracking algorithm for defending against such adversarial localization attacks. Next we investigate secure end-to-end communication in randomly deployed wireless sensor networks. Here, due to lack of control on sensors\u27 locations post deployment, pre-fixing pairwise keys between sensors is not feasible especially under larger scale random deployments. Towards this premise, we propose differentiated key pre-distribution for secure end-to-end secure communication, and show how it improves existing routing algorithms. Our next contribution is in addressing quality versus latency trade-off in content retrieval under ad hoc node mobility. We propose a two-tiered architecture for efficient content retrieval in such environment. Finally we investigate Sybil attack detection in vehicular ad hoc networks. A Sybil attacker can create and use multiple counterfeit identities risking trust of a vehicular ad hoc network, and then easily escape the location of the attack avoiding detection. We propose a location based clustering of nodes leveraging vehicle platoon dispersion for detection of Sybil attacks in vehicular ad hoc networks --Abstract, page iii

Power-efficient Location-based Cooperative Routing with Sensor Power Upper Limit for Wireless Sensor Networks

A location-based cooperative routing algorithm is proposed to improve the wireless sensor network performance.[ANGLÈS] Cooperative routing in wireless sensor networks can improve performance in these types of networks. In our work, we propose a routing algorithm called Location-based Cooperative Routing with Sensor Power-upper-limit for Wireless Sensor Networks. The algorithm is based on the principle of minimum link power and aims to take advantage of nodes cooperation to make the link work well in Wireless Sensor Networks with a low transmission power. In the proposed scheme, with a determined sending power upper limit, nodes find the most appropriate next nodes and single-relay nodes with the proposed algorithm. Moreover, this proposal subtly avoids the nodes not working, because we add Bad nodes Avoidance Strategy. Simulation results show that, compared with other routing algorithm, the algorithm proposed in previous study, proposed algorithm with Bad nodes Avoidance Strategy can significantly improve the performance in reducing the overall link power, enhancing the transmission success rate and decreasing the retransmission rate.[CASTELLÀ] Cooperative routing en redes de sensores inalámbricos puede mejorar el rendimiento en este tipo de redes. En nuestro trabajo, proponemos un algoritmo de enrutamiento llamado Location-based Cooperative Routing with Sensor Power-upper-limit for Wireless Sensor Networks. El algoritmo se basa en el principio de la potencia de enlace mínimo, y tiene como objetivo aprovechar la cooperación de los nodos para hacer que el enlace funcione bien en redes de sensores inalámbricos con una potencia de transmisión baja. En el esquema propuesto, con un límite de envío de potencia determinado, los nodos pueden encontrar los nodos siguientes más apropiados y los nodos relay con el algoritmo propuesto. Por otra parte, esta propuesta sutilmente evita los nodos que no funcionan, porque añade la estrategia Bad nodes Avoidance Strategy (BAS). Los resultados de simulación muestran que, en comparación con otro algoritmo de enrutamiento, el algoritmo propuesto con la estrategia de BAS puede mejorar significativamente el rendimiento en la reducción de la potencia del enlace general, aumentar la tasa de éxito de transmisión y la disminución de la tasa de retransmisión.[CATALÀ] Cooperative routing en xarxes de sensors sense fil pot millorar el rendiment en aquest tipus de xarxes. En el nostre treball, proposem un algorisme d'encaminament anomenat Location-based Cooperative Routing with Sensor Power-upper-limit for Wireless Sensor Networks. L'algorisme es basa en el principi de la potència d'enllaç mínim i té com objectiu aprofitar la cooperació dels nodes per fer que l'enllaç funcioni bé en xarxes de sensors sense fil amb una potència de transmissió baixa. En l'esquema proposat, sense límit d'enviament de potència determinat, els nodes poden trobar els relays més apropiats amb l'algorisme proposat. Per altra part, aquesta proposta evita els nodes que no funcionen bé, perquè s'afegeix l'estratègia Bad nodes Avoidance Strategy (BAS). Els resultats de simulació mostren que, en comparació amb un altre algorisme d'encaminament, l'algorisme proposat amb l'estratègia de BAS pot millorar significativament el rendiment en la reducció de la potència de l'enllaç general, augmentar la taxa d'èxit de transmissió i la disminució de la taxa de retransmissió

An Enhanced Cluster-Based Routing Model for Energy-Efficient Wireless Sensor Networks

Energy efficiency is a crucial consideration in wireless sensor networks since the sensor nodes are resource-constrained, and this limited resource, if not optimally utilized, may disrupt the entire network's operations. The network must ensure that the limited energy resources are used as effectively as possible to allow for longer-term operation. The study designed and simulated an improved Genetic Algorithm-Based Energy-Efficient Routing (GABEER) algorithm to combat the issue of energy depletion in wireless sensor networks. The GABEER algorithm was designed using the Free Space Path Loss Model to determine each node's location in the sensor field according to its proximity to the base station (sink) and the First-Order Radio Energy Model to measure the energy depletion of each node to obtain the residual energy. The GABEER algorithm was coded in the C++ programming language, and the wireless sensor network was simulated using Network Simulator 3 (NS-3). The outcomes of the simulation revealed that the GABEER algorithm has the capability of increasing the performance of sensor network operations with respect to lifetime and stability period

A Game Theory-Based Obstacle Avoidance Routing Protocol for Wireless Sensor Networks

The obstacle avoidance problem in geographic forwarding is an important issue for location-based routing in wireless sensor networks. The presence of an obstacle leads to several geographic routing problems such as excessive energy consumption and data congestion. Obstacles are hard to avoid in realistic environments. To bypass obstacles, most routing protocols tend to forward packets along the obstacle boundaries. This leads to a situation where the nodes at the boundaries exhaust their energy rapidly and the obstacle area is diffused. In this paper, we introduce a novel routing algorithm to solve the obstacle problem in wireless sensor networks based on a game-theory model. Our algorithm forms a concave region that cannot forward packets to achieve the aim of improving the transmission success rate and decreasing packet transmission delays. We consider the residual energy, out-degree and forwarding angle to determine the forwarding probability and payoff function of forwarding candidates. This achieves the aim of load balance and reduces network energy consumption. Simulation results show that based on the average delivery delay, energy consumption and packet delivery ratio performances our protocol is superior to other traditional schemes

Machine Learning in Wireless Sensor Networks: Algorithms, Strategies, and Applications

Wireless sensor networks monitor dynamic environments that change rapidly over time. This dynamic behavior is either caused by external factors or initiated by the system designers themselves. To adapt to such conditions, sensor networks often adopt machine learning techniques to eliminate the need for unnecessary redesign. Machine learning also inspires many practical solutions that maximize resource utilization and prolong the lifespan of the network. In this paper, we present an extensive literature review over the period 2002-2013 of machine learning methods that were used to address common issues in wireless sensor networks (WSNs). The advantages and disadvantages of each proposed algorithm are evaluated against the corresponding problem. We also provide a comparative guide to aid WSN designers in developing suitable machine learning solutions for their specific application challenges.Comment: Accepted for publication in IEEE Communications Surveys and Tutorial

Virtual and topological coordinate based routing, mobility tracking and prediction in 2D and 3D wireless sensor networks

2013 Fall.Includes bibliographical references.A Virtual Coordinate System (VCS) for Wireless Sensor Networks (WSNs) characterizes each sensor node's location using the minimum number of hops to a specific set of sensor nodes called anchors. VCS does not require geographic localization hardware such as Global Positioning System (GPS), or localization algorithms based on Received Signal Strength Indication (RSSI) measurements. Topological Coordinates (TCs) are derived from Virtual Coordinates (VCs) of networks using Singular Value Decomposition (SVD). Topology Preserving Maps (TPMs) based on TCs contain 2D or 3D network topology and directional information that are lost in VCs. This thesis extends the scope of VC and TC based techniques to 3D sensor networks and networks with mobile nodes. Specifically, we apply existing Extreme Node Search (ENS) for anchor placement for 3D WSNs. 3D Geo-Logical Routing (3D-GLR), a routing algorithm for 3D sensor networks that alternates between VC and TC domains is evaluated. VC and TC based methods have hitherto been used only in static networks. We develop methods to use VCs in mobile networks, including the generation of coordinates, for mobile sensors without having to regenerate VCs every time the topology changes. 2D and 3D Topological Coordinate based Tracking and Prediction (2D-TCTP and 3D-TCTP) are novel algorithms developed for mobility tracking and prediction in sensor networks without the need of physical distance measurements. Most existing 2D sensor networking algorithms fail or perform poorly in 3D networks. Developing VC and TC based algorithms for 3D sensor networks is crucial to benefit from the scalability, adjustability and flexibility of VCs as well as to overcome the many disadvantages associated with geographic coordinate systems. Existing ENS algorithm for 2D sensor networks plays a key role in providing a good anchor placement and we continue to use ENS algorithm for anchor selection in 3D network. Additionally, we propose a comparison algorithm for ENS algorithm named Double-ENS algorithm which uses two independent pairs of initial anchors and thereby increases the coverage of ENS anchors in 3D networks, in order to further prove if anchor selection from original ENS algorithm is already optimal. Existing Geo-Logical Routing (GLR) algorithm demonstrates very good routing performance by switching between greedy forwarding in virtual and topological domains in 2D sensor networks. Proposed 3D-GLR extends the algorithm to 3D networks by replacing 2D TCs with 3D TCs in TC distance calculation. Simulation results show that the 3D-GLR algorithm with ENS anchor placement can significantly outperform current Geographic Coordinates (GCs) based 3D Greedy Distributed Spanning Tree Routing (3D-GDSTR) algorithm in various network environments. This demonstrates the effectiveness of ENS algorithm and 3D-GLR algorithm in 3D sensor networks. Tracking and communicating with mobile sensors has so far required the use of localization or geographic information. This thesis presents a novel approach to achieve tracking and communication without geographic information, thus significantly reducing the hardware cost and energy consumption. Mobility of sensors in WSNs is considered under two scenarios: dynamic deployment and continuous movement. An efficient VC generation scheme, which uses the average of neighboring sensors' VCs, is proposed for newly deployed sensors to get coordinates without flooding based VC generation. For the second scenario, a prediction and tracking algorithm called 2D-TCTP for continuously moving sensors is developed for 2D sensor networks. Predicted location of a mobile sensor at a future time is calculated based on current sampled velocity and direction in topological domain. The set of sensors inside an ellipse-shaped detection area around the predicted future location is alerted for the arrival of mobile sensor for communication or detection purposes. Using TPMs as a 2D guide map, tracking and prediction performances can be achieved similar to those based on GCs. A simple modification for TPMs generation is proposed, which considers radial information contained in the first principle component from SVD. This modification improves the compression or folding at the edges that has been observed in TPMs, and thus the accuracy of tracking. 3D-TCTP uses a detection area in the shape of a 3D sphere. 3D-TCTP simulation results are similar to 2D-TCTP and show competence comparable to the same algorithms based on GCs although without any 3D geographic information