Skip to main content

ibrahima Niang

Followers

13

Following

1

Public Views

Andreas Timm-Giel

Hamburg University of Technology (TUHH)

Galatasaray University

Université du Luxembourg

DHANAJAIYAN NAGARAJAN

Anna University

Alexandre Guitton

Mohammed Alsharqawy

University Abderahmane Mira, Bejaia

Soraya Yahiaoui

University Abderahmane Mira, Bejaia

Interests

Uploads

Papers by ibrahima Niang

Robust discovery, addressing and routing protocol for dynamic linear network

Linear Wireless Sensor Networks (LWSN) are a sub-case of Wireless Sensor Networks where nodes are... more Linear Wireless Sensor Networks (LWSN) are a sub-case of Wireless Sensor Networks where nodes are roughly located through multiple lines. They can be used to monitor many real-life infrastructure-e.g. roads, pipelines-or natural entities such as rivers. Classical network solutions are mostly inefficient on LWSN because these topologies-a tree with very long branches-are often a worst-case scenario of many protocols. Therefore few specific protocols have been designed for LWSN. But most of them require manual configuration of the nodes and are static. Real-life conditions require the network to adapt to changing situations-addition of new nodes or sets of nodes, node destruction-or to solve problems of data congestion. We propose a new network protocol called Dynamic Disco-Proto covering the setting up of the logical topology, address distribution without spoilage, dynamic addition of nodes or branches, and even dynamic addition of new data sinks. All these operations happen without human interaction or knowledge of the topology. Our proposition keeps the benefits of a mainly hierarchical routing without paying the price of address spoilage which can be the aftermath of mainly linear topologies. We evaluate our Dynamic DiscoProto protocol for LWSN using Castalia simulator and demonstrate that it resolves the problem of orphan nodes during network setup and also has good performance for dynamic and large LWSN. Eventually, simulation results demonstrate that our proposition adapts to multi-Sink deployment and improves data packet delivery ratio and data packet latency.

Using a Token Approach for the MAC Layer of Linear Sensor Networks - Impact of the Redundancy on the Throughput

HAL (Le Centre pour la Communication Scientifique Directe), Feb 11, 2015

Automatic and dynamic network establishment for linear WSNs

Wireless Networks, Nov 1, 2017

The deployment of Wireless Sensor Networks (WSNs) in the mostly linear large structures, such as ... more The deployment of Wireless Sensor Networks (WSNs) in the mostly linear large structures, such as rivers, pipelines, etc, suffers from being the worst case for classical addressing schemes, e.g. Distributed Address Assignment Mechanism (DAAM) or stochastic addressing for Zigbee. Using DAAM for physical topologies composed of long lines of nodes connected together wastes addresses and generates orphan nodes. We show in this paper the inherent limitations of classical (DAAM, stochastic) and specialized (usually cluster-orientated) addressing schemes for Linear WSNs. DiscoProto, is an addressing and routing scheme which builds a logical network corresponding to a corresponding physical linear network without any knowledge of physical topology. In this paper, we show thanks to a realistic simulation using Castalia (Omnet based simulator) that DiscoProto avoids waste of addresses and allows a high association ratio. We also propose a dynamic version of our protocol called Dynamic DiscoProto in the second part of the paper. Dynamic DiscoProto allows to add new nodes or new branches in an existing linear network.

Accelerated precomputation points-based scalar reduction on elliptic curve cryptography for wireless sensor networks

International Journal of Communication Systems, May 16, 2017

Sensor devices are limited resource power and energy, thus providing security services for sensor... more Sensor devices are limited resource power and energy, thus providing security services for sensor networks is very difficult. Elliptic curve cryptography (ECC) is one of the most famous asymmetric cryptographic schemes, which offers the same level of security with much shorter keys compared to the other widely used asymmetric cryptographic algorithm, RSA (Rivest, Shamir, and Adleman). In ECC, the main and most-heavily used operation is the scalar multiplication kP, where the scalar value k is a private integer and must be secured. In this work, we present a new approach to accelerate the main scalar multiplication on ECC over prime fields for sensor networks. This approach uses an equivalent representation of points and can act as a support for existing schemes in a selected interval. The simulation results showed that the proposed technique increases the efficiency of the computation time. For example, on this scalar multiplication, we obtain a gain of 4 bits in 161 bits for 6.25% of the scalars. This gain can sometimes reach 100% in some cases. After this significant reduction of the scalar k, we present a fast precomputation algorithm in a distributed scalar multiplication on kP to avoid storage of precomputation points, which requires extra memory.

