Optimized query routing trees for wireless sensor networks

@article{Andreou2011OptimizedQR,
  title={Optimized query routing trees for wireless sensor networks},
  author={Panayiotis Andreou and Demetrios Zeinalipour-Yazti and Andreas Pamboris and Panos K. Chrysanthis and George Samaras},
  journal={Inf. Syst.},
  year={2011},
  volume={36},
  pages={267-291}
}
In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T ) that provides each sensor with a path over which query results can be transmitted to the querying node. We found that current methods deployed in predominant data acquisition systems construct T in a sub-optimal manner which leads to significant waste of energy. In particular, since T is constructed in an ad-hoc manner there is no guarantee that a… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 24 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 57 REFERENCES

Similar Papers

Loading similar papers…