To address the growing challenges of road safety, efficiency, and environmental sustainability, Cooperative, Connected, and Automated Mobility (CCAM) leverages advanced communication and automation technologies across road networks. In Europe, Cooperative Intelligent Transportation Systems (C-ITS) facilitate communication among vehicles, infrastructure, and other entities, enhancing situational awareness and safety. Cooperative Awareness Messages (CAMs) provide continuous status information-such as vehicle position, speed, and direction-to nearby vehicles and infrastructure. Vehicles send CAMs to other vehicles at high frequencies ($1-10 \text{Hz}$), which, especially in dense networks, risks overloading communication channels. This may degrade network performance and potentially reduce the effectiveness of road safety applications. In this paper, we propose a new deep learning-based communication mechanism to reduce the risk of channel overload in C-ITS. Our approach enables nearby vehicles to form a temporary trust group valid for a specified period. During this period, vehicles initially send CAMs at a frequency of 1 Hz. Then, each vehicle predicts the subsequent messages of its neighbors using a variational autoencoder. Next, vehicles periodically verify the predicted CAMs by sending actual CAMs. This process ensures prediction reliability and reduces channel load by allowing vehicles to decrease CAM transmissions. We validated our approach in a simulation environment (using Omnet++, Sumo, and Artery) demonstrating its effectiveness in maintaining road safety, while reducing communication overhead.

5G and 6G technologies are set to play a transformative role in Intelligent Transportation Systems (ITS) and Vehicular communications. ITS integrates advanced communication and data technologies to optimize traffic flow, enhance safety, and enable autonomous driving. With low latency communications in 5G, high-speed connectivity, and increased reliability, it supports real-time data exchange between vehicles, infrastructure, and pedestrians, improving traffic management and safety features. As we look toward 6G, the next generation of networks promises even greater advancements, offering ultrareliable, high-bandwidth connections that will enable even more sophisticated applications, such as full vehicle autonomy and seamless integration with smart city infrastructure. Vehicle-to-everything (V2X) connectivity is the enabler of futuristic ITS, since it enables vehicles to intelligently interact with their surroundings. Reconfigurable Intelligent Surfaces (RISs) has unlocked the full potential of V2X communication. In this paper, we propose an analytical study of dual RISbased vehicle-to-infrastructure (V2I) communication scheme. Some relevant conclusions are provided related to the tradeoff between transmit power reduction and communication's outage probability increasing. The impact of the number of RIS elements are investigated. Deduction to single RIS case was provided. Finally, the analytical findings are corroborated by simulations, demonstrating the importance of our findings.

Connected and Automated Mobility (CCAM) is undergoing a paradigm shift, with safety and efficiency increasingly dependent on connectivity. Cooperative Intelligent Transport Systems (C-ITS) support this transformation by enabling the exchange of Cooperative Awareness Messages (CAMs) between vehicles and roadside infrastructure. These messages, transmitted periodically at$\text{1 - 1 0 ~ H z}$, must be digitally signed in compliance with ETSI standards using Pseudonym Certificates (PCs). However, this security process introduces a significant overhead, as the size of the security data can be up to three times larger than the CAM payload, thereby consuming a considerable portion of the communication channel bandwidth. In this paper we propose a new authentication scheme based on deep learning. Instead of exchanging signed CAMs every time, the vehicles will authenticate each other once to establish cluster-based trust relationships, and then they will exchange only unsigned CAMs during the cluster lifetime. To ensure security within the cluster, an unsupervised variational autoencoder analyzes vehicle behavior to detect anomalies and confirm that each vehicle remains the same entity originally authenticated. Through simulations using OMNeT++, SUMO, and Artery, our method achieved a$\text{48.9 \%}$reduction in the volume of messages exchanged between vehicles, significantly decreasing communication channel overhead.

In the near future, autonomous vehicles are expected to become a common sight on our roads. To facilitate their smooth integration, smart infrastructures should be in place to assist and support their operations. This transition poses various challenges that must be addressed in different environments. Autonomous vehicles need to efficiently merge onto the road and navigate various scenarios, including approaching toll booths. Ensuring seamless transitions onto and along highways is a critical aspect of their operation. In urban areas, autonomous vehicles face a unique set of challenges. They must safely interact with vulnerable road users, such as pedestrians and cyclists. Additionally, they need to navigate complex scenarios, including roundabouts, crossings, and intersections, which are common in densely populated urban environments. The successful integration of autonomous vehicles relies on both technological advancements within the vehicles themselves and the development of smart infrastructures that can support and enhance their behaviors. These advancements are crucial to ensure the safety and efficiency of autonomous vehicles in a variety of driving environments. We propose, in this study, a distributed scheme able to ensure the management of any junction without adding any specific equipment. The main idea is to allow vehicles to decide, at every moment using a simple consensus, which vehicle(s) has to go through the junctions. In this study, vehicles send and receive standardized C-ITS (Cooperative Intelligent Transport Systems) messages. They have been extended in order to implement the agreement algorithm between vehicles. The proposal has been evaluated through large campaigns of simulations. We have mainly measured average waiting time. The obtained results are almost similar to those provided by regular red-light junction management systems. As far as we know, it is the first study implementing a consensus algorithm to manage junctions using standard messages.

In today’s business environment, companies use a wide range of methods to track and interact with customers, and one popular method is proximity marketing. In order to improve customer interaction and maybe influence purchasing decisions, proximity marketing entails the targeted delivery of material to individuals depending on their physical vicinity of a business site. However, because of this domain’s quick growth and the dearth of thorough research to date, it is difficult to establish standard operating procedures and boundaries, which makes regulation and implementation difficult. This paper proposes an improved framework for proximity marketing categorization in order to fill up the gaps. Our analysis, which is based on rigorous key performance criteria distinguishes three types of proximity marketing: context-aware, beacon-driven, and location-based. These sections are designed to give users a better-organized comprehension of the tool’s uses, encouraging a more methodical and knowledgeable approach for companies looking to maximize their client tracking tactics. This paper aims to aid practitioners, policymakers, and researchers in navigating the evolving terrain of proximity marketing and assuring the ethical and efficient use of client monitoring tools in modern corporate environments by defining clearer boundaries and standards.

A marketing strategy, which is a comprehensive plan, describes an organization's approach to promoting and selling its products and services, including target audience identification, brand message, and promotional techniques. Proximity marketing is a type of marketing strategy that uses wireless technologies to target customers based on their geographic location or proximity to a specific store or location. Businesses regularly use it to get customers to their physical locations, increase sales, and raise awareness of their brands. Using wireless technologies like Bluetooth and Wi-Fi, targeted messages are sent to customers' mobile devices when they are near a physical store in a sort of location-based marketing. Concerns around data security and privacy are one of the potential issues with proximity marketing. Customers can feel that their data is not under their control or that it is being collected and used without their consent. Businesses can take steps to address these worries, such as providing customers with the choice to opt-in or opt-out of receiving marketing messages and being explicit and honest about data collection and use. Even when customers explicitly accept the gathering and usage of their data, they may nevertheless feel uneasy about it. So we suggest a Control Algorithm (CA) inspired by the concept of the consensus algorithm in the blockchain, which would give people control over their data rather than businesses, in order to solve these concerns. And this can support the development of customer and business confidence.

Cooperative Intelligent Transport Systems (C-ITS) are very important in our daily lives. They ensure road safety through the exchange of data between vehicles and road side units (RSU). Due to the sensitivity of the exchanged data between different entities, C-ITS systems are vulnerable to Cyber-attacks, they require high protection. In order to guarantee the integrity and the authentication of the exchanged messages, the European Telecommunications Standards Institute (ETSI), has specified specific procedures to manage certificates and signatures of all sent messages. Each vehicle periodically sends signed CAMs. Then, the integration of the signature and certificate in each transmitted CAM has a considerable impact on the communication channel load and bandwidth. In this study, we propose a new lightweight authentication mechanism which considers that vehicles on road are composed of a set of clusters having different sizes. The clusters are dynamic and change continuously. In each cluster, we implement some procedures in order to reach a trusted environment where vehicles communicate with unsigned messages when they trust their neighbours. When the trust is not guaranteed, vehicles switch to the standard communication until trust recovery. In order to reach the trust, each vehicle computes its own prediction of neighbours behavior. based on trajectory, speed. The prediction is performed using an auto-encoder running the LTSM algorithm. We have implemented this mechanisms on the OMNET++ environment and we have concluded that our mechanisms reduce the overhead generated by the authentication algorithms around 34% of the size of exchanged messages.

