OLSR-L. Evaluation of OLSR-L Network Protocol for Integrated Protocol for Communications and Positionig

Transcription

1 OLSR-L ROULA OLSR OLSR ROULA ROULA OLSR OLSR-L Evaluation of OLSR-L Network Protocol for Integrated Protocol for Communications and Positionig Kazuyoshi Soga, 1 Tomoya Takenaka, 2 Yoshiaki Terashima, 3 Hiroshi Mineno 4 and Tadanori Mizuno 2 On wireless multi hop network, the routing technology that does the localization technology and the path control that presumes theposition of the node is important technology. In a current research, localization and the routing protocol are examined, and the evaluation has been done separately. In this paper, the integrated protocol with OLSR that it is ROULA, and is the routing protocol that is the localization technology is shown. Localization by ROULA is done at the same time preparing of OLSR the routing table. The reduction in the communication overhead and the processing procedure generated if a separate protocol communicates can be achieved. It becomes possible by the fusion of ROULA and OLSR, and a detailed implementation of the integrated protocol of localization and routing is shown Data communication protocols Geographic routing LAR Collision avoidance MAC D-MAC Energy efficient sleeping GAF Positioning protocols Ranging methods TOA, TDOA, RSSI Positioning methods Trilateration, ROULA 1 Graduate School of Informatics, Shizuoka University 2 Graduate School of Science and Technology, Shizuoka University 3 Mitsubishi Electric Corporation 4 Faculty of Informatics, Shizuoka University 1 Fig. 1 Relationship between data communication and positioning protocols Location Aided Routing (LAR) 10) Information Processing Society of Japan

2 Geographical Adaptive Fidelity (GAF) 14) D-MAC 15) MAC Global Positioning System (GPS) GPS GPS ( ) ( ) Time-Of-Arrival (TOA) Time Difference of Arrival (TDOA) Received Signal Strength (RSS) ROULA 1) ( 1) 2) OLSR (ROULA) 1) Optimized Link State Routing (OLSR) 3) OLSR and Localization (OLSR-L) ROULA Fig. 2 Concept of ROULA 2.1 GPS DV-HOP 12) DV-HOP 3 GPS ROULA ROULA 1 2 ROULA 1) ROULA Multi Point Relay (MPR) Information Processing Society of Japan

3 Farthest 2 Farthest 2 TRI NORICE TRI NOTICE ROULA ROULA IETF Mobile Adhoc Networks (MANET) Working Group (WG) 13) MANET-WG OLSR AODV 7) DSR 8) TBRPF 9) 4 RFC ROULA Reactive Proactive Reactive AODV DSR Reactive Reactive Proactive OLSR TBRPF Proactive Proactive Fig. 3 S 3 MPR Using MPR nodes to decrease retransmissions OLSR 1. Send Hello packet 1. Select MPR 2. Flood TC message 1. Make routing table Discove communication pathway 1. Send Hello packet S ROULA 1. Select MPR 2. Select farthest 2-hop node 3. Send TRI_NOTICE packet 1. Make regular triangles 2. Merge regular triangles 4. Merge local position coordinates 5. Merge global position coordinates Get position coordinates 4 OLSR-L Fig. 4 Flow of OLSR-L ROULA ROULA Proactive ROULA OLSR MPR OLSR MPR 3 ROULA OLSR 3. (OLSR-L) Information Processing Society of Japan

4 1 2 MPR MPR Willingness 2 MPR MPR 2 2 OLSR ROULA OLSR-L OLSR Hello 2 MPR proactive MPR ROULA 4 ROULA Farthest2 Topology Control (TC) TC TRI NOTICE TC ROULA TC ROULA OLSR 3.1 Hello OLSR Hello 1 Hello 2 MPR MPR 5 2 (Willingness) MPR MPR MPR (MPR ) Hello Hello Hello Hello ROULA Hello ROULA Hello 2 Farthest 2 Farthest 2 OLSR MPR 2 ROULA OLSR Hello 3.2 MPR OLSR MPR Hello MPR Hello MPR MPR MPR Information Processing Society of Japan

5 Advertised Neighbor Sequence Number Reserved H[2] Advertised Neighbor Main Address G[3] F[1] 6 TC Fig. 6 Packet format of original TC message B Advertised Neighbor Sequence Number Reserved C Number of MPR selector nodes Number of farthest 2 hop nodes Sink of not sink Volume of information Advertised Neighbor Main Address S D E[2] Farthest 2 hop node Address Information of sink node (or not sink node) Communication range 5 Farthest 2 Fig. 5 Selection of farthest 2-hop node. The number surrounded in a parenthesis is the number connected to the MPR node of s node. OLSR MPR ROULA MPR 1 MPR ROULA OLSR Hello MPR OLSR MPR ROULA OLSR MPR COVERAGE ROULA 1 3 1) 1 MPR MPR COVERAGE 3.3 Farthest 2 ROULA Farthest Farthest 2 3 Farthest 2 Farthest 2 Farthest 2 Farthest 2 Farthest 2 TC TC Farthest 2 Farthest 2 R 7 TC Fig. 7 Packet format of changed TC message 5 S Farthest 2 MPR 2 2 S MPR Farthest 2 MPR 5 S S F 2 S Farthest 2 Farthest 2 OLSR MPR 2 MPR Farthest TC OLSR Hello TC Hello TC MPR TC MPR TC MPR Information Processing Society of Japan

6 D A B 8 Fig. 8 Matching of regular triangle MPR MPR MPR 6 TC 7 TC TC MPR Farthest 2 Farthest 2 TC Farthest 2 MPR Farthest 2 TC B ABC 8 Farthest 2 A 3 Farthest 2 AB AC AD A C Farthest 2 TRI NOTICE Farthest 2 C E B A,C B Farthest 2 B ABC 2 AC CA Farthest 2 Farthest 2 MPR Farthest 2 R 2 MPR R R MPR Farthest TC TC Farthest 2 TC TC ROULA OMNeT++ 5) OLSR ns-2 4) ns-allinone-2-olsr 6) ROULA 9 10 ns Information Processing Society of Japan

7 Number of messages generated by the whole network 4000 (a)lattice: OLSR-L 3500 (b)lattice: Two separate protocols 3000 Mesh: OLSR-L 2500 (d)mesh: Two separate protocols Simulation time 11 TC Fig. 9 9 (GUI) Check of regular triangle generation (GUI) using ns-2 Fig. 11 Number of TC messages generaetd by various protocols 10 (CUI) Fig. 10 Check of regular triangle generation (CUI) Farthest MPR 2 4 Farthest TC 11 TC (10 10) (10 10) 250 OLSR MRR COVERAGE MPR 1 ROULA MPR COVERAEG 3 MPR MPR COVERAGE 3 2 MPR COVERAGE 3 MPR COVERAGE 1 MPR COVERAGE A B C D A C TC B D 2 TC TC TC 11 TC 4 5. OLSR-L ns-allinone-2 4),6) MPR COVERAGE Information Processing Society of Japan

8 OLSR MPR COVERAGE OLSR-L OLSR-L OLSR ROULA ) IETF Mobile Ad-hoc Netwerks(MANET), 14) Y. Xu, J. Heidemann, and D. Estrin, Geography-informed Energy Conservation for Ad Hoc Routing, Proc. of ACM Mobicom, pp , ) Y. Ko, V. Shankarkumar, and N. H. Vaidya, Medium Access Control Protocols Using Directional Antennas in Ad Hoc Networks, Proc. of IEEE Infocom, vol. 1, pp , ) T. Takenaka, H. Mineno, Y. Tokunaga, N. Miyauchi and T.Mizuno, Performance Analysis of Optimized Link State Routing-based Localization, In journal of Information Processing Society of Japan (IPSJ), Vol.48, No.9, pp , Sep ) T. Takenaka, H. Mineno, and T. Mizuno, A Study on Integrated Protocol for Communications and Positioning, Proc. of International Workshop on Informatics (IWIN), pp.17-23, Sep ) T.Clausen, and P.jacquet, Optimized Link State Routing Protocol (OLSR), IETF RFC 3626, ) The Network Simulator - ns-2, 5) OMNeT++ Descret Event Simulation System, 6) Implementation code of OLSR, 7) C. E. Perkins, E. Belding-Royer, S. Das, Ad hoc On-Demand Distance Vector (AODV) Routing, IETF RFC 3561, Jul ) D. B. Johnson, D. A. Maltz, Y. Hu, The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR), IETF Internet-Draft draft-ietf-manet-dsr-10.txt, Jul ) R. Ogier, F. Templin, M. Lewis, Topology Dissemination Based on Reverse-Path Forwarding (TBRPF), IETF RFC 3684, Feb ) Y. Ko, N. H. Vaidya, Location-Aided Routing (LAR) in Mobile Ad Hoc Networks, Proc. of ACM/IEEE MobiCom, Oct ) B. Karp, H. T. Kung, GPSR: Greedy Perimeter Stateless Routing for Wireless Networks, Proc. of ACM/IEEE MobiCom, Aug ) D.Nicolescu, and B.Nath, Ad-Hoc Positioning Systems(APS), Proc. of IEEE Globecom, Information Processing Society of Japan