Search

Your search keyword '"Hicham Lakhlef"' showing total 28 results
Start Over Author "Hicham Lakhlef" Topic business.industry
28 results on '"Hicham Lakhlef"'

1. Vertex Coloring with Communication Constraints in Synchronous Broadcast Networks

Author

François Taïani, Hicham Lakhlef, Michel Raynal, Heuristique et Diagnostic des Systèmes Complexes [Compiègne] (Heudiasyc), Université de Technologie de Compiègne (UTC)-Centre National de la Recherche Scientifique (CNRS), the World Is Distributed Exploring the tension between scale and coordination (WIDE), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), ANR-16-CE40-0023,DESCARTES,Abstraction modulaire pour le calcul distribué(2016), ANR-12-IS02-0004,CO²Dim,Coordination et programmation de MEMS intelligents distribués(2012), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1)

Subjects
Vertex (graph theory), Correctness, Computer science, 02 engineering and technology, Upper and lower bounds, Message-passing, Broadcast/receive communication, Synchronous systems, 0202 electrical engineering, electronic engineering, information engineering, Graph coloring, 020203 distributed computing, TDMA slot allocation !, business.industry, Message passing, Vertex coloring, 16. Peace & justice, Graph, Vertex (geometry), Computational Theory and Mathematics, Multi-coloring, Hardware and Architecture, Distributed algorithm, Signal Processing, Broadcast communication network, Index Terms-Distributed algorithms, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business, Computer network
Abstract

International audience; This paper considers distributed vertex-coloring in broadcast/receive networks suffering from conflicts and collisions. (A collision occurs when, during the same round, messages are sent to the same process by too many neighbors; a conflict occurs when a process and one of its neighbors broadcast during the same round.) More specifically, the paper focuses on multi-channel networks, in which a process may either broadcast a message to its neighbors or receive a message from at most γ of them. The paper first provides a new upper bound on the corresponding graph coloring problem (known as frugal coloring) in general graphs; proposes an exact bound for the problem in trees; presents a deterministic, parallel, color-optimal, collision-and conflict-free distributed coloring algorithm for trees; proves the correctness of this algorithm; and finally evaluates experimentally its performance using simulations that show our solution clearly outperforms a reference protocol for distributed TDMA slot-allocation.

Published
2019

2. Towards Energy Efficient Mobile Data Collection In Cluster-based IoT Networks

Author

Abdelmadjid Bouabdallah, Sana Benhamaid, and Hicham Lakhlef

Subjects
Data collection, Ubiquitous computing, Computer science, business.industry, Node (networking), 020206 networking & telecommunications, 020302 automobile design & engineering, 02 engineering and technology, Energy consumption, law.invention, 0203 mechanical engineering, Relay, law, 0202 electrical engineering, electronic engineering, information engineering, Trajectory, Reinforcement learning, business, Computer network, Efficient energy use
Abstract

Mobile data collection is a very efficient solution to gather information from spatially distributed IoT nodes. In order to enhance the efficiency of mobile data collection, the trajectory planning of the mobile node has been widely studied. In the literature, most of the solutions proposed use static and non learning-based approaches. In our paper, we opted for a learning based approach in which we study a trajectory planning problem in mobile data collection for IoT where IoT nodes are organized in clusters. A relay node is chosen from each cluster in order to collect data from IoT nodes and transmit it to the mobile node in its range. In order to plan the trajectory of the mobile node, we train a deep Q-learning network (DQN) with combined experience replay. This solution will allow us to maximize the amount of data collected and reduce the energy consumption. It will also allow us to adapt the trajectory of the mobile node to the environment parameters without doing expensive recomputations and learning.

Published
2021

3. A Blockchain-Based Key Management Protocol for Secure Device-to-Device Communication in the Internet of Things

Author

Abdelmadjid Bouabdallah, Hicham Lakhlef, Mohamed Ali Kandi, Yacine Challal, Djamel Eddine Kouicem, Heuristique et Diagnostic des Systèmes Complexes [Compiègne] (Heudiasyc), and Université de Technologie de Compiègne (UTC)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Blockchain, Computer science, business.industry, Emerging technologies, 020206 networking & telecommunications, Cryptography, 02 engineering and technology, Cryptographic protocol, Computer security, computer.software_genre, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Scalability, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Single point of failure, business, Key management, computer, Protocol (object-oriented programming), ComputingMilieux_MISCELLANEOUS
Abstract

The Internet of Things (IoT) is an emerging technology that aims to extend connectivity to all everyday devices. One of the main challenges that are slowing down its development is how to secure the Device-to-Device communication. Among all the security issues, the Key Management (KM) is one of the most challenging. The difficulty lies in the fact that most of the IoT devices suffer from a lack of resources. Although different protocols were proposed, most of them do not consider the dynamic nature of the IoT. Other solutions rely on a centralized entity to distribute the new keys upon a change in the network. However, this entity becomes a single point of failure and the main target of attacks. We propose a novel blockchain-based decentralized KM protocol. In addition to being resilient, scalable and dynamic, our solution uses the blockchain technology to securely distribute the KM on several entities.

Published
2020

4. A Memory-efficient Group Key Managment for Communicating Things

Author

Abdelmadjid Bouabdallah, Hicham Lakhlef, Fabio D'Andreagiovanni, Heuristique et Diagnostic des Systèmes Complexes [Compiègne] (Heudiasyc), and Université de Technologie de Compiègne (UTC)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Event monitoring, Computer science, business.industry, [INFO.INFO-CE]Computer Science [cs]/Computational Engineering, Finance, and Science [cs.CE], 020206 networking & telecommunications, 02 engineering and technology, 020202 computer hardware & architecture, Secure communication, Communication in small groups, Scalability, 0202 electrical engineering, electronic engineering, information engineering, Rekeying, Wireless, business, Protocol (object-oriented programming), ComputingMilieux_MISCELLANEOUS, Computer network, Group key
Abstract

Recent advances in emerging technologies gave birth to new parading of networks calledInternet of Things (IoT). The emergence of such communicating objects has led practitioners to envision networking a large number of sensors for event monitoring, data collection and filtering. Due to the use of wireless technologies, a secure communication is strongly needed to protect valuable information. Secure group communication is one of the most significant requirements for IoT applications. This employs a group rekeying mechanism for a secure and efficient delivery of data. In this paper, we present a new efficient and scalable rekeying protocol for wireless communicating things. This protocol uses $O(log_2 \sqrt[3]n )$ memory complexity, improving significantly the literature works, where n is the network size. Simulation results show that our protocol has better performances than existing works in several criteria.

