By Topic

Bubble routing: A scalable algorithm with guaranteed delivery in 3D sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Su Xia ; Center for Advanced Computer Studies, University of Louisiana at Lafayette, P.O. Box 44330, Lafayette, LA 70504 ; Miao Jin ; Hongyi Wu ; Hongyu Zhou

Compared with its 2D counterpart, the scalability problem is greatly exacerbated in a 3D wireless sensor network. In this paper, we propose a scalable routing algorithm, dubbed Bubble Routing. It preprocesses global knowledge via a distributed algorithm, such that a node only needs to store a small constant information to make correct and efficient local routing decisions and achieve guaranteed delivery at the same time. More specifically, the proposed bubble routing algorithm first decompose a 3D network into a set of hollow spherical cells (HSCs). A continuous and one-to-one mapping is applied and a virtual tree structure is established inside each HSC to enable greedy routing. On the other hand, routing across HSCs is guided by a small routing table whose size is bounded by the number of interior holes. Our simulation results show that bubble routing can achieve guaranteed data delivery, low stretch factor, and well balanced traffic load.

Published in:

Sensor, Mesh and Ad Hoc Communications and Networks (SECON), 2012 9th Annual IEEE Communications Society Conference on

Date of Conference:

18-21 June 2012