Two-Hop Routing with Traffic-Differentiation for QoS Guarantee in Wireless Sensor Networks

This paper proposes a Traffic-Differentiated Two-Hop Routing protocol for Quality of Service (QoS) in Wireless Sensor Networks (WSNs). It targets WSN applications having different types of data traffic with several priorities. The protocol achieves to increase Packet Reception Ratio (PRR) and reduce end-to-end delay while considering multi-queue priority policy, two-hop neighborhood information, link reliability and power efficiency. The protocol is modular and utilizes effective methods for estimating the link metrics. Numerical results show that the proposed protocol is a feasible solution to addresses QoS service differenti- ation for traffic with different priorities.Comment: 13 page

Performance evaluation of wireless sensor networks for mobile event and mobile sink

Extending lifetime and energy efficiency are important objectives and challenges in-Wireless Sensor Networks (WSNs). In large scale WSNs, when the nodes are near to the sink they consume much more energy than the nodes far from the sink. In our previous work, we considered that the sink node was stationary and only event node was moving in the observation field. In this work, we consider both cases when the sink node and event node are moving. For the simulations, we use TwoRayGround and Shadowing radio models, lattice topology and AODV protocol. We compare the simulation results for the cases when the sink node and event node are mobile and stationary. The simulation results have shown that the goodput of TwoRayGround is better than Shadowing in case of mobile event, but the depletion of Shadowing is better than TwoRayGround in case of mobile event. The goodput in case of mobile sink is better than stationary sink when the transmission rate is lower than 10pps. For TwoRayGround radio model, the depletion in case of mobile sink is better than stationary sink when the number of nodes is increasedPeer ReviewedPostprint (published version

Resilient networking in wireless sensor networks

This report deals with security in wireless sensor networks (WSNs), especially in network layer. Multiple secure routing protocols have been proposed in the literature. However, they often use the cryptography to secure routing functionalities. The cryptography alone is not enough to defend against multiple attacks due to the node compromise. Therefore, we need more algorithmic solutions. In this report, we focus on the behavior of routing protocols to determine which properties make them more resilient to attacks. Our aim is to find some answers to the following questions. Are there any existing protocols, not designed initially for security, but which already contain some inherently resilient properties against attacks under which some portion of the network nodes is compromised? If yes, which specific behaviors are making these protocols more resilient? We propose in this report an overview of security strategies for WSNs in general, including existing attacks and defensive measures. In this report we focus at the network layer in particular, and an analysis of the behavior of four particular routing protocols is provided to determine their inherent resiliency to insider attacks. The protocols considered are: Dynamic Source Routing (DSR), Gradient-Based Routing (GBR), Greedy Forwarding (GF) and Random Walk Routing (RWR)

CERN Storage Systems for Large-Scale Wireless

The project aims at evaluating the use of CERN computing infrastructure for next generation sensor networks data analysis. The proposed system allows the simulation of a large-scale sensor array for traffic analysis, streaming data to CERN storage systems in an efficient way. The data are made available for offline and quasi-online analysis, enabling both long term planning and fast reaction on the environment

Evaluation of RPL’s Single Metric Objective Functions

In this paper, we evaluate the performance of RPL (IPv6 Routing Protocol for Low Power and Lossy Networks) based on the Objective Function being used to construct the Destination Oriented Directed Acyclic Graph (DODAG). Using the Cooja simulator, we compared Objective Function Zero (OF0) with the Minimum Rank with Hysteresis Objective Function (MRHOF) in terms of average power consumption, packet loss ratio, and average end-to-end latency. Our study shows that RPL performs better in terms of packet loss ratio and average endto-end latency when MRHOF is used as an objective function. However, the average power consumption is noticeably higher compared to OF0

Routing efficiency in wireless sensor-actor networks considering semi-automated architecture

Wireless networks have become increasingly popular and advances in wireless communications and electronics have enabled the development of different kind of networks such as Mobile Ad-hoc Networks (MANETs), Wireless Sensor Networks (WSNs) and Wireless Sensor-Actor Networks (WSANs). These networks have different kind of characteristics, therefore new protocols that fit their features should be developed. We have developed a simulation system to test MANETs, WSNs and WSANs. In this paper, we consider the performance behavior of two protocols: AODV and DSR using TwoRayGround model and Shadowing model for lattice and random topologies. We study the routing efficiency and compare the performance of two protocols for different scenarios. By computer simulations, we found that for large number of nodes when we used TwoRayGround model and random topology, the DSR protocol has a better performance. However, when the transmission rate is higher, the routing efficiency parameter is unstable.Peer ReviewedPostprint (published version