By Topic

A New Localized Geometric Routing with Guaranteed Delivery on 3-D Wireless 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
$31 $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)
Jun Duan ; Sch. of Inf., Renmin Univ. of China, Beijing, China ; Donghyun Kim ; Wenping Chen ; Deying Li

Recently, geometric routing has emerged as an efficient routing strategy on wireless networks. An ideal geometric routing is memoryless and does not suffer from the drawbacks of traditional proactive/reactive routings. All existing geometric routings on 3-D wireless networks either work deterministically only on the networks with special properties or do not guarantee delivery. In this paper, we divide the memoryless requirement into two sub-requirements, node-memoryless-ness and message-memoryless-ness. Then, we propose a new node-memoryless geometric routing, which is still free from the drawbacks of traditional routings. Our algorithm partitions the 3-D space with regular cubes and converts the routing problem over nodes into a routing problem over cubes. With minimal information attached to the header of a message, our algorithm deterministically delivers a message to its destination in any connected 3-D wireless networks. The forwarding decision on the message is made in a completely localized manner. The simulation results indicate that our algorithm outperforms its competitors on average.

Published in:

Computer Communications and Networks (ICCCN), 2012 21st International Conference on

Date of Conference:

July 30 2012-Aug. 2 2012