Bounds on the mixing time and partial cover of ad-hoc and sensor networks

Proceedings of the Second European Workshop on Wireless Sensor Networks, EWSN 2005

Volumn 2005, Issue , 2005, Pages 1-12

  Avin, Chen ^a   Ercal, Gunes ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTING; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; GRAPH THEORY; PROBABILITY; SENSORS;

BROADCAST NETWORK; MIXING TIME; SENSOR NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 26444543553     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EWSN.2005.1461994     Document Type: Conference Paper

References (24)

1. C. Avin and C. 'Brito, "Efficient and robust query processing in dynamic environments using random walk techniques," in Proceedings of the third international symposium on Information processing in sensor networks. ACM Press, 2004, pp. 277-286.
2. S. Shenker, S. Ratnasamy, B. Karp, R. Govindan, and D. Estrin, "Data-centric storage in sensornets," ACM SIGCOMM Computer Communication Review, vol. 33, no. 1, pp. 137-142, 2003.
3. S. Madden, M. J. Franklin, J. M. Hellerstein, and W. Hong, "Tag: a tiny aggregation service for ad-hoc sensor networks," A CM SIGOPS Operating Systems Review, vol. 36, no. SI, pp. 131-146, 2002.
4. A. Heinzelman, W.R. and Chandrakasan and H. Balakrishnan, "Energy-efficient communication protocol for wireless microsensor networks," in Proc. of the 33rd Annual Hawaii Int. Conference on System Sciences, 2000, pp. 3005-3014.
5. G. J. Pottie and W. J. Kaiser, "Wireless integrated network sensors," Communications of the ACM, vol. 43, no. 5, pp. 51-58, 2000.
6. D. Kempe, A. Dobra, und J. Gehrke, "Gossip-based computation of aggregate information," in Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003, pp. 482-491.
7. C. Gkantsidis, M. Mihail, and A. Saberi, "Random walks in peer-to-peer networks," in Proc. 23 Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2004, pp. 120-130.
8. D. J. Aldous, "On the time taken by random on finite groups to visit every state," Z. Wahrsch. Verw. Gebiete, vol. 62, no. 3, pp. 361-374, 1983.
9. P. Matthews, "Covering problems for Brownian motion on spheres." Ann. Probab., vol. 16, no. 1, pp. 189-199, 1988.
10. R. Motwani and P. Raghavan, Randomized algorithms. Cambridge University Press, 1995.
11. B. A. Clark and C, J. Colbourn, "Unit disk graphs," Discrete Mathematics, vol. 86, pp. 165-177, 1991.
12. M. D. Penrose, Random Geometric Graphs, ser. Oxford Studies in Probability. Oxford University Press, May 2003, vol. 5.
13. M. Jerrum and A. Sinclair, "The markov chain monte carlo method: an approach to approximate counting and integration," in Approximations for NP-hard Problems, Dorit Hochbaum ed. PWS Publishing, Boston, MA, 1997, pp. 482-520.
14. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Gossip and mixing times of random walks on random graphs," unpublished, 2004. http://www.stanford.edu/boyd/reports/gossip-gnr.pdf.
15. L. Lovász, "Random walks on graphs: A survey," in Combinatorics, Paul Erdös is eighty, Vol. 2 (Keszthely, 1993), ser. Bolyai Soc. Math. Stud. Budapest: János Bolyai Math. Soc., 1996, vol. 2, pp. 353-397.
16. A. Sinclair, "Improved bounds for mixing rates of markov chains and multicommodity flow," Combinatorics, Probability and Computing, vol. 1, pp. 351-370, 1992.
17. A. Sinclair and M. Jerrum, "Approximate counting, uniform generation and rapidly mixing markov chains," Inf. Comput., vol. 82, no. 1, pp. 93-133, 1989.
18. P. Winkler and D. Zuckerman, "Multiple cover time," Random Structures and Algorithms, vol. 9, no. 4, pp. 403-411, 1996. [Online], Available; citeseer.ist.psu.edu/139.html
19. C. Avin and G. Ercal, "On the cover time of random geometric graphs," UCLA, Tech. Rep. 040050, November 2004, ftp://ftp.cs.ucla.edu/ tech-report/2004-reports/040050.pdf.
20. P. Gupta and P. R. Kumar, "Critical power for asymptotic connectivity in wireless networks," In Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W. H. Fleming, W. M. McEneaney, G. Yin, and Q. Zhang, Eds, pp. 547-566, 1998.
21. P.-J. Wan and C.-W. Yi, "Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks," in Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing. ACM Press, 2004, pp. 1-8.
22. A. Broder and A. Karlin, "Bounds on the cover time," J. Theoret. Probab., vol. 2, pp. 101-120, 1989.
23. D. Aldous and J. Fill, Reversible Markov Chains and Random Walks on Graphs, unpublished. http://stst-www.berkeley.edu/users/aldous/RWG/book.html.
24. A. K. Chandra, P. Raghavan, W. L. Ruzzo, and R. Smolensky, "The electrical resistance of a graph captures its commute and cover times," in Proc. of the twenty-first annual ACM symposium on Theory of computing. ACM Press, 1989, pp. 574-586.