Dependable Wireless Sensor Networks

Because of the broadcast nature of the wireless medium, motes cannot structure the network with subnetwork pre fi xes and use address aggregation to reduce the size of routing

The D-SWC algorithm is based on the greedy algorithm proposed in [16] for solving the domatic partition problem and the distributed optimal-compression clustering protocol (DOC 2

Il présente la bonne valeur p (ne pas raconter tout de suite) à valider, notant même que cela serait dans l’intérêt de l’histoire qu’il s’apprête à raconter, mais rend

• Simulation study of IEEE 802.15.4 sensor networks: The performance of IEEE 802.15.4 sensor network is studied by IDEA1, including packet delivery rate, average latency,

In this paper a new coordinated algorithm is proposed that is able to guarantee k-coverage in the network where it is physically possible and at the same time can provide

In the last part of the thesis a method is proposed to compensate for the apparent increase in the calculated distance between the related nodes due to decrease in the voltage of

Number of packets sent (6.3) In gure 6.10, we plotted the packet delivery ratio of the dierent protocols for a network size of 500 while varying the transmission power level TX and

Our objective is to ease the development of dependable wireless sensor networks, through the extensive support for (i) distribu- ted fault injection and (ii) monitoring and