Based on client location, preferences, and behavior data, proximity marketing has become a potent tool for businesses to interact with their target audience in a personalized way. However, questions regarding user control over personal data and privacy are raised by the use of customer tracking, notably through MAC addresses. We suggest a novel algorithm in this paper to improve user control and privacy protection in proximity marketing systems. Our system uses pseudonymous MAC address switching and a consensus-based methodology to give users more protection and control over their interactions. Through simulations and performance criteria including consensus correctness, convergence, and privacy protection, we assess the algorithm’s efficacy. The outcomes show how the algorithm can enhance user control, protect privacy, reduce the likelihood of tracking and profiling, and guarantee computing efficiency for proximity marketing applications. Our findings provide information for further study and practical use, as well as for the creation of privacy-enhancing proximity marketing tactics.

In the very next future, autonomous vehicles will be really present on roads and Cooperative, Connected ans Automated Mobility will be adopted widely. They have many challenges either in urban environments or highway environments. The evolution of connectivity for vehicles ensured thanks to Cooperative Intelligent Transport Systems (C-ITS) will help autonomous vehicles to be safer and more efficient. Urban scenarios have been studied since many years in particular for the management of road intersections. Some technical solutions are deployed on light management center deployed through Road Side Units (RSU) at each road intersection. These RSU manages the intersection by running a defined policy using a specific algorithm. We propose a distributed scheme to manage a road intersection without any additional equipment. Vehicles run a consensus algorithm which allows to find, at each time, which vehicles have the right to go through the intersection. We have modelled the scheme as a distributed algorithm run by all vehicles around the road intersection.This algorithm has been implemented on a simulator and has been tested on some urban scenarios. Our main findings are that the decision made by the distributed algorithm does not lead to any collision on the intersection and has allowed a better traffic management with the reduction of the average waiting time within the intersection.

Cooperative Intelligent Transport Systems (C- ITS) are very important in our daily lives. They ensure road safety through the exchange of data between vehicles and road side units (RSU). Due to the sensitivity of the exchanged data between different entities, C- ITS systems are vulnerable to cyber attacks, they require high protection. In order to guarantee the integrity and the authentication of the exchanged messages, the European Telecommunications Standards Institute (ETSI), has specified specific procedures to manage certificates and signatures of all sent messages. Each vehicle periodically sends signed CAMs. Then, the integration of the signature and certificate in each transmitted CAM has a considerable impact on the communication channel load and bandwidth. In this study, we propose a new lightweight authentication mechanism which uses the cluster concept to decrease the network overhead. The objective is to reduce the number of signatures and certificates on all exchanged messages. The key idea is that neighbouring vehicles form a cluster to establish a trust relationship with each other, thus removing the need to send signed messages each time. Our method allows for the exchange of lightweight data without certificates or signatures (unsigned CAMs) and therefore verification and signature processes are no longer necessary all the time, which saves processing time and allows for smoother and faster communications.

The implementation of security in Cooperative Intelligent Transport Systems (C-ITS) is highly recommended to authenticate and ensure the integrity of Cooperative Awareness Message (CAM) exchanged between vehicles. Modern networks must be reliable and optimized in terms of the use of resources. In Europe, the ETSI standardization institute has defined a PKI (Public Key Infrastructure) for C-ITS that is used to distribute certificates for each vehicle. To ensure that CAMs (Cooperative Awareness Messages) are generated by trusted vehicles, they have to be signed using these certificates. However, integrating signature and certificate within each sent CAM presents a high impact on the overload of the communication channel and the bandwidth, due to the added size to the sent CAMs, which is significant. In this paper, we propose a new lightweight authentication protocol based on the ETSI standard. Our protocol is dynamic and integrates few concepts allowing to smartly reduce the transmitted security information, which often presents the highest cost in network systems. First, we build a cluster to establish a trusted link between vehicles giving them the opportunity to exchange information using unsigned CAMs (without integrating certificate and signature). As a result, the verification and the signing processes are not always necessary, which saves processing time and results in smoother and faster communication. Furthermore, we added a process that aims to check the consistency of the CAMs of each vehicle in the cluster in real time to avoid an attack. Under the Omnet++ simulator and the Artery framework, we have demonstrated that our protocol is more efficient in terms of communication channel usage and latency, while still secured.

The implementation of optimized management process for road intersections in Cooperative Intelligent Transport Systems (C-ITS) is highly recommended in order to reduce traffic jams and fuel consumption. Most of solutions are implemented on light controllers and they use various sensors in order to optimize intersection management. The use of vehicle communications, mainly I2V (Infrastructure to Vehicle), enhances the solutions since the vehicles continuously provide messages about their status (position, timestamp, speed, heading, etc.). In this paper, we suppose that a manager is embedded on a hotspot located at a road intersection. It will know the status of each road (thanks to requests sent by vehicles approaching the intersection) and will give the right to the most relevant vehicle to pass through the intersection (many vehicles could drive in the same time when they use concurrent roads). Our algorithm measures the weight of each lane and allows to non-crossing ones having the highest weight to traverse the intersection. The calculation of the weight is based on many parameters: the waiting time, the length of the road queue and some others. Our algorithm considers that the intersection topology as stable. The algorithm has been implemented on a simulator on three urban scenarios and our results show very promising performances, they show considerable enhancement in terms of computing time.

Cooperative Intelligent Transport Systems(C-ITS) focus on improving safety, comfort, traffic and energy efficiency. Vehicle speed and other speed based indicators are commonly used parameters in traffic research for generation of driving profiles. The main goal for studying speed variation is to gain a better understanding on why drivers respond in certain ways to road/traffic conditions and to discover factors which affect their actions. The aim of this paper is to use a real data-set of Cooperative Awareness Messages generated in a naturalistic driving C-ITS environment to generate speed signatures. We apply a segmentation technique and statistical analysis in generation and evaluation of road speed signatures. Based on our approach, interesting characteristics on the evolution of driving behavior are revealed.

Privacy is very sensitive and is challenging over Cooperative Intelligent Transport Systems (C-ITS). In such systems, Vehicles broadcast messages containing private data as position and speed, etc,. This data may be linked to the driver's identity. Many intruders working for employers, insurance companies or criminal organizations, could track drivers and get private data sent by vehicles. Therefore, privacy protection solutions take profit of the use of multiple identities (denoted pseudonyms). In addition to getting various identities, senders have to authenticate all their messages. These messages should be signed using certificates. Then, a pseudonym is more than a simple identity, it is a pseudonym certificate which is denoted PC. A sa consequence, each vehicle has a set of PCs. Each PC is used for a limited period of time, it must be changed according to various rules. In this paper, we compare the performances of three different pseudonym change strategies which have been implemented and evaluated over. These strategies have been described in [1]–[3]. The first one has been experimented along various European projects (SCOOP@F, C-Roads, Intercor and Indid). The second one aims to reduces the number of PCs used in the system. When a certificate has been used by a vehicle, this PC will be swap with another driver PC. The third one is based on the idea that any trusted vehicle within the system is able to generate a valid certificat to any neighbor when they drive close to each other during a long period.

Vehicles in an Intelligent Transport Network exchange a lot of messages. Every message sent is generated with an identifier of the transmitting vehicle. To respect the user privacy, an identifier is kept only over a specified time interval. The need that arises is, given that multiple identifiers are assigned to a vehicle, are we able to group the identifiers and detect those which belong to the same vehicle? We solved this Trajectory-User Linking problem by chaining anonymous trajectories to potential vehicles by considering similarity in movement patterns. Our method managed to link trajectory segments to their common vehicles which we validated through map matching of the trajectories using QGIS.

C-ITS (Cooperative Intelligent Transport System) Messages are usually sent through a specific WIFI (IEEE 802.11p) denoted also ITS-G5. This protocol is more appropriate to mobility than all other usual WiFi. The use of such networks require to vehicles and Road side Units (RSU) to be equipped with 802.11p modules. Up to now such modules are not widely distributed and have high costs. In order to recover such a weakness, we present in this paper a communication architecture based on BLE (Bluetooth Low Energy) messages. The coverage of such networks is lower than 802.11p but they are widely deployed over smartphones or some basic equipments as Raspberry-Pi stations. In this paper, we present an architecture which ensures communications between mobile stations and RSU using Bluetooth protocol. We have defined light messages which are derived from usual C-ITS messages mainly CAM (Cooperative Awareness Messages) and DENM (Decentralized Event Notification Messages). In our experimentations, we have observed that messages are properly received by vehicles driving at 130Km per hour.

Since few years, cloud computing has been adopted vehicular networks and many issues have been handled within such networks as cloud architecture and application distribution This paper proposes a new mechanism, denoted Geographical Vehicular Central Data Networking (GeoVCDN), to distribute interests in the context of Vehicular Cloud Networking (VCN). Our mechanism takes the benefit from the ETSI (European Telecommunications Standardisation Institute) standardized sent messages such as Cooperative Awareness Messages (CAM) to distribute the interests and to collect new data. Moreover, our approach allows to use the multi-hop forwarding capability of vehicular networks to spread the new data. Extensive simulations show a real enhancement of our solution compared to existing ones in particular two well known mechanism: Rendez-vous Networks (RENE) and Named Data Networks (NDN).

