Academic & Scientific Articles
Permanent URI for this communityhttp://dl.cerist.dz/handle/CERIST/3
Browse
23 results
Search Results
Item SMART: Secure Multi-pAths Routing for wireless sensor neTworks(IEEE, 2014-06-22) Lasla, Noureddine; Derhab, Abdelouahid; Ouadjaout, Abdelraouf; Bagaa, Miloud; Challal, YacineIn this paper, we propose a novel secure routing protocol named Secure Multi-pAths Routing for wireless sensor neTworks (SMART) as well as its underlying key management scheme named Extended Twohop Keys Establishment (ETKE). The proposed framework keeps consistent routing topology by protecting the hop count information from being forged. It also ensures a fast detection of inconsistent routing information without referring to the sink node. We analyze the security of the proposed scheme as well as its resilience probability against the forged hop count attack. We have demonstrated through simulations that SMART outperforms a comparative solution in literature, i.e., SeRINS, in terms of energy consumptionItem Distributed Algorithm for the Actor Coverage Problem in WSN-based Precision Irrigation Applications(IEEE, 2011-05) Derhab, Abdelouahid; Lasla, NoureddineIn this paper, we study the actor coverage problem with the goal of meeting the requirements of precision irrigation applications in Wireless sensor and Actor Networks (WSANs), which are : (1) the volume of water applied by actors should match plant water demand and (2) minimizing over-irrigation to the least extent. We take a novel approach to define and resolve the actor coverage problem. Based on this approach, we propose two algorithms : Centralized Actor-Coverage-IRRIG (CACI) and Distributed Actor-Coverage-IRRIG (DACI). The existing centralized and distributed approaches for the minimum cost actor coverage problem in WSANs are not optimal for all metrics. The communication scheme of DACI is designed in the way that it can keep the advantages of the centralized and the distributed approaches without inheriting their weaknesses. DACI constructs an actor cover set with the same optimality cost as CACI while incurring low signaling overhead. Complexity analysis and simulations results show that CACI and DACI are both better than the existing centralized algorithm in terms of cover set optimality. Also, DACI is better than the existing distributed algorithm in terms of message overhead.Item Interference-aware Congestion Control Protocol for Wireless Sensor Networks(Elsevier, 2014-09) Kafi, Mohamed Amine; Djenouri, Djamel; Ben Othman, Jalel; Ouadjaout, Abdelraouf; Bagaa, Miloud; Lasla, Noureddine; Badache, NadjibThis paper deals with congestion and interference control in wireless sensor networks (WSN), which is essential for improving the throughput and saving the scarce energy in networks where nodes have different capacities and traffic patterns. A scheme called IACC (Interference-Aware Congestion Control) is proposed. It allows maximizing link capacity utilization for each node by controlling congestion and interference. This is achieved through fair maximum rate control of interfering nodes in inter and intra paths of hot spots. The proposed protocol has been evaluated by simulation, where the results rival the effectiveness of our scheme in terms of energy saving and throughput. In particular, the results demonstrate the protocol scalability and considerable reduction of packet loss that allow to achieve as high packet delivery ratio as 80% for large networks.Item SEDAN: Secure and Efficient protocol for Data Aggregation in wireless sensor Networks(IEEE, 2007-10-15) Bagaa, Miloud; Lasla, Noureddine; Ouadjaout, Abdelraouf; Challal, Yacine—Energy is a scarce resource in Wireless Sensor Networks. Some studies show that more than 70% of energy is consumed in data transmission. Since most of the time, the sensed information is redundant due to geographically collocated sensors, most of this energy can be saved through data aggregation. Furthermore, data aggregation improves bandwidth usage. Unfortunately, while aggregation eliminates redundancy, it makes data integrity verification more complicated since the received data is unique. In this paper, we present a new protocol that provides secure aggregation for wireless sensor networks. Our protocol is based on a two hops verification mechanism of data integrity. Our solution is essentially different from existing solutions in that it does not require referring to the base station for verifying and detecting faulty aggregated readings, thus providing a totally distributed scheme to guarantee data integrity. We carried out simulations using TinyOS environment. Simulation results show that the proposed protocol yields significant savings in energy consumption while preserving data integrity.Item Poster Abstract: Static Analysis of Device Drivers in TinyOS(ACM/IEEE, 2014-04-15) Ouadjaout, Abdelraouf; Lasla, Noureddine; Bagaa, Miloud; Badache, NadjibIn this paper, we present SADA, a static analysis tool to verify device drivers for TinyOS applications. Its broad goal is to certify that the execution paths of the application complies with a given hardware specification. SADA can handle a broad spectrum of hardware specifications, ranging from simple assertions about the values of configuration registers, to complex behaviors of possibly several connected hardware components. The hardware specification is expressed in BIP, a language for describing easily complex interacting discrete components. The analysis of the joint behavior of the application and the hardware specification is then performed using the theory of Abstract Interpretation. We have done a set of experiments on some TinyOS applications. Encouraging results are obtained that confirm the effectiveness of our approach.Item On the Effect of Sensing-Holes in PIR-based Occupancy Detection Systems(2016-02-20) Ouadjaout, Abdelraouf; Lasla, Noureddine; Djenouri, Djamel; Zizoua, CherifSensing-holes in PIR-based motion detection systems are considered, and their impact on occupancy monitoring applications is investigated. To our knowledge, none of prior works on PIR-based systems consider the presence of these holes, which represents the major cause for low precision of such systems in environments featured with very low mobility of occupants, such as working offices. We consider optimal placement of PIRs that ensures maximum coverage in presence of holes. The problem is formulated as a mixed integer linear programming optimization problem (MILP). Based on this formulation, an experimental study on a typical working office has been carried out. The empirical results quantify the effects of the holes on the detection accuracy and demonstrate the enhancement provided by the optimal deployment of the solution.Item On optimal anchor placement for effecient area-based localization in wireless networks(CERIST, 2015-06-08) Lasla, Noureddine; Younis, Mohamed; Ouadjaout, Abdelraouf; Badache, NadjibArea-based localization is a simple and efficient approach, where each node estimates its position based on proxim- ity information to some special nodes with known location, called anchors. Based on the anchors’ coordinates, each node first determines its residence area and then approximates its position as the centroid of that area. Therefore, the accu- racy of the estimated position depends on the size of the residence area; the smaller the residence area is, the bet- ter the accuracy is likely to be. Because the size of the residence area mainly depends on the number and the posi- tions of anchor nodes, their deployment should be carefully considered in order to achieve a better accuracy while mini- mizing the cost. For this purpose, in this paper we conduct a theoretical study on anchor placement for a very popular area based localization approach. We determine the optimal anchor placement pattern for increased accuracy and how to achieve a particular accuracy goal with the least anchor count. Our analytical results are further validated through simulation.Item SMART: Secure Multi-pAths Routing for wireless sensor neTworks(CERIST, 2014-06-22) Lasla, Noureddine; Derhab, Abdelouahid; Ouadjaout, Abdelraouf; Bagaa, Miloud; Challal, YacineAbstract. In this paper, we propose a novel secure routing protocol named Secure two-hop disjoint Multi-pAths Routing for wireless sensor neTworks (SMART) as well as its underlying key management scheme named Extended Two-hop Keys Establishment (ETKE). The proposed framework keeps consistent routing topology by protecting the hop count information from being forged. The two-hop scheme ensures immediate verification and fast detection of inconsistent routing information with- out referring to the sink node. We prove that it is sufficient to keep only two-hop disjoint paths to ensure full-resilience against node capture attacks. We have demonstrated through simulations that our solution outperforms a comparative solution in literature. In addition, ETKE is more resilient to node capture attacks than the probabilistic key man- agement schemes.Item Inertial Measurement Unit: Evaluation for Indoor Positioning(CERIST, 2014-05-17) Ksentini, Dalila; Elhadi, A.Rahim; Lasla, NoureddineIn this paper, we tackle the problem of indoor positioning, where the GPS signals are unavailable and the energy consumption of battery powered mobile devices should be carefully considered during the positioning process. For this purpose, we study the inertial navigation system (INS), which uses only a set of inertial sensors, that represent an Inertial Measurement Unit (IMU), attached to the mobile without referring to any external positioning system. This technique is characterized by its low cost and low energy consumption, while ensuring an effective positioning in indoor environments. The aim of this work is to evaluate the IMU in order to develop an indoor positioning application. A set of tests were made with the accelerometer to examine its accuracy and its use in the process of positioning. The obtained results are encouraging and allowed us to develop an android based positioning application with an acceptable degree of accuracy.Item On optimal anchor placement for effecient area-based localization in wireless networks(IEEE, 2015-06-08) Lasla, Noureddine; Younis, Mohamed; Ouadjaout, Abdelraouf; Badache, NadjibArea-based localization is a simple and efficient approach, where each node estimates its position based on proxim- ity information to some special nodes with known location, called anchors. Based on the anchors’ coordinates, each node first determines its residence area and then approximates its position as the centroid of that area. Therefore, the accu- racy of the estimated position depends on the size of the residence area; the smaller the residence area is, the bet- ter the accuracy is likely to be. Because the size of the residence area mainly depends on the number and the posi- tions of anchor nodes, their deployment should be carefully considered in order to achieve a better accuracy while mini- mizing the cost. For this purpose, in this paper we conduct a theoretical study on anchor placement for a very popular area based localization approach. We determine the optimal anchor placement pattern for increased accuracy and how to achieve a particular accuracy goal with the least anchor count. Our analytical results are further validated through simulation.
- «
- 1 (current)
- 2
- 3
- »