A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks

摘要: Abstract We study the problem of data propagation in sensor networks, comprised a large number very small and low-cost nodes, capable sensing, communicating computing. The distributed co-operation such nodes may lead to accomplishment sensing tasks, having useful applications practice. present new protocol for towards control center (“sink”) that avoids flooding by probabilistically favoring certain (“close optimal”) transmissions. Motivated (see [I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, Wireless networks: survey, Journal Computer Networks 38 (2002) 393–422], [C. Intanagonwiwat, R. Govindan, D. Estrin, Directed diffusion: scalable robust communication paradigm in: 6th ACM/IEEE Annual International Conference on Mobile Computing (MOBICOM 2000), 2000, pp. 56–67]) also as starting point rigorous analysis, we here lattice-shaped networks. however show this lattice shape emerges even randomly deployed networks sufficient density. Our work is inspired builds upon directed diffusion 56–67]. This simple implement devices, uses only local information operates under total absence co-ordination between sensors. consider network model sensors As shown geometry correct , since it always propagates sink, ideal conditions (no failures). Using stochastic processes, energy efficient . Also, when part inoperative, manages propagate close thus sense finally discuss large-scale simulation findings validating analytical results.