Mechanism for multi-domain marking in DiffServ architecture

In a DiffServ domain, several marking mechanisms for packets have been proposed. They make it pos... more In a DiffServ domain, several marking mechanisms for packets have been proposed. They make it possible to downgrade or to remove the packets from flows which are not in conformity with the traffic contract. However, all these mechanisms are adapted to operate in intra-domain rather than in multi-domain marking. We propose a mechanism called multi-domain marker (MDM) for flows crossing

Enhancing Moodle for offline learning in a degraded connectivity environment

ABSTRACT

New Node Distributed Access Control Scheme for Wireless Sensor Network

Access control is a critical security service in Wireless Sensor Networks (WSNs). To prevent mali... more Access control is a critical security service in Wireless Sensor Networks (WSNs). To prevent malicious nodes or unauthorized entity from joining the sensor network, access control is required. It restricts the network access only to eligible sensor nodes, while queries from outsiders will not be answered or forwarded by nodes. Since sensor nodes are highly constrained in terms of resources and can be deployed in hostile environment, they may be lost because of power exhaustion or malicious attacks. Therefore, new node deployment is necessary. Schemes based on elliptic curve cryptography (ECC) are proposed. Some of them are static and other dynamic because all the old secret keys and broadcasting information in existing nodes should not be updated once a new node is added. In this paper we proposed a new node access control scheme based on symmetric key cryptography, one-way hash chain and XOR operation, which are low expenses in calculation, storage and communication. The proposed solution provides a distributed authentication system, it is also resistance to node capture, query replay, denial of service (DoS) attacks and probably restricts the propagation of fake queries to a logarithmic part of the network.

A Game Theoretic Approach for Virtual Machine Allocation Security in Cloud Computing

The Virtualization technologies make cloud computing desirable but they also introduce serious se... more The Virtualization technologies make cloud computing desirable but they also introduce serious security risks like co-resident attack and interdependence between users on the same hypervisor. The previous works on the subject of virtualization security have some limitations: either we can not implement them, no performance evaluation or it increases the workload at servers or haven&amp;#39;t quantitative analysis. This paper proposes a new approach to minimize Virtual machine escape attack in which the attacker&amp;#39;s goal is to co-locate their VMs with the targets VMs on the same physical server. In order to proliferate his attack on the virtual machines of other users on the same hypervisor. Hence, we model different basic VM allocation policies using a game theoretic approach to get quantitative analysis. In each VM allocation policies, attacker&amp;#39;s action is to decide when to start the VMs, how many VMs to start, what is the security level of its VMs. The goal of the defender will be to find a VM allocation policy that minimizes attacker&amp;#39;s possibility. We also presented the attack efficiency, cost, coverage, power consumption and workload balance under the VM allocation policies and compute the numerical solution in CloudSim. This solution does not require any changes to the underlying infrastructure. Our results show that the Round Robin policy is the least secure allocation policy against Virtual machine escape attack. In order to minimise the efficiency rates for the attacker, the cloud provider should use a probabilistic VM allocation policy.

Automatic discovery of topologies and addressing for Linear wireless sensors networks

Wireless sensor networks are a collection of sensor nodes that collaborate to sense a specific ev... more Wireless sensor networks are a collection of sensor nodes that collaborate to sense a specific event in a given environment. When sensors monitor a structure organized linearly (e.g., pipelines, rivers, railways), they are organized in Linear WSN (LWSN, constituted by connected portions of lines), with different properties than a uniformly deployed WSN. The distributed address allocation in the ZigBee cluster-tree suffers from limitations in LWSN: the number of children is limited, as well as the maximum number of children routers, and the maximum tree depth. Stochastic address assignment, also available in ZigBee, has a high cost in exchanged messages and requires an expensive (in terms of messages and memory) routing process. This paper proposes an automatic discovery of topologies for linear wireless sensor networks combined with an efficient addressing mechanism. We show that our proposition avoids the waste of addresses while keeping the number of messages exchanged proportional to the number of nodes in the network.

SDN-based QoS architectures in Edge-IoT Systems: A Comprehensive Analysis

2023 IEEE World AI IoT Congress (AIIoT)

Schéma DHT hiérarchique pour la tolérance aux pannes dans les réseaux P2P-SIP

Revue Africaine de Recherche en Informatique et Mathématiques Appliquées

This paper focuses on fault tolerance of super-nodes in P2P-SIP systems. These systems are charac... more This paper focuses on fault tolerance of super-nodes in P2P-SIP systems. These systems are characterized by high volatility of super-nodes. Most fault-tolerant proposed solutions are only for physical defects. They do not take into consideration the timing faults that are very important for multimedia applications such as telephony. This paper proposes a timing and physical fault tolerant mechanism based on P2P overlay with two levels for P2P-SIP systems. The simulation results show that our proposition reduces mostly the nodes location latency and increases the probability to find the called nodes. Cet article met l'accent sur la tolérance aux pannes de super-noeuds dans les systèmes P2P-SIP. Ces systèmes sont caractérisés par une forte volatilité des super-noeuds. La plupart des solutions tolérant aux pannes proposées traitent des défaillances physiques et ne prennent pas en compte les défaillances temporelles qui sont aussi importantes pour des applications multimédia telle q...

A Survey on QoS-based communication protocols for IoT systems

Proceedings of the 3rd International Conference on Networking, Information Systems & Security, 2020

Internet of Things (IoT) contributes to development of world through its technological contributi... more Internet of Things (IoT) contributes to development of world through its technological contributions and its daily applications. Several technologies and protocols are used for the implementation of new applications allowing physical objects to connect with each other in support of smart decision-making. To provide efficient and reliable services to its end-users, it guarantees the quality of its pragmatic use by referring to QoS criteria.This implies efficient management of the quality of service in IoT systems in order to meet requirements of their applications. In this paper, we offer an analysis of quality of service mechanisms of communication protocols in IoT environment. This study opens a new perspective of dynamic QoS management.

A Comparison of QoS-Based Architecture Solutions for IoT/Edge Computing Environment

Advances in Science, Technology & Innovation, 2021

Home Edge Computing Architecture for Smart and Sustainable Agriculture and Breeding

Proceedings of the 2nd International Conference on Networking, Information Systems & Security - NISS19, 2019

Challenges of today and tomorrow in developing countries to ensure sustainable food security for ... more Challenges of today and tomorrow in developing countries to ensure sustainable food security for their populations require smart agriculture and breeding. This necessarily depends on water control, soil erosion, livestock management, and so on. At the same time, Internet of Things (IoT) represents the latest evolution of the Internet and can significantly improve the ability to collect, analyze and retrieve data that we can then transform into information, knowledge and finally knowing. In the context of ensuring smart and sustainable agriculture, the importance of IoT seems obvious. Note that, IoT has implications for bandwidth, latency and processing speeds, given the huge amount of data to collect. Edge computing and Systems are one of the emerging solutions to reduce latency and improve bandwidth utilization for real-time applications and services. Thus, to achieve these aims, we propose, in this paper, a new three-tier architecture (3-TIER) for smart agriculture. It is based on that of Home Edge Computing allowing us to achieve ultra-low latency. This architecture will also allow us to effectively solve the problems related to agriculture and livestock breeding, but also to be able to resolve considerably the conflicts between farmers and herders. This proposal will be followed by an experimental validation of HEC architecture using the EdgeCloudSim simulator.

New Node Distributed Access Control Scheme for Wireless Sensor Network

Proceedings of the 9th International Conference on Information Systems and Technologies, 2019

Access control is a critical security service in Wireless Sensor Networks (WSNs). To prevent mali... more Access control is a critical security service in Wireless Sensor Networks (WSNs). To prevent malicious nodes or unauthorized entity from joining the sensor network, access control is required. It restricts the network access only to eligible sensor nodes, while queries from outsiders will not be answered or forwarded by nodes. Since sensor nodes are highly constrained in terms of resources and can be deployed in hostile environment, they may be lost because of power exhaustion or malicious attacks. Therefore, new node deployment is necessary. Schemes based on elliptic curve cryptography (ECC) are proposed. Some of them are static and other dynamic because all the old secret keys and broadcasting information in existing nodes should not be updated once a new node is added. In this paper we proposed a new node access control scheme based on symmetric key cryptography, one-way hash chain and XOR operation, which are low expenses in calculation, storage and communication. The proposed solution provides a distributed authentication system, it is also resistance to node capture, query replay, denial of service (DoS) attacks and probably restricts the propagation of fake queries to a logarithmic part of the network.

