Efficient communication in an ad-hoc network Export

@article{citeulike:1295579, abstract = {We model the dynamics of an ad-hoc sensor network as a continuum percolation model, and prove that a simple local-flooding technique yields an efficient communication protocol in that setting.}, author = {Flaxman, Abraham and Frieze, Alan and Upfal, Eli}, citeulike-article-id = {1295579}, citeulike-linkout-0 = {http://www.sciencedirect.com/science/article/B6WH3-4BY3VT1-2/2/6bc45a9f41c5158bb9ec9afa546c09fc}, journal = {Journal of Algorithms}, keywords = {ad-hoc, algorithm, communication, dust, geometric, graph, random}, month = {July}, number = {1}, pages = {1--7}, posted-at = {2007-05-14 18:09:50}, priority = {0}, title = {Efficient communication in an ad-hoc network}, url = {http://www.sciencedirect.com/science/article/B6WH3-4BY3VT1-2/2/6bc45a9f41c5158bb9ec9afa546c09fc}, volume = {52}, year = {2004} }

TY - JOUR ID - citeulike:1295579 L3 - citeulike-article-id:1295579 N2 - We model the dynamics of an ad-hoc sensor network as a continuum percolation model, and prove that a simple local-flooding technique yields an efficient communication protocol in that setting. IS - 1 JF - Journal of Algorithms EP - 7 TI - Efficient communication in an ad-hoc network VL - 52 SP - 1 KW - ad-hoc KW - algorithm KW - communication KW - dust KW - geometric KW - graph KW - random AU - Flaxman, Abraham AU - Frieze, Alan AU - Upfal, Eli PY - 2004/07// UR - http://www.sciencedirect.com/science/article/B6WH3-4BY3VT1-2/2/6bc45a9f41c5158bb9ec9afa546c09fc ER -