Minimum-hot-spot query trees for wireless sensor networks

Abstract

We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optimally balanced communication tree with minimum overhead. The balancing of the node degrees results in the minimization of packet collisions during query execution, that would otherwise require numerous retransmissions and reduce the lifetime of the network. We compare our simple distributed algorithm against previous work and a centralized solution and show that for most network layouts it outperforms competition and achieves tree balance very close to the centralized algorithm. It also has the smallest energy overhead possible to construct the tree, increasing the lifetime of the network even more.

A Sensor Positioning Scheme with High Accuracy in Nonuniform Wireless Sensor Networks

“…After that, all of the nodes calculate average 1-hop distance through the hop count from each anchor node to themselves. The average 1-hop distance of anchor node is estimated using (1). Here ℎ is the minimum hop count of anchor nodes and , and ( , ) and ( , ) are their coordinates.…”

“…A sink node receives sensing values from sensor nodes in sensing area and transmits them to a user. The collected information is used for diverse purposes such as observation of wildlife's habitat, military affair, fire detection, environmental monitoring, medical service, and U-City for application environment [1, 2].…”

A Novel Mobile Sink Nodes Protocol for Grid Sensor Networks

“…Simple model of radio energy consumption is utilized [19], where E tx represents the transmission distance d, the need for energy consumption to transmit certain length k, E rx represents the need for energy consumption to receive certain length k. As shown in Formula (2).…”

“…There are many researches adopting different sink node deployment strategies including fixed sink node or moving sink node methods [3][4] [5]. In a fixed sink node WSNs model, sensor nodes closer to the sink node are usually required to forward a large amount of traffic that causes the hotspot problem [2]. Therefore, the sensor nodes in hotspot area tend to run out of energy more quickly than other nodes and reduce the functional network lifetime.…”

Extending query languages for in-network query processing

“…Nevertheless, they can prove very useful when integrated with an actual system, which will use them as building blocks for more comprehensive optimization. Operator placement and query routing trees [3,6,7,8] are other fields of research for in-network optimization. Especially suited for changing environments and situations, where there is not a central node with complete view of the network, are adaptive operator placement techniques.…”