Hierarchical Load Balancing and Clustering Technique for Home Edge Computing

IEEE Access, 2020

The edge computing system attracts much more attention and is expected to satisfy ultra-low respo... more The edge computing system attracts much more attention and is expected to satisfy ultra-low response time required by emerging IoT applications. Nevertheless, as there were problems on latency such as the emerging traffic requiring very sensitive delay, a new Edge Computing system architecture, namely Home Edge Computing (HEC) supporting these real-time applications has been proposed. HEC is a threelayer architecture made up of HEC servers, which are very close to users, Multi-access Edge Computing (MEC) servers and the central cloud. This paper proposes a solution to solve the problems of latency on HEC servers caused by their limited resources. The increase in the traffic rate creates a long queue on these servers, i.e., a raise in the processing time (delay) for requests. By leveraging, based on clustering and load balancing techniques, we propose a new technique called HEC-Clustering Balance. It allows us to distribute the requests hierarchically on the HEC clusters and another focus of the architecture to avoid congestion on a HEC server to reduce the latency. The results show that HEC-Clustering Balance is more efficient than baseline clustering and load balancing techniques. Thus, compared to the HEC architecture, we reduce the processing time on the HEC servers to 19% and 73% respectively on two experimental scenarios. INDEX TERMS HEC-clustering balance, resource allocation, processing time, delay, clustering, load balancing, hierarchical resource management, home edge computing (HEC), edge computing, graph theory.

Accelerated precomputation points–based scalar reduction on elliptic curve cryptography for wireless sensor networks

International Journal of Communication Systems, 2017

SummarySensor devices are limited resource power and energy, thus providing security services for... more SummarySensor devices are limited resource power and energy, thus providing security services for sensor networks is very difficult. Elliptic curve cryptography (ECC) is one of the most famous asymmetric cryptographic schemes, which offers the same level of security with much shorter keys compared to the other widely used asymmetric cryptographic algorithm, RSA (Rivest, Shamir, and Adleman). In ECC, the main and most‐heavily used operation is the scalar multiplication kP, where the scalar value k is a private integer and must be secured. In this work, we present a new approach to accelerate the main scalar multiplication on ECC over prime fields for sensor networks. This approach uses an equivalent representation of points and can act as a support for existing schemes in a selected interval. The simulation results showed that the proposed technique increases the efficiency of the computation time. For example, on this scalar multiplication, we obtain a gain of 4 bits in 161 bits for...

Mechanism for multi-domain marking in DiffServ architecture

Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications

In a DiffServ domain, several marking mechanisms for packets have been proposed. They make it pos... more In a DiffServ domain, several marking mechanisms for packets have been proposed. They make it possible to downgrade or to remove the packets from flows which are not in conformity with the traffic contract. However, all these mechanisms are adapted to operate in intra-domain rather than in multi-domain marking. We propose a mechanism called multi-domain marker (MDM) for flows crossing

Enhancing Moodle for offline learning in a degraded connectivity environment

2012 International Conference on Multimedia Computing and Systems, 2012

ABSTRACT

A Token-based MAC Protocol for Linear Sensor Networks

A wireless sensor network is a large number of sensor nodes deployed in a fixed or random manner ... more A wireless sensor network is a large number of sensor nodes deployed in a fixed or random manner over a wide area for environmental monitoring applications. Wireless sensors communicate via wireless links and are powered by batteries. They collect and provide information to the base station usually called sink. The information collected is generally physical, chemical or biological nature. For some of these applications, as pipeline or road monitoring, wireless sensor nodes have to be deployed in a linear manner. We refer to these WSNs as Linear Sensor Networks (LSNs). Due to specificity of LSNs, MAC protocol designed for WSNs, as contention or TDMA based protocols, are often not suitable. Furthermore, wireless node deployment can provide a certain form of redundancy to prevent link or node failures. In this paper, we propose a token based MAC protocol for linear sensor networks in order to improve the network performance. We evaluate the effect of the redundancy on the throughput a...