Published
2020

5. An Energy Efficient Architecture of self-sustainable WSN based on Energy Harvesting and Wireless Charging with Consideration of Deployment Cost

Author

Hicham Lakhlef, Ahmed Lounis, Ghada Jaber, Abdelmadjid Bouabdallah, Khaled Abid, Heuristique et Diagnostic des Systèmes Complexes [Compiègne] (Heudiasyc), and Université de Technologie de Compiègne (UTC)-Centre National de la Recherche Scientifique (CNRS)

Subjects
021110 strategic, defence & security studies, Computer science, business.industry, Distributed computing, 0211 other engineering and technologies, 020206 networking & telecommunications, 02 engineering and technology, 7. Clean energy, Renewable energy, Base station, Software deployment, 0202 electrical engineering, electronic engineering, information engineering, Wireless, [INFO]Computer Science [cs], Energy source, business, Wireless sensor network, Energy harvesting, ComputingMilieux_MISCELLANEOUS, Efficient energy use
Abstract

Energy efficiency is a major issue in self-sustainable Wireless Sensor Networks (WSNs) since they operate without battery replacement.Recent works introduce the Energy Harvesting (EH) technique that limits battery dependency of sensors to benefit from green and renewable energy. Furthermore, Wireless Charging (WC) techniques provide reliable energy sources for sensors. The combination of these two technologies solves many problems in WSNs. However, the cost of such deployment must be taken into consideration. In this paper, we propose an energy-efficient architecture of self-sustainable WSN based on an Energy Harvesting Base Station(EHBS) and a Mobile Charger (MC) with consideration of deployment cost. Through extensive simulations, we compare different solutions and we demonstrate that the proposed solution maximizes the network lifetime while taking into account the deployment cost.

Published
2020

6. An Efficient and Anonymous Blockchain-Based Data Sharing Scheme for Vehicular Networks

Author

Djamel-Eddine Kouicem, Hicham Lakhlef, Abdelmadjid Bouabdallah, Heuristique et Diagnostic des Systèmes Complexes [Compiègne] (Heudiasyc), and Université de Technologie de Compiègne (UTC)-Centre National de la Recherche Scientifique (CNRS)

Subjects
050210 logistics & transportation, Authentication, Vehicular ad hoc network, Wireless ad hoc network, business.industry, Computer science, Data management, 05 social sciences, [INFO.INFO-CE]Computer Science [cs]/Computational Engineering, Finance, and Science [cs.CE], 020206 networking & telecommunications, 02 engineering and technology, Data sharing, Server, 0502 economics and business, 0202 electrical engineering, electronic engineering, information engineering, Wireless, Enhanced Data Rates for GSM Evolution, business, Edge computing, ComputingMilieux_MISCELLANEOUS, Computer network
Abstract

Vehicular Ad Hoc networks (VANETs) is a new emerging technology that aims at connecting vehicles using wireless communication technologies. With the emergence of VANETs, new advanced applications have emerged away which aim at enhancing driving safety and traffic management. These applications exploit the huge amount of data, shared between vehicles and infrastructure, through advanced data analysis. Due to resources limitation of vehicles, this increasing volume of data is stored on powerful edge computing servers spread over the VANETs infrastructure. However, these edge servers are not fully trusted, which rise new serious security and privacy challenges regarding the shared data between vehicles. In this work, we propose a new data-sharing scheme that protects the privacy of vehicles and drivers. We base our construction on consortium blockchain, smart contracts and Zero-Knowledge Proofs (ZKP) to propose a decentralized and anonymous data-sharing scheme. In addition, we propose a fine-grained data storage scheme on the top of blockchain, based on publish-subscribe model to enhance the data management. We confirm the efficiency of our scheme through extensive simulations and experiments. The numerical results showed that our protocol achieves a reasonable efficiency while guaranteeing a high level of security.

Published
2020

7. A Matheuristic for Joint Optimal Power and Scheduling Assignment in DVB-T2 Networks

Author

Antonella Nardin, Fabio D'Andreagiovanni, Hicham Lakhlef, Heuristique et Diagnostic des Systèmes Complexes [Compiègne] (Heudiasyc), Université de Technologie de Compiègne (UTC)-Centre National de la Recherche Scientifique (CNRS), and Università degli Studi Roma Tre

Subjects
Mathematical optimization, lcsh:T55.4-60.8, Computer science, tight linear relaxations, 02 engineering and technology, mixed integer linear programming, lcsh:QA75.5-76.95, DVB-T2, Theoretical Computer Science, Scheduling (computing), [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Software, telecommunications, Digital Video Broadcasting, matheuristics, 0202 electrical engineering, electronic engineering, information engineering, lcsh:Industrial engineering. Management engineering, network optimization, DVB-T, Integer programming, antenna design, Numerical Analysis, business.industry, Digital video, ILP heuristics, 020206 networking & telecommunications, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Solver, Computational Mathematics, Computational Theory and Mathematics, 020201 artificial intelligence & image processing, lcsh:Electronic computers. Computer science, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], business
Abstract

Because of the introduction and spread of the second generation of the Digital Video Broadcasting&mdash, Terrestrial standard (DVB-T2), already active television broadcasters and new broadcasters that have entered in the market will be required to (re)design their networks. This is generating a new interest for effective and efficient DVB optimization software tools. In this work, we propose a strengthened binary linear programming model for representing the optimal DVB design problem, including power and scheduling configuration, and propose a new matheuristic for its solution. The matheuristic combines a genetic algorithm, adopted to efficiently explore the solution space of power emissions of DVB stations, with relaxation-guided variable fixing and exact large neighborhood searches formulated as integer linear programming (ILP) problems solved exactly. Computational tests on realistic instances show that the new matheuristic performs much better than a state-of-the-art optimization solver, identifying solutions associated with much higher user coverage.

Published
2020
Full Text
View/download PDF

8. Recent Advances on 5G Resource Allocation Problem using PD-NOMA

Author

Hicham Lakhlef, Sally Ismail, Youcef Imine, Fabio D'Andreagiovanni, D'Andreagiovanni, Fabio, Heuristique et Diagnostic des Systèmes Complexes [Compiègne] (Heudiasyc), Université de Technologie de Compiègne (UTC)-Centre National de la Recherche Scientifique (CNRS), and Centre National de la Recherche Scientifique (CNRS)

