• DocumentCode
    2384557
  • Title

    Bounded-Degree Minimum-Radius Spanning Trees for Fast Data Collection in Sensor Networks

  • Author

    Ghosh, Amitabha ; Incel, Ö Zlem Durmaz ; Kumar, V. S Anil ; Krishnamachari, Bhaskar

  • Author_Institution
    Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA
  • fYear
    2010
  • fDate
    15-19 March 2010
  • Firstpage
    1
  • Lastpage
    2
  • Abstract
    We study the effect of routing topologies on maximizing the aggregated data collection rate and minimizing the maximum packet delay in TDMA-based sensor networks. We propose a bi-criteria formulation to the optimal routing tree construction problem, and show that a tree with bounded node degree and minimum radius can achieve the best trade-off between the data collection rate and packet delays.
  • Keywords
    telecommunication network routing; time division multiple access; trees (mathematics); wireless sensor networks; TDMA-based sensor networks; aggregated data collection rate; bicriteria formulation; bounded-degree minimum-radius spanning trees; fast data collection; maximum packet delay; optimal routing tree construction problem; routing topologies; Delay effects; Network topology; Routing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    INFOCOM IEEE Conference on Computer Communications Workshops , 2010
  • Conference_Location
    San Diego, CA
  • Print_ISBN
    978-1-4244-6739-6
  • Electronic_ISBN
    978-1-4244-6739-6
  • Type

    conf

  • DOI
    10.1109/INFCOMW.2010.5466684
  • Filename
    5466684
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2384557