Cooperative Intelligent Systems development is growing and the data they produce is increasing exponentially. This amount of data will soon be large enough to fall in big data paradigm. We propose to exploit these data as data stream. We aim to detect anomaly on the road using concept drift detection methods over data stream. To achieve this purpose, we create a data generation tool to obtain large data-sets of vehicles taking an avoiding behavior and detect obstacles through crowdsensing. We use two scenarios that we aim to detect: a stopped car and a growing pothole. We focus our study on the vehicle orientation information on which we apply Page-Hinkley and ADWIN methods. We obtain interesting detection results with ADWIN on the stopped car scenario. The Page-Hinkley algorithm is obtaining good results but with a latency that makes it unexploitable in real context. But for the pothole detection, both approaches are not providing significant results.

C-ITS (Cooperative Intelligent Transport Systems) are growing more than expected, they are an important part of smart cities. Connected vehicles is one of the most recent aspect of C-ITS. For these vehicles, usual communications could be ensured through wireless local area networks over ITS-G5 (based on WFI 802.11p). In smart cities, these interconnections form a Context Cloud. As a consequence a vehicle can access to information generated by any other C-ITS, no matter its location, as long as both are part of the Cloud. In this paper, we propose a secure Cloud environment for connected vehicles denoted VCDN, for Vehicular Central Data Networking, which exploits Information Centric Networking and Vehicular Cloud Computing paradigms to provide to vehicles the data generated in a Smart City. All the communications with the Cloud are authenticated messages and mainly Cooperative Awareness Messages (CAM). We have compared the performance of our solution to some other solutions, in particular REndez-vous NEtwork (RENE) and Named Data Networking (NDN). The results are promising since our solution is more efficient compared to these approaches in terms of network's overhead.

Privacy is a very important feature nowadays on any shared system. This issue should be considered on deployed C-ITS (Cooperative Intelligent Transport Systems) in order to avoid tracking drivers who send continously messages containing their locations. The anonymity is ensured by changing the identity of drivers frequently. In addition to anonymity, authentication is highly required. An adapted PKI (Public Key Infrastructure) solves this issue. Each vehicle has a set of pseudonyms certificates (PC) which will be used to sign sent messages and will be used as a part of the driver id. Getting PCs from the PKI requires a reliable network for a period of time and is constrained for vehicles. Each vehicle manages a list of PCs dynamically. A PC is used for a limited period of time. When this period expires, the vehicle will use another PC. This paper proposes a method which reduces the number of PCs used by vehicles. Indeed, when a certificate is used by a vehicle, in order to introduce a confusion for any tracker, this PC will be exchanged with another driver PC. A tracker will be confused since the former vehicle will not be the owner of the previous PC. This exchange has to be recorded on the PKI with simple processes. This mechanism protects privacy and introduces another PC change method. It also reduces the PC costs for drivers. The evaluation of the work has been by done through a theoretical model and has proven that tracking of vehicles decreases very much.

Nowadays traffic management is considered as a key factor application to enhance transportation system performances. It aims to reduce traffic jams, fuel consumption and to optimise travel time for road users to reach their destinations in the least possible time. This traffic issue is directly affected by congestions generated at intersections when vehicles spend longer time when crossing them. In this paper, we present a distributed predictive road traffic management system for Vehicular Ad-hoc Networks (VANETs). It aims at predicting the future road traffic along with a continuous adaptation of routes for each vehicle at each junction to minimise driving time and to avoid future congestions in the network. This work highlights communications between vehicles and road-side units and shows how traffic prediction can be achieved in a distributed way without using a central server. We have implemented our proposal using OMNeT++ simulator and we have measured two performance indicators: the total waiting time and the total driving time in order to evaluate its performances compared to other proposals. These indicators have confirmed that our proposed method has better performances under some conditions.

C-ITS (Cooperative Intelligent Transport Systems) are growing very quickly in many parts over the world. Their benefits are of importance for fuel consumption, traffic management and road safety. Their deployments are in advanced steps in many countries. Their impacts on human life are not clearly known. For this reason, we propose to analyze a large set of data collected during real tests on open roads with many connected vehicles. This analysis allows us to focus on relevant information like driver profiles, abnormal driving behaviours, etc. In this paper, we present a methodology to analyze data provided by a real experimentation of C-ITS mobile stations. We mainly analyze the headings of each driver when approaching some Points of Interest (POI). We use unsupervised machine learning approaches to detect driver profiles. The interesting features about driver profiles obtained need to be enhanced and confirmed for larger data-sets.

Summary Position‐based routing, also called geographic routing, is widely recognised as an efficient routing approach for highly dynamic and mobile networks as vehicular ad hoc networks (VANETs). In this kind of networks, the high‐speed mobility of vehicles causes rapid changes on the network topology measured with vehicles density, limited‐time communication links, link failures, etc. In the meantime, the need of location service is a key issue; indeed, it will allow finding the position of a target node in order to reach it with a message. Some theoretical studies have proposed location services based on sharing nodes informations in different ways with hierarchy mechanism or with distribution mechanism or with centralization process. This paper proposes a location service deployed on RSUs (Road Side Units) for unicast routing over VANETs in urban environment. The proposed approach is able to measure the connectivity of a route. We propose then a new metric called Link Connectivity (LC) which measures this connectivity. Additionally, we have implemented our proposal using OMNET++ simulator and we have conducted extensive simulations with various scenarios to evaluate its scalability and robustness against frequent topology changes. As a conclusion, the proposed mechanism provides significant performance improvements in terms of packet delivery ratio, end‐to‐end delay, and overhead when it is compared to some other known proposals.

Summary The complexity of cyber‐physical systems (CPSs) opens up several challenges regarding the assurance of high levels of reliability. Therefore, we need to develop a new data quality analysis and new CPS components/subsystems for the detection, isolation, recovery, and prevention of failures and intrusion events. Furthermore, we have to develop new reliability assessment models and metrics in order to properly evaluate CPSs. Agent technologies, through their characteristics such as autonomy, social ability, reactivity, and proactivity, have the potential to address these challenges and requirements. We propose a multi‐agent based solution, namely ReliaCPS, for detecting and preventing the failures of the system components of CPSs. We also use a case study of a CPS for monitoring ambient parameters to evaluate the performance of the proposed approach. Our results indicate improvements in terms of reliability metrics (32.69% for the mean time between failures and mean time to failure, 50% for the mean time to repair and 0.94% for reliability function over time).

Nowadays, huge amount of data are generated and collected in many domains and from various sources. Most of the time, the collected data are processed as common data where simple calculations are applied for the analysis, such as measuring the average, the maximum, the deviation, etc. Exemplar selection has a finer meaning since its aim is to study a few exemplars from common data (the most representative ones). The objective of this paper is to propose a methodology able to extract these representative exemplars from a dataset. The proposed method has been tested against well-known simulated as well as real dataset. It is then experimented on dataset extracted from experimentations of connected vehicle traces.

Vehicular Ad-hoc networks (VANETs) are a specific class of Mobile Ad-hoc Networks made by vehicles communicating among themselves in roads in urban and rural environments. The well-known unicast routing protocols implemented for MANETs (Mobile Area Networks) are not suitable for VANETs due to high mobility. Routing over VANET is a challenging task due to highly dynamic network topology. In order to avoid a frequent communication link failure and reduce the communication overhead among mobile nodes, we implemented a new routing protocol based on measuring with accuracy road densities in a distributed manner. Each computed route is a list of roads (between two successive anchors). The aim is to built the route having the highest density composed by the density of each component road. In this paper we present a distributed algorithm which measures the density in a road by exchanging CDP (Control Data Packets) between a group of vehicles on a road. Each group is represented by a leader which is in charge of measuring the density periodically and send it to the next group leader. The last group leader will have the actual density at each period. This protocol has been developed over the simulator OMNET++. We have conducted extensive simulations with different scenarios to evaluate the scalability of the approach and the robustness against frequent topology changes. The evaluation stated that our proposal has higher performance measures than the existing routing protocols as EGyTAR. We have evaluated packet delivery ratio, end-to-end delay and overhead.

"Connected vehicles" is a very hot challenge since many years. Usual communications could be ensured through wireless local area networks (over ITS-G5 for example) or through cellular networks (over 3G, LTE, etc.). ITS-G5 is not enough deployed. Then, the need to have efficient solutions using cellular networks is required. Indeed, we propose in this paper a solution to trigger automatically some events after collecting messages from mobile nodes. The triggered events are those related to traffic congestion which could be combined with a notification about alternative routes. Our contribution consists of a deployment of an application over smartphones embedded in vehicles which are connected to a server (through cellular networks) which takes care of management of vehicle location as well as traffic congestion management. The deployment of the application during some weeks has provided a mobility model which has been used as an input to a simulator. Many simulations have been undertaken and some indicators have been measured as latency and packet loss rate.