Subjects
[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], Computer science, resource allocation, 02 engineering and technology, Noma, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0202 electrical engineering, electronic engineering, information engineering, medicine, Resource management, Flexibility (engineering), [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], Wireless network, business.industry, Quality of service, energy-efficient, rate-optimal, 020206 networking & telecommunications, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Spectral efficiency, medicine.disease, power allocation, power-efficient, Non-orthogonal multiple access (NOMA), 5G cellular, Cellular network, Resource allocation, 020201 artificial intelligence & image processing, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], business, optimization, Computer network
Abstract

International audience; 5G is the fifth generation technology standard for cellular networks, which is already being deployed and offering many advantages for communications, such as the high degree of flexibility, the possibility of management and control of systems and resources, thus allowing to host and execute services in one or more distinct network slices, etc. Non-orthogonal multiple access (NOMA) is being considered as a key enabling technique for 5G cellular systems. The earlier generations are becoming less practical with the emergent requirements such as very high spectral efficiency, very low latency, supporting diverse quality of services (QoS). Researchers are working on different techniques to fulfill these requirements, and NOMA is one of the essentials due to its capacity to increase spectrum efficiency. NOMA schemes exploit channel gain differences to serve multiple users concurrently, by superimposing multiple users' information signals at the transmitter side. In this paper, we review, analyze and classify recent papers on resource allocation problem in 5G networks, and then we discuss the proposed solutions. In particular, the papers are classified into two main categories: power/energy-efficient and rate-optimal. For each paper, the objective, optimization method and main results are discussed. Finally, some open challenges are highlighted.

Published
2020

9. A survey on recent contention-free MAC protocols for static and mobile wireless decentralized networks in IoT

Author

Abdelmadjid Bouabdallah, Hicham Lakhlef, Khaled Abid, Heuristique et Diagnostic des Systèmes Complexes [Compiègne] (Heudiasyc), Université de Technologie de Compiègne (UTC)-Centre National de la Recherche Scientifique (CNRS), and Abid, Khaled

Subjects
[INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], Computer Networks and Communications, business.industry, Wireless network, Computer science, Quality of service, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, 020206 networking & telecommunications, Access control, 02 engineering and technology, [INFO.INFO-ES] Computer Science [cs]/Embedded Systems, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Robustness (computer science), [INFO.INFO-ET] Computer Science [cs]/Emerging Technologies [cs.ET], 0202 electrical engineering, electronic engineering, information engineering, Wireless, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, [INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET], 020201 artificial intelligence & image processing, business, Internet of Things, Protocol (object-oriented programming), Game theory, ComputingMilieux_MISCELLANEOUS, Computer network
Abstract

Medium Access Control (MAC) protocols for wireless decentralized networks in IoT have attracted a lot of attention in both academic and industrial fields. They aim to coordinate access among IoT devices to the shared wireless medium. More specifically, contention-free MAC protocols are known to be more efficient than contention-based ones in the case of high traffic load and dense networks. To face the main communication challenges between IoT devices such as collisions and conflicts as well as mobility, it is crucial to design an efficient MAC protocol. To do so, several solutions have been proposed in the literature. Among recent proposed solutions, Machine Learning (ML) algorithms and game theory models were used to revolutionize the communication in IoT networks, especially for devices with high mobility degree. In our survey, we first start by studying the challenges and requirements of communication in wireless networks. Then, we provide a comprehensive survey on recent contention-free MAC protocols existing in the literature. Next, we compare these solutions based on important metrics such as QoS, robustness, fairness etc., and discuss the relationship between MAC protocols, network type and network mobility. Finally, we investigate a future research direction to solve a major problem, which is the network disruption and delay tolerance in IoT wireless mobile networks.

Published
2021

10. Efficient and lightweight group rekeying protocol for communicating things

Author

Hicham Lakhlef, Abdelmadjid Bouabdallah, Heuristique et Diagnostic des Systèmes Complexes [Compiègne] (Heudiasyc), and Université de Technologie de Compiègne (UTC)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Event monitoring, General Computer Science, Computer science, business.industry, Emerging technologies, 020206 networking & telecommunications, 02 engineering and technology, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Secure communication, Control and Systems Engineering, Communication in small groups, Scalability, 0202 electrical engineering, electronic engineering, information engineering, Rekeying, Wireless, 020201 artificial intelligence & image processing, Electrical and Electronic Engineering, business, Protocol (object-oriented programming), ComputingMilieux_MISCELLANEOUS, Computer network
Abstract

Recent advances in emerging technologies have given birth to a new type of networks called Internet of Things (IoT). The emergence of IoT has led practitioners to envision networking a large number of sensors for event monitoring, data collection and filtering. Due to the use of wireless technologies, a secure communication is strongly needed to protect valuable information. Secure group communication is one of the most significant requirements for IoT applications. This employs a group rekeying mechanism for a secure and efficient delivery of data. In this paper, we present a new efficient and scalable rekeying protocol for wireless communicating things. This protocol uses O ( log 2 n 3 ) memory complexity, improving significantly the literature works, where n is the network size. Simulation results show that our protocol has better performances than existing works in several criteria.

Published
2021

11. An Efficient Multi-Group Key Management Protocol for Heterogeneous IoT Devices

Author

Yacine Challal, Abdelmadjid Bouabdallah, Hicham Lakhlef, Mohamed Ali Kandi, Heuristique et Diagnostic des Systèmes Complexes [Compiègne] (Heudiasyc), Université de Technologie de Compiègne (UTC)-Centre National de la Recherche Scientifique (CNRS), Centre de recherche sur l'Information Scientifique et Technique (CERIST), Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.), and INS2I STFOC

Subjects
business.industry, Computer science, 020206 networking & telecommunications, Cryptography, 02 engineering and technology, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Secure communication, Scalability, Collusion, Secrecy, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, business, Key management, Protocol (object-oriented programming), ComputingMilieux_MISCELLANEOUS, Heterogeneous network, Computer network
Abstract

