Dealing with Non-Convexity in Geographic Routing in Smart Dust Networks
Abstract
The paper proposes a new approach to greedy geographic routing for sensor networks with non-convex covering structure.
Downloads
Download data is not yet available.
Downloads
Published
2006-12-15
How to Cite
Kłopotek, M., Ruciński, D., & Tchórzewski, J. (2006). Dealing with Non-Convexity in Geographic Routing in Smart Dust Networks. Studia Informatica. System and Information Technology, 7(1-2), 57–64. Retrieved from https://czasopisma.uph.edu.pl/studiainformatica/article/view/2850
Issue
Section
Article