Robust discovery, addressing and routing protocol for dynamic linear network

Linear Wireless Sensor Networks (LWSN) are a sub-case of Wireless Sensor Networks where nodes are... more Linear Wireless Sensor Networks (LWSN) are a sub-case of Wireless Sensor Networks where nodes are roughly located through multiple lines. They can be used to monitor many real-life infrastructure-e.g. roads, pipelines-or natural entities such as rivers. Classical network solutions are mostly inefficient on LWSN because these topologies-a tree with very long branches-are often a worst-case scenario of many protocols. Therefore few specific protocols have been designed for LWSN. But most of them require manual configuration of the nodes and are static. Real-life conditions require the network to adapt to changing situations-addition of new nodes or sets of nodes, node destruction-or to solve problems of data congestion. We propose a new network protocol called Dynamic Disco-Proto covering the setting up of the logical topology, address distribution without spoilage, dynamic addition of nodes or branches, and even dynamic addition of new data sinks. All these operations happen without human interaction or knowledge of the topology. Our proposition keeps the benefits of a mainly hierarchical routing without paying the price of address spoilage which can be the aftermath of mainly linear topologies. We evaluate our Dynamic DiscoProto protocol for LWSN using Castalia simulator and demonstrate that it resolves the problem of orphan nodes during network setup and also has good performance for dynamic and large LWSN. Eventually, simulation results demonstrate that our proposition adapts to multi-Sink deployment and improves data packet delivery ratio and data packet latency.

Using a Token Approach for the MAC Layer of Linear Sensor Networks - Impact of the Redundancy on the Throughput

HAL (Le Centre pour la Communication Scientifique Directe), Feb 11, 2015

Automatic and dynamic network establishment for linear WSNs

Wireless Networks, Nov 1, 2017

The deployment of Wireless Sensor Networks (WSNs) in the mostly linear large structures, such as ... more The deployment of Wireless Sensor Networks (WSNs) in the mostly linear large structures, such as rivers, pipelines, etc, suffers from being the worst case for classical addressing schemes, e.g. Distributed Address Assignment Mechanism (DAAM) or stochastic addressing for Zigbee. Using DAAM for physical topologies composed of long lines of nodes connected together wastes addresses and generates orphan nodes. We show in this paper the inherent limitations of classical (DAAM, stochastic) and specialized (usually cluster-orientated) addressing schemes for Linear WSNs. DiscoProto, is an addressing and routing scheme which builds a logical network corresponding to a corresponding physical linear network without any knowledge of physical topology. In this paper, we show thanks to a realistic simulation using Castalia (Omnet based simulator) that DiscoProto avoids waste of addresses and allows a high association ratio. We also propose a dynamic version of our protocol called Dynamic DiscoProto in the second part of the paper. Dynamic DiscoProto allows to add new nodes or new branches in an existing linear network.

Accelerated precomputation points-based scalar reduction on elliptic curve cryptography for wireless sensor networks

International Journal of Communication Systems, May 16, 2017

Sensor devices are limited resource power and energy, thus providing security services for sensor... more Sensor devices are limited resource power and energy, thus providing security services for sensor networks is very difficult. Elliptic curve cryptography (ECC) is one of the most famous asymmetric cryptographic schemes, which offers the same level of security with much shorter keys compared to the other widely used asymmetric cryptographic algorithm, RSA (Rivest, Shamir, and Adleman). In ECC, the main and most-heavily used operation is the scalar multiplication kP, where the scalar value k is a private integer and must be secured. In this work, we present a new approach to accelerate the main scalar multiplication on ECC over prime fields for sensor networks. This approach uses an equivalent representation of points and can act as a support for existing schemes in a selected interval. The simulation results showed that the proposed technique increases the efficiency of the computation time. For example, on this scalar multiplication, we obtain a gain of 4 bits in 161 bits for 6.25% of the scalars. This gain can sometimes reach 100% in some cases. After this significant reduction of the scalar k, we present a fast precomputation algorithm in a distributed scalar multiplication on kP to avoid storage of precomputation points, which requires extra memory.

