下載/瀏覽

Download Report

Transcript 下載/瀏覽

Implementation of Robot in
MANET applications
楊尚修
Professor:Lian-Jou Tsai
Student:Chi-hao Feng
PPT Production rate:90%
Date:2011/10/26
1
Outline


Introduction
透過網路控制機器人的視窗介面
 Mobile Ad Hoc Network
 Ad Hoc Network路由協定
 Table Driven : DSDV、OLSR
 On-Demand : DSR、AODV
 Hybrid : ZRP
 Loction-aware : LAR
 Adaptive Dynamic Backbone Multicast
 ADBM結合LAR
 模擬路由
 模擬結果與分析
 References
2
Introduction
改善了傳統直接修改原始程式的方式,改以圖
控做為人機介面,利於機器人的動作編輯及系
統後續維護。
 提出在未來機器人於MANET網路中,檔案的快
速傳輸並兼顧穩定的重要性。
 探討在Ad hoc多種路由方式並對其做出優缺比
較,最後提出使用ADBM與LAR結合的路由方
式,且加入環境判別、優先權機制,並做模擬
提出數據。

3
透過網路控制機器人的視窗介面(1/2)
WiFi
WiFi
PC
AX-12 x 15
4
透過網路控制機器人的視窗介面(2/2)
Motor Control : 角度,速度,釋放
wxPython
動作列表
動作速度
開始、停止、載入、儲存、初始化
動作訊息欄
5
Mobile Ad Hoc Network (MANET)
6
Ad Hoc Network路由協定
Routing Protocol in Ad Hoc Network
Table Driven
DSDV
OLSR
On-demand
DSR
AODV
TORA
Hybrid
ZRP
Location-aware
LAR
Multipath
M-AODV
DREAM
7
Table Driven
8
Destination Sequenced Distance Vector Routing
( DSDV )
Des
D
Next
Hops
C
Des
Next
Hops
A
C
1
B
Des
G
C
Next
E
1
Hops
1
AG
CF
11
B
C
1
1
E
C
2
F
C
2
G
C
3
A
C
Des
Next
Hops
D
C
1
E
C
F
G
Des
Next
Hops
A
D
2
B
D
2
C
D
1
E
D
G
Des
Next
Hops
G
D
2
2
E
D
1
Des
Next
Hops
C
2
F
D
1
A
D
2
C
3
B
D
2
C
D
1
B
F
Des
Next
Hop
s
D
E
1
D
F
1
A
E
3
B
E
3
C
E
2
A
F
2
B
F
3
C
F
3
9
Optimized Link State Routing ( OLSR )
F
H
C
H
E
I
F
F
I
E
Des
Next
C
Hop
s
F
Des
Next
Hops
B
F
C
1
F
E
1
I
E
1
G
E
1
G
D
1
Des
Next
Hops
C
B
1
E
B
1
D
B
1
E
C
B
1
C
F
1
D
B
1
D
D
G
1
E
A
B
1
H
F
1
B
G
D
A
C
A
G
E
B
B
D
10
On-Demand
11
Dynamic Source Routing ( DSR )
C
A-C
A
J-H-F-E
A
E
A
K
J-H-F
A-E
A
F
A-E-F-H-I
J-H
A-E-F
B
H
E-A-B
A-B
D
A-E-F-H
E-F-H-G
A-B-D
J
A-E-F-H
G
A-B-D-G
I
A-E-F-H-I
J
12
Ad Hoc On-demand Distance Vector Routing
(AODV)
B
D
N
H
A
B
1
A
C
1
N
H
A
D
2
G
D
A
D
D
N
H
A
G
3
A
H
3
I
F
C
H
J
E
D
N
H
A
D
2
A
C
1
A
E
2
D
N
H
A
F
2
D
N
H
A
I
4
A
H
3
13
Hybrid
14
Zone Routing Protocol (ZRP)
B
A
C
B
A
H
L
H
L
M
C
M
P
A
D
A
L
M
M
P
L
N
N
L
L
Q
H
M
R
P
B
D
H
H
N
F
B
A
N
Q
E
M
F
Q
C
I
N
Q
J
B
N
D
H
I
F
C
E
F
E
I
J
G
R
J
C
D
G
F
I
K
J
J
G
E
K
F
D
K
F
E
J
O
P
M
Q
O
R
R
O
N
I
M
R
P
M
O
I
F
G
15
Location-aware
16
Location Aided Routing(LAR)
17
路 由
種 類
路由
協定
優點
缺點
DSDV
隨時記錄到達每一節點的路徑
當網路變大節點變多時,routing
table所占的記憶體空間會越來越
大
OLSR
不論網路的大小,每一節點的
routing table都只記錄兩個hops
內的節點
網路的流量會集中在同一條路徑
上,容易造成網路擁塞
DSR
需要建立連結時才送出請求,
並將封包所經過的路徑加在封
包傳送
當網路變大時,所加在封包中的
路徑訊息就會增加,導致傳送資
料量變大
需要建立連結時才送出請求,
並建routing table僅記錄可到達
源節點的上一個節點
因為還是無法避免為了尋找目
的節點所需的廣播,所以當網路
變大時,對於網路流量的負擔就
會增加
Teble Driven
On demand
AODV
Hybrid
ZRP
並不需要以廣播來尋找目的節
點,routing table中僅記錄所設
定半徑範圍內的節點,網路的
大小並不影響其網路流量
Locationaware
LAR
以GPS座標的判斷限制廣播的範圍
每個節點皆去建立半徑內節點的
routing table,所以在還沒開始建
立連結就已經占據了許多頻寬
每一節點需具備取得GPS座標的設備
18
Adaptive Dynamic Backbone Multicast
(ADBM)
三個步驟維護路由表:
Neighbor node discovery
Core node selection
Core connection
19
Neighbor node discovery
Fieldc
Desc
ID
2
CoreID
1
degree
1
Hops
0
nlff
0
Update
1.5s
First HELLO packet(from 4 to 5)
1
ID
coreI
D
degre
e
hops
nlff
3
3
0
0
0
coreI
D
4
4
Desc
ID
1,3
3
2
2
degree
2
1
Hops
0
nlff
0
Update
1.4s
0sID
3
3
0 Fieldc0
nlff
Desc
0
ID
3,4
4
CoreID
5
degree
1
2
Hops
0
nlff
0
Update
1.1s
0s
Desc
ID
2,4,5
Fieldc
Desc
CoreID
3
ID
3,5
3
degree
3
CoreID
4
degree
1
2
Hops
0
nlff
0
Update
0s
1s
nlff
0
degre
hops
nlff
eUpdate
0.5s
0
hops
Fieldc
Hops
0
First HELLO packet(from
3to
4)
coreI
D
degre
e
5
3
Fieldc
CoreID
First HELLO packet(from 3to 2)
ID
0
0
4
20
Core selection Process
1
START
5
Core node
Receive
HELLO
packet
3
Calculate
weight
weight >
neighbor node
weight
Pick neighbor
node as core
node
Update
nlist
Update
nlist
FINISH
FINISH
Fieldc
Desc
ID
1,3
CoreID
32
degree
2
Hops
Degree of 3 is
bigger Desc
than 2
Fieldc
(3 becomes core
ID
2,5,4
node of
2)
2
CoreID
3
2
degree
3
3
0
Degree = 2
Hops
1
0 =3
Degree
nlff
0
nlff = 0
nlff
nlff 0= 0
Update
1ms
0s
Update
0.5ms
0s
4
21
Core Connection Process
Path #2
Field
Descriptio
n
coreId
1
hops
1
nlff
0.001
Last updt
.5 ms
Core Node 2
Paht list
Field
Path2
coreId
1
hops
2
nlff
0.001
Last updt
0.6 ms
1
2
Core Node
1
Core Node
2
2
Path1
1
1
3
1
0.001
Path #2
0.6 ms Descriptio
Field
n
coreId
1
hops
2
nlff
0.001
Last updt
.5 ms
2
1
22
ADBM
D
S
23
ADBM結合LAR
A
env_priority
env_type
value
3
5
1
30
Q
M
B
env_id
N
30
O
H
V
S
Y
R
K
C
T
L
D
E
P
I
U
W
Z
X
b
a
G
F
J
24
模擬路由
wxPython
25
模擬結果與分析
26
References
C.H. Kuo*, C.C. Chen, W.C. Wang, Y.C. Hung, E.C. Lin,K.M. Lee, Y.M. Lin, ” Remote Control Based
Hybrid-Structure Robot Design for Home Security Applications” Intelligent Robots and Systems, 2006
IEEE/RSJ International Conference on
Takashi Okuda, ”A New Metrology of Usability Test for New Communication Media Humanoid Robot
System” International Professional Communication Conference, 2006 IEEE
Noel Rappin, Robin Dunn, “wxPython in Action” Manning
Time研究室, 顧思捷, 陳錦輝, “Linux c/c++ 網路程式設計” 金禾資訊
Albert Y. Zomaya, “Algorithms and Protocols for Wireless and Mobile Ad Hoc Networks”
C. E. Perkins and E. M. Royer, “Highly Dynamic Distination-Sequenced Distance-Vector Routing
(DSDV) for Mobile Computer”, Proceeding of the 1994 ACM Special Interest Group on Data
Communication, London, UK, Sep. 1994, pp.234-244.
T. Clausen, P. Jacquet, A. Laouiti, P. Muhlethaler, A. Qayyum, and L. Viennot. Optimized, “link state
routing protocol for ad hoc networks.” In: Proceedings of the IEEE INMIC, 2001, pp. 62–68.
D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks”, Mobile
Computing, T. Imelinsky and H. Korth, eds., Kluwer Academic Publishers, 1996, pp.153-181
C. Perkins and E. Royer. “Ad hoc on-demand distance vector routing.” In Proceedings of the Second
IEEE Workshop on Mobile Computing Systems and Applications, 1999, pp. 99–100.
Z. Hass and M. Pearlman, “The Performance of Query Control Schemes for the Zone Routing
Protocol”, ACM SIGCOMM, Aug. 1998, pp. 167-177
Y. B. Ko and N.H. Vaidya, “Location-Aided Routing (LAR) in Mobile Ad Hoc Networks”, IEEE
Transactions on Parallel and Distributed Systems, Vol. 12, 2001, No. 10, pp.1023-1032
27