The Internet of Things (IoT) is a network made up of a large number of devices which are able to automatically communicate to computer systems, people and each other providing various services for the benefit of society. These devices have the particularity of being heterogeneous and so have different capabilities in terms of storage, computing, communication and energy. One of the main challenges facing the IoT is how to secure communication between these heterogeneous devices. Among all the issues, the Group Key Management is one of the most difficult. Although different approaches have been proposed to solve it, very few of them consider the heterogeneous nature of the IoT. We propose then a highly scalable Multi-Group Key Management protocol for IoT that ensures the forward and backward secrecy, efficiently recovers from collusion attacks, guarantees the secure coexistence of several services in a single network and balances the loads between its heterogeneous devices according to their capabilities. The evaluation of our solution shows that it is efficient for large-scale heterogeneous networks even if they contain highly resource-constrained devices.

Published
2019

12. A multi-level clustering scheme based on cliques and clusters for wireless sensor networks

Author

Hicham Lakhlef

Subjects
Clique, General Computer Science, business.industry, Quality of service, Distributed computing, Hierarchical clustering, Key distribution in wireless sensor networks, Control and Systems Engineering, Scalability, Computer Science::Networking and Internet Architecture, Key (cryptography), Electrical and Electronic Engineering, business, Cluster analysis, Wireless sensor network, Computer network, Mathematics
Abstract

This paper presents a hierarchical scheme for sensor networks clustering.The solution proposed combines clustering into cliques and clusters.It takes into account the sizes of cliques and clusters for scalability and energy saving purposes.It improves the end-to-end delay compared to existing works. Wireless sensor networks (WSNs) have a wide range of applications in our lifetime. Indeed, WSNs perform a various missions and tasks in odor localization, firefighting, medical service, surveillance and security. In order to accomplish these tasks, the sensors have to perform partitioning protocols to form an organization into clusters and cliques. The hierarchical clustering is the key solution for WSNs to deal with the scalability problems in a network composed of millions of nodes. In this paper, a new hierarchical partitioning scheme is presented, named MCCC. It is cliques and clusters based hierarchical scheme that takes into account the size of cliques and clusters, it also minimizes the number of hops between the cluster head and its nodes. The proposed scheme is motivated by the need to have minimum and maximum size for cliques and clusters. This hierarchical scheme is proposed to respond to the energy and memory constraints for WSNs.

Published
2015

13. A versatile Key Management protocol for secure Group and Device-to-Device Communication in the Internet of Things

Author

Abdelmadjid Bouabdallah, Mohamed Ali Kandi, Yacine Challal, Hicham Lakhlef, Heuristique et Diagnostic des Systèmes Complexes [Compiègne] (Heudiasyc), Université de Technologie de Compiègne (UTC)-Centre National de la Recherche Scientifique (CNRS), Centre de recherche sur l'Information Scientifique et Technique (CERIST), and Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.)

Subjects
Service (systems architecture), Computer Networks and Communications, Computer science, business.industry, 020206 networking & telecommunications, 02 engineering and technology, dissemin, Computer Science Applications, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Mode (computer interface), Hardware and Architecture, Secrecy, Scalability, Communication in small groups, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], 020201 artificial intelligence & image processing, Key management, Resilience (network), business, Protocol (object-oriented programming), ComputingMilieux_MISCELLANEOUS, Computer network
Abstract

The Internet of Things (IoT) is a network made up of a large number of devices that collaborate to provide various service for the benefit of society. Two communication modes are required to enable a smooth collaboration. A device can send the same message to several other ones participating in the same service. It may also address a specific device in a Peer-to-Peer manner. The first mode of communication is called Group Communication, while we refer to the second as Device-to-Device Communication. One of the main challenges facing the IoT is how to secure these two modes of communication. Among all the security issues, the Key Management is one of the most challenging. This is mainly due to the fact that most of the IoT devices have limited resources in terms of storage, calculation, communication and energy. Although different approaches have been proposed to deal with this problem, each of them presents its own limitations and weaknesses. Moreover, they usually consider either the Group or the Device-to-Device Communication. In this paper, we propose a novel versatile Key Management protocol for the Internet of Things. To the best of our knowledge, this is the first protocol that secures both modes of communication at the same time. We then analyze the security and performance of our solution and compare it to the existing schemes. For Group Communication, we show that our solution ensures the forward and backward secrecy and, unlike most of the existing Group Key Management protocols, guarantees the secure coexistence of several services in the network. With regard to Device-to-Device Communication, we prove that our solution is flexible and provides a good level of resilience and network connectivity compared to the existing Peer-to-Peer Key Management schemes. We finally demonstrate that, by balancing the loads between the heterogeneous devices according to their capabilities, our solution is both efficient and scalable.

Published
2020

14. A Decentralized Blockchain-Based Trust Management Protocol for the Internet of Things

Author

Youcef Imine, Abdelmadjid Bouabdallah, Hicham Lakhlef, Djamel Eddine Kouicem, Heuristique et Diagnostic des Systèmes Complexes [Compiègne] (Heudiasyc), and Université de Technologie de Compiègne (UTC)-Centre National de la Recherche Scientifique (CNRS)

Subjects
021110 strategic, defence & security studies, business.industry, Smart objects, Computer science, 0211 other engineering and technologies, 02 engineering and technology, Service provider, Variety (cybernetics), [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Scalability, Trust management (information system), Electrical and Electronic Engineering, Architecture, business, Protocol (object-oriented programming), Dissemination, ComputingMilieux_MISCELLANEOUS, Computer network
Abstract

The Internet of Things (IoT) is a network that integrates a variety of heterogeneous nodes, such as connected devices (sensors, robots, smart phones…), connected cars, smart homes, etc. These smart objects communicate and collaborate between each other in distributed and dynamic environments that face several security challenges. Trust management is one of the most important challenges in such environments. Existing trust management solutions do not meet the new requirements of IoT such as heterogeneity, mobility and scalability. In this paper, we propose a hierarchical and scalable based blockchain trust management protocol with mobility support in massively distributed IoT systems. In our protocol, mobile smart objects disseminate trust information about service providers to the blockchain. Thus, all the objects will have a global view about each service provider in the architecture which speeds up the trust decision making. In addition, our protocol is resilient against known malicious attacks such as \textit{bad-mouthing}, \textit{ballot-stuffing} and \textit{cooperative attacks}. We confirm the efficiency of our proposal through theoretical analysis and extensive simulations. Finally, we show that it outperforms existing solutions especially in terms of scalability, mobility support, communication and computation.

Published
2020

15. A Hybrid MIP-Based Heuristic for the Optimal Design of DVB-T2 Networks

Author

Antonella Nardin, Hicham Lakhlef, Fabio D'Andreagiovanni, Centre National de la Recherche Scientifique (CNRS), Heuristique et Diagnostic des Systèmes Complexes [Compiègne] (Heudiasyc), Université de Technologie de Compiègne (UTC)-Centre National de la Recherche Scientifique (CNRS), Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS), and Università degli Studi Roma Tre

Subjects
Mathematical optimization, Heuristic (computer science), Computer science, business.industry, 020206 networking & telecommunications, 02 engineering and technology, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Solver, DVB-T2, Network planning and design, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Software, Genetic algorithm, Digital Video Broadcasting, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], business, Integer programming, ComputingMilieux_MISCELLANEOUS
Abstract