Mechanism for multi-domain marking in DiffServ architecture

In a DiffServ domain, several marking mechanisms for packets have been proposed. They make it pos... more In a DiffServ domain, several marking mechanisms for packets have been proposed. They make it possible to downgrade or to remove the packets from flows which are not in conformity with the traffic contract. However, all these mechanisms are adapted to operate in intra-domain rather than in multi-domain marking. We propose a mechanism called multi-domain marker (MDM) for flows crossing

Enhancing Moodle for offline learning in a degraded connectivity environment

ABSTRACT

New Node Distributed Access Control Scheme for Wireless Sensor Network

Access control is a critical security service in Wireless Sensor Networks (WSNs). To prevent mali... more Access control is a critical security service in Wireless Sensor Networks (WSNs). To prevent malicious nodes or unauthorized entity from joining the sensor network, access control is required. It restricts the network access only to eligible sensor nodes, while queries from outsiders will not be answered or forwarded by nodes. Since sensor nodes are highly constrained in terms of resources and can be deployed in hostile environment, they may be lost because of power exhaustion or malicious attacks. Therefore, new node deployment is necessary. Schemes based on elliptic curve cryptography (ECC) are proposed. Some of them are static and other dynamic because all the old secret keys and broadcasting information in existing nodes should not be updated once a new node is added. In this paper we proposed a new node access control scheme based on symmetric key cryptography, one-way hash chain and XOR operation, which are low expenses in calculation, storage and communication. The proposed solution provides a distributed authentication system, it is also resistance to node capture, query replay, denial of service (DoS) attacks and probably restricts the propagation of fake queries to a logarithmic part of the network.

A Game Theoretic Approach for Virtual Machine Allocation Security in Cloud Computing

The Virtualization technologies make cloud computing desirable but they also introduce serious se... more The Virtualization technologies make cloud computing desirable but they also introduce serious security risks like co-resident attack and interdependence between users on the same hypervisor. The previous works on the subject of virtualization security have some limitations: either we can not implement them, no performance evaluation or it increases the workload at servers or haven&amp;#39;t quantitative analysis. This paper proposes a new approach to minimize Virtual machine escape attack in which the attacker&amp;#39;s goal is to co-locate their VMs with the targets VMs on the same physical server. In order to proliferate his attack on the virtual machines of other users on the same hypervisor. Hence, we model different basic VM allocation policies using a game theoretic approach to get quantitative analysis. In each VM allocation policies, attacker&amp;#39;s action is to decide when to start the VMs, how many VMs to start, what is the security level of its VMs. The goal of the defender will be to find a VM allocation policy that minimizes attacker&amp;#39;s possibility. We also presented the attack efficiency, cost, coverage, power consumption and workload balance under the VM allocation policies and compute the numerical solution in CloudSim. This solution does not require any changes to the underlying infrastructure. Our results show that the Round Robin policy is the least secure allocation policy against Virtual machine escape attack. In order to minimise the efficiency rates for the attacker, the cloud provider should use a probabilistic VM allocation policy.

Automatic discovery of topologies and addressing for Linear wireless sensors networks

Wireless sensor networks are a collection of sensor nodes that collaborate to sense a specific ev... more Wireless sensor networks are a collection of sensor nodes that collaborate to sense a specific event in a given environment. When sensors monitor a structure organized linearly (e.g., pipelines, rivers, railways), they are organized in Linear WSN (LWSN, constituted by connected portions of lines), with different properties than a uniformly deployed WSN. The distributed address allocation in the ZigBee cluster-tree suffers from limitations in LWSN: the number of children is limited, as well as the maximum number of children routers, and the maximum tree depth. Stochastic address assignment, also available in ZigBee, has a high cost in exchanged messages and requires an expensive (in terms of messages and memory) routing process. This paper proposes an automatic discovery of topologies for linear wireless sensor networks combined with an efficient addressing mechanism. We show that our proposition avoids the waste of addresses while keeping the number of messages exchanged proportional to the number of nodes in the network.

SDN-based QoS architectures in Edge-IoT Systems: A Comprehensive Analysis

2023 IEEE World AI IoT Congress (AIIoT)

