Automatic discovery of topologies and addressing for Linear wireless sensors networks

Abstract

Abstract-Wireless sensor networks are a collection of sensor nodes that collaborate to sense a specific event in a given environment. When sensors monitor a structure organized linearly (e.g., pipelines, rivers, railways), they are organized in Linear WSN (LWSN, constituted by connected portions of lines), with different properties than a uniformly deployed WSN. The distributed address allocation in the ZigBee cluster-tree suffers from limitations in LWSN: the number of children is limited, as well as the maximum number of children routers, and the maximum tree depth. Stochastic address assignment, also available in ZigBee, has a high cost in exchanged messages and requires an expensive (in terms of messages and memory) routing process. This paper proposes an automatic discovery of topologies for linear wireless sensor networks combined with an efficient addressing mechanism. We show that our proposition avoids the waste of addresses while keeping the number of messages exchanged proportional to the number of nodes in the network.

Topology Discovery for Linear Wireless Networks With Application to Train Backbone Inauguration

“…It can be seen from Figs. [9][10][11], that the analysis predicts the performance of neighbor discovery well in terms of the three criteria. As expected, the success rate and time needed The average time needed to achieve a successful neighbor discovery and overall inauguration versus M H (p H = 0.15, p T = 0.15 and SNR 0 = 15 dB).…”

Wireless Sensor Networks for Road Traffic Monitoring

“…In order to achieve this goal we propose to modify the current addressing method; Instead of using the typical 8 bytes for node address, we could just use two bytes for node address. The proposed MAC overcomes the typical cluster tree algorithm [12] by providing reliable communication links and avoiding well-known limitation of the earlier mentioned algorithm. Furthermore, the main features of the proposed MAC are to overcome some of limitations of the Jennic propriety MAC implementation by decreasing the protocol overhead, increasing maximum data packet size, providing a bidirectional communication links and supporting the linear network topology.…”

“…Many other possible candidate applications could be also considered as in [9], [10] and [11] not only for speed monitoring or temperature measurement, but also for GIS data collection to enhance the health of important structures as tunnels, bridges, and kinetic traffic structures to avoid disasters and improve environmental quality by measuring co2 emissions inside tunnels and ventilate it properly in times of congestion, vibration of bridges and avoid collapse caused by resonance,surface humidity and protect vehicles from slipping away by forcing proper speed ... etc. For such topology, ZigBee cluster-tree can be implemented as well to exchange data between nodes, where this method suffers from limitations in LWSN: the limited number of children, and as well as the maximum number of children routers, and the maximum tree depth as stated and discussed by [12]. Therefore, the goal of this work is to design a new MAC protocol that would take advantage of the linear topology nature and characteristics in order to minimize the energy consumption needed to exchange the collected date among the sensor nodes.…”

Using a token approach for the MAC layer of linear sensor networks: Impact of the node position on the packet delivery

“…Packets are forwarded from node to node without aggregation in a store-and-forward manner. Address management and routing protocol are treated as in [11]. Any node that has the token can transmit data frames.…”