BBS: An Energy Efficient Localized Routing Scheme for Query Processing in Wireless Sensor Networks

Department of Electrical & Computer Engineering, University of Waterloo, Ватерлоо, Ontario, Canada
International Journal of Distributed Sensor Networks (Impact Factor: 0.67). 01/2006; 2(1):23-54. DOI: 10.1080/15501320500330711
Source: DBLP


A wireless sensor network (WSNET) can support various types of queries. The energy resource of sensors constrains the total number of query responses, called query capacity, received by the sink. There are four problems in the existing approaches for energy-efficient query processing in WSNETs:
the fact that sensors near the sink drain their energy much faster than distant sensors has been overlooked,routing trees (RT) are rooted at the sink, and therefore, aggregative queries are less energy-efficient,data reception cost has been ignored, andflooding is used in query distribution or RT construction.

Download full-text


Available from: M. Tamer Özsu
  • Source

    Full-text · Article ·
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper investigates theoretical aspects of the uneven energy depletion phenomenon recently noticed in sink-based wireless sensor networks. We consider uni- formly distributed sensors, each sending roughly the same number of reports toward the closest sink. We assume an energy consumption model governed by the relation E = dα +c where d, (d ≤ tx), is the transmission distance, α ≥ 2 is the power attenuation, c is a technology-dependent positive constant, and tx is the maximum transmission range of sensors. Our results are multifold. First, we show that for α> 2, all sensors whose distance to the sink is min{tx, ( 2c α�2 ) 1 α } should transmit directly to the sink. Interestingly, this limit does not depend on the size of the network, expressed as the largest distance R from a sensor to the closest sink. Next, we prove that in order to minimize the total amount of energy spent on routing along a path originating at a sensor in a corona and ending at the sink, all the coronas must have the same width, equal to the above expression. This choice, however, leads to uneven energy depletion and to the creation of energy holes. We show that for α> 2 the uneven energy depletion can be prevented by judicious system design, resulting in balanced energy expenditure across the network. We describe an iterative process for determining the sizes of coronas. Their optimal sizes (and corresponding transmission radii) and the number of coronas depend on R. As expected, the width of coronas in energy-balanced sensor network increases. Finally, we show that for α =2 , the uneven energy depletion phenomenon is intrinsic to the system and no routing strategy can avoid the creation of an energy hole around the sink.
    Preview · Conference Paper · Apr 2006
  • [Show abstract] [Hide abstract]
    ABSTRACT: Energy optimization problem in wireless sensor network is related to network utilization and efficiency of information transmission and routing algorithm and it is the core issue of wireless sensor networks. Based on the coronas hierarchical model, this paper, using the Dijkstra shortest path algorithm to calculate the optimal sequence of transmission distance from the source node to the sink node, proposes a dynamic multi-path routing algorithm originated from the energy balance and the minimum energy of the network. In addition, when the nodes transmit information from outer coronas to inner, we use the q-switch algorithm, which allows each node have q types of nodes available to choose one with the maximum energy to keep the balance of the network. When the nodes from a corona run out of energy we can search the remaining distance sequence to achieve the optimal energy of the nodes through the dynamic routing method.
    No preview · Conference Paper · Jan 2012
Show more