The IEEE 802.15.4e MAC amendment has been proposed to meet the requirements of industrial applications. Using slotted medium access with channel hopping, the MAC layer orchestrates the medium accesses of nodes according to a given schedule. Nevertheless, this amendment does not specify how this schedule is computed. The purpose of this paper is to propose a distributed joint time slot and channel assignment, called Wave, for data gathering in low-power lossy networks. This schedule targets minimised data convergecast delays by reducing the total number of slots in the schedule. Moreover, Wave ensures the absence of conflicting transmissions in the schedule provided. In such a schedule, a node is awake only during its transmission slots and those of its children in the convergecast routing graph. Thus, energy efficiency is ensured. In this paper, we present Wave with its properties (e.g. support of heterogeneous traffic, support of a sink equipped with multiple interfaces, worst case delays and buffer size) and compare it with a centralised scheduling algorithm like TMCP and a distributed one like DeTAS. Simulation results show the good performance of Wave compared with TMCP. Because in an industrial environment, several routing graphs can coexist, we study how Wave supports this coexistence. Copyright

International audienceIn aerospace applications, wireless sensor networks (WSNs) collect data from sensor nodes towards a sink in a multi-hop convergecast structure. The throughput requirement of these applications is difficult to meet with a single wireless channel. That is why, in this paper, we focus on a multichannel time slot assignment that minimizes the data gathering cycle. We first formalize the problem as a linear program and compute the optimal time needed for a raw data convergecast in various multichannel topologies. These optimal times apply to sinks equipped with one or several radio interfaces. We then propose our algorithm called MODESA and prove its optimality in various multichannel topologies. We evaluate its performances in terms of number of slots, maximum buffer size and number of active/sleep switches per node. Furthermore, we present variants of MODESA achieving a load balancing between the channels used

In this paper, we propose a new multichannel allocation protocol for ZigBee/IEEE 802.15.4 networks. The main goal is to improve the global throughput which is basically insufficient to satisfy high bandwidth requirements for applications like monitoring or traffic control. The solution is based on the availability of multiple channels on current lowcost, low-energy radio transceivers, such as CC2420, which can be easily tuned dynamically to different frequencies. This possibility can be exploited to increase the number of simultaneous transmissions on adjacent links. The allocation of the different channels is centralized and distributed by the coordinator thanks to a function designed to compute the channel offset between two successive children routers. In the nodes, the switching process between the transmission and the reception channels is triggered starting from the PHY primitive available on the transceiver. The evaluation shows that the proposed protocol improves the global throughput by a factor between 2 and 5, depending on the scenario, compared to the single-channel solution or a random channel allocation.

The new IEEE 802.15.4e standard does not specify how the schedule of medium accesses followed by wireless sensors is built. That is why, we propose a distributed interferenceaware joint channel and time slot assignment, called DiSCA, for a traffic-aware convergecast in multichannel wireless sensor networks (WSNs). Unlike most previous studies, we consider two cases of transmissions: without acknowledgment and with immediate acknowledgment. We provide the minimum bound on the number of time slots needed for a convergecast with a sink equipped with multiple radio interfaces. Simulations results show that DiSCA is close to the optimal in terms of the number of slots and outperforms TMCP.

No abstract

In this paper, we focus on the deployment of wireless sensor nodes in an arbitrary realistic area with an irregular shape, and with the presence of obstacles that may be opaque. Moreover, we propose a simple projection-based method that tends to minimize the number of sensor nodes needed to fully cover such an area. This method starts with the optimal uniform deployment based on the triangular tessellation encompassing the whole area. Then, it projects some external sensor nodes on the border to ensure full coverage and connectivity. We show that this method outperforms the contour-based one using various types of irregular areas.

To cite this version:Ridha Soua, Erwan Livolant, Pascale Minet. MUSIKA: A multichannel multi-sink data gathering algorithm in wireless sensor networks.

Wireless sensor networks are adapted to monitoring applications. Specific solutions have to be developed for industrial environments in order to deal with the harsh radio conditions and the QoS (quality of service) requirements of industrial applications. In this paper, we present the main protocols used in the OCARI project, and we describe their use of cross-layering techniques. We show how it enables us to improve the performance of the network. For each protocol, we give a performance evaluation of its main characteristic.