Fundamentals of Large Sensor Networks: Connectivity, Capacity, Clocks and Computation

Sensor networks potentially feature large numbers of nodes that can sense their environment over time, communicate with each other over a wireless network, and process information. They differ from data networks in that the network as a whole may be designed for a specific application. We study the theoretical foundations of such large scale sensor networks, addressing four fundamental issues- connectivity, capacity, clocks and function computation. To begin with, a sensor network must be connected so that information can indeed be exchanged between nodes. The connectivity graph of an ad-hoc network is modeled as a random graph and the critical range for asymptotic connectivity is determined, as well as the critical number of neighbors that a node needs to connect to. Next, given connectivity, we address the issue of how much data can be transported over the sensor network. We present fundamental bounds on capacity under several models, as well as architectural implications for how wireless communication should be organized. Temporal information is important both for the applications of sensor networks as well as their operation.We present fundamental bounds on the synchronizability of clocks in networks, and also present and analyze algorithms for clock synchronization. Finally we turn to the issue of gathering relevant information, that sensor networks are designed to do. One needs to study optimal strategies for in-network aggregation of data, in order to reliably compute a composite function of sensor measurements, as well as the complexity of doing so. We address the issue of how such computation can be performed efficiently in a sensor network and the algorithms for doing so, for some classes of functions.Comment: 10 pages, 3 figures, Submitted to the Proceedings of the IEE

RTXP : A Localized Real-Time Mac-Routing Protocol for Wireless Sensor Networks

Protocols developed during the last years for Wireless Sensor Networks (WSNs) are mainly focused on energy efficiency and autonomous mechanisms (e.g. self-organization, self-configuration, etc). Nevertheless, with new WSN applications, appear new QoS requirements such as time constraints. Real-time applications require the packets to be delivered before a known time bound which depends on the application requirements. We particularly focus on applications which consist in alarms sent to the sink node. We propose Real-Time X-layer Protocol (RTXP), a real-time communication protocol. To the best of our knowledge, RTXP is the first MAC and routing real-time communication protocol that is not centralized, but instead relies only on local information. The solution is cross-layer (X-layer) because it allows to control the delays due to MAC and Routing layers interactions. RTXP uses a suited hop-count-based Virtual Coordinate System which allows deterministic medium access and forwarder selection. In this paper we describe the protocol mechanisms. We give theoretical bound on the end-to-end delay and the capacity of the protocol. Intensive simulation results confirm the theoretical predictions and allow to compare with a real-time centralized solution. RTXP is also simulated under harsh radio channel, in this case the radio link introduces probabilistic behavior. Nevertheless, we show that RTXP it performs better than a non-deterministic solution. It thus advocates for the usefulness of designing real-time (deterministic) protocols even for highly unreliable networks such as WSNs

BurstProbe: Debugging Time-Critical Data Delivery in Wireless Sensor Networks

In this paper we present BurstProbe, a new technique to accurately measure link burstiness in a wireless sensor network employed for time-critical data delivery. Measurement relies on shared probing slots that are embedded in the transmission schedule and used by nodes to assess link burstiness over time. The acquired link burstiness information can be stored in the node's flash memory and relied upon to diagnose transmission problems when missed deadlines occur. Thus, accurate diagnosis is achieved in a distributed manner and without the overhead of transmitting rich measurement data to a central collection point. For the purpose of evaluation we have implemented BurstProbe in the GinMAC WSN protocol and we are able to demonstrate it is an accurate tool to debug time-critical data delivery. In addition, we analyze the cost of implementingBurstProbe and investigate its effectiveness

Collision-free Time Slot Reuse in Multi-hop Wireless Sensor Networks

To ensure a long-lived network of wireless communicating sensors, we are in need of a medium access control protocol that is able to prevent energy-wasting effects like idle listening, hidden terminal problem or collision of packets. Schedule-based medium access protocols are in general robust against these effects, but require a mechanism to establish a non-conflicting schedule. In this paper, we present such a mechanism which allows wireless sensors to choose a time interval for transmission, which is not interfering or causing collisions with other transmissions. In our solution, we do not assume any hierarchical organization in the network and all operation is localized. We empirically show that our localized algorithm is successful within a factor 2 of the minimum necessary time slots in random networks; well in range of the expected (worst case) factor 3-approximation of known first-fit algorithms. Our algorithm assures similar minimum distance between simultaneous transmissions as CSMA(/CD)-based approaches

Router deployment of Streetside Parking Sensor Networks in Urban Areas

The deployment of urban infrastructure is very important for urban sensor applications. In this paper, we studied and introduced the deployment strategy of wireless on-street parking sensor networks. We defined a multiple-objective problem with four objectives, and solved them with real street parking map. The results show two sets of Pareto Front with the minimum energy consumption, sensing information delay and the amount of deployed routers and gateways. The result can be considered to provide urban service roadside unit or be taken into account while designing a deployment algorithm.Comment: UM - Urban Modelling Symposium, Oct 2014, Lyon, France. \<http://urbanmodelling.sciencesconf.org/\&g

Opportunistic Sensing in Train Safety Systems

Train safety systems are complex and expensive, and changing them requires huge investments. Changes are evolutionary and small. Current developments, like faster - high speed - trains and a higher train density on the railway network, have initiated research on safety systems that can cope with the new requirements. This paper presents a novel approach for a safety subsystem that checks the composition of a train, based on opportunistic sensing with a wireless sensor network. Opportunistic sensing systems consist of changing constellations sensors that, for a limited amount of time, work together to achieve a common goal. Such constellations are selforganizing and come into being spontaneously. The proposed opportunistic sensing system selects a subset of sensor nodes from a larger set based on a common context.We show that it is possible to use a wireless sensor network to make a distinction between carriages from different trains. The common context is acceleration, which is used to select the subset of carriages that belong to the same train out of all the carriages from several trains in close proximity. Simulations based on a realistic set of sensor data show that the method is valid, but that the algorithm is too complex for implementation on simple wireless sensor nodes. Downscaling the algorithm reduces the number of processor execution cycles as well as memory usage, and makes it suitable for implementation on a wireless sensor node with acceptable loss of precision. Actual implementation on wireless sensor nodes confirms the results obtained with the simulations