Schéma DHT hiérarchique pour la tolérance aux pannes dans les réseaux P2P-SIP

Revue Africaine de Recherche en Informatique et Mathématiques Appliquées

This paper focuses on fault tolerance of super-nodes in P2P-SIP systems. These systems are charac... more This paper focuses on fault tolerance of super-nodes in P2P-SIP systems. These systems are characterized by high volatility of super-nodes. Most fault-tolerant proposed solutions are only for physical defects. They do not take into consideration the timing faults that are very important for multimedia applications such as telephony. This paper proposes a timing and physical fault tolerant mechanism based on P2P overlay with two levels for P2P-SIP systems. The simulation results show that our proposition reduces mostly the nodes location latency and increases the probability to find the called nodes. Cet article met l'accent sur la tolérance aux pannes de super-noeuds dans les systèmes P2P-SIP. Ces systèmes sont caractérisés par une forte volatilité des super-noeuds. La plupart des solutions tolérant aux pannes proposées traitent des défaillances physiques et ne prennent pas en compte les défaillances temporelles qui sont aussi importantes pour des applications multimédia telle q...

A Survey on QoS-based communication protocols for IoT systems

Proceedings of the 3rd International Conference on Networking, Information Systems & Security, 2020

Internet of Things (IoT) contributes to development of world through its technological contributi... more Internet of Things (IoT) contributes to development of world through its technological contributions and its daily applications. Several technologies and protocols are used for the implementation of new applications allowing physical objects to connect with each other in support of smart decision-making. To provide efficient and reliable services to its end-users, it guarantees the quality of its pragmatic use by referring to QoS criteria.This implies efficient management of the quality of service in IoT systems in order to meet requirements of their applications. In this paper, we offer an analysis of quality of service mechanisms of communication protocols in IoT environment. This study opens a new perspective of dynamic QoS management.

A Comparison of QoS-Based Architecture Solutions for IoT/Edge Computing Environment

Advances in Science, Technology & Innovation, 2021

Home Edge Computing Architecture for Smart and Sustainable Agriculture and Breeding

Proceedings of the 2nd International Conference on Networking, Information Systems & Security - NISS19, 2019

Challenges of today and tomorrow in developing countries to ensure sustainable food security for ... more Challenges of today and tomorrow in developing countries to ensure sustainable food security for their populations require smart agriculture and breeding. This necessarily depends on water control, soil erosion, livestock management, and so on. At the same time, Internet of Things (IoT) represents the latest evolution of the Internet and can significantly improve the ability to collect, analyze and retrieve data that we can then transform into information, knowledge and finally knowing. In the context of ensuring smart and sustainable agriculture, the importance of IoT seems obvious. Note that, IoT has implications for bandwidth, latency and processing speeds, given the huge amount of data to collect. Edge computing and Systems are one of the emerging solutions to reduce latency and improve bandwidth utilization for real-time applications and services. Thus, to achieve these aims, we propose, in this paper, a new three-tier architecture (3-TIER) for smart agriculture. It is based on that of Home Edge Computing allowing us to achieve ultra-low latency. This architecture will also allow us to effectively solve the problems related to agriculture and livestock breeding, but also to be able to resolve considerably the conflicts between farmers and herders. This proposal will be followed by an experimental validation of HEC architecture using the EdgeCloudSim simulator.

New Node Distributed Access Control Scheme for Wireless Sensor Network

Proceedings of the 9th International Conference on Information Systems and Technologies, 2019

Access control is a critical security service in Wireless Sensor Networks (WSNs). To prevent mali... more Access control is a critical security service in Wireless Sensor Networks (WSNs). To prevent malicious nodes or unauthorized entity from joining the sensor network, access control is required. It restricts the network access only to eligible sensor nodes, while queries from outsiders will not be answered or forwarded by nodes. Since sensor nodes are highly constrained in terms of resources and can be deployed in hostile environment, they may be lost because of power exhaustion or malicious attacks. Therefore, new node deployment is necessary. Schemes based on elliptic curve cryptography (ECC) are proposed. Some of them are static and other dynamic because all the old secret keys and broadcasting information in existing nodes should not be updated once a new node is added. In this paper we proposed a new node access control scheme based on symmetric key cryptography, one-way hash chain and XOR operation, which are low expenses in calculation, storage and communication. The proposed solution provides a distributed authentication system, it is also resistance to node capture, query replay, denial of service (DoS) attacks and probably restricts the propagation of fake queries to a logarithmic part of the network.

