Lamia Ben Azzouz

CASAN: Clustering algorithm for security in ad hoc networks

Clustering in ad hoc networks is an organization method which consists in grouping the nodes into clusters (groups) managed by nodes called clusterheads. This technique has been used for different goals as routing efficiency, transmission management, information collection, etc. As far as we know, no existing clustering algorithms have taken into account the trust level of nodes for clusterheads election. In this paper, we propose a clustering algorithm for security in ad hoc networks that we called CASAN. CASAN aims to elect trustworthy, stable and high-energy clusterheads that can be used to offer security for application level. Simulations were conducted to evaluate CASAN in terms of clusters stability, load balancing and number of hops to clusterheads. Furthermore, we compare CASAN performances to an existing clustering algorithm called weighted clustering algorithm. Results show that it gives a convenient network division with stable clusters and mainly one hop members.

Lowest weight: reactive clustering algorithm for adhoc networks

In this paper, we address clustering in ad hoc networks. Ad hoc networks are a wireless networking paradigm in which mobile hosts rely on each other to keep the network connected without the help of any pre-existing infrastructure or central administrator. Thus, additional features pertinent to this type of networks appeared. In fact, centralized solutions are generally inadaptable due to the need for cooperative network operations. To ensure efficient, tolerant and durable cooperative operations, nodes need to organize themselves. Clustering is an organization method which consists in grouping the nodes into clusters (groups) managed by nodes called clusterheads. In this paper, we present existing clustering algorithms and propose a new solution inspired from two of these algorithms (Lowest Id and WCA). This solution, called Lowest Weight, exploits their advantages and relieve to their drawbacks in terms of clusters stability and computational overhead. Simulation experiments were conducted to evaluate the performance of the algorithm proposed in terms of clusters numbers, clusterheads lifetime and the number of reaffiliations (node moving from a cluster to another). Results show that Lowest Weight ameliorate performs of existing algorithms especially regarding mobility leading to more suitable, adaptable, scalable and autonomous clustering.

Security services for eSafety applications clusters

The high number of applications envisioned for VANETs and the diversity of their characteristics (time constraints, communication mode, etc.) form a challenge for the development of the adequate secure system. Clustering them into homogeneous groups can constitute a start point for the designing of the suitable communication and security components. In this work, we propose seven eSafety application clusters based on communication criteria having an impact on security mechanisms to be implemented. Then we highlight security services required for each cluster.

Improvements to the Smart Energy Profile security

The smart grid, new generation of the electric grid, aims to improve the energy production, delivery and customer usages. To reach this goal, smart devices, smart meters, etc. must exchange information with the control center in a bidirectional way. The Home Area Network (HAN) manages communications among the smart meter and smart devices inside the home. The ZigBee Alliance developed a profile for the energy HAN called the ZigBee Smart Energy Profile (SEP). While the HAN is vulnerable to several types of attacks (eavesdropping, spoofing, DoS, etc.), SEP defined security mechanisms to join the network and to protect the traffic. In this paper, we identify vulnerabilities of SEP security mechanisms and we propose improvements to the SEP join process and key refreshment. We conducted simulations to evaluate the latency for energy real time applications while using SEP and the success rate for SEP and the enhanced SEP.

A secure Neighborhood Area Network using IPsec

The smart grid is a complex network that aims to manage the electricity usage and reduce consumption. It is composed of a large number of intelligent devices and systems that exchange sensitive data via several networks (HAN, NAN, FAN). The Neighborhood Area Network covers communications between smart meters and the collector that transmits aggregate data to the control center. The NAN network is vulnerable to several types of attacks (Eavesdropping, spoofing, replay) and, security is essential to protect sensitive information in the NAN. In this paper, we propose to use the IPsec protocol to secure the traffic exchanged between smart meters and the control center. Simulation experiments are conducted to evaluate the latencies for real time NAN applications in urban and rural scenarios.

Using IPsec to secure multicast smart energy traffic

The smart grid is an intelligent electrical grid that aims to manage the electricity production, distribution and consumption. One of the Smart Grid key technologies is to integrate a two-way communication between a utility company and its customers. Hence, the Smart Grid covers several networks to exchange data among intelligent devices (Smart Meter for example) and systems (the control center). The Neighborhood Area Network (NAN) relays customers data from smart meters to the control center. Furthermore, it can relay a multicast traffic from the control center (energy prices, outage notifications, etc.) to a group of smart meters. Several types of attacks (eavesdropping, spoofing, replay, etc.) can be performed against the NAN multicast traffic and lead to an instability of the electronic grid. Hence, security solutions must be envisaged to counter those attacks. In this paper, we propose a security solution based on the IPsec protocol to prevent most of the threats on the NAN multicast traffic.

OLSR based peer to peer instant messaging for Ad-hoc networks

Instant messaging is one of the most popular applications on the Internet. Furthermore, we assist to the emerging of Peer to Peer systems based on a decentralized architecture. These systems share similarities with spontaneous Ad-hoc networks. The crossing of the Ad hoc networks and the Peer to Peer systems opens a field of possibilities for new spontaneous collaborative applications such as the instant messaging. In this work, we propose a Peer to Peer instant messaging system for Ad-hoc networks based on the IETF work in progress. This will guarantee the opening and the viability of the system.

A Kerberos-Based Authentication Architecture for WLANS

This work addresses the issues related to authentication in wireless LAN environments, with emphasis on the IEEE 802.11 standard. It proposes an authentication architecture for Wireless networks. This architecture called Wireless Kerberos (W-Kerberos), is based on the Kerberos authentication server and the IEEE 802.1X-EAP model, in order to satisfy both security and mobility needs. It then, provides a mean of protecting the network, assuring mutual authentication, thwarts cryptographic attack risks via a key refreshment mechanism and manages fast and secure Handovers between access points. In addition to authentication, Kerberos has also the advantage of secure communications via encryption.