Papers by Mohamed Lehsaini
A Brief Review on Security in IoT Environments Based on Fog Computing Architecture
An Efficient Cluster-based Self-organization Algorithm for Wireless Sensor Networks
HAL (Le Centre pour la Communication Scientifique Directe), 2010
ABSTRACT
Metrics for Vehicle Density in Urban Environment
Vehicular Ad Hoc Networks (VANETs) have received a great interest either form academia and from i... more Vehicular Ad Hoc Networks (VANETs) have received a great interest either form academia and from industry since a decade because of their potential for Cooperative-Intelligent Transportation Systems (C-ITS). Then many many issues have been investigated in order to improve performances of such networks as packet delay, throughput,.. As a consequence, such systems could participate in the future to reduce accidents on the roads and traffic jams. Unicast forwarding over VANETs are usually geographic for one main reason: the nodes are dynamic, then their location change continously and the network connectivity is never stable. As a consequence, packet loss is a serious issue which has to be considered with care. Among known solutions to care this issue, we have to find appropriate metrics to measure paths to be used in order to forward packet in the network. This paper aims to propose a new metric called Link Connectivity (LC) in order to find the path with the highest connectivity between the source vehicle and the destination vehicle. Then this metrics is a basis for a unicast routing protocol over VANETs in city environment. The proposed approach is able to find the path with higher connectivity in urban environments which guarantees a high packet delivery. This metrics has been integrated into the a greedy based routing algorithm which has been developed over the simulator OMNET++ and a comparison to the GyTAR \cite{Jerbi2009}algorithm has been undertaken. We have conducted extensive simulations with different scenarios to evaluate the scalability of the approach and the robustness against frequent topology changes. As a conclusion, we have observed that this metrics has a positive impact on performance indicators as packet delivery ratio, end-to-end delay and overhead as compared to EGyTAR protocol.
A Realistic Location Service for VANETs
Communications in computer and information science, 2017
Position-based routing also called geographic routing is considered a more promising routing appr... more Position-based routing also called geographic routing is considered a more promising routing approach for highly dynamic and mobile networks like Vehicular Ad-hoc Networks (VANETs). In this kind of networks, the high-speed mobility of vehicles causes rapid changes in vehicles density and limited-time communication links. Hence, the need of location service has become extremely important to be able to find the position of a target node in a very short time.
A novel cluster-based self-organization algorithm for wireless sensor networks
Wireless sensor networks (WSNs) consist of a large number of tiny sensor nodes. Hence, a cluster-... more Wireless sensor networks (WSNs) consist of a large number of tiny sensor nodes. Hence, a cluster-based architecture can be used to deal the self-organization issues of large networks. This cluster-based organization can prolong network lifetime and reduce broadcast overhead. In this paper, we propose an efficient self- organization algorithm for clustering (ESAC), which uses a weight-based criterion for cluster-head's election.
A cooperative location service for VANETs
2017 IEEE Symposium on Computers and Communications (ISCC)
Routing messages over vehicular ad hoc networks (VANETs) is usually achieved through geographic r... more Routing messages over vehicular ad hoc networks (VANETs) is usually achieved through geographic routing protocols. In such networks, the vehicle dynamics causes rapid changes on the vehicle density and the communication links. In order to be efficient to route messages from a vehicle to another, we need to locate each node (its position), this is achieved by a location service. This study works on simple location service adapted for unicast routing over VANETs in city environment. This service is able to find a route from a route from a source to the destination and this route is the one passing through the most dense path‥ We have implemented our proposal on the OMNET++ simulator and we have conducted extensive simulations in different scenarios to evaluate its scalability and robustness against frequent topology changes. The results obtained have shown that our proposed protocol provides significant improvements in terms of packet delivery ratio, end-to-end delay and overhead compared to EGyTAR protocol.
Data transmission reduction using prediction and aggregation techniques in IoT-based wireless sensor networks
Journal of Network and Computer Applications
CCITL: A cloud‐based smart traffic management protocol using intelligent traffic light system in VANETs
Concurrency and Computation: Practice and Experience
SummaryRoad congestion and traffic jams are serious problems for drivers, causing them more delay... more SummaryRoad congestion and traffic jams are serious problems for drivers, causing them more delay in reaching their destinations. Motivated by these considerations, this article proposes an intelligent scheduling algorithm based on vehicular ad hoc networks (VANETs) and Cloud computing to schedule traffic lights to smooth road traffic and reduce waiting time on the road, called CCITL (cloud computing based intelligent traffic light protocol). In CCITL, we involve cloud computing by using conventional and vehicular clouds to have a global view of the road network and take advantage of the cloud computing capabilities to calculate the most appropriate traffic signal formulas and combinations with their phase durations in a dynamic way. This allows to ensure the fluidity of the traffic and the arrival at the destination in a short time while minimizing the waiting time on the different segments of the road network. Our proposed protocol has been developed and evaluated over OMNET++ sim...
Blockchain-Based Conditional Privacy-Preserving Authentication Mechanism for Vehicular Fog Networks
2022 3rd International Conference on Embedded & Distributed Systems (EDiS)
Detecting Sybil Attacks in Vehicular Fog Networks Using RSSI and Blockchain
IEEE Transactions on Network and Service Management
Fault‐tolerance based on augmenting approach in wireless sensor networks
Concurrency and Computation: Practice and Experience
Electricity Consumption Data Analysis Using Various Outlier Detection Methods
International Journal of Software Science and Computational Intelligence
Nowadays, detecting abnormal power consumption behavior of householders has become a big concern ... more Nowadays, detecting abnormal power consumption behavior of householders has become a big concern in the smart energy field; overcoming this limitation will help in identifying efficient solutions to reduce power consumption. This paper proposes a new methodology for detecting abnormal energy consumption in residential buildings based on hourly readings of energy consumption and peak energy consumption. The proposition is implemented using three unsupervised outlier detection methods (isolation forest, one-class SVM, and k-means). The authors propose this solution to help residents in reducing operating costs by detecting consumption failures that cannot be detected easily. On the other hand, energy providers will have the access to detailed data about anomalies, faulty appliances, and houses with poor power control strategy in general, which will help in pinpointing overconsumption problems, thus enhancing human awareness and reducing energy consumption.
Greedy Forwarding Routing Schemes using an Improved K-Means Approach for Wireless Sensor Networks
Wireless Personal Communications
Efficient deployment of roadside units in vehicular networks using optimization methods
International Journal of Communication Systems
SummaryNowadays, vehicles have become more and more intelligent and equipped with highly sophisti... more SummaryNowadays, vehicles have become more and more intelligent and equipped with highly sophisticated systems. This allows them to communicate with each other and with the roadside units (RSUs). Furthermore, to ensure efficient data dissemination in vehicular ad hoc networks (VANETs), it is recommended that a Vehicle‐to‐Infrastructure (V2I) architecture be chosen where RSUs will be installed at intersections. Nevertheless, it is not advisable to place an RSU at each intersection because of their high cost. It is therefore appropriate to reduce the number of RSUs by choosing locations at intersections that maximize the surface covered of the urban area and minimize the area of overlapping zones. Moreover, deploying an optimal number of RSUs in an urban area meeting the above requirements is an NP‐hard problem since the number of combinations is very high when the number of intersections is very large. For this purpose, we used metaheuristic approaches. The first approach is represen...
Link Quality and Load Balancing Multipath Geographic Routing for Wireless Multimedia Sensor Networks
International Journal of Wireless Networks and Broadband Technologies
Multimedia applications in wireless multimedia sensor networks (WMSNs) demand a high level of qua... more Multimedia applications in wireless multimedia sensor networks (WMSNs) demand a high level of quality of service (QoS) requirements. The multipath routing approach is considered as an effective solution to meet these requirements. However, the high-energy consumption in WMSNs is a critical concern for lifetime of network contains sensor nodes with limited battery. Many proposed works have designed multipath routing protocols to provide load balancing between discovered paths, although there is a trade-off between power efficiency and data delivery. This paper proposes a link quality and load balancing multipath geographic routing (LQLB-MGR) protocol for WMSNs. This protocol consists of two phases. The first phase is responsible to find multiple node-disjoint paths with high link quality and the second phase allows load balancing between the discovered paths based on nodal residual energy. Simulation results show that LQLB-MGR provides better performance compared to other protocols.
A GA-based Multihop Routing Scheme using K-Means Clustering approach for Wireless Sensor Networks
2020 Second International Conference on Embedded & Distributed Systems (EDiS), 2020
Energy efficiency is a very challenging issue in wire-less sensor networks (WSNs) since these net... more Energy efficiency is a very challenging issue in wire-less sensor networks (WSNs) since these networks are generally composed of a large number of energy-constrained sensors which are expected to run autonomously for long times and it may be cost-prohibitive to replace exhausted batteries of these sensors or even impossible in harsh environments. In this paper, we propose a novel routing protocol using genetic algorithm approach and K-means method to prolong network lifetime in WSNs. We involve k-means method to create clusters wherein cluster-heads are elected based on distance, residual energy and the occurrence of nodes state as cluster-head (CH). Moreover, we use genetic algorithm approach to establish CH-to-CH paths from a source node to the base station. The clustering process is performed if all members of a cluster are dead and the path constructing process will be triggered if a node changes status i.e. a member node becomes a CH. Simulation results demonstrate that our proposal provides better performance in terms of network lifetime and energy consumption compared to other routing protocols.
Advanced Measurement of Road Traffic Information in City Environments
2018 14th International Wireless Communications & Mobile Computing Conference (IWCMC), 2018
The geographic routing protocols show a great routing performance compareed to topology-based rou... more The geographic routing protocols show a great routing performance compareed to topology-based routing protocols in the highly dynamic and the large scale networks such as Vehicular Ad hoc NETworks (VANETs).However, these routing protocols suffer from radio obstacles in urban environments which leads to frequent links disconnection. One alternative to bypass this specific drawback is to benefit from the urban topology and vehicular traffic information in order to find paths with higher connectivity. In this paper, we propose a new routing protocol based on a novel distributed group information, able to provide an advanced decision when choosing the intersections by which the packets must pass to reach their destination. Our proposed protocol has been implemented over OMNET++ simulator. We have conducted simulations which have shown that our proposal provides interesting performances in terms of packet delivery ratio and end-to-end delay compared with GyTAR [1] and EGyTAR [2] protocols.
Energy-efficient fault-tolerant routing for wireless sensor networks
2020 2nd International Workshop on Human-Centric Smart Environments for Health and Well-being (IHSH), 2021
The fault-tolerance property is defined by the ability of the network to maintain its functionali... more The fault-tolerance property is defined by the ability of the network to maintain its functionality without interruption caused by sensor failure. In wireless sensor networks (WSNs), sensor nodes are prone to failures due to various causes: energy depletion, damage due to weather conditions or animals, etc. Moreover, in WSNs, failures caused by depletion of sensor batteries are the most predominant. Hence, the conservation of sensor energy prevents the premature extinction of their batteries, thus increasing the service life of the sensors. To ensure fault-tolerance property in this kind of networks, fault-tolerant protocols use fault recovery algorithms. This mechanism is considered to be an optimistic approach where it is only performed after fault detection; then to avoid breakdowns. Moreover, fault-tolerant routing protocols provide strategies that attempt to delay or avoid any type of failure in order to keep the network functional for as long as possible. In this paper, we propose an energy-efficient cluster-based fault-tolerant routing protocol for WSNs that aims to cover failures before they occur, called EE-FT protocol. EE-FT protocol chooses the shortest reliable paths for routing data to the base station based on Bernoulli's law for selecting reliable nodes. These paths are formed by CHs having more energy. Simulation results show that our proposal provides better performance in terms of network lifetime, end-to-end delay and packet loss rate compared to other protocols.
A Realistic Location Service for VANETs
Innovations for Community Services, 2017
Position-based routing also called geographic routing is considered a more promising routing appr... more Position-based routing also called geographic routing is considered a more promising routing approach for highly dynamic and mobile networks like Vehicular Ad-hoc Networks (VANETs). In this kind of networks, the high-speed mobility of vehicles causes rapid changes in vehicles density and limited-time communication links. Hence, the need of location service has become extremely important to be able to find the position of a target node in a very short time.
An improved K-means cluster-based routing scheme for wireless sensor networks
2018 International Symposium on Programming and Systems (ISPS), 2018
In wireless sensor networks (WSNs), clustering routing schemes have been widely used to reduce en... more In wireless sensor networks (WSNs), clustering routing schemes have been widely used to reduce energy consumption. In this context, the key point in such topology is how to generate clusters and select cluster-heads to improve network performance. One of solutions is to select cluster-heads alternately because the latter consume more energy due to some extra load for various activities such as data collection, data aggregation, and communication of the aggregated data to the base station. However, most of the cluster-based solutions proposed in the literature do not take into account the generation of balanced clusters with cluster-heads having more residual energy and closer to the members of their corresponding clusters. In this paper, we propose two cluster-based routing schemes. The first is based on K-means approach and the second is an improved version of K-means approach. The latter generates balanced clusters, which allows to distribute the load equitably among the cluster-heads. Simulation results show that the proposed routing schemes balance the energy consumption among the cluster-heads, and significantly improves the network lifetime compared to LEACH (Low Energy Adaptive Clustering Hierarchy) protocol.
Uploads
Papers by Mohamed Lehsaini