Abdelmadjid Bouabdallah

Energy Efficiency in Wireless Sensor Networks: a top-down survey

The design of sustainable wireless sensor networks (WSNs) is a very challenging issue. On the one hand, energy-constrained sensors are expected to run autonomously for long periods. However, it may be cost-prohibitive to replace exhausted batteries or even impossible in hostile environments. On the other hand, unlike other networks, WSNs are designed for specific applications which range from small-size healthcare surveillance systems to large-scale environmental monitoring. Thus, any WSN deployment has to satisfy a set of requirements that differs from one application to another. In this context, a host of research work has been conducted in order to propose a wide range of solutions to the energy-saving problem. This research covers several areas going from physical layer optimization to network layer solutions. Therefore, it is not easy for the WSN designer to select the efficient solutions that should be considered in the design of application-specific WSN architecture. We present a top-down survey of the trade-offs between application requirements and lifetime extension that arise when designing wireless sensor networks. We first identify the main categories of applications and their specific requirements. Then we present a new classification of energy-conservation schemes found in the recent literature, followed by a systematic discussion as to how these schemes conflict with the specific requirements. Finally, we survey the techniques applied in WSNs to achieve trade-off between multiple requirements, such as multi-objective optimisation.

IP mobile multicast: Challenges and solutions

This article outlines the challenges of IP multicast over Mobile IP. Then it provides a comprehensive overview of existing multicast solutions to handle mobile sources and receivers in both the Mobile IPv4 and the Mobile IPv6 environments. The solutions are classified into different classes in light of how the network infrastructure is used and the nature of the multicast members (receivers or sources). For each solution, we present a brief overview; we describe the architecture and the proposed protocol; we discuss the advantages and the limitations; and we compare qualitatively all the solutions of each class based on common criteria such as optimal routing, join latency, handover transparency, etc.

Review: Wireless sensor networks for rehabilitation applications: Challenges and opportunities

Rehabilitation supervision has emerged as a new application of wireless sensor networks (WSN), with unique communication, signal processing and hardware design requirements. It is a broad and complex interdisciplinary research area on which more than one hundred papers have been published by several research communities (electronics, bio-mechanical, control and computer science). In this paper, we present WSN for rehabilitation supervision with a focus on key scientific and technical challenges that have been solved as well as interdisciplinary challenges that are still open. We thoroughly review existing projects conducted by several research communities involved in this exciting field. Furthermore, we discuss the open research issues and give directions for future research works. Our aim is to gather information that encourage engineers, clinicians and computer scientists to work together in this field to tackle the arising challenges. We believe that bridging researchers with different scientific backgrounds could have a significant impact on the development of WSN for rehabilitation and could improve the way rehabilitation is provided today.

A taxonomy of multicast data origin authentication: Issues and solutions

Multicasting is an efficient communication mechanism for group-oriented applications such as videoconferencing, broadcasting stock quotes, interactive group games, and video on demand. The lack of security obstructs a large deployment of this efficient communication model. This limitation motivated a host of research works that have addressed the many issues relating to securing the multicast, such as confidentiality, authentication, non-repudiation, integrity, and access control. Many applications, such as broadcasting stock quotes and video-conferencing, require data origin authentication of the received traffic. Hence, data origin authentication is an important component in the multicast security architecture. Multicast data origin authentication must take into consideration the scalability and the efficiency of the underlying cryptographic schemes and mechanisms, because multicast groups can be very large and the exchanged data is likely to be heavy in volume (streaming). Besides, multicast data origin authentication must be robust enough against packet loss because most multicast multimedia applications do not use reliable packet delivery. Therefore, multicast data origin authentication is subject to many concurrent and competitive challenges, when considering these miscellaneous application-level requirements and features. In this article we review and classify recent works dealing with the data origin authentication problem in group communication, and we discuss and compare them with respect to some relevant performance criteria.

Secure and Scalable Cloud-Based Architecture for e-Health Wireless Sensor Networks

There has been a host of research works on wireless sensor networks for medical applications. However, the major shortcoming of these efforts is a lack of consideration of data management. Indeed, the huge amount of high sensitive data generated and collected by medical sensor networks introduces several challenges that existing architectures cannot solve. These challenges include scalability, availability and security. In this paper, we propose an innovative architecture for collecting and accessing large amount of data generated by medical sensor networks. Our architecture resolves all the aforementioned challenges and makes easy information sharing between healthcare professionals. Furthermore, we propose an effective and flexible security mechanism that guarantees confidentiality, integrity as well as fine grained access control to outsourced medical data. This mechanism combines several cryptographic schemes to achieve high flexibility and performance.

A Highly Scalable Key Pre-Distribution Scheme for Wireless Sensor Networks

Given the sensitivity of the potential WSN applications and because of resource limitations, key management emerges as a challenging issue for WSNs. One of the main concerns when designing a key management scheme is the network scalability. Indeed, the protocol should support a large number of nodes to enable a large scale deployment of the network. In this paper, we propose a new scalable key management scheme for WSNs which provides a good secure connectivity coverage. For this purpose, we make use of the unital design theory. We show that the basic mapping from unitals to key pre-distribution allows us to achieve high network scalability. Nonetheless, this naive mapping does not guarantee a high key sharing probability. Therefore, we propose an enhanced unital-based key pre-distribution scheme providing high network scalability and good key sharing probability approximately lower bounded by 1-e-1 ≈ 0.632. We conduct approximate analysis and simulations and compare our solution to those of existing methods for different criteria such as storage overhead, network scalability, network connectivity, average secure path length and network resiliency. Our results show that the proposed approach enhances the network scalability while providing high secure connectivity coverage and overall improved performance. Moreover, for an equal network size, our solution reduces significantly the storage overhead compared to those of existing solutions.

SAKM: a scalable and adaptive key management approach for multicast communications

Multicasting is increasingly used as an efficient communication mechanism for group-oriented applications in the Internet. In order to offer secrecy for multicast applications, the traffic encryption key has to be changed whenever a user joins or leaves the system. Such a change has to be communicated to all the current users. The bandwidth used for such rekeying operation could be high when the group size is large. The proposed solutions to cope with this limitation, commonly called 1 affects n phenomenon, consist of organizing group members into subgroups that use independent traffic encryption keys. This kind of solutions introduce a new challenge which is the requirement of decrypting and reencrypting multicast messages whenever they pass from one subgroup to another. This is a serious drawback for applications that require real-time communication such as video-conferencing. In order to avoid the systematic decryption / reencryption of messages, we propose in this paper an adaptive solution which structures group members into clusters according to the application requirements in term of synchronization and the membership change behavior in the secure session. Simulation results show that our solution is efficient and typically adaptive compared to other schemes.

Key management for content access control in a hierarchy

The need for content access control in hierarchies (CACH) appears naturally in all contexts where a set of users have different access rights to a set of resources. The hierarchy is defined using the access rights. The different resources are encrypted using different keys. Key management is a critical issue for scalable content access control. In this paper, we study the problem of key management for CACH. We present main existing access control models, and show why these models are not suitable to the CACH applications, and why they are not implemented in the existing key management schemes. Furthermore, we classify these key management schemes into two approaches, and construct an access control model for each approach. The proposed access control models are then used to describe the schemes in a uniform and coherent way. A final contribution of our work consists of a classification of the CACH applications, a comparison of the key management schemes, and a study of the suitability of the existing schemes to the CACH applications with respect to some analytical measurements.

Distributed mutual exclusion algorithms in mobile ad hoc networks: an overview

The problem of mutual exclusion has been extensively studied in distributed systems. The proposed solutions can be mainly classified in consensus based and token based protocols. Some of the proposed solutions consider the physical topology of the networks and try to provide optimal message exchange and minimal synchronisation delays. Others, impose a logical structure on the network like a ring or a tree. Recently, the mutual exclusion problem received an interest for mobile ad hoc networks. These networks are known as a challenging domain. To our knowledge, few algorithms have been proposed in the literature and all of them are token based approach. In this paper, we review the distributed mutual exclusion algorithms developed for mobile environments and principally for ad hoc networks and discuss some issues.

Review: Synchronous contention-based MAC protocols for delay-sensitive wireless sensor networks: A review and taxonomy

Duty-cycling allows obtaining significant energy saving compared to full duty cycle (sleepless) random access MAC protocols. However, it may result in significant latency. In slotted duty-cycled medium access control (MAC) protocols, sensor nodes periodically and synchronously alternate their operations between active and sleep modes. The sleep mode allows a sensor node to completely turn off its radio and save energy. In order to transmit data from one node to another, both nodes must be in active mode. The synchronous feature makes the protocols more appropriate for delay-sensitive applications compared to asynchronous protocols. The latter involve additional delay for the sender to meet the receivers active period, which is eliminated with synchronous approach where nodes sleep and wake up all together. Despite the possible increase of contention by grouping active periods, the delay due to packets retransmissions after collisions is less significant compared to the waiting time of asynchronous protocols. Furthermore, contention-based feature makes the protocol conceptually distributed and more dynamic compared to TDMA-based. This manuscript deals with timeliness issues of slotted contention-based WSN MAC protocols. It provides a comprehensive review and taxonomy of state-of-the-art synchronous MAC protocols. The performance objective considered in the proposed taxonomy is the latency, in the context of energy-limited WSN, where energy is considered as a constraint for the MAC protocol that yields the need of duty-cycling the radio. The main contribution is to study and classify these protocols from the delay efficiency perspective. The protocols are divided into two main categories: static schedule and adaptive schedule. Adaptive schedule are split up into four subclasses: adaptive grouped schedule, adaptive repeated schedule, staggered schedule, and reservation schedule. Several state-of-the-art protocols are described following the proposed classification, with comprehensive discussions and comparisons with respect to their latency.