An Improved TPSN Algorithm for Time Synchronization in Wireless Sensors Networks Salim EL KHEDIRI

The kernel density estimation was used to set mass functions, and the belief functions theory combined evidence to determine the sensor’s zone. Experiments on real data prove

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

In an idealized model, multi-hop wireless networks can be modeled as unit disk graphs of the plane, where two nodes are neighbors if their distance is lower than a fixed radio range

We consider here that the best tracking precision (100%) is obtained when we have one point every five meters (the target speed corresponds to a pedestrian). Figure

With these equations, the channel distribution does not directly guarantee, like in MMSN [11], that two neighboring links will have a different CHR (the offset can

We propose in this paper a novel approach of clustering in WSNs based on the FFUCA method and on a metric measure of energy consumption which provide rapidly an optimal

IFSTTAR works con- sisted in using the PPS signal to have a stable time reference across the network but also to take into account, incrementally: temperature influence, fixed-mode

During this time, the sensor listens to messages sent by neighbors (lines 2&4): When the first receiving the message (line7), then the node will be the child of node