This paper presents a time division multiple access medium access control protocol for wireless sensor / actuator networks implemented with a contention-free message scheduler. A message scheduler is used to determine which message has access to the medium at any time. A set of messages is contention-free if only one message is ready at a time. Otherwise, some other criterion such as priority must be used to resolve contention. In this case the message scheduler at each node in the network must schedule all messages in order to resolve contention. If the schedule is contention-free however, then each node only schedules the messages that interest it. The key contribution of our contention-free scheduler protocol is scalability. Large wireless sensor / actuator networks may contain hundreds of nodes exchanging thousands of messages. Due to resource constraints it is infeasible that each node schedule every message. Our protocol scales by optimizing each node to schedule only the messages it is interested in.
The main goal of Cluster-based sensor networks is to decrease system delay and reduce energy consumption. LEACH is a cluster-based protocol for microsensor networks which achieves energy-efficient, scalable routing and fair media access for sensor nodes. However, the election of a malicious or compromised sensor node as the cluster head is one the most significant breaches in cluster-based wireless sensor networks. We propose a deterministic key management scheme, called DKS-LEACH, to secure LEACH protocol against malicious attacks. Our contributions are twofold. Firstly, we design and performed a theoretical evaluation of our security model which secures the setup and study phases of LEACH protocol. Secondly, using the TOSSIM simulator, we performed an evaluation of the power consumption of DKS-LEACH. The results indicate clear advantages of our approach in preventing the election of untrustworthy cluster head as well different kind of attacks from malicious sensor nodes.
International audience
In this paper, we present a self-stabilizing asynchronous distributed clustering algorithm that builds non-overlapping k-hops clusters. Our approach does not require any initialization. It is based only on information from neighboring nodes with periodic messages exchange. Starting from an arbitrary configuration, the network converges to a stable state after a finite number of steps. Firstly, we prove that the stabilization is reached after at most n+2 transitions and requires (u+1)* log(2n+k+3) bits per node, whereΔu represents node's degree, n is the number of network nodes and k represents the maximum hops number. Secondly, using OMNet++ simulator, we performed an evaluation of our proposed algorithm.
Dans cet article, nous proposons un algorithme de structuration auto-stabilisant, distribuéet asynchrone qui construit des clusters de diamètre au plus 2k. Notre approche ne nécessite aucuneinitialisation. Elle se fonde uniquement sur l’information provenant des noeuds voisins à l’aided’échanges de messages. Partant d’une configuration quelconque, le réseau converge vers un étatstable après un nombre fini d’étapes. Nous montrons par preuve formelle que pour un réseau de nnoeuds, la stabilisation est atteinte en au plus n + 2 transitions. De plus, l’algorithme nécessite uneoccupation mémoire de (u + 1) log(2n + k + 3) bits pour chaque noeud u où u représente ledegré (nombre de voisins) de u et k la distance maximale dans les clusters. Afin de consolider lesrésultats théoriques obtenus, nous avons effectué une campagne de simulation sous OMNeT++ pourévaluer la performance de notre solution.
International audience
Dans cet article, nous menons une étude complète visant à proposer trois stratégies de routage, intégrant différents niveau d’agrégation, afin d’acheminer les données collectées dans les Réseaux de Capteurs Sans Fil (RCSF) structurés en clusters auto-stabilisants. Ces trois scénarios sont : (i) le Routage Sans Agrégation (RSA), (ii) le Routage avec Agrégation Partielle (RAP) et (iii) le Routage avec agrégation Totale (RAT). Ces derniers se fondent sur un schéma de clustering autostabilisant où est intégré un système d’agents coopératifs. Nous validons ces trois scénarios par simulation sous OMNeT++ en évaluant et comparant leurs performances en termes de délai de bout en bout, de consommation énergétique et de durée de vie du réseau. Les résultats de simulation montrent que le RSA minimise les délais de communication, le RAP réduit la consommation énergétique et le RAT prolonge la durée de vie des cluster-heads
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.