Entity

Time filter

Source Type

Bordj El Bahri, Algeria

Demigha O.,Computer Science Unit | Hidouci W.-K.,Computer Science | Ahmed T.,University of Bordeaux 1
IEEE Communications Letters | Year: 2014

In this letter, we propose a binary integer linear programming (BILP) model of the problem of Energy Minimization under the constraint of Data Precision in the context of correlated data collection in wireless sensor networks, called EMDP. The exact solution of our BILP model determines, in each round of data collection, the role of each node in terms of sensing, data relaying, and processing. It gives the baseline for optimal network operations and helps characterizing the complexity of EMDP problem. Moreover, we propose a heuristic solution, namely, CORAD, which is an energy-aware correlation-based adaptive dynamic clustering algorithm for data collection. Index Terms-Integer linear programming, energy efficiency, wireless sensor networks, sensor selection, data collection. © 2014 IEEE. Source


Djamaa B.,Cranfield University | Djamaa B.,Computer Science Unit | Richardson M.,Cranfield University | Barker P.,Cranfield University | Aissani M.,Computer Science Unit
IEEE Vehicular Technology Conference | Year: 2015

In Low-power and Lossy Networks (LLNs), multicast communications accommodate many interesting applications ranging from firmware installation and upgrades to resource discovery and utilization. However, performing multicast in LLNs has shown to be less efficient and lacks reliability when compared with unicast. This is especially the case under radio duty cycling mechanisms employed by LLNs in order to save energy and hence extend the network lifetime. In this paper, we present a technique to enhance the performance of multicast burst forwarding in duty-cycled LLNs. The proposed mechanism has been implemented in Contiki OS and evaluated in both testbed experiments and cycle-accurate simulations. Results show a considerable increase of multicast burst throughput (more than 8 times) accompanied with an important decrease in energy consumption (about three times) and transmission latency (at least 35%). Finally, the proposed mechanism was integrated with a multicast-based service discovery protocol and demonstrated noticeable improvements. © 2015 IEEE. Source


Aissani M.,Computer Science Unit | Bouznad S.,Computer Science Unit | Hariza A.,Computer Science Unit | Allia S.-E.,Computer Science Unit
Sensors and Transducers | Year: 2012

Closed voids are created within a deployed wireless sensor network (WSN), but open voids are often formed on the boundary of this network. Geographical routing protocols must handle these voids where packets fall into local minima. To contribute on resolving this problem, we propose in this paper an effective void-tolerant routing approach based on two mechanisms for handling any kind of void. Our approach uses simple and effective algorithms ensuring discovery and maintenance of voids in a WSN. Contrary to existing void-handling techniques, our proposal uses information of all voids for better orienting data packets toward their destination in optimal paths around the voids. Proposed approach has good performances in terms of packet delivery ratio, average routing path length, control packets overhead, energy of network and boundary nodes consumed per delivered packet, and average residual deadline of delivered packets. © 2012 IFSA. Source

Discover hidden collaborations