Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network

N
NCA
2007
Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)
Abstract - Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Gregory J. Brault Articles by Christopher J. Augeri Articles by Barry E. Mullins Articles by Rusty O. Baldwin Articles by Christopher B. Mayer

Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)

Cambridge, Massachusetts

July 12-July 14

ISBN: 0-7695-2922-4

	ASCII Text	x
	Gregory J. Brault, Christopher J. Augeri, Barry E. Mullins, Rusty O. Baldwin, Christopher B. Mayer, "Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network," Network Computing and Applications, IEEE International Symposium on, pp. 273-282, Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007), 2007.

	BibTex	x
	@article{ 10.1109/NCA.2007.18, author = {Gregory J. Brault and Christopher J. Augeri and Barry E. Mullins and Rusty O. Baldwin and Christopher B. Mayer}, title = {Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network}, journal ={Network Computing and Applications, IEEE International Symposium on}, volume = {0}, year = {2007}, isbn = {0-7695-2922-4}, pages = {273-282}, doi = {http://doi.ieeecomputersociety.org/10.1109/NCA.2007.18}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Network Computing and Applications, IEEE International Symposium on TI - Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network SN - 0-7695-2922-4 SP273 EP282 A1 - Gregory J. Brault, A1 - Christopher J. Augeri, A1 - Barry E. Mullins, A1 - Rusty O. Baldwin, A1 - Christopher B. Mayer, PY - 2007 KW - null VL - 0 JA - Network Computing and Applications, IEEE International Symposium on ER -

Gregory J. Brault, Air Force Institute of Technology, USA

Christopher J. Augeri, Air Force Institute of Technology, USA

Barry E. Mullins, Air Force Institute of Technology, USA

Rusty O. Baldwin, Air Force Institute of Technology, USA

Christopher B. Mayer, Air Force Institute of Technology, USA

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/NCA.2007.18

A skip graph is a resilient application-layer routing structure that supports range queries of distributed k-dimensional data. By sorting deterministic keys into groups based on locally computed random membership vectors, nodes in a standard skip graph can optimize range query performance in mobile networks such as unmanned aerial vehicle swarms.

We propose a skip graph extension that inverts the key and membership vector roles and bases group membership on deterministic vectors derived from the z-ordering of k-dimensional data and sorting within groups is based on locally computed random keys.

Citation:

Gregory J. Brault, Christopher J. Augeri, Barry E. Mullins, Rusty O. Baldwin, Christopher B. Mayer, "Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network," nca, pp.273-282, Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007), 2007

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.