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

No abstract

To cite this version:Abstract-The myriad of potential applications supported by wireless sensor networks (WSNs) has generated much interest from the research community. Various applications range from small size low industrial monitoring to large scale energy constrained environmental monitoring. In all cases, an operational network is required to fulfill the application missions. In addition, energy consumption of nodes is a great challenge in order to maximize network lifetime. Unlike other networks, it can be hazardous, very expensive or even impossible to charge or replace exhausted batteries due to the hostile nature of environment.Researchers are invited to design energy efficient protocols while achieving the desired network operations. This paper focuses on different techniques to reduce the consumption of the limited energy budget of sensor nodes. After having identified the reasons of energy waste in WSNs, we classify energy efficient techniques into five classes, namely data reduction, control reduction, energy efficient routing, duty cycling and topology control. We then detail each of them, presenting subdivisions and giving many examples. We conclude by a recapitulative table.

Wireless Sensor Networks (WSNs) have many fields of application, including industrial, environmental, military, health and home domains. Monitoring a given zone is one of the main goals of this technology. This consists in deploying sensor nodes in order to detect any event occurring in the zone of interest considered and report this event to the sink. The monitoring task can vary depending on the application domain concerned. In the industrial domain, the fast and easy deployment of wireless sensor nodes allows a better monitoring of the area of interest in temporary worksites. This deployment must be able to cope with obstacles and be energy efficient in order to maximize the network lifetime. If the deployment is made after a disaster, it will operate in an unfriendly environment that is discovered dynamically. We present a survey that focuses on two major issues in WSNs: coverage and connectivity. We motivate our study by giving different use cases corresponding to different coverage, connectivity, latency and robustness requirements of the applications considered. We present a general and detailed analysis of deployment problems, while highlighting the impacting factors, the common assumptions and models adopted in the literature, as well as performance criteria for evaluation purposes. Different deployment algorithms for area, barrier, and points of interest are studied and classified according to their characteristics and properties. Several recapitulative tables illustrate and summarize our study. The designer in charge of setting up such a network will find some useful recommendations, as well as some pitfalls to avoid. Before concluding, we look at current trends and discuss some open issues.

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