Connected vehicles is a very hot challenge today. All main actors of the domain are spending a lot of money in order to master all issues. Radio coverage is one of the most important issue Indeed, vehicles could be connected if a minimum density is provided. In real cooperative intelligent transport systems (CITS), we use an infrastructure which connects road side units (RSU) with a central station managed by road operators. RSU are deployed in order to enhance area coverage and to disseminate messages about traffic or events on roads when road operators have information to disseminate. However, RSU are not deployed everywhere. In order to extend the coverage of these networks, we usually use cellular networks. But in some specific cases (mainly on highways), cellular networks may not cover the area, we suggest to deploy Bluetooth Low Energy (BLE) beacons to be able to cover the remaining area. In this paper, we propose a methodology which allows to cover all relevant areas which will receive events for vehicles.

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.

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 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 in a continous manner and the network topology is never stable. As a consequence, packet loss is a serious issue which has to be considered with care. Among known solutions to solve 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 metrics 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 metric has been integrated into a greedy based routing algorithm which has been developed over the simulator OMNET++ and a comparison to the eGyTAR [9] (which is an extension to GyTAR protocol [6]) is discussed 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 some performance indicators as packet delivery ratio, end-to-end delay and overhead compared to eGyTAR protocol.

Multimedia transfer in ad-hoc wireless networks is a challenging issue and attracts many researchers. In this paper, we propose a cross layer scheme to handle video transfer. Our staring point is to provide a multipath forwarding protocol able to transmit efficiently video streams and regular data from many sources to a unique base station (BS). This protocol will have a close cooperation with the application layer in order to consider with care different video frames and to assign high priority to the most important frames and lower priority for the least important ones. In the meantime, many paths could be selected, our aim is to guarantee independence between paths in terms of interference in order to be able to use more than one path in the same time. Experimental analysis has been undertaken, they show improvements of some performance indicators such as packet data rate, delay, loss packet rate and user experience feedback.

Since more than a decade, wireless sensor networks is a very attractive field in computer science and networking. Battery management is a crucial issue in the area of wireless sensor networks. The communication between a source node and a destination one may fail if both nodes are located inside a deep shadow-fading zone. Relay-selection strategy has been used in order to extend amplify-and-forward (AF) cooperative networks lifetime. The communication could not be achieved if the signal-to-noise ratio (SNR) at the destination could not reach a reasonable threshold. In the literature, various relay selection schemes have been used under the assumption that batteries are linear, but their effectiveness is not guaranteed when realistic nonlinear battery models are considered. In this paper, we review some relay selection schemes with linear battery mode that were proposed to extend network lifetime. Then, a realistic nonlinear battery model is applied with these schemes. Through numerical studies, we give a performances comparison between these techniques. The results show that the maximum energy-efficiency index MEI and the minimum outage probability MOP schemes give the best network lifetime extension.

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.

High reliability is an important characteristic of Cyber-Physical Systems (CPS). New CPS components/subsystems have to be developed for the detection, isolation, recovery and prevention of failures and external attacks. To address this challenge, we propose a multi-agent-based subsystem architecture that can detect and prevent CPS hardware components' failures. The architecture comprises of several types of agents with well-defined behaviors which cooperate to fulfil the goal of the CPS subsystem. We evaluate the performance of the proposed approach using reliability metrics for a CPS aimed at monitoring ambient and environmental parameters.

Summary Efficient energy consumption is the most important challenge in wireless sensors networks. Many solutions have been proposed since many years as efficient medium access control protocols, smart sensing applications, appropriate task scheduling, and so on. Task scheduling allows could participate to optimise energy consumption, it aims to propose planning over repetitive time periods where sensors need to sleep, to collect data and to communicate. In this paper, we propose two scheduling procedures (semi‐dynamic and dynamic) which are executed over the ZigBee network in beacon‐enabled mode. Each of these algorithms has its own features and advantages. The Zigbee super‐frame is used as a means to inform each node on its duties (when to sleep or when to communicate). In order to evaluate our proposals, we have implemented them over TelosB motes running on operating system TinyOS. These algorithms have been implemented on the Z‐Monitor tool . We have compared our scheduling approaches to the usual static scheduling method provided by Zigbee. These evaluations show that our proposals enhance network lifetime and ensure better packet data rate and lower latency. Copyright © 2017 John Wiley & Sons, Ltd.

Summary Wireless sensor networks are one the most challenging fields in computer science and networking in particular with the exposition of Internet of things. The energy management is a crucial issue on wireless sensor network since it has a real influence on then network lifetime. Since such networks are used for many sensitive applications, they need to guarantee some quality of service requirements as continuous connectivity or continuous monitoring or balanced energy consumption over all the network nodes. In this paper, we suggest an algorithm which monitors the energy consumption of all nodes (in relation with their main activity: communication). We present an activity model of the network and evaluate how the remaining energy behaves. Our main objective is to predict (after a learning step) the energy consumption of all the nodes. Then, various techniques could be used to find a cure to such troubles (wake up sleeping neighbor nodes, increasing radio ranges of some neighbor nodes, etc). Simulations have shown interesting results, and large‐scale evaluation has to be undertaken to confirm the early results. Copyright © 2017 John Wiley & Sons, Ltd.

The purpose of this special issue is to collate a selection of representative research articles that were primarily presented at the 3rd International Conference on Innovative Network Systems and Applications (iNetSApp'15), held in conjunction with Federated Conference on Computer Science and Information Systems (FedCSIS'15). The mission of the conference is to provide a highly acclaimed forum for the area of modern network systems which encompass a wide range of solutions and technologies, including wireless and wired networks, network systems, services, and applications. The forum is also considered as a valuable experience-sharing platform for scientific researchers and experts from research institutes, SMEs, and companies who work in this domain for exchanging relevant skills and experiences as well as discuss upcoming trends and new ideas from different fields of network-related research. The scope of this special issue is broad, aiming at different results in numerous active research areas oriented towards various technical, scientific, and social aspects of network systems and applications. With regard to the FedCSIS policy, 23% acceptance rate was kept within all regular paper submissions with the help of the well-structured and experienced conference program committee. For this special issue, only the papers with best review score were selected; thus, the quality of the CPE series can be preserved. The problematic of indoor positioning which currently lacks novel services based on location of users is discussed in 1 where authors focus on application of optimization algorithms on performance of hybrid indoor positioning system, which utilizes radio signals from both Global System for Mobile communication and Wi-Fi networks simultaneously. In 2, authors show that a naive brute force algorithm, enhanced by a simple heuristics, in an average case, can be faster than comprehensive solutions based on parallel implementation of an asymptotically optimal sequential algorithm when constructing the cell graph on a single instruction, multiple data-like graphics processing unit processor. Very interesting practical implementation of a novel hybrid security scheme suitable for maritime coastal environment-based wireless sensor networks is presented in 3 in line with the comparison of its performance together with the existing cryptographic schemes. The critical issue of barrier-coverage in wireless sensor networks with the proposal of four different approaches to construct reinforced barriers from a given layout of sensors is presented in 4. Special wireless sensor network for the power metering at places with shared power sources developed and implemented in a scenario of multi-store parking garage is described in 5. In 6, author introduces a novel evaluation of wireless sensor networks emissions metering using the Exposure Index as well as a method of reducing exposure by intelligent network scheduling. Still actual issue of wireless sensor network energy consumption is targeted in 7. Authors present an activity model of the network and evaluate how the remaining energy behaves to predict the energy consumption of the nodes. The ratio between the network security and energy consumption is discussed in 8. Three energy-aware security methods for hierarchically clustered wireless sensor network were presented and evaluated through simulation scenarios as a basis to establish recommendations regarding the use cases of those methods. The problematic of Machine-to-Machine communication is handled in 9 where the algorithm and protocol devised for task allocation to nodes of Machine-to-Machine architecture which consists of battery powered devices are presented. Two novel scheduling procedures for energy consumption optimization for wireless sensor networks are presented in 10. An aim is to propose planning over repetitive time periods where sensors need to sleep, to collect data and to communicate.

