A hop count based greedy face greedy routing protocol on localized geometric spanners

Du, J. (Jingzhe), E. Kranakis (Evangelos) and Nayak, A. (Amiya)

2009-12-01

Presented at the 5th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2009 (December 2009)

Additional Metadata
Keywords	Delaunay triangulation, Face routing, Gabriel graph, Localized algorithm, Minimum spanning tree, Relative neighbor graph
Persistent URL	doi.org/10.1109/MSN.2009.74
Conference	5th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2009
Organisation	School of Computer Science
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Du, J. (Jingzhe), Kranakis, E, & Nayak, A. (Amiya). (2009). A hop count based greedy face greedy routing protocol on localized geometric spanners. Presented at the 5th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2009. doi:10.1109/MSN.2009.74

Publication