Due to the ongoing introduction of the second generation of the Digital Video Broadcasting - Terrestrial standard (DVB-T2), television broadcasters that are already active and new broadcasters entering in the business will be required to (re) design their networks. This is generating a new interest for effective and efficient DVB optimization software tools. In this work, we propose a new fast hybrid heuristic for the design of DVB-T2 networks. The heuristic combines a genetic algorithm, adopted to efficiently explore the solution space of power emissions of DVB stations, with a (very) large neighborhood search formulated as a Mixed Integer Programming (MIP) problem solved exactly. Computational tests on realistic instances show that the new hybrid heuristic is able to identify solutions granting much higher user coverage than those identified by a state-of-the-art optimization solver.

Published
2018

16. An Efficient Multi-Group Key Management Protocol for Internet of Things

Author

Hicham Lakhlef, Yacine Challal, Abdelmadjid Bouabdallah, Mohamed Ali Kandi, Heuristique et Diagnostic des Systèmes Complexes [Compiègne] (Heudiasyc), Université de Technologie de Compiègne (UTC)-Centre National de la Recherche Scientifique (CNRS), and Université de Technologie de Compiègne (UTC)

Subjects
Computer science, Compromise, media_common.quotation_subject, 0211 other engineering and technologies, 02 engineering and technology, Computer security, computer.software_genre, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Secure communication, Secrecy, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], Key management, Protocol (object-oriented programming), ComputingMilieux_MISCELLANEOUS, media_common, Service (business), 021110 strategic, defence & security studies, business.industry, 020206 networking & telecommunications, dissemin, Scalability, Collusion, business, computer
Abstract

International audience; Internet of Things (IoT) is a network made up of a large number of devices which are able to automatically communicate to computer systems, people and each other providing various services for the benefit of society. One of the main challenges facing the IoT is how to secure communication between these devices. Among all the issues, the Group Key Management is one of the most difficult. Although different approaches have been proposed to solve it, most of them use the same security parameters to secure all communications. Thus, if several services are provided by the network, communications within a service will be accessible to all network members even those which did not subscribe to it. Moreover, the compromise of a member will jeopardize all services. In this paper, we propose a highly scalable Multi-Group Key Management protocol for IoT which ensures the forward and backward secrecy, efficiently recovers from collusion attacks and guarantees the secure coexistence of several services in a single network. To achieve this, our protocol manages several groups with independent security parameters.

Published
2018

17. An Efficient Architecture for Trust Management in IoE Based Systems of Systems

Author

Djamel Eddine Kouicem, Abdelmadjid Bouabdallah, and Hicham Lakhlef

Subjects
System of systems, Smart objects, Computer science, business.industry, 020206 networking & telecommunications, 02 engineering and technology, Service provider, Home automation, 020204 information systems, Scalability, 0202 electrical engineering, electronic engineering, information engineering, Trust management (information system), The Internet, business, Dissemination, Computer network
Abstract

Internet of Every things (IoE) is a network that integrates a variety of heterogeneous nodes, such as connected portable devices, connected cars, smart home appliances, humans, etc. to Internet. The constituents of IoE are heterogeneous, distributed by nature and also autonomous in most of cases, which meet the criteria of what we call Systems of Systems (SoS). These smart objects communicate and collaborate between each other in dynamic environments which are subject to several security attacks. In this paper, we propose a hierarchical based blockchain trust management architecture with mobility support in highly distributed IoE based Systems of Systems. This architecture deals efficiently with scalability issues. It allows smart objects to disseminate the trustworthiness of the service providers they interact with them to the blockchain. This later makes the access to this information possible from anywhere and ensures a global view of trustworthiness information. Thanks to the blockchain technology, our architecture outperforms the existing trust management solutions especially in terms of scalability and mobility support.

Published
2018

18. Agent-based Broadcast Protocols for Wireless Heterogeneous Node Networks

Author

Julien Bourgeois, Abdelmadjid Bouabdallah, Hicham Lakhlef, Michel Raynal, Heuristique et Diagnostic des Systèmes Complexes [Compiègne] (Heudiasyc), Université de Technologie de Compiègne (UTC)-Centre National de la Recherche Scientifique (CNRS), the World Is Distributed Exploring the tension between scale and coordination (WIDE), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC), RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES (IRISA-D2), CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Université de Rennes (UNIV-RENNES), Université de Rennes (UNIV-RENNES)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UNIV-RENNES)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Rennes (ENS Rennes)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), and Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Internet of things, Permutation routing, Computer Networks and Communications, Computer science, Distributed computing, 02 engineering and technology, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Broadcasting, Upper and lower bounds, [INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Collision-free, 0202 electrical engineering, electronic engineering, information engineering, Wireless, Wearable technology, Communication protocols, Energy-efficiency, business.industry, Wireless network, Network packet, 020206 networking & telecommunications, Partition (database), [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, [INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA], 020201 artificial intelligence & image processing, [INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business, Parallel broadcasting, Computer network
Abstract

Internet of Things (IoT) is a wireless network composed of a variety of heterogeneous objects such as Connected Wearable Devices (sensors, smartwatches, smartphones, PDAs ...), Connected Cars, Connected Homes,...etc. These things use generally wireless communication to interact and cooperate with each other to reach common goals. IoT(T, n) is a network of things composed of T things with n items (packets) distributed randomly on it. The aim of the permutation routing is to route to each thing, its items, so it can accomplish its task. In this paper, we propose two agent-based broadcast protocols for mobile IoT, using a limited number of communication channels. The main idea is to partition the things into groups where an agent in each group manages a group of things. This partitioning is based on the memory capacities for these heterogeneous nodes. The first protocol uses a few communication channels to perform a parallel broadcasting and requires O ( n k ) memory space, where k is the number of communication channels. The second protocol uses an optimal complexity of memory space for each thing to achieve the permutation routing with a parallel broadcasting using less number of channels. We give an estimation of the upper and lower bounds of the number of broadcast rounds in the worst case and we discuss experimental results.

Published
2018

19. Energy-aware parallel self-reconfiguration for chains microrobot networks

Author

Julien Bourgeois, Hakim Mabed, Hicham Lakhlef, Seth Copen Goldstein, Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS), and Carnegie Mellon University [Pittsburgh] (CMU)

Subjects
0209 industrial biotechnology, Computer Networks and Communications, Computer science, business.industry, Logical topology, Parallel algorithm, Control reconfiguration, 02 engineering and technology, Energy consumption, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Theoretical Computer Science, Rendering (computer graphics), [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], 020901 industrial engineering & automation, Artificial Intelligence, Hardware and Architecture, Distributed algorithm, Embedded system, Scalability, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business, Software, Declarative programming
Abstract

MEMS microrobots are miniaturized electro-mechanical elements, made using the techniques of micro-fabrication. They have limited energy capacity and low memory space. Self-reconfiguration is required for MEMS microrobots to complete their mission and/or to optimize their communication. In this paper, we present a self-reconfiguration protocol from a straight chain to square organization, which deals with MEMS microrobots characteristics. In the proposed protocol, nodes do not have the map of their target positions which makes the protocol portable, standalone, and the memory complexity is bounded by a constant. This paper improves a former solution by using parallelism in the movements of microrobots to optimize the time and the number of movements and by making the algorithm energy-aware. So each node is aware of the amount of energy that it will spend, which will improve the energy consumption. Our algorithm is implemented in Meld, a declarative language, and executed in a real environment simulator called DPRSim. We present a parallel and energy-ware protocol for self-reconfiguration of microrobots.From chains configurations to squares configurations.This protocol is efficient and scalable because it is map-less.This protocol needs a constant complexity of memory usage.Evaluation is made with the Dynamic Physical Rendering Simulator.

Published
2015

20. Providing Collision-Free and Conflict-Free Communication in General Synchronous Broadcast/Receive Networks

Author

Abdelmadjid Bouabdallah, Michel Raynal, François Taïani, Hicham Lakhlef, Heuristique et Diagnostic des Systèmes Complexes [Compiègne] (Heudiasyc), Université de Technologie de Compiègne (UTC)-Centre National de la Recherche Scientifique (CNRS), As Scalable As Possible: foundations of large scale dynamic distributed systems (ASAP), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Ecole Superieure d'Ingenieurs de Rennes [Rennes] (ESIR), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES), Université de Rennes (UNIV-RENNES), Heuristique et Diagnostic des Systèmes Complexes [Compiègne] ( Heudiasyc ), Centre National de la Recherche Scientifique ( CNRS ), As Scalable As Possible: foundations of large scale dynamic distributed systems ( ASAP ), Institut National de Recherche en Informatique et en Automatique ( Inria ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -SYSTÈMES LARGE ÉCHELLE ( IRISA_D1 ), Institut de Recherche en Informatique et Systèmes Aléatoires ( IRISA ), Université de Rennes 1 ( UR1 ), Université de Rennes ( UNIV-RENNES ) -Université de Rennes ( UNIV-RENNES ) -Institut National des Sciences Appliquées - Rennes ( INSA Rennes ) -Université de Bretagne Sud ( UBS ) -École normale supérieure - Rennes ( ENS Rennes ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -CentraleSupélec-Centre National de la Recherche Scientifique ( CNRS ) -IMT Atlantique Bretagne-Pays de la Loire ( IMT Atlantique ) -Université de Rennes 1 ( UR1 ), Université de Rennes ( UNIV-RENNES ) -Université de Rennes ( UNIV-RENNES ) -Institut National des Sciences Appliquées - Rennes ( INSA Rennes ) -Université de Bretagne Sud ( UBS ) -École normale supérieure - Rennes ( ENS Rennes ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -CentraleSupélec-Centre National de la Recherche Scientifique ( CNRS ) -IMT Atlantique Bretagne-Pays de la Loire ( IMT Atlantique ) -Institut de Recherche en Informatique et Systèmes Aléatoires ( IRISA ), Université de Rennes ( UNIV-RENNES ) -Université de Rennes ( UNIV-RENNES ) -Institut National des Sciences Appliquées - Rennes ( INSA Rennes ) -Université de Bretagne Sud ( UBS ) -École normale supérieure - Rennes ( ENS Rennes ) -CentraleSupélec-Centre National de la Recherche Scientifique ( CNRS ) -IMT Atlantique Bretagne-Pays de la Loire ( IMT Atlantique ), Ecole Superieure d'Ingenieurs de Rennes [Rennes] ( ESIR ), Université de Rennes ( UNIV-RENNES ) -Université de Rennes ( UNIV-RENNES ), Université de Rennes ( UNIV-RENNES ), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), and Université de Rennes (UR)

Subjects
Distance-2 graph coloring, Collision, Conflict, Computer science, Distributed computing, 02 engineering and technology, traversal, Message-passing, Synchronous system, Arbitrary networks, [ INFO.INFO-DC ] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, Wireless, Wireless network, business.industry, Message passing, 020206 networking & telecommunications, Time slot assignment, Key distribution in wireless sensor networks, Evolving networks, Broadcast/receive, Distributed algorithm, network, Graph (abstract data type), 020201 artificial intelligence & image processing, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business, Wireless sensor network, Computer network
Abstract

International audience; This work considers the problem of communication in dense and large scale wireless networks composed of resource-limited nodes. In this kind of networks, a massive amount of data is becoming increasingly available, and consequently implementing protocols achieving error-free communication channels constitutes an important challenge. Indeed, in this kind of networks, the prevention of message conflicts and message collisions is a crucial issue. In terms of graph theory, solving this issue amounts to solve the distance-2 coloring problem in an arbitrary graph. The paper presents a distributed algorithm providing the processes with such a coloring. This algorithm is itself collision-free and conflict-free. It is particularly suited to wireless networks composed of nodes with communication or local memory constraints.

Published
2017

21. Programmable matter as a cyber-physical conjugation

Author

Julien Bourgeois, Andre Naz, Dominique Dhoutaut, Nicolas Boillot, Hakim Mabed, Hicham Lakhlef, Benoît Piranda, Thadeu Tucci, Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS), As Scalable As Possible: foundations of large scale dynamic distributed systems (ASAP), SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), and ANR-16-CE33-0022,ProgrammableMatter,Matériel et logiciel pour créer de la matière programmable(2016)