Greedy routing in VANETs requires some geographical informations, such as the source location and the destination location.The first one could be obtained using some localization devices like GPS receiver.However, the second one is provided by a location service.This later has a high overhead especially if it is implemented over V2V (vehicle to vehicle) communications.Many location services are well known as HLS, RLS, GLS.This paper is interested in reducing this overhead by using some Road Side Units (RSU) already deployed along the roads.We propose here a location service called "improved Reactive Location Service (iRLS)", which is an extension of the RLS service.The major difference is that RLS assumes only V2V communications and iRLS takes profit of a wireless backbone based on RSUs to catch the destination's position.This allows to reduce the overhead instead of flooding requests and also makes the communication faster since we will not have to wait to the request to reach the destination before receiving the response and then starting sending data.In our proposal, the closest RSU will reply with the actual location.In order to show the contribution of our approach, we have conducted some simulations that prove that iRLS outperforms any geographic protocol by using the V2I communications in terms of end-to-end delay which is one of the most important parameter.We considered also the ratio of packet received correctly by the destination vehicle (PDR), our protocol improves significantly this second parameter, and ensures more than 20% of packets received correctly Index Terms-VANETs; Location-based Services; Geographic Routing Protocols, .

Security is critical for wireless sensor networks (WSN)deployed in hostile environments since many types of attacks could reduce the trust on the global functioning of any WSN. Many solutions have been proposed to secure communications for WSNs and most of them rely on a centralized component which behaves as a certificate authority. We propose in this paper a distributed solution able to ensure authentication of nodes at any time without having any on-line access to a certificate authority. Each node will be equipped with a Trusted Platform Module (TPM) which is able to store keys with security. Each node will have its own public key and private key pair in the TPM and a certificate of the public key. The certificate is issued off-line when setting-up the node. When a node communicates with another, it has to sign the message with its own private key (done securely by the TPM) and sends the message, the signature and the certificate of the public key. The evaluation of the solution has been done using simulation and the overhead added by integrating authentication does not exceed 15% of energy consumption.

This paper aims to present a methodology and a set of tools that could be used in order to check the validity of an Intelligent Transport System. These tools will consider each ITS component, i.e. C-ITS- R (Road Side Units) RSU, C-ITS-V (On-Board Unit) OBUU, C-ITS-C (Central Server) with its specific fea- tures as location precision for an OBU and adequate forwarding of dangerous events for an RSU. The aim of this paper is to tackle first con- formance testing for each component (in fact the component have to respect all basic specifications) before check the interoperability of all components (in order to ensure a correct functioning of the when they work together). Basic specifications have been mainly described by standardization institutes as ETSI or IEEE. But some additional specifications could be considered for particular aims (for example, car manufacturers do all agree on the distance to inform drivers on next dangerous events). This framework has been experimented with var- ious RSUs and OBUs from different providers. We have experimented the framework with all of them and many troubles have been detected. Most of the bugs are due to a wrong interpretation of specifica- tions. Sometimes, troubles reveal that specifications have been proposed with incorrect behaviors. The main conclusion is that such frameworks have to be improved and deployed widely in order to allow the deployment of large scale Intelligent Transport Systems.

Nowadays, wireless communication technologies have high influence on our daily lives. The vehicular ad hoc networks (VANETs) is now evolving quickly and attract attention from road operators, car manufacturers and governments. We unveil a fine traffic flow optimization method with VANETs. On the macroscopic level, our model identifies road segment profiles. On the microscopic level, vehicles send and receive alerts using low-level-of-details data. This paper gives workflows for both vehicle and infrastructure sides.

Experimental deployment of Cooperative Intelligent Transportation Systems have been undertaken these last years. But a real deployment is lower than expected. One reason is the lack of complete validation techniques which handle the whole system. The aim of this paper is to present a complete framework able to test each component involved in a C-ITS and which is able to check the interoperability of all components. This framework ensures the conformance testing of all the C-ITS components regarding their specifications (mainly the communication protocols which ensure the interoperability over various layers) as well as the interoperability testing of these components in order to guarantee their correct functioning where they perform together. This framework has been used with mobile ITS stations and fixed ITS stations provided by different vendors. Many test series have been undertaken. C-ITS development is not quite mature, then many bugs have been detected thanks to the execution of test cases. The design of this framework and its use have shown that a deployment of an actual C-ITS is still a difficult task. The use of our framework has underlined that some standard specifications (either protocols or test case specifications) need to be improved.

Abstract Applications over wireless sensor networks (WSNs) are various and different. Many routing protocols have been proposed for WSNs since a decade. Medium access control protocols can differ from a network to another. The transmission range can also be variable from a sensor to another depending on their battery capacities. All these various protocols have an influence on the WSNs performance, in particular, the quality of service (QoS) they provide. It is worthy to choose the appropriate protocol for each specific situation in order to ensure a high security of the network. In this paper, we show that the type of application, the type of routing protocol, and the transmission range value have a real impact on WSN performance. Indeed, if we do not choose the right protocol in the right situation, the network could provide a low QoS in terms of lost packet rate and energy consumption. We have undertaken a set of experimentations in order to extract a road map that could be useful for any designer who intend to deploy a WSN with a high QoS degree. For the application layer, we have handled three types of applications: regular applications, applications requiring a high communication rate, and burst rate based applications. We have also considered different network sizes. For the routing layer, we have investigated the Ad hoc On‐demand Distance Vector, ad hoc on‐demand multipath distance vector routing, dynamic source routing, and Destination‐Sequenced Distance Vector protocols. Various transmission range values have been used. We have conducted many simulations through the NS‐2 simulator in order to analyze two relevant QoS indicators on WSNs: energy consumption and lost packet rate. Copyright © 2014 John Wiley & Sons, Ltd.

Abstract Over the last few years, wireless sensor networks have become a great field of interest for the scientific community. This novel kind of network provides an array of applications for different aspects of human life. To give a satisfying performance to the final user, the wireless sensor networks must ensure the quality of service. The use of multipath technique was widely applied in the literature. Nevertheless, there might be a problem if the interference issues are not taken into account by the multipath routing design. In this paper, we propose a novel multipath routing protocol calledCarrier Sense Aware Multipath Geographic Routing protocol(CSA‐MGR). This protocol creates multiple paths while avoiding any shared carrier sense range by using a distributed and dynamic process. In addition, the CSA‐MGR employs a new metrics named the Number of Common Neighbors to guarantee a faster and an efficient path construction. Simulations conducted over the NS‐2 simulator show promising results in terms of delay, Packet Delivery Ratio and routing overhead. The performance gain of CSA‐MGR in terms of delay is up to 275% compared with the Two‐Phase geographical Greedy Forwarding and up to 565% compared with the ad hoc on‐demand multipath distance vector. For the Packet Delivery Ratio, the performance gain of CSA‐MGR is up to 16% compared with the Two‐Phase geographic Greedy Forwarding and up to 28% compared with the ad hoc on‐demand multipath distance vector. Copyright © 2015 John Wiley & Sons, Ltd.

Nowadays, adopting an optimized irrigation system has become a necessity due to the lack of the world water resource.Moreover, many researchers have treated this issue to improve the irrigation system by coupling the novel technologies from the information and communication field with the agricultural practices.The Wireless Sensor and Actuators Networks (WSANs) present a great example of this fusion.In this paper, we present a model architecture for a drip irrigation system using the WSANs.Our model includes the soil moisture, temperature and pressure sensors to monitor the irrigation operations.Specifically, we take into account the case where a system malfunction occurs, as when the pipes burst or the emitters block.Also, we differentiate two main traffic levels for the information transmitted by the WSAN, and we use an adequate priority-based routing protocol to achieve high QoS performance.Simulations conducted over the NS-2 simulator show promising results in terms of delay and Packet Delivery Ratio (PDR), mainly for the priority traffic.

Nowadays, a recent trend has emerged in the Wireless Multimedia Sensor Networks (WMSNs) field. This trend consists of ensuring the best Quality of Experience (QoE) while transferring the multimedia content, as well as keeping an acceptable Quality of Service (QoS) concerning the scalar data transmission. However, ensuring this request needs more flexible and robust protocols at different communication layers. Especially, the network layer must provide an efficient routing protocol with awareness of the interference phenomenon and the carrier sense range effect. In this paper we provide analysis of the carrier sense range effect on multimedia communication in the WMSNs. Therefore, we present a realistic solution at the routing layer to enhance the QoS/QoE while avoiding any type of multipath coupling effect. Our solution differs from the existing approaches that handle the problem at the MAC layer. Simulations conducted over the NS-2 simulator show promising results in terms of delay, Packet Delivery Ratio (PDR) and QoE.

