*banner
 

Fast Transmission in Ad Hoc Networks
P. Balister, B. Bollobas, M. Haenggi, M. Walters

Citation
P. Balister, B. Bollobas, M. Haenggi, M. Walters. "Fast Transmission in Ad Hoc Networks". Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on, July, 2004.

Abstract
In this paper, various fast transmission strategies for sending information from a source s over a large distance to a target t in ad hoc wireless networks where the nodes are distributed as a Poisson process of intensity is presented. The existence of an infinite component, i.e., percolation, is not sufficient for our problem since the proportion of vertices in the infinite component may be very low. To achieve connectivity the power must increase with the number of vertices, since there is some positive chance that a vertex is isolated. Result shows that with directional transmissions, even with very low power there exist points at arbitrarily large distance that can communicate.

Electronic downloads

Citation formats  
  • HTML
    P. Balister, B. Bollobas, M. Haenggi, M. Walters. <a
    href="http://chess.eecs.berkeley.edu/pubs/761.html"
    >Fast Transmission in Ad Hoc Networks</a>,
    Information Theory, 2004. ISIT 2004. Proceedings.
    International Symposium on, July, 2004.
  • Plain text
    P. Balister, B. Bollobas, M. Haenggi, M. Walters. "Fast
    Transmission in Ad Hoc Networks". Information Theory,
    2004. ISIT 2004. Proceedings. International Symposium on,
    July, 2004.
  • BibTeX
    @inproceedings{BalisterBollobasHaenggiWalters04_FastTransmissionInAdHocNetworks,
        author = {P. Balister and B. Bollobas and M. Haenggi and M.
                  Walters},
        title = {Fast Transmission in Ad Hoc Networks},
        booktitle = {Information Theory, 2004. ISIT 2004. Proceedings.
                  International Symposium on},
        month = {July},
        year = {2004},
        abstract = {In this paper, various fast transmission
                  strategies for sending information from a source s
                  over a large distance to a target t in ad hoc
                  wireless networks where the nodes are distributed
                  as a Poisson process of intensity is presented.
                  The existence of an infinite component, i.e.,
                  percolation, is not sufficient for our problem
                  since the proportion of vertices in the infinite
                  component may be very low. To achieve connectivity
                  the power must increase with the number of
                  vertices, since there is some positive chance that
                  a vertex is isolated. Result shows that with
                  directional transmissions, even with very low
                  power there exist points at arbitrarily large
                  distance that can communicate.},
        URL = {http://chess.eecs.berkeley.edu/pubs/761.html}
    }
    

Posted by Christopher Brooks on 4 Nov 2010.
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.

©2002-2018 Chess