Subjects
0209 industrial biotechnology, Computer science, business.industry, Cyber-physical system, 020206 networking & telecommunications, 02 engineering and technology, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Object (philosophy), [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, [INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing, Programmable matter, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], 020901 industrial engineering & automation, Action (philosophy), Human–computer interaction, [INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA], Claytronics, Component (UML), 0202 electrical engineering, electronic engineering, information engineering, Robot, Cybernetics, [INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET], Artificial intelligence, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business
Abstract

International audience; Programmable matter i.e. matter that can change its physical properties, more likely its shape according to an internal or an external action is a good example of a cybermatics component. As it links a cyberized shape to real matter, it is a straight example of cyber-physical conjugation. But, this interaction between virtual and real worlds needs two elements. The first one is to find a way to represent the cyberized object using programmable matter and the second is to be able to adapt the matter to the cyberized changes. This article presents the progresses made in these two topics within the Claytronics project.

Published
2016

22. Optimal Collision/Conflict-Free Distance-2 Coloring in Wireless Synchronous Broadcast/Receive Tree Networks

Author

Hicham Lakhlef, Michel Raynal, Davide Frey, As Scalable As Possible: foundations of large scale dynamic distributed systems (ASAP), SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria), Institut Universitaire de France (IUF), Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), and Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)

Subjects
[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], Degree (graph theory), business.industry, Computer science, Wireless network, Message passing, Time division multiple access, 020206 networking & telecommunications, Graph theory, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Tree (graph theory), [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, Tree network, Graph (abstract data type), [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business, Time complexity, ComputingMilieux_MISCELLANEOUS, Computer network
Abstract

This article is on message-passing systems where communication is (a) synchronous and (b) based on the "broadcast/receive" pair of communication operations. "Synchronous" means that time is discrete and appears as a sequence of time slots (or rounds) such that each message is received in the very same round in which it is sent. "Broadcast/receive" means that during a round a process can either broadcast a message to its neighbors or receive a message from one of them. In such a communication model, no two neighbors of the same process, nor a process and any of its neighbors, must be allowed to broadcast during the same time slot (thereby preventing message collisions in the first case, and message conflicts in the second case). From a graph theory point of view, the allocation of slots to processes is known as the distance-2 coloring problem: a color must be associated with each process (defining the time slots in which it will be allowed to broadcast) in such a way that any two processes at distance at most 2 obtain different colors, while the total number of colors is "as small as possible". The paper presents a parallel message-passing distance-2 coloring algorithm suited to trees, whose roots are dynamically defined. This algorithm, which is itself collision-free and conflict-free, uses aamp;#x0394;+1 colors where aamp;#x0394; is the maximal degree of the graph (hence the algorithm is color-optimal). It does not require all processes to have different initial identities, and its time complexity is O(daamp;#x0394;), where aamp;#x0394; is the depth of the tree. As far as we know, this is the first distributed distance-2 coloring algorithm designed for the broadcast/receive round-based communication model, which owns all the previous properties.

Published
2016

23. Efficient Broadcast Protocol for the Internet of Things

Author

Julien Bourgeois, Hicham Lakhlef, Michel Raynal, Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS), As Scalable As Possible: foundations of large scale dynamic distributed systems (ASAP), SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes 1 (UR1), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria), Inria Grenoble - Rhône-Alpes, Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Université de Rennes (UNIV-RENNES)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UNIV-RENNES)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Rennes (ENS Rennes)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Université de Rennes (UNIV-RENNES), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), and Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique)

Subjects
Computer science, Wireless Routing Protocol, Index Terms—Internet of things, 02 engineering and technology, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Computer security, computer.software_genre, law.invention, [INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], law, Internet Protocol, Collision-free, 0202 electrical engineering, electronic engineering, information engineering, Wireless, Permutation Routing, Wearable technology, Energy-efficiency, business.industry, Wireless network, 020206 networking & telecommunications, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, [INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA], Broadcast communication network, 020201 artificial intelligence & image processing, [INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET], Mobile telephony, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business, computer, Parallel broadcasting, Computer network, Efficient energy use
Abstract

International audience; —Internet of Things (IoT) is a network composed of a variety of heterogeneous things and objects such as Connected Wearable Devices (sensors, MEMS, microrobots, PDA, ...), Connected Cars, Connected Homes, Connected Cities, and the Industrial Internet. These things use generally wireless communication to interact and cooperate with each other to reach common services and goals. IoT (T, n) is a wireless network of things composed of T things with n items (information) distributed on it. The aim of the permutation routing is to route to each thing, its items, so it can accomplish its task. In this paper, we present an agent-based broadcast protocol for mobile Internet of Things that uses few communication channels. The main idea is to partition things into groups according to the number of channels. In each group, an agent manages a set of things. This new protocol performs efficiently with respect to the number of broadcast rounds and runs without conflict and collision on the communication channels. We give an estimation of the upper and the lower bounds of the number of broadcast rounds in the worst case. This paper is the first to present efficient broadcast protocol for the internet of things.

Published
2016

24. On the Mapless Reconfiguration for Modular Robots: Results and Future Directions

Author

Julien Bourgeois, Hicham Lakhlef, Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), and Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)

