OMSI-Tree: Power-Awareness Query Processing over Sensor Networks by Removing Overlapping Regions

Zha, Wei; Eo, Sang Hun; You, Byeong-Seob; Lee, Dong‐Wook; Bae, Hae-Young

doi:10.1007/978-3-540-72909-9_21

Cited by 2 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…SPIX [4] are quite similar with OMSI-tree [3] in spatial index building up phase. They both adopt two phases spatial index building up phase.…”

Section: Introductionmentioning

confidence: 85%

“…A parent node will not pick up its parent until all the children have finished selecting parent. The OMSI-tree [3] bring the capability of executing spatial query and reduce the number of involved sensor nodes when there are redundant nodes involved. OMSI-tree adopted the same path for query spreading and data transmitting.…”

Section: Introductionmentioning

confidence: 99%

“…In OMSI-tree [3], the author also adopts a R-tree like structure to index the sensor network. The sink node acts as the root of the tree and each parent keeps the children MBR information.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Energy-efficient return-path routing in wireless sensor networks

Zha

Tran

2009

TENCON 2009 - 2009 IEEE Region 10 Conference

Self Cite

View full text Add to dashboard Cite

As sensor nodes are powered by battery of limited lifespan, energy consumption has always been an important issue in sensor networks. New generation of sensor network technology bring about the possibility of constructing a spatial index over a sensor network such that sensor queries are forwarded only to the relevant nodes. Existing spatial indices share the common feature of using the same node path for propagating queries and routing back results. Hence, intermediate nodes along the path incur heavier workload than non-intermediate nodes and drain their battery more quickly. In this paper, we propose a multi-parent method to share the workload of intermediate nodes so that sensor results have alternative return paths to the sink node. As a result, the lifespan of the entire sensor network can be prolonged. We study the performance and effects of this method under three different kinds of spatial index structures. Our experiments show that the proposed approach is able to prolong the sensor network lifespan especially when the sensor network is dense. The experiments also yield various interesting information on the performance of the proposed approach under various conditions of the sensor network.

show abstract

“…SPIX [4] are quite similar with OMSI-tree [3] in spatial index building up phase. They both adopt two phases spatial index building up phase.…”

Section: Introductionmentioning

confidence: 85%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Energy-efficient return-path routing in wireless sensor networks

Zha

Tran

2009

TENCON 2009 - 2009 IEEE Region 10 Conference

Self Cite

View full text Add to dashboard Cite

show abstract

“…As discussed above, we have noted that almost all the spatial indices adopt a hierarchical structure to keep nodes in a parent-child relationship. The most frequently used are R-tree [14,52,63,37,47] and Quad-tree [39,46]…”

Section: Resultsmentioning

confidence: 99%

Power-aware routing in wireless sensor networks

Zha¹

Self Cite

View full text Add to dashboard Cite

Wireless sensor networks have drawn a lot of attention in recent years. Due to the advantages of flexibility and cheap cost, wireless sensor network applications have been widely used for both civil and military purposes. However, constrained by hardware, sensor nodes usually have limited energy supply. All wireless sensor network applications have to take energy issues into consideration. In this thesis, we explore energy efficiency in wireless sensor networks and focus on energy efficient routing protocols. Two kinds of routing protocols, spatial index based routing protocols and geographic based routing protocols, are studied. Spatial index based routing protocols are able to inquire a selected area without flooding the whole network. The drawbacks are the high cost of maintenance and the lack of scalability. Strategies which prolong sensor network lifespan by reducing maintenance cost is studied. Geographic based routing protocols, on the contrary, are quite scalable because the network is organized in a stateless manner. However, they are all designed for stationary networks. Releasing this assumption may fail to guarantee delivery. The deep causes of delivery failure in duty-cycling sensor networks are fundamentally investigated and formally analyzed. A general algorithm component is proposed to serve existing geographic routing algorithms to guarantee the success of packet delivery in duty-cycling sensor networks. Future work will continue studying practical implementations of geographic routing and explore some new areas, such as energy usage prediction and privacy preserving in wireless sensor networks. i My thanks also go to people in Parallel and Distributed Computing Centre, Dr.

show abstract

OMSI-Tree: Power-Awareness Query Processing over Sensor Networks by Removing Overlapping Regions

Cited by 2 publications

References 10 publications

Energy-efficient return-path routing in wireless sensor networks

Energy-efficient return-path routing in wireless sensor networks

Power-aware routing in wireless sensor networks

Contact Info

Product

Resources

About