Void traversal for efficient non-planar geometric routing

Authors: Thomas Clouser, Adnan Vora, Timothy Fox, Mikhail Nesterenko

Abstract: 
Geometric routing provides a scalable and efficient way to route messages in ad hoc networks if extensive routing information is unavailable. Such algorithms require a planar graph to guarantee message delivery. The routing techniques for such guarantee usually center around the traversal of planar faces of the graph. However, in realistic wireless networks existing planarization methods, if at all applicable, tend to require extensive local storage or result in suboptimal route selection. In this paper we study an alternative approach of translating the algorithms themselves to be able to route messages over voids in non-planar graphs. We prove sufficient memory requirements for such translations. We then translate several well-known planar geometric routing algorithms and evaluate their performance in both static and mobile networks.

Keywords:
Non-planar routing
Geometric routing
Ad hoc wireless networks

Published in: Ad Hoc Networks (Volume 11, Issue 8, January 2013)

Publisher: Elsevier

ISSN Information: 1570-8705

Void traversal for efficient non-planar geometric routing

Bình luận của bạn

*

*

*

*

 Captcha

Gửi bình luận nhập lại