planarity, on the graph structure of network for delivering messages to destination definitely. PHF achieves the guaranteed packet delivery over Unit Disk Graph, which is more widely employed graph model for the study of ad hoc networks. Accordingly, to eliminate the restriction of the routing algorithms enhances the probability to deliver messages successfully in networks with high nodes' mobility rate. In the simulation of PHF, we have evaluated the performance comparisons between PHF and its related work, Greedy Perimeter Stateless Routing (GPSR) and Dynamic Source Routing (DSR), which are the prominent geographic and conventional topology-based routing protocols, respectively. The results show that PHF provides higher packet delivery success rate indicating better communication stability and equal or less overhead than these work." />


The Enhancement on Communication Stability in MANETs with Unit Disk Graph Model

Makoto TAKIZAWA  Hiroto AIDA  Masato SAITO  Yoshito TOBE  Hideyuki TOKUDA  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E89-D   No.5   pp.1644-1653
Publication Date: 2006/05/01
Online ISSN: 1745-1361
DOI: 10.1093/ietisy/e89-d.5.1644
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Section on Challenges in Ad-hoc and Multi-hop Wireless Communications)
Category: 
Keyword: 
mobile ad hoc networks (MANET),  routing protocols,  simulation,  graph theory,  communication stability,  

Full Text: PDF>>
Buy this Article




Summary: 
In this paper, we present a novel forwarding scheme to enhance communication stability based on geographic routing in mobile ad hoc networks, which is called "Position-based Heuristic Forwarding" (PHF). For alternative solutions to traditional ad hoc routings, many geographic routing algorithms have been proposed. Most of the existing routings impose a certain restriction, planarity, on the graph structure of network for delivering messages to destination definitely. PHF achieves the guaranteed packet delivery over Unit Disk Graph, which is more widely employed graph model for the study of ad hoc networks. Accordingly, to eliminate the restriction of the routing algorithms enhances the probability to deliver messages successfully in networks with high nodes' mobility rate. In the simulation of PHF, we have evaluated the performance comparisons between PHF and its related work, Greedy Perimeter Stateless Routing (GPSR) and Dynamic Source Routing (DSR), which are the prominent geographic and conventional topology-based routing protocols, respectively. The results show that PHF provides higher packet delivery success rate indicating better communication stability and equal or less overhead than these work.