Subjects
Self-reconfiguring modular robot, Robot kinematics, Engineering, business.industry, Distributed computing, Control reconfiguration, Control engineering, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Medical services, [INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Robustness (computer science), [INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA], Scalability, Robot, [INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business, Search and rescue
Abstract

International audience; Modular robots represent a major technological challenges in the last decades because of expectations on their massive use in our lifetime, particularly in order to improve the well-being of people. Indeed, modular robots are gaining increasing attention due to their use in various missions and tasks in a wide range of applications, including location, the fight against fires, medical services, surveillance and security, and search and rescue. They can perform tasks in unstructured environments, complex, dynamic and unknown. To carry out these missions robots must apply reconfiguration protocols to adapt to working conditions. These reconfiguration protocols must deal with the limitations of nodes including those relating to memory and energy resources. Also, these algorithms should be effective, scalable, secure and robust, using only local information. In this paper, we provide a review on the recent protocols that achieve the self-reconfigurations without predefined positions of the target shape.}, keywords={microrobots;MEMS microrobots;energy resources;fire fighting;mapless reconfiguration;medical services;memory resources;modular robots;reconfiguration protocols;search and rescue;security;self-reconfigurations;surveillance;unstructured environments;Heuristic algorithms;Prediction algorithms;Protocols;Robot kinematics;Robustness;Shape;MEMS;Mapless;Modular robots;reconfiguration

Published
2015

25. Distributed and Dynamic Map-less Self-reconfiguration for Microrobot Networks

Author

Julien Bourgeois, Hakim Mabed, Hicham Lakhlef, Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), and Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Artificial neural network, business.industry, Computer science, Distributed computing, Node (networking), Control reconfiguration, 020206 networking & telecommunications, 02 engineering and technology, Network topology, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Set (abstract data type), [INFO.INFO-MC]Computer Science [cs]/Mobile Computing, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Distributed algorithm, Embedded system, Scalability, 0202 electrical engineering, electronic engineering, information engineering, Robot, 020201 artificial intelligence & image processing, business
Abstract

International audience; MEMS micro robots are low-power and low memory capacity devices that can sense and act. One of the most challenges in MEMS micro robot applications is the self-reconfiguration, especially when the efficiency and the scalability of the algorithm are required. In the literature, if we want a self-reconfiguration of micro robots to a target shape consisting of P positions, each micro robot should have a memory capacity of P positions. Therefore, if P equals to millions, each node should have a memory capacity of millions of positions. Therefore, this is not scalable. In this paper, nodes do not record any position, we present a self-reconfiguration method where a set of micro robots are unaware of their current position and do not have the map of the target shape. In other words, nodes do not store the positions that build the target shape. Consequently, memory usage for each node is reduced to O(1). An algorithm of self-reconfiguration to optimize the communication is deeply studied showing how to manage the dynamicity (wake up and sleep of micro robots) of the network to save energy. Our algorithm is implemented in Meld, a declarative language, and executed in a real environment simulator called DPRSim.

Published
2013

26. Parallel self-reconfiguration for MEMS microrobots

Author

Hakim Mabed, Julien Bourgeois, Hicham Lakhlef, Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), and Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Microelectromechanical systems, 0209 industrial biotechnology, business.industry, Computer science, Control reconfiguration, 02 engineering and technology, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, [INFO.INFO-MC]Computer Science [cs]/Mobile Computing, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 020901 industrial engineering & automation, Position (vector), Embedded system, Scalability, 0202 electrical engineering, electronic engineering, information engineering, Parallelism (grammar), 020201 artificial intelligence & image processing, Node (circuits), business, Scale (map), Declarative programming
Abstract

International audience; MEMS microrobots are low-power and low-memory capacity devices that can sense and act. One of the most difficult challenges in MEMS microrobot applications is the selfreconfiguration, especially when the efficiency, parallelism and the scalability of the algorithm are required. Self-reconfiguration with shared map does not scale. Because the map (predefined position of the target shape) consists of P positions, and each node must have a memory capacity, at least, of P positions. Therefore, if P is very high, the self-reconfiguration will be not feasible. In this paper, we present an efficient reconfiguration algorithm, without predefined positions of the target shape, which reduces memory usage to O(1). This algorithm ensures the networks connectivity throughout all its execution time. This solution improves the execution time and the number of movements by using movement of different microrobots at the same time that we call parallelism of movement. Our algorithm is implemented in Meld, a declarative language, and executed in a real environment simulator called DPRSim.

Published
2013

27. Dynamicity to Save Energy in Microrobots Reconfiguration

Author

Julien Bourgeois, Hakim Mabed, Hicham Lakhlef, Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), and Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS)

Subjects
0209 industrial biotechnology, Computational complexity theory, business.industry, Computer science, Distributed computing, Node (networking), Control reconfiguration, 02 engineering and technology, Network topology, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, [INFO.INFO-MC]Computer Science [cs]/Mobile Computing, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 020901 industrial engineering & automation, Distributed algorithm, Embedded system, Scalability, 0202 electrical engineering, electronic engineering, information engineering, Robot, 020201 artificial intelligence & image processing, business, Protocol (object-oriented programming)
Abstract

International audience; In this paper we present a dynamic self reconfiguration protocol for MEMS micro robots. The protocol presented in this paper is without map of the target shape which makes it efficient and scalable. In other words, nodes do not store the positions that build the target shape. Consequently, memory usage for each node is reduced to a constant complexity. An algorithm of self-reconfiguration is deeply studied showing how to manage the dynamicity (wake up and sleep of micro robots)of the network to save energy. Our algorithm is implemented in Meld, a declarative language, and executed in a real environment simulator called DPRSim.

Published
2013

28. An Efficient Permutation Routing Protocol in Multi-Hop Wireless Sensor Networks

Author

Jean Frédéric Myoupo, Hicham Lakhlef, Alain Bertrand Bomgni, Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS), Modélisation, Information et Systèmes - UR UPJV 4290 (MIS), and Université de Picardie Jules Verne (UPJV)

Subjects
Routing protocol, Zone Routing Protocol, Dynamic Source Routing, General Computer Science, Computer science, business.industry, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, Wireless Routing Protocol, 020206 networking & telecommunications, 02 engineering and technology, Key distribution in wireless sensor networks, [INFO.INFO-MC]Computer Science [cs]/Mobile Computing, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Link-state routing protocol, 0202 electrical engineering, electronic engineering, information engineering, Mobile wireless sensor network, ComputerSystemsOrganization_SPECIAL-PURPOSEANDAPPLICATION-BASEDSYSTEMS, 020201 artificial intelligence & image processing, business, Wireless sensor network, ComputingMilieux_MISCELLANEOUS, Computer network
Abstract

A wireless sensors network (WSN for short) can be represented as a graph, tree, or other structures. The structure is more or less important depending on the problem that we will deal with and the respect of constraints on WSNs. WSN (p, n) is a wireless sensor network of p stations with n items saved on it. In this paper we are interested in the permutation routing problem on multi-hop WSN(p, n). We derive a new protocol that performs with less number of broadcast rounds compared to the one in [3]. We present some simulation results comparing our protocols to the one in [3].

Published
2011

Catalog

Books, media, physical & digital resources
See catalog results