Hierarchical Load Balancing and Clustering Technique for Home Edge Computing

IEEE Access, 2020

The edge computing system attracts much more attention and is expected to satisfy ultra-low respo... more The edge computing system attracts much more attention and is expected to satisfy ultra-low response time required by emerging IoT applications. Nevertheless, as there were problems on latency such as the emerging traffic requiring very sensitive delay, a new Edge Computing system architecture, namely Home Edge Computing (HEC) supporting these real-time applications has been proposed. HEC is a threelayer architecture made up of HEC servers, which are very close to users, Multi-access Edge Computing (MEC) servers and the central cloud. This paper proposes a solution to solve the problems of latency on HEC servers caused by their limited resources. The increase in the traffic rate creates a long queue on these servers, i.e., a raise in the processing time (delay) for requests. By leveraging, based on clustering and load balancing techniques, we propose a new technique called HEC-Clustering Balance. It allows us to distribute the requests hierarchically on the HEC clusters and another focus of the architecture to avoid congestion on a HEC server to reduce the latency. The results show that HEC-Clustering Balance is more efficient than baseline clustering and load balancing techniques. Thus, compared to the HEC architecture, we reduce the processing time on the HEC servers to 19% and 73% respectively on two experimental scenarios. INDEX TERMS HEC-clustering balance, resource allocation, processing time, delay, clustering, load balancing, hierarchical resource management, home edge computing (HEC), edge computing, graph theory.

Accelerated precomputation points–based scalar reduction on elliptic curve cryptography for wireless sensor networks

International Journal of Communication Systems, 2017

SummarySensor devices are limited resource power and energy, thus providing security services for... more SummarySensor devices are limited resource power and energy, thus providing security services for sensor networks is very difficult. Elliptic curve cryptography (ECC) is one of the most famous asymmetric cryptographic schemes, which offers the same level of security with much shorter keys compared to the other widely used asymmetric cryptographic algorithm, RSA (Rivest, Shamir, and Adleman). In ECC, the main and most‐heavily used operation is the scalar multiplication kP, where the scalar value k is a private integer and must be secured. In this work, we present a new approach to accelerate the main scalar multiplication on ECC over prime fields for sensor networks. This approach uses an equivalent representation of points and can act as a support for existing schemes in a selected interval. The simulation results showed that the proposed technique increases the efficiency of the computation time. For example, on this scalar multiplication, we obtain a gain of 4 bits in 161 bits for...

Mechanism for multi-domain marking in DiffServ architecture

Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications

In a DiffServ domain, several marking mechanisms for packets have been proposed. They make it pos... more In a DiffServ domain, several marking mechanisms for packets have been proposed. They make it possible to downgrade or to remove the packets from flows which are not in conformity with the traffic contract. However, all these mechanisms are adapted to operate in intra-domain rather than in multi-domain marking. We propose a mechanism called multi-domain marker (MDM) for flows crossing

Enhancing Moodle for offline learning in a degraded connectivity environment

2012 International Conference on Multimedia Computing and Systems, 2012

ABSTRACT

A Token-based MAC Protocol for Linear Sensor Networks

A wireless sensor network is a large number of sensor nodes deployed in a fixed or random manner ... more A wireless sensor network is a large number of sensor nodes deployed in a fixed or random manner over a wide area for environmental monitoring applications. Wireless sensors communicate via wireless links and are powered by batteries. They collect and provide information to the base station usually called sink. The information collected is generally physical, chemical or biological nature. For some of these applications, as pipeline or road monitoring, wireless sensor nodes have to be deployed in a linear manner. We refer to these WSNs as Linear Sensor Networks (LSNs). Due to specificity of LSNs, MAC protocol designed for WSNs, as contention or TDMA based protocols, are often not suitable. Furthermore, wireless node deployment can provide a certain form of redundancy to prevent link or node failures. In this paper, we propose a token based MAC protocol for linear sensor networks in order to improve the network performance. We evaluate the effect of the redundancy on the throughput a...