Internet Of Things (IoT) is one of the major topics in computer science. The connection of IoT to applications over Wireless Sensor Networks (WSNs) is common in order to propose practical solutions. Simultaneously, games are known to increase interest and motivation among students when they are designed with pedagogic intent. Moreover, having fun while learning is of great interest to dyslexic children because it reduces stress and helps them focus and concentrate, which may be difficult for them because of their condition. Touching and manipulating letters may also improve their reading skills. The application this article deals with is a physical support on which children can place and move 3D letters in order to reproduce the word they are seeing. In this study, we embed in each learning component a WSN. For each WSN, we select a kind of master which is connected to the Internet. We will then handle a network of WSNs to build a backbone to investigate the thinking pattern of each child. This investigation could be monitored by a doctor from her/his office without disrupting her/his work. The main purpose of this paper is to propose a model in order to detect if dyslexic children could read more efficiently if a 3D view of words was proposed to them. But as our application gathers information that are relevant for remediation, it is also a forward useful solution to doctors who are always busy and who might check the display of children without an actual meeting.

In Wireless Sensors Network (WSN) the energy parameter is important. The traffic management needs a clever scheduling algorithm that can balance the energy consumption and the time slots also can be divided according to the traffic pattern. Every sensor node collects the environmental data and sends it to the coordinator. Using scheduling algorithm allows the communication process to be done in a collision-free mode. This work propose two scheduling algorithms called semidynamic and dynamic. They are executed over ZigBee/ IEEE 802.15.4 network. The network coordinator is programmed to organize and synchronize the network based on the proposed algorithms. They are implemented in beacon-enabled mode. The beacon frames are defined only by the network coordinator. The beacon exchanging process between the coordinator and its child routers keep all sensor nodes synchronized. Our work is to use the scheduling algorithm in organizing beacon frames as well as super frames. We have validated our work by implementing the proposed algorithms over TelosB sensors. They are implemented under TinyOS environment.

Wireless sensor networks (WSN) are one the most challenging field in computer and networking science. The energy management is a crucial issue on WSN since it has a real influence on a network lifetime. Since such networks are used for many sensitive applications, they may need to guarantee some Quality of Service requirements as continuous connectivity or continuous monitoring or balanced energy consumption over all network nodes. In this paper, we suggest a centralized approach which monitors the energy consumption of all nodes (in relation with their main activity: communication). We present an activity model of the network and evaluate how the remaining energy behaves. Our main objective is to predict (after a learning step) the energy consumption of all the nodes. Many techniques could be used to find a cure to such troubles (wake up sleeping neighbor nodes, increasing radio ranges of some neighbor nodes,. . . ).

In the recent years, Wireless Sensor Networks (WSNs) have become a great field of interest for scientific community. This kind of network provides a panoply of applications in different areas of human life. However WSNs must ensure the quality of service (QoS) to give the requested performance for the final user. Among different issues presented in the literature to provide high QoS, multipath routing is commonly used. But such a solution could be not enough efficient if the multipath routing design does not consider the phenomena of interference. Indeed the constructed paths can have an interference zone, mainly a shared carrier sense range. In this paper we show by analytical and experimental results, that using multipath routing can never overshoot the performance of single path when the interferences are not taken into account. Also, we show how the carrier sense range can influence the network performance.

This paper proposes a dynamic slot scheduling for tasks having different time constraints executed over wireless sensor networks (WSN). These tasks may have different priorities. They are usually repeated periodically. We present an algorithm which is able to provide a dynamic scheduling procedure for all tasks. In the actual version, the scheduling algorithm is executed on the network coordinator which monitor the slot distribution for all nodes. This algorithm is implemented over TelosB nodes.

Wireless multimedia sensor networks (WMSNs) is one of the hotest topic nowadays which attracts more and more researchers as being an interdisciplinary research interest. Its cost decreases continously due to advances in micro-electromechanical systems, and the proliferation and progression of wireless communications. However, the transmission of multimedia information must satisfy QoS criteria which increases energy consumption. This issue should be taken into consideration in the protocol design for WMSNs. In this paper1, we propose an implementation and an evaluation of the TPGF routing protocol (Two Phase geographical Greedy Forwarding) over the network simulator NS2. The TPGF module over NS-2 is available for the research community. In this evaluation, we compare the TPGF performances with two other protocols: the well known AODV protocol and the EA-TPGF protocol (our previous work on an extension of the TPGF protocol which takes into account the remaining energy of nodes during the process of path identification). The performance metrics measured to evaluate the QoS of each protocol are: delay, PDR, remaining energy of each node at the end of the communication and the standard deviation of remaining energy. Simulations show promising results in terms of network life extension when TPGF is used.

The design of efficient Wireless Sensor Networks (WSN) is a very hot topic nowadays. The efficiency could be observed at many levels, from the application layer to the physical part. In order to get better performances over WSN, many parameters could be considered: the application type, the routing protocol, the MAC protocol, the physical protocol, the radio range of nodes, the topology of the networks. In this paper1,2, we present a support-tool that we have developed in order to manage all these parameters in order to help designers to choose the most appropriate value for each parameter involved in the design of efficient solutions based on WSN. This tool has used a learning step where intensive simulations have been conducted. The results of this step allow the platform to suggest the most appropriate parameter for any situation chosen by the designer. The tool could be handled easily with adequate GUI. In addition, it is also able to generate NS-2 scripts in order to check the efficiency of the proposed configurations.

This paper presents Semi-Dynamic Tree Scheduling Process for Wireless Sensor Networks (WSN). We combined two type of scheduling in this study: the static scheduling for coordinator nodes and the dynamic scheduling for leaf nodes. We consider a cluster tree topology in our study with, one main coordinator (Personal Area Network Coordinator), several children coordinators (Routers) and several end devices (leafs). We implement the scheduling algorithm on the PAN Coordinator. The experimental implementation is done over TelosB sensors under TinyOS environment.

This study presents a dynamic slot assignment for tasks executed over Wireless Body Area Networks. We consider tasks which have timing constraints for their execution. and different priorities. They are usually repeated periodically. In this study we propose an algorithm which is able to provide a dynamic scheduling procedure for all tasks. In the actual version, the scheduling algorithm is executed over the network coordinator. This algorithm is implemented over TelosB nodes composing a Wireless Body Area Network.

The design of efficient Wireless Sensor Networks is a very hot topic nowadays. The efficiency could be observed at many levels, from the application layer to the physical part. In order to get better performances over WSN, many layers could be considered. Indeed, routing over Wireless Sensor Networks (WSN) has been considered in many studies. The energy consumption is one of the hottest issue in this area. Many papers have proposed solutions in order to reduce the energy consumption while handling routing. However, energy optimisation could not ensure a network lifetime extension, since the battery discharge is not linear. We propose in this paper a routing protocol which considers carefully the battery recovery in path searching. We prefer use paths composed of nodes having their batteries fully recovered and letting other nodes completing their batteries recovery to extend their time usage. The paths change continuously since some nodes need to shut down in order to have enough time to recover additional energy.

Location-based services provide (and maintain) location information used by geographic routing protocols. Routing and location service are widely related, but handled separately in usual studies about Vehicular Ad hoc Network (VANET). In this paper, we propose a hybrid approach, denoted mobility-Prediction-based Hybrid Routing and Hierarchical Location Service (PHRHLS), coupling a VANET routing protocol, the Greedy Perimeter Stateless Routing (GPSR), and the Hierarchical Location Service (HLS) extended with a mobility prediction algorithm. We show that our approach, PHRHLS, reduces the localization overhead and enhances the routing performances. Indeed, our extensive simulations show promising results in terms of end-to-end latency, packet delivery ratio and control message overhead.

TCP is known to exhibit poor performance in Over wireless networks. Various parameters may be considered to configure the network functioning with multi-hop wireless connectivity. Many routing protocols could be used over WSN. In this paper, we show that the choice of the routing protocol (and its parameters) will surely have an impact on the whole network functioning. We focus, in particular, on packet retransmission process which is an usual process used by a node when the network is disturbed (traffic jam, non connected nodes, ...) However, multi-hop end-to-end transmissions require cooperation of several layers of the communication protocol stack. At each layer different mechanisms and protocols are used, each of them are set default values. In this paper, we investigate how these layers are designed and we consider taking a look at default configurations of the layers parameters/mechanisms and comparing them to alternative possibilities. We also explore cross-layer effects between layers and how they affect the performance. We analyze the impact of usual routing protocols such as Direct Diffusion, AODV, AOMDV, DSDV and DSR on the packet retransmission used by the transport layer. These analysis are conducted through the NS-2 simulator to enhance two relevant indicators: the CWL value and the MAC retries ratio.

This paper presents a number of the significant Vehicular Communication (VC) projects based on wireless technology. We focused on the main concept behind these platforms individually as well as we classified and evaluated the projects based on the provided solutions. Important considerations for designing VC applications and systems are discussed as well. Finally, the main conclusion shows that some areas are less studied than other features.

This paper aims to propose an evaluation and a comparison of health-monitoring platforms based on wireless body area network (WBAN). We focused on the main concept behind these platforms individually as well as we classified these platforms based on the provided solutions and their main features. Important considerations in designing WBAN platforms are discussed as well. The main conclusion is that the mobility is less studied than other features then we give some perspectives about future useful platform which we intend to develop.

