Shortcut Anycast Tree Routing in MANETs

被引：7

作者：

Chen, Shyr-Kuen ^{[1
]}

Wang, Pi-Chung ^{[1
]}

机构：

[1] Natl Chung Hsing Univ, Dept Comp Sci & Engn, Taichung 402, Taiwan

来源：

2012 IEEE 26TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (AINA) | 2012年

关键词：

Shortcu; MANET; Tree-based Routing; Anycast Tree; HOC WIRELESS NETWORKS; SCHEME;

D O I：

10.1109/AINA.2012.20

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In hierarchical tree-based routing for service discovery in a MANET, all routes form a tree infrastructure. Therefore, the transmitted packets from a node may go up to the tree root and down to the leaf node. The routing overhead of the tree-based routing algorithm cannot be avoided if the packet forwarding is based on parent-child relationships, even the destination node may be located near the source node. In order to improve such problem, each node should consider its neighbor nodes as next hop nodes in their routing tables. In this work, we present a shortcut anycast tree routing in MANETs. We minimize control overhead by establishing the routing tables only for certain nodes on an anycast tree. Our scheme can reduce the volume of query messages as well as the reply messages. It also reduces the transmission latency. We also improve the information accuracy of the routing tables by periodically transmitting update messages. The simulation results show that the performance of our shortcut anycast tree routing algorithm is fast and efficient for MANETs.

引用

页码：635 / 640

页数：6

共 10 条

[1]

Al-Harbawi M, 2009, INT J COMPUTER SCI N, V9

[2]

[Anonymous], 1996, Mobile Computing

[3]

Dow CR, 2002, IEICE T COMMUN, VE85B, P1561

[4]

Kim T., 2007, P ISWPC 07 FEB

[5] A distributed virtual backbone development scheme for ad-hoc wireless networks [J].

Lin, JH ;

Dow, CR ;

Hwang, SF .

WIRELESS PERSONAL COMMUNICATIONS, 2003, 27 (03) :215-233

[6] A FASTER APPROXIMATION ALGORITHM FOR THE STEINER PROBLEM IN GRAPHS [J].

MEHLHORN, K .

INFORMATION PROCESSING LETTERS, 1988, 27 (03) :125-128

[7] Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers [J].

Perkins, C.E. ;

Bhagwat, P. .

Computer Communications Review, 1994, 24 (04)

[8] Ad-hoc On-Demand Distance Vector Routing [J].

Perkins, CE ;

Royer, EM .

WMCSA '99, SECOND IEEE WORKSHOP ON MOBILE COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 1999, :90-100

[9]

Tsai C. H., 2009, IEEE AS PAC WIR COMM

[10] Shortcut detection and route repair in ad hoc networks [J].

Zapata, MG .

THIRD IEEE INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING AND COMMUNICATIONS, WORKSHOPS, 2005, :237-242

← 1 →