Efficient communication in an ad-hoc network

Journal of Algorithms - Tập 52 - Trang 1-7 - 2004
Abraham Flaxman1, Alan Frieze1, Eli Upfal2
1Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213, USA
2Department of Computer Science, Brown University, Providence, RI 02912, USA

Tài liệu tham khảo

Cerpa, 2002, ASCENT: Adaptive selfconfiguring sensor network topologies Ganesan, 2002, Highly resilient, energy efficient multipath routing in wireless sensor networks, Mobile Comput. Commun. Rev., 1 Grimmett, 1999 Jennings, 2002, On the diameter of sensors networks Klarner, 1967, Cell growth problems, Canad. J. Math., 19, 851, 10.4153/CJM-1967-080-4 Meguerdichian, 2001, Coverage problems in wireless ad-hoc sensor networks, 1380 S. Muthukrishnan, G. Pandurangan, The bin-covering technique for thresholding random geometric graph properties, DIMACS Technical Report 2003-39, November 2003 Penrose, 1997, The longest edge of the random minimal spanning tree, Ann. Appl. Probab., 7, 340, 10.1214/aoap/1034625335 Penrose, 1996, Large deviations for discrete and continuous percolation, Adv. Appl. Probab., 28, 29, 10.2307/1427912 Penrose, 2003 Tsirigos, 2001, Multipath routing in mobile adhoc networks or how to route in the presence of topological changes