The field of wireless multimedia sensor networks (WMSN) is attracting more and more research community as an interdisciplinary field of interest. This type of network is low-cost, multifunctional due to advances in micro-electromechanical systems, and the proliferation and progression of wireless communications. However transmit multimedia information captured must satisfy the criteria of QoS , which increases energy consumption, fact that should be taken into consideration in the design of any routing protocols for WMSNs. In this paper we present routing protocol which we call an Energy Aware TPGF (EA-TPGF), that improves the Two Phase geographical Greedy Forwarding (TPGF). The basic idea is to take into account the residual energy of the nodes in the identification of pathways. Simulations and statistics produced by the simulator NeTtopo showing a significant contribution with regard to the extension of the life of the network.

SUMMARY In this paper, we propose a methodological approach to solve distributed nonbinary constraint satisfaction problem (CSP) on wireless sensor networks (WSNs). A distributed CSP is a CSP in which variables and constraints are distributed among multiple agents. On WSNs, it is usual to handle applications that need to solve distributed problems. Different real‐world applications can be modeled as distributed CSPs, and numerous algorithms based on enumerative search have been proposed to solve them. The most cited one is distributed backtracking algorithm in which each variable is associated to each agent. This algorithm is known as fine‐grained distributed algorithm. All the search efforts of this algorithm concerns the communication between agents that are very expensive. In addition, this approach is not realistic because, in general, an agent might control more than one variable. In this paper, we propose a generic methodology for developing coarse‐grained backtracking algorithm. Mainly, a preprocess technique breaks a single large problem into a set of smaller connected ones. These semi‐independent CSPs can be efficiently and concurrently solved and can cooperate to solve the whole problem. We illustrate the preprocess technique by the tree decomposition method for its good theoretical properties. The aim of our paper is to present an efficient approach to solve complex distributed CSPs over WSNs. Copyright © 2011 John Wiley & Sons, Ltd.

International audience

In this paper, we propose a combination between a routing protocol Greedy Perimeter Stateless Routing (GPSR) and Hierarchical Location Service (HLS) that we denote Hybrid Hierarchical Location Service (HHLS). HLS and GPSR used to be combined in the original work with a direct method, i.e. GPRS takes care of routing packets and HLS is called to get the destination position when the target node position is not known or is not fresh enough. When a destination is quite far away from the sender, the exact position of the target is calculated, and an extra overhead is generated from sender to receiver. Our main purpose is to reduce this overhead in HHLS. We suggest to proceed as follows: when a packet has to be sent to the destination, it will be sent directly to the former position of the target instead of requesting for the exact position. When the packet is approaching the former position, the exact position request is then sent. We have proposed a patch over the NS-2 simulator for HHLS according to our proposal. We have conducted experimentations which show promising results in terms of latency, packet delivery rate and overhead.

The design of an energy-efficient Medium Access Control (MAC) protocol is one of the major issues in wireless sensor networks (WSN). In this study, we present a MAC protocol adapted to a particular class of WSNs. This protocol is mainly used for nodes located in the same radio range. It could be used by WSNs dedicated to environment monitoring where each node senses a parameter periodically. In this particular case, a node executes a code during a small period and in the rest of the time it moves to a sleeping mode. Our protocol maintains a abstract ring which ensures the ordered communications and avoids collisions. The actual version of the technique is one-hop based communication. The multi-hop extension is discussed in the paper.

Applications over Wireless Sensor Networks (WSNs) are growing quickly. Various parameters may be considered to configure a network functioning but there is a lack of methodologies able to guide to choose the most appropriate parameters for any specific situation. An application can be characterized as one of the following three applications: a regular application, an application requiring a high communication rate, and a burst rate based application. In WSNs, the following routing protocols are usually used: AODV, AOMDV, DSDV and DSR. The ZigBee protocol was designed based on the assumption that infrastructure nodes have a constant power supply and low-rate wireless personal area networks. In the ZigBee Medium Access Control (MAC) layer, there exists two system parameters which provide a power-saving mechanism: macBeaconOrder (BO) and macSuperFrameOrder (SO). We are convinced that the choice of the appropriate protocol in each layer will surely have an impact on the whole network functioning. In this paper, we intend to observe the impact of these choices on the performances in the purpose of getting a useful classification. These analyses are conducted through the NS-2 simulator. We have experimented various routing protocols, BO and SO values on different kinds of applications in order to observe two relevant indicators on WSNs: energy consumption and lost packet rate.

Tracking epidemic disease is a very challenging issue nowadays. The success of such process could help medical administration to stop diseases quicker than usual. In this paper, we suggest a methodology based on wireless sensor networks deployed over volunteers who agree to carry a light wireless sensor network. Sensors over the body will monitor some health parameters (temperature, pressure,...) and will run some light classification algorithms to diagnosis first diseases on the volunteers and later on their neighbors. The classification methodologies used in this study are based on the SVM approach or on the Fuzzy C-Means one. Finally, the wireless sensor network will send aggregated data about the disease to some base stations which collect the results. The main contribution is to execute an on-line disease tracking program and to detect some information about how the disease is propagated.

Applications over Wireless Sensor Networks (WSNs) are growing quickly. Their MAC protocols was designed based on the assumption that infrastructure nodes have a constant power supply and low-rate wireless personal area networks. Various parameters may be considered to configure the network functioning and with multi-hop wireless connectivity, routing protocols must be dynamic and efficient. We are convinced that the choice of the routing protocol will surely have an impact on the whole network functioning. In these networks, the transmission range can impact on these routing protocols and decrease system performances. In addition, we can have over these networks one of the following type of applications: a regular application, an application requiring a high rate, and a burst rate based application. In this paper, we analyze the impact of transmission range in MAC protocols and usual routing protocols such as AODV, AOMDV, DSDV and DSR with various kinds of applications and various network sizes. These analyses are conducted through the NS-2 simulator to analyze two relevant indicators on WSNs: energy consumption and lost packet rate.

VANETs (Vehicular Ad-hoc NETworks) are a special case of MANETs (Mobile Ad-hoc NETworks). Their main feature is the high mobility range of nodes, which causes topology changes and frequent disconnections. Topology-based routing protocols have weak performances in such networks. This is why a new set of routing protocols, designated as geographic routing protocols, were designed to enhance performances and ensure a better scalability. These geographic protocols assume on one hand that all nodes must be aware about their position (by using a positioning system like GPS). On the other hand they also assume a certain knowledge about the position of the destination node and the position of their neighbors thanks to Location-based Services. In this paper, we compare three location-based services: Reactive Location Service (RLS), Grid Location Service (GLS) and Hierarchical Location Service (HLS) while coupled to the well known geographic routing protocol Greedy Perimeter Stateless Routing (GPSR). As far as we know, our work is the first that targets the performance evaluation of location-based services while coupled with a routing protocol. The simulations were performed using the NS-2 simulator on a realistic map about the city of Reims (France). Besides, a scalability study of GLS and HLS is presented. This study is based on three qualitative metrics (the location maintenance cost, the location query cost and the storage cost).

In modern vehicles, there are a lot of devices (GPS receiver, Tachograph, etc.) with different functions. The communication between these peripherals is rarely ensured. In fact, they have to exchange useful information about the vehicle status. Many protocols and standards are used to connect embedded devices. Then, the compatibility between them is not always guaranteed. We propose in this paper a new design of a smart channel. This channel allows the communication and interoperability between heterogeneous embedded systems. The smart channel builds services which can be customized by the end-user. Furthermore, simulation results are provided to illustrate this claim and to assess the performance of the proposed model.

In wireless sensor networks, one of the most important challenge is power saving, then various contributions are suggested since a decade. In this paper, we propose a distributed and an adaptive gossiping technique able to guarantee communications over all sensors and to save a high amount of energy. The aim is to allow to the network to achieve a self organizing procedure in order to provide an efficient scheduling approach for communications over all sensors. Each sensor will have a particular slot for listening and another one for sending. The slot assignment is achieved in a distributed manner and is continuously reconfigurable during all the time. That means when a sensor leaves the network, its assigned slot will be recovered. When a new one wants to join the network, a slot will be assigned to it on-line. Our main contribution, is to show how our approach will ensure the reconfiguration of the network.

This paper presents an algorithm able to generate test sequences for real-time and embedded systems. This algorithm is divided into 3 steps. The first step is less complex than the second one which has lower complexity than the third. The first step is able to generate test sequences for some states in the system. The second step generates test sequences for some of the remaining states. The last step derives test sequences for the states which have not been covered by the two first steps. Then, we analyse a large number of experiments based on this algorithm with different automata, and we deduce that in most of the cases the first step generates test sequences for almost 85 % of all states while the second derives approximatively 10 % and finally the third one derives for 5 % of the states. That proves the efficiency of our methodology since we have no mean to prove formally these results.

