Hania Aoudia

Hierarchical routing approach-based energy optimization in wireless sensor networks

We propose a critical improvement of the LEACH (Low-Energy Adaptive Clustering Hierarchy) routing protocol for the optimization of the energy consumption as well as memory occupation of Wireless Sensor Network (WSN). Our protocol LEACH-M uses a cascade of clustering algorithms, every step of which chooses the next one. We expect at best an improvement of 5% of energy consumption and since the lifetime of the application is itself improved the amount of data routed is improved in the same amount. Of course, testing our approach using it along a comparative study with the standard LEACH confirms our expectation.

Wireless Sensor Networks Lifetime Extension Based on a New Hybrid Hierarchical Routing Mechanism

Streamline energy consumption in Wireless Sensor Network (WSN) is and stills a topical problem in which several investigations have undertaken. The aim is to develop mechanisms such those based on routing protocols, for prolonging the network lifetime leading to improve its robustness and fluidity of transmissions, and then ensure an overall stable operation. In this paper, we present a robust and hybrid hierarchical multi-hop routing protocol wherein a dynamic clustering mechanism is implemented for optimal clusters construction. The approach combines successfully heterogonous information in terms of residual energy and signal strength of nodes and allows a multipath search by optimizing end-to-end delay and energy consumption. The effectiveness of the proposed approach is illustrated in simulations. For this purpose, a comparative study with LEACH protocol has been carried out for several networks with different densities.

Energy-efficient routing protocol based on dynamicclustering mechanism for WSN applications

The aim of this work is to develop a routing protocol for wireless sensor networks (WSN) applications taking into account constraints such as network lifetime and energy consumption. We propose a robust hierarchical routing protocol using a dynamic clustering mechanism (HRP-DCM) which consists to build clusters wherein coordinators nodes with extra privileges called Cluster-Head (CH) are able to create and manipulate messages using TDMA schedule and aggregate data according to CDMA method. The network reconfiguration is carried out dynamically based on some threshold value which is associated to the number of nodes belonging to a biggest cluster. To test the effectiveness of the proposed approach, some comparative studies with other well known clustering algorithms have been conducted.

Energy Optimization Mechanism in Wireless Sensor Networks

Nowadays, wireless sensor networks (WSN) present a lot of interest in several research areas due to their wide range of applications. One of the most critical problems is how to ensure a better and efficient communication taking into account some constraints such as network lifetime and energy consumption. In this context and as an alternative, several papers focusing on the conception and development of robust routing protocols have been undertaken these last decades. In this paper, we propose a robust hierarchical routing protocol using a dynamic clustering mechanism (HRP-DCM) which consists to build clusters wherein coordinators nodes with extra privileges called Cluster-Head (CH) are able to create and manipulate messages using TDMA schedule and aggregate data according to CDMA method. The effectiveness of the proposed approach is illustrated in simulations.

An embedded control architecture for smart wheelchair navigation via wireless network

This paper presents a monitoring and control approach based on virtual impedance method for handicapped peoples assistance. The approach uses a wireless communication network which is based on 802.11 standards. This approach allows a reliable remote maneuvering with obstacle avoidance taking into account systems interactive behaviour. To test the effectiveness of the proposed approach, simulations and experimentation are designed in this respect.