Mohamed Tounsi

Mohamed Tounsi
Umm Al-Qura University · College of Computer and Information Systems

Phd

About

39
Publications
1,872
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
139
Citations
Introduction
Additional affiliations
October 2011 - February 2012
Université Bordeaux 1
Position
  • Professor (Assistant)

Publications

Publications (39)
Article
Purpose Nowadays, connected vehicles are becoming quite complex systems which are made up of different devices. In such a vehicle, there are several electronic control units (ECUs) that represent basic units of computation. These ECUs communicate with each other over the Controller Area Network (CAN) bus protocol which ensures a high communication...
Chapter
After the deployment of a Wireless Sensor Network (WSN), we may need to update or even change the algorithm running in the sensors. WSNs are often deployed on a large scale which makes the manual update of the running algorithms impractical. Moreover, for some WSNs, sensors are physically inaccessible like sensors deployed in harsh environments mak...
Chapter
Broadcasting urgent information is emerging as an important area of research. One of the issues posed by this subject is the delivery ratio and the transmission time that depend on several factors such as the mobility of persons, the battery of their mobile devices, etc. In this paper, we are interested in broadcasting emergency messages to inform...
Article
Wireless sensor networks (WSNs) are composed of sensors exchanging the information that they collect from the environment. The use of a scheduler offers an efficient solution to eliminate information redundancy and possible collisions in this network. A scheduler is responsible for choosing the sensors to exchange information at each step of the al...
Article
Full-text available
This paper presents a systematic literature review of platooning systems with a special focus on the strategies which have been adopted to validate platooning algorithms. We collect the existing studies in the platooning field. The proposed algorithms are compared based on some criteria including platooning operations, communication modes, and vali...
Article
Proving the correctness of distributed algorithms is a difficult challenge in dynamic networks. In these networks, topological changes can take place due to unexpected appearance and disappearance of devices and communication links. The existing studies in the literature lack a general model for their development and their proof. Besides, most of t...
Chapter
A Wireless Sensor Network (WSN) is composed of sensors that communicate together in a distributed way to supervise the environment. The energy consumption is an important performance measure for a WSN that spurs the development of energy-efficient distributed algorithms for WSNs. In this field, we focus on a specific type of distributed algorithms...
Article
Full-text available
Broadcasting emergency messages has been widely recognized as an important area of research. A crucial issue, in this context, is to ensure the correctness of broadcasting protocols using a formal method to prevent errors before their implementation. In this paper, we propose a new protocol for broadcasting emergency messages in order to inform per...
Article
Full-text available
Constructing maximal cliques is a well-known problem in the graph theory. Despite this problem has been well studied for decades, few efforts have been presented in distributed computing. The main contribution of this paper is to propose a distributed algorithm, modeled by local computations, for constructing all maximal and disjoint cliques in a s...
Chapter
A Wireless Sensor Network (WSN) is an important wireless technology that is widely used in the Internet of things and that has wide variety of applications. In fact, a WSN consists of independent sensors, communicating with each other in a distributed way to monitor the environment. In this network, most of the existing distributed algorithms are d...
Chapter
In this paper, we focus on maintaining a forest of spanning trees in dynamic networks. In fact, we propose an approach based on two levels for specifying and proving distributed algorithms in a forest. The first level allows us to control the dynamic structure of the network by triggering a maintenance operation when the forest is altered. To do so...
Article
Full-text available
The design and the proof of correctness of distributed algorithms in dynamic networks are difficult tasks. These networks are characterized by frequent topology changes due to unpredictable appearance and disappearance of mobile devices and/or communication links. In this paper, we propose a correct-by-construction approach for specifying and provi...
Conference Paper
Finding maximal and maximum cliques are well-known problems in the graph theory. They have different applications in several fields such as the analysis of social network, bioinformatics and graph coloring. They have attracted the interest of the research community. The main goal of this paper is to present a comprehensive review of the existing ap...
Conference Paper
Full-text available
The enumeration problem addresses a collection of important algorithmic issues related to distributed computations. Among existing solutions, we are interested on the seminal algorithm of Mazurkiewicz, based on local computations. Our paper contributes to the design of a correct-by-construction enumeration algorithm. The main idea relies upon the d...
Conference Paper
In this paper, we propose a formal framework enhancing the termination detection property of distributed algorithms and reusing their specifications as well as their proofs. By relying on refinement and composition, we show that an algorithm specified with local termination detection, can be reused in order to compute the same algorithm with global...
Article
Due to the highly dynamic behavior and the time complexity in Mobile Ad-hoc NEtworks (MANETs), modeling distributed algorithms and looking at their assumptions represent a challenging research task. Also, proving the correctness of these algorithms for dynamic networks is a topic of intensive research. In fact, the solutions which have been propose...
Article
Formal proofs of distributed algorithms are long, hard and tedious. We propose a general approach, based on the Event-B formal method, to automatically generate correct programs of distributed algorithms. Our approach is implemented with a translation tool, called B2Visidia, that generates Java code from an Event-B specification related to distribu...
Article
Due to the lack of knowledge of the global state and the non determinism in the execution of the processes, distributed algorithms are considered to be very complex to design and to prove. However, it becomes crucial to guarantee that these algorithms run as designed. Modularization mechanism in formal development provides a simple way to manage th...
Conference Paper
The design and the proof of distributed algorithms are difficult tasks due to the lack of knowledge of the global state and the non determinism in the execution of the processes. Formal methods can guarantee that these algorithms run as designed. In this paper, we show that the proof of complex distributed algorithms can be simplified by combining...
Conference Paper
Formal proofs of distributed algorithms are long, hard and tedious. We propose a general approach, based on the formal method Event-B, to automatically generate correct programs of distributed algorithms. Our approach is implemented with a translation tool, called B2Visidia, that generates Java code from an Event-B specification related to distribu...
Article
Distributed algorithms are considered to be very complex to design and to prove; our paper contributes to the design of correct-by-construction distributed algorithms. The main idea relies upon the development of distributed algorithms following a top/down approach, which is clearly well known in earlier works of Dijkstra, and to use refinement for...
Conference Paper
Synchronization algorithms are mandatory for simulating local computation models of distributed algorithms. Therefore, correctness of these algorithms becomes crucial, because it gives confidence that local computations are simulated as designed and do not behave harmfully. However, these algorithms are considered to be very complex to prove since...
Article
Abstract: Our approach is directly related to the design of correct-by-construction programs. The main idea relies upon the development of distributed algorithms fol- lowing a top/down approach, which is clearly well known in earlier works of Dijkstra, and to use the refinement for controlling the correctness of the resulting algorithm. It relies o...
Article
Full-text available
Generally, the design and the proof of distributed algorithms are difficult tasks due to the lack of knowledge of the global state and the non determinism in the execution of the processes. Formal methods like Event-B can guarantee that these algorithms run correctly and efficiently. However, the specification of distributed algorithms in the Event...
Conference Paper
One of the most important issues in mobile agent systems is the security aspect. For the purpose of ensuring security, we provide in this paper a formal model for secure mobile agent system. This model supports the specification of numerous security policy types which control the behaviour of system entities and protect them, as far as possible, fr...

Network

Cited By