hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.2498/cit.1001047

Constant Time Queries for Energy Efficient Paths in Multi-hop Wireless Networks

Peter Sanders
Domagoj Matijevic
Stefan Funke

Puni tekst: engleski, pdf (653 KB) str. 119-130 preuzimanja: 168* citiraj
APA 6th Edition
Sanders, P., Matijevic, D. i Funke, S. (2008). Constant Time Queries for Energy Efficient Paths in Multi-hop Wireless Networks. Journal of computing and information technology, 16 (2), 119-130. https://doi.org/10.2498/cit.1001047
MLA 8th Edition
Sanders, Peter, et al. "Constant Time Queries for Energy Efficient Paths in Multi-hop Wireless Networks." Journal of computing and information technology, vol. 16, br. 2, 2008, str. 119-130. https://doi.org/10.2498/cit.1001047. Citirano 20.07.2019.
Chicago 17th Edition
Sanders, Peter, Domagoj Matijevic i Stefan Funke. "Constant Time Queries for Energy Efficient Paths in Multi-hop Wireless Networks." Journal of computing and information technology 16, br. 2 (2008): 119-130. https://doi.org/10.2498/cit.1001047
Harvard
Sanders, P., Matijevic, D., i Funke, S. (2008). 'Constant Time Queries for Energy Efficient Paths in Multi-hop Wireless Networks', Journal of computing and information technology, 16(2), str. 119-130. https://doi.org/10.2498/cit.1001047
Vancouver
Sanders P, Matijevic D, Funke S. Constant Time Queries for Energy Efficient Paths in Multi-hop Wireless Networks. Journal of computing and information technology [Internet]. 2008 [pristupljeno 20.07.2019.];16(2):119-130. https://doi.org/10.2498/cit.1001047
IEEE
P. Sanders, D. Matijevic i S. Funke, "Constant Time Queries for Energy Efficient Paths in Multi-hop Wireless Networks", Journal of computing and information technology, vol.16, br. 2, str. 119-130, 2008. [Online]. https://doi.org/10.2498/cit.1001047

Sažetak
We investigate algorithms for computing energy efficient
paths in ad-hoc radio networks. We demonstrate how
advanced data structures from computational geometry
can be employed to preprocess the position of radio stations
in such a way that approximately energy optimal
paths can be retrieved in constant time, i.e., independent
of the network size. We put particular emphasis on actual
implementations which demonstrate that large constant
factors hidden in the theoretical analysis are not a
big problem in practice.

Hrčak ID: 44599

URI
https://hrcak.srce.hr/44599

Posjeta: 270 *