Nodes in VANETs move at high speed. This high mobility makes most conventional routing protocols incompatible with this type of network. A new class of geographic routings has emerged. Most of these routing protocols suppose that the nodes position is known in advance and that the nodes do not have time to move significantly between sending packets and receiving their acknowledgments. This assumption is not always realistic because of the high nodes movement and the low wireless transmissions range. Consequently, packets routing may fail if this assumption is not guaranteed. In this paper, we propose a prediction mechanism, which will estimate the expected new vehicle position to reduce the packet loss.

Power saving is a very critical issue in energy-constrained wireless sensor networks. Many schemes can be found in the literature, which have significant contributions in energy conservation. The aim of this study is to propose a distributed technique able to guarantee communications over all sensors and reducing in a considerable rate the energy consumed. The originality of the solution is the use fundamental principles inherited from distributed computing (leader election, consensus, abstract ring structure). The aim is to allow to the network to achieve a self organizing procedure which assigns a slot time to each sensor. Indeed, each sensor will have a particular slot for listening and another one for sending. The slot assignment is done in distributed manner and can adapted dynamically.

The aim of this study is to perform a simulation of large scale Wireless Sensor Networks (WSN) working on medical diagnosis. The main feature of this WSN is its density and the fact that all sensors are in the same radio range. Our approach helps medical staff to diagnose diseases in an automatic way. In this context, each patient is equipped to a set of sensors. Each sensor is connected to a transducer dedicated to measure a specific health parameter. This WSN will perform some computations and run an alarm when some diseases are suspected. This technique is based on the population protocol to handle data exchanged between sensors. This approach is in fact an efficient distributed algorithm which implies that the diagnose may be done by any sensor dealing with the disease detection. The main result of this paper is the approach supports large scalability which proves its practicability for real cases.

The aim of this study is to suggest an automated technique for distributed decision. It is based on population protocol deployed on a Wireless Sensor Networks (WSN). This approach could be used by any medical staff to detect earlier than usual some diseases on patients. Moreover, It could be easily adapted to many other fields (fire monitoring, environment supervising, ...) In this context, a patient is equipped with health parameter transducers which are connected to a WSN. This WSN will perform some computations and will raise an alarm when some diseases are suspected. The algorithm is distributed, i.e., the decision may be done by any mote dealing with the disease detection. The experimentations show promising results.

The aim of this study is to suggest two automated techniques able to help medical staff to detect earlier than usual some diseases using wireless sensor networks (WSNs). In this context, a patient is equipped with physical sensors which sense health parameters. This WSN will perform some computations and will run an alarm when a disease is suspected. The first technique uses a population protocol to handle data exchanged between motes and provides an efficient algorithm to suggest that a disease is diagnosed on a patient. The algorithm is distributed, i.e., the decision may be done by any sensor dealing with the disease detection. The second technique uses a token algorithm where, some motes are denoted as masters. Each of them is in charge of deciding if a specific disease occurs. This technique is not totally distributed but enhances the network efficiency regarding to the energy consumption, the time execution and the number of exchanged messages.

Abstract This paper studies how to detect anomalies in a distributed manner by using wireless sensor networks (WSNs). We focus on a medical context, where the existing works generally provide large environments to monitor patients using sensors as simple transducers. Those devices forward sensed health parameters to a main base station. This station collects received data and may perform some computations. In this paper, we perform some distributed tasks on the sensors. We propose a distributed algorithm, which allows to raise alarms under some initial rules to alert efficiently medical staff in case of critical situations without needless warnings. Each mote monitors a parameter. When this parameter reaches an abnormal value, the mote communicates with other motes in order to check if it is a ‘local’ anomaly or if the patient is in an abnormal situation. In such cases an alarm is raised. We implemented our algorithm over a network of micaZ sensors running under TinyOS. The obtained results show promising perspectives. Copyright © 2010 John Wiley & Sons, Ltd.

We present a study on the optimasation of the number of messages for medical diagnosis over wireless sensors networks (WSNs). We suggest distributed algorithms to diagnosis some diseases while monitoring a patient. Then, we compare the number of messages needed to make a decision between the algorithms. In our approach, each sensor will make some computations in order to participate to the decision. Indeed, some computation and collaboration tasks are performed over the sensors and the final diagnosis is performed in a distributed way. During the experimentation of our algorithms, we used a real data flow extracted from hospital monitoring.

This paper presents a study on power management optimisation over a sensor network. We have proposed a set of management rules which are executed by each sensor of the network. These rules adapt themselves to sensors depending on their energy status and on the network energy. Periodically, each sensor computes its rules and decides how to behave (sleeping during a long period or not). An experimentation of these rules has been implemented, we used a distributed sort algorithm on the whole network. We have observed the network behaviour and noticed that the use of these rules allows to increase the average energy life up to 20 %.

In this paper we study how to detect anomalies in a distributed manner by using wireless sensor networks (WSNs). We focus on a medical context, where existing works generally provide large environments to monitor patients using sensors as simple transducers. Those devices forward sensed health parameters to a main base station. This station collects received data and may perform some computations. In this paper, we perform some distributed tasks on the sensors. We propose a distributed algorithm which allows to raise alarms under some initial rules to alert efficiently medical staff in case of critical situations without needless warnings.

Web applications can be composed of heterogeneous selfcontained web services. Such applications are usually modified to fix errors or to enhance their functionality. After modifications, regression testing is essential to ensure that modifications do not lead to adverse effects. In this paper, we present a safe regression testing algorithm that selects an adequate number of non-redundant test sequences aiming to find modification-related errors. In our technique, a web application and the behavior of its composed components are specified by a two-level abstract model represented as a Timed Labeled Transition System. Our algorithm selects every test sequence that corresponds to a different behavior in the modified system. We discuss three situations for applying this algorithm: (1) connecting to a newly established web service that fulfills a composed web service, (2) adding or removing an operation in any of the composed web services, (3) modifying the specification of the web application. Moreover, modifications handled by the algorithm are classified into three classes: (a) adding an operation, (b) deleting an operation, (c) fixing a condition or an action. Key-words : label transition systems, testing, verification, web service, web application.

Complex systems need to be validated before industrial development. The last step in the validation process is testing. This part has to be considered with care in order to avoid troubles. This step takes a long time and requires a lot of resources. In this paper, a complex system is described a timed labeled transition system (TLTS). In such description, we focus on the specification of the event ordering respecting time constraints. Since the TLTS may be very large (million of states for industrial systems), we present a solution to reduce the test derivation complexity. We aim to decompose the derivation process among some hosts participating to the generation algorithm. Each host deals with a part of the system independently; each host derives test sequences for some fixed states for the system. Some computations are redundant. In order to reduce them, on each host we use the Bloom filters concept used to manage a local cache containing computed sequences. Then, we show how to compute the results given by all hosts in order give a set of test sequences for the whole system. We suggest an implementation of this technique on the JXTA environment deployed on some hosts. We analyze a large number of experiments on different TLTS. Finally, we have shown that the use of Bloom filters make increases the test derivation performances

Summary form only given. In this paper, we suggest a realistic methodology for testing robustness of real-time component-based systems (RTCBS). A RTCBS system is described as a collection of components where each component is specified by a nominal and a degraded specification, modeled as a timed input-output automaton (TIOA). Further, the communication of the whole system is also specified by its nominal and degraded specification. We extract test sequences from the nominal specification and we inject automatically faults in order to model hostile environments. Then, we present an adequate test architecture consisting of the system under test (SUT) of components, and a distributed tester that consists of a set of coordinating testers. Each tester is dedicated to test a single SUT component. A test execution algorithm with an approach to handle testers coordination and execution delay is presented. Testing the SUT is divided into two phases. In the first phase, the tester tests the robustness of each component in isolation. If all components are robust according to the inserted hazards, in the second phase, we use the nominal and degraded specification of the whole system to check the robustness of communications between components.

This study is devoted to test quality of timed systems. In order to produce reliable systems, they need to be tested before industrial development, but system testing costs a lot of money and time. We suggest to make some preliminary analysis of the system in order to evaluate the cost before starting the tests. This test quality is evaluated by means of four factors. We detail each factor and show how to measure them in all different cases of system specification.

The aim of this paper is to present a convenient test architecture for the purpose of testing timed systems. A timed system is described as a timed automaton which is expressed as a region graph. This latter is then translated into a flattened automaton. Test sequences are derived from the flattened automaton. In order to check the conformity of a real life implementation, we detail the test architecture needed to execute the derived test sequences. This architecture considers the behaviour part as well as the timed part of the system.

No abstract available.