Entity

Time filter

Source Type


Jamaa M.B.,Al Imam Mohamed Bin Saud University | Jamaa M.B.,University of Sfax | Koubaa A.,Al Imam Mohamed Bin Saud University | Koubaa A.,Polytechnic Institute of Porto | Kayani Y.,Al Imam Mohamed Bin Saud University
Procedia Computer Science | Year: 2012

Localization based on Received Signal Strength (RSS) is a key method for locating objects in Wireless Sensor Networks (WSNs). However, current RSS-based methods are ineffective at both deployment and operation design levels since they (i.) usually require a labor-intensive pre-deployment profiling operations to map the RSS to either locations or distances and (ii.) rely on heavy processing operations. These two designs problems limit the possibility of implementing the localization technique on resources constrained sensor nodes and also restrict its scalability and practical use. In this paper, we tackle the challenge of devising a self-organizing and practical RSS-based localization technique that improves on previous approaches in terms of ease of deployment, ease of implementation while still providing a reasonable accuracy. To this end, we come up with a new solution, EasyLoc, a plug-and-play and distributed RSS-based localization method that requires zero pre-deployment configuration. The idea consists in exploiting the available distance information between anchors to derive an online and anchor-specific RSS-to-distance mapping. We show that, in addition to its simplicity, EasyLoc provides location errors of 90% less than 1m and an average error of 0.48m in small environment and 1.8m in large environment. © 2012 Published by Elsevier Ltd.


Cheikhrouhou O.,University of Sfax | Koubaa A.,Polytechnic Institute of Porto | Koubaa A.,Al Imam Mohamed Bin Saud University | Dini G.,University of Pisa | Abid M.,University of Sfax
Personal and Ubiquitous Computing | Year: 2011

Securing group communication in wireless sensor networks has recently been extensively investigated. Many works have addressed this issue, and they have considered the grouping concept differently. In this paper, we consider a group as being a set of nodes sensing the same data type, and we alternatively propose an efficient secure group communication scheme guaranteeing secure group management and secure group key distribution. The proposed scheme (RiSeG) is based on a logical ring architecture, which permits to alleviate the group controller's task in updating the group key. The proposed scheme also provides backward and forward secrecy, addresses the node compromise attack, and gives a solution to detect and eliminate the compromised nodes. The security analysis and performance evaluation show that the proposed scheme is secure, highly efficient, and lightweight. A comparison with the logical key hierarchy is preformed to prove the rekeying process efficiency of RiSeG. Finally, we present the implementation details of RiSeG on top of TelosB sensor nodes to demonstrate its feasibility. © 2011 Springer-Verlag London Limited.


Cheikhrouhou O.,University of Sfax | Koubaa A.,Polytechnic Institute of Porto | Koubaa A.,Al Imam Mohamed Bin Saud University | Dini G.,University of Pisa | And 2 more authors.
Ad Hoc Networks | Year: 2012

Secure group communication is a paradigm that primarily designates one-to-many communication security. The proposed works relevant to secure group communication have predominantly considered the whole network as being a single group managed by a central powerful node capable of supporting heavy communication, computation and storage cost. However, a typical Wireless Sensor Network (WSN) may contain several groups, and each one is maintained by a sensor node (the group controller) with constrained resources. Moreover, the previously proposed schemes require a multicast routing support to deliver the rekeying messages. Nevertheless, multicast routing can incur heavy storage and communication overheads in the case of a wireless sensor network. Due to these two major limitations, we have reckoned it necessary to propose a new secure group communication with a lightweight rekeying process. Our proposal overcomes the two limitations mentioned above, and can be applied to a homogeneous WSN with resource-constrained nodes with no need for a multicast routing support. Actually, the analysis and simulation results have clearly demonstrated that our scheme outperforms the previous well-known solutions. © 2012 Elsevier B.V. All rights reserved.


Gaddour O.,University of Sfax | Koubaa A.,Polytechnic Institute of Porto | Koubaa A.,Al Imam Mohamed Bin Saud University | Cheikhrouhou O.,University of Sfax | Abid M.,University of Sfax
Proceedings - International Conference on Distributed Computing Systems | Year: 2010

Group communication in Wireless Sensor Networks (WSNs) requires an efficient multicast routing mechanism due to inherent resources and computing constraints of sensor nodes. ZigBee, which is a standard protocol that represents a very prominent technology for WSNs, does not consider multicast routing in its specification. In this paper, a group is defined as a set of nodes that share the same sensory information. The main contributions of this paper are two-folded: First, we propose Z-Cast, an efficient multicast routing mechanism for groups that share the same sensory information in a cluster-tree WSN. Second, we show how to integrate the Z-Cast mechanism in open-ZB which is an open source IEEE 802.15.4/ZigBee implementation. Finally, we demonstrate the efficiency and backward compatibility of our proposal with the standard specification. © 2010 IEEE.


Cheikhrouhou O.,University of Sfax | Koubaa A.,Polytechnic Institute of Porto | Koubaa A.,Al Imam Mohamed Bin Saud University | Koubaa A.,Al Imam Mohamed bin University | And 3 more authors.
Procedia Computer Science | Year: 2011

Secure group management is an important issue in Wireless Sensor Networks (WSNs). The most of previous works consider the whole network as a single group managed by a central, powerful node (e.g., the base station) capable of supporting heavy communication, computation and storage cost. However, typical WSNs applications may benefit from being designed and implemented as a collection of multiple logical groups, each one is maintained by a sensor node (the group controller) with constrained resources. Furthermore, previous schemes require multicast support at the routing level to deliver rekeying messages. Unfortunately, multicast may cause a storage and communication overhead that are not affordable in a WSN. In order to go beyond these two limitations, we propose a new secure group management scheme with a lightweight re-keying process. The scheme allows multiple logical groups, each one is maintained and rekeyed separately by a resource-constrained sensor node without requiring multicast routing support. We prove that the scheme is secure and we evaluate its performance from several view points. Actually, we show that our scheme outperforms some previous well-known schemes such as LKH. © 2011 Published by Elsevier Ltd.

Discover hidden collaborations