Add to ORKGAbstract. We present a family of self-stabilizing distributed algorithms to built a spanning tree on the underlaying communications graph of an adhoc wireless network. Next, based on this principle, we show how to construct two overlaying trees which are suitable for routing tasks
Nodes in route-restricted overlays have an im-mutable set of neighbors, explicitly specified by thei...
International audienceSensor networks are wireless adhoc networks where all the nodes cooperate for ...
ABSTRACT Modern networking applications replicate data and services widely, leadingto a need for loc...
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are p...
Abstract. We consider routing problems in ad hoc wireless networks modeled as unit graphs in which n...
International audienceWe propose the correctness proofs and the complexity analysis for the first se...
Monitoring and data collection are the two main functions in wireless sensor networks (WSNs). Collec...
We introduce a recursive (“anytime”) distributed algorithm that iteratively restructures any initial...
A wireless network is any type of computer network that uses wireless communication links for connec...
We propose very simple randomized algorithms to compute sparse overlay networks for geometric random...
We propose very simple randomized algorithms to compute sparse overlay networks for geometric random...
International audienceAchieving reliable communication of critical data on mobile ad hoc networks is...
This thesis presents a localized distributed algorithm for topology control of mobile ad hoc wireles...
Spanning Trees from theory to practiceSelf-Stabilizing algorithms and sensor networksAbstract : Sens...
Abstract — Geometric routing using source-destination loca-tions has been widely suggested as a scal...
Nodes in route-restricted overlays have an im-mutable set of neighbors, explicitly specified by thei...
International audienceSensor networks are wireless adhoc networks where all the nodes cooperate for ...
ABSTRACT Modern networking applications replicate data and services widely, leadingto a need for loc...
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are p...
Abstract. We consider routing problems in ad hoc wireless networks modeled as unit graphs in which n...
International audienceWe propose the correctness proofs and the complexity analysis for the first se...
Monitoring and data collection are the two main functions in wireless sensor networks (WSNs). Collec...
We introduce a recursive (“anytime”) distributed algorithm that iteratively restructures any initial...
A wireless network is any type of computer network that uses wireless communication links for connec...
We propose very simple randomized algorithms to compute sparse overlay networks for geometric random...
We propose very simple randomized algorithms to compute sparse overlay networks for geometric random...
International audienceAchieving reliable communication of critical data on mobile ad hoc networks is...
This thesis presents a localized distributed algorithm for topology control of mobile ad hoc wireles...
Spanning Trees from theory to practiceSelf-Stabilizing algorithms and sensor networksAbstract : Sens...
Abstract — Geometric routing using source-destination loca-tions has been widely suggested as a scal...
Nodes in route-restricted overlays have an im-mutable set of neighbors, explicitly specified by thei...
International audienceSensor networks are wireless adhoc networks where all the nodes cooperate for ...
ABSTRACT Modern networking applications replicate data and services widely, leadingto a need for loc...