Search results for "sensor network"
showing 10 items of 380 documents
RBCR: a Relay-Based Cooperative Routing Protocol for Cooperative Wireless Sensor Network
2011
International audience; In wireless sensor networks several constraints decrease communications performances. The main objective of this paper is to present a multi-objective routing algorithm RBCR that computes routing path based on the energy consumption and channel qualities. Additionally, the channel qualities are evaluated based on the presence of relay nodes. Compared to AODV and AODV associated to a cooperative MAC protocol, RBCR provides better performances.
A combined relay-selection and routing protocol for cooperative wireless sensor networks
2012
International audience; In wireless sensor networks several constraints decrease communications performances. In fact, channel randomness and energy restrictions make classical routing protocols inefficient. Therefore, the design of new routing protocols that cope with these constraints become mandatory. The main objective of this paper is to present a multi-objective routing algorithm RBCR that computes routing path based on the energy consumption and channel qualities. Additionally, the channel qualities are evaluated based on the presence of relay nodes. Compared to AODV and AODV associated to a cooperative MAC protocol, RBCR provides better performances in term of delivery ratio, power …
A Network Protocol to Enhance Robustness in Tree-Based WSNs Using Data Aggregation
2007
This paper proposes a data gathering strategy for wireless sensor networks and an implementation based on the IEEE 802.15.4 standard. The algorithm combines the benefits of single-path and multi-path routing strategies in a hybrid solution which makes use of alternative paths when necessary. We adopt a caching and retransmission technique, which exploits some peculiar features of data aggregation, with the use of implicit acknowledgments of reception. The paper also discusses simulation results that show how the mentioned techniques, combined with exploitation of the features of the IEEE 802.15.4 standard have been used to obtain an efficient protocol that takes energy consumption into acco…
A Group-Based Architecture for Wireless Sensor Networks
2007
Many routing protocols for ad-hoc networks and sensor networks have been designed, but none of them are based on groups. We propose to divide the network into several groups of sensors. When a sensor send data to other groups, the data has to arrive just to one sensor from each group, then they propagate it to the rest of sensors in their groups. We have simulated our proposal for different types of sensor topologies to know which type of topology is the best depending on the number of sensors in the whole network or depending on the number of interior sensors. We have also simulated how much time is needed to propagate information between groups. The application areas for our proposal coul…
A Group-Based Protocol for Large Wireless AD-HOC and Sensor Networks
2008
Many routing protocols for ad-hoc networks and sensor networks have been designed, but none of them is based on groups. It is known that grouping nodes gives better performance to the group and to the whole system, thereby avoiding unnecessary message forwarding and additional overheads. We propose an approach where the network is split into several groups of sensors where connections between groups are established as a function of the proximity and the neighbor's available capacity (based on the sensor's energy). In this paper the network architecture is described with its mathematical description and the messages that are needed to proper operation. It is also simulated how much time is n…
Web Tool for Path Analysis in Wireless Sensor Networks to Improve Their Performance
2018
Wireless Sensor Networks (WSNs) are based on tiny autonomous devices, usually named motes or nodes, and are used in many monitoring applications, such as environment, habitat, precision horticulture, etc. These motes are power-limited and most energy is wasted through the communication process when exchanging data packets. Because these motes are quite simple, with low power transmission and simple antennas, these networks usually run multihop routing protocols in order to forward packets between one mote to the sink, or the collector node, using the other motes as relaying motes. Basically, these routing protocols try to find out new routes within these wireless network, optimizing differe…
Reliable Data Gathering in Tree-Based IEEE 802.15.4 Wireless Sensor Networks
2007
This paper describes a routing protocol for enhanced robustness in IEEE 802.15.4-based sensor networks, which also addresses typical MAC layer issues, including power management, synchronization and link reliability. The algorithm uses a single-path strategy in error-free scenarios and resorts to using alternative paths when communication errors are detected. Our proposal exploits implicit acknowledgement of reception, a feature which may be provided by data aggregation when a broadcast medium such as the wireless channel is used. Therefore MAC layer acknowledgements are not used and errors recovery relies on a caching and retransmission strategy. The protocol requires synchronization among…
An adaptive timer for RPL to handle mobility in wireless sensor networks
2016
This paper focuses on the performance of wireless sensor networks characterized by a hybrid topology composed of mobile and static sensor nodes. The Routing Protocol for Low power and lossy networks (RPL), which is standardized as an IPv6 routing protocol for low power and lossy networks, uses the trickle timer algorithm to handle changes in the network topology. However, this algorithm is not well adapted to dynamic environments. This paper enhances the trickle timer in order to fit with mobility requirements. Most of previous works have improved this algorithm without considering the random movement of nodes. In this work, the proposed timer algorithm takes into consideration the random t…
Reaction-diffusion on dynamic inhibition areas: A bio-inspired link scheduling algorithm
2014
We present the Dynamic Inhibition Areas Reaction-Diffusion (DIA-RD) algorithm, a distributed medium access control protocol that globally maximizes the spatial reusability (number of simultaneous transmissions per unit area) of wireless sensor networks. This algorithm is able, in consequence, to minimize the number of time slots needed to schedule the set of demanded links, making it very efficient to solve the Shortest Link Schedule problem. DIA-RD combines accurate interference management, provided by the use of dynamic inhibition areas based on the physical interference model; and global intelligent behavior, provided by the bio-inspired technique known as Reaction-Diffusion. This techni…
Serial In-network Processing for Large Stationary Wireless Sensor Networks
2017
International audience; In wireless sensor networks, a serial processing algorithm browses nodes one by one and can perform different tasks such as: creating a schedule among nodes, querying or gathering data from nodes, supplying nodes with data, etc. Apart from the fact thatserial algorithms totally avoid collisions, numerous recent works have confirmed that these algorithms reduce communications andconsiderably save energy and time in large-dense networks. Yet, due to the path construction complexity, the proposed algorithmsare not optimal and their performances can be further enhanced. To do so, in the present paper, we propose a new serial processing algorithm that, in most of the case…