• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Computing localized power-efficient data aggregation trees for sensor networks

      Thumbnail
      View / Download
      1.5 Mb
      Author
      Tan, H. O.
      Korpeoglu, I.
      Stojmenovic, I.
      Date
      2011
      Source Title
      IEEE Transactions on Parallel and Distributed Systems
      Print ISSN
      1045-9219
      Publisher
      Institute of Electrical and Electronics Engineers
      Volume
      22
      Issue
      3
      Pages
      489 - 500
      Language
      English
      Type
      Article
      Item Usage Stats
      114
      views
      116
      downloads
      Abstract
      We propose localized, self organizing, robust, and energy-efficient data aggregation tree approaches for sensor networks, which we call Localized Power-Efficient Data Aggregation Protocols (L-PEDAPs). They are based on topologies, such as LMST and RNG, that can approximate minimum spanning tree and canbeefficiently computed using only position or distance information ofone-hop neighbors. The actual routing tree is constructed over these topologies. We also consider different parent selection strategies while constructing a routing tree. We compare each topology and parent selection strategy and conclude that the best among them is the shortest path strategy over LMST structure. Our solution also involves route maintenance procedures that will beexecuted whenasensor node fails ora new node is added to the network. The proposed solution is also adapted to consider the remaining power levels ofnodes in orderto increase the network lifetime. Our simulation results show that byusing our power-aware localized approach, we can almost have the same performance of a centralized solution in terms of network lifetime, and close to 90 percent of an upper bound derived here. © 2011 IEEE.
      Keywords
      Data gathering
      Distributed algorithms
      Minimum energy control
      Sensor networks
      Wireless networks
      Permalink
      http://hdl.handle.net/11693/22000
      Published Version (Please cite this version)
      http://dx.doi.org/10.1109/TPDS.2010.68
      Collections
      • Department of Computer Engineering 1368
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      Copyright © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy