Efficient low-delay routing algorithm for opportunistic networks based on cross-layer sensing of encountered nodes

Μέγεθος: px

Εμφάνιση ξεκινά από τη σελίδα:

Download "Efficient low-delay routing algorithm for opportunistic networks based on cross-layer sensing of encountered nodes"

Λήδα Αλεξίου
5 χρόνια πριν
Προβολές:

1 34 10 Vol.34 No Journal on Communications October 013 doi: /j.issn.0-436x ( ) eidemic ECES eidemic routing based on cross-layer encountered-node sensing MAC SV summary vector HELLO SV ECES Eidemic outing ECES 8.%.1% 11.3% TP393.4 A 0-436X(013) Efficient low-delay routing algorithm for oortunistic networks based on cross-layer sensing of encountered nodes EN Zhi, SUO Jian-wei, CHEN Hong, XU Zhong-hao, CHEN Qian-bin (Chongqing Key Laboratory of Mobile Communication Technology, Chongqing University of Posts and Telecommunications, Chongqing , China) Abstract: An efficient low-delay routing algorithin, name eidemic routing based on cross-layer encountered-node sensing (ECES) was roosed to address the issue that the eidemic-based routing algorithms have some extralatency in sensing encountered nodes and extra overhead in exchanging data ackets. ECES achieves to seed sensing encountered nodes through cross-layer design among the PHY, MAC, and network layers. Moreover, to reduce overhead and to decrease data latency, it makes a node send novel data acket immediately after encountering other nodes, sends the ackets close-by their destinations firstly after receiving summary vector(sv) ackets, adatively varies the eriod of HELLO acketsand deletes the ackets reaching their destinations from nodes memory with the hel of SVs. Theoretical analysis verifies the effectiveness of ECES. And simulation results show that ECES reduces by at least 11.3% the control overhead by at least 8.%,.1% memory overhead by more than.1%, and the average end-to-end delay by at least 11.3%. Key words: oortunistic network; routing algorithm; encountered node; sensing; cross-layer design 1 (oortunistic network) [1~4] ad hoc MANET, mobile ( ) (cstc01jja40051) (011-4) (0101) Foundation Items: The National Natural Science Foundation of China( ); The Natural Science Foundation of Chongqing (cstc01jja40051); The Secial Fund of Chongqing Key Laboratory(011-4); The Oen Project of Emergency Communication Laboratory of Chongqing(0101)

2 34 ad-hoc network eidemic SCF, store-carry-forward eidemic [15] [5~13] MAC 5 [14] C ij + C 3 TTL ij i ( T s ) ij TTL ij C1C C3 HELLO HELLO [13] HELLO eidemic m 300 m50 10 m/s 10 m5 m50 m75 m m 1.6 s 85% 3 eidemic eidemic EMES [14] [9~13] VAHAT eidemic eidemic routing(e) E SCF SV(summary vector)/ internet MANET encasulation rotocol(imep) [16] [10] MATSUA -HOP [17] eidemic (, q)-eidemic routing IMEP TOWE [11] eidemic E- HELLO HELLO WANG [1] E AE(adative randomized eidemic routing) W ij C 1 i ( T s )+ [9] G ( V, E) V { v 1, v,, v n } n >1 v n n E Ø { e 1, e,, e m } 1 m n( n- 1) e m m { e i,( t si, t ei )} 1 in ( n- 1) t si t ei > t ei? { e i,( t si, t ei )} t e t si < t e( i+1) 3 SV SV SV(summary vector) SV SV 3. 1 t si t s

3 10 3 eidemic HELLO HELLO HELLO 4 1 ECES 4 ECESeidemic routing based on cross-layer encountered-node sensing ECES CSMA/CA MAC MAC MAC MAC SV 4.1. { HELLO } SV SV equest SV SV HELLO HELLO T HELLO

4 4 34 HELLO ECES MAC HELLO HELLO SV SV { n } 4. ECES 6 1) HELLO ) 3) { n HELLO T } HELLO 4) SV MAC HELLO 5) SV { n } equest { n } 6) equest 4.3 v A B x x F( x) P( X x ) x B A a? [0, ]? [0, ] 1, 0? f (?) (6) 0, 56B A S (?) x (1) f ( x) x f ( x) F ( x) () x E[ x] xdx 0 (3) 3 a + b abcos( q ) c (4) BB' ( q ) (?) cos? cos(?) (5)

5 S (?) f (?) (?)d? cos? 7 + cos(?) d? + d? cos(?)d? 3 0 T t t t t A B HELLO t 1 0t >0 3 3 HELLO 3 E-HELLO (7) W (? ) 7 + cos(?) W (0) W (0) W (?) W (0) + q +? + 1!! n W (0) 3 W (0) n? + L+? + L 3! n! 4 3? +? S (?) 3?? d? E told T th 4 ( ) 405v t t T t T t + t + T T (8) (9) (10) ECES 1 ECES E-HELLO A B HELLO (11) 111 t t t T E E 4.4. S N r v T 3 ECES 1 N - 1 N - 1- d tn ew t S N ) t T N 3) E t t t T t 3 t t 4 + t + T T 3 4 tnew (1) N- 1 5 E E-HELLO to ld πr N S (13) 1 (14) d ( N 1 ) S N (15) t ( N 1 ) S N v (16) C t C o S N πr N v S (( ) ) (17) Cs Cc C s o( TN ) (18) C c o( N ) (19)

6 34 AE 4 5.1 1) P P ) T i C C P ( P + P ) (0) C C i 1 (1) i 3) () K i i N 4) (3) d iscovery all discovery t C all T Ti K K N i i V T t C discovery 5) rate S (4) S 5.

6 6 34 AE ) P P ) T i C C P ( P + P ) (0) C C i 1 (1) i 3) () K i i N 4) (3) d iscovery all discovery t C all T Ti K K N i i V T t C discovery 5) rate S (4) S 5. OPNET [9] random wayoint 1 1 /m /(ms - 1 ) 1~19 /(Mbit s - 1 ) /s 1 /m 10,5,50,75, /s 1.3, 3.07, 6.15, 9., 1.3 /s ECES AE E-HELLOE-IMEP ) 4 ECES E-IMEP E-HELLOAE ECES HELLO HELLO HELLO 4 ) 5 AE ECES 11.3% ( m

7 10 7 ( )/ )~54%( 5 m: ( )/ ) (a) ECES (b) (c) 7 5 3) 6 ECES 3 ECES SV AE 5) HELLO 8 ECES HELLO 3 HELLO HELLO 13.6%( 10 m)~44.3%( m) 8 HELLO 6 6) ECES 3 5 % 4) HELLO 7 ECES %( 10 m: ( )/ ECES /m /% E-IMEP E-HELLO AE ECES

8 34 6 eidemic ECES ECES E eidemic ECES [1] STAVOULAKI V, TSAGKAIS K, LOGOTHETIS M, et al. Oortunistic networks[j]. IEEE Vehicular Technology Magazine, 011, 6(3):5-59. [],,. [J]., 009, 0(1): 14-137.

8 eidemic ECES ECES E eidemic ECES [1] STAVOULAKI V, TSAGKAIS K, LOGOTHETIS M, et al. Oortunistic networks[j]. IEEE Vehicular Technology Magazine, 011, 6(3):5-59. [],,. [J]., 009, 0(1): XIONG Y P, SUN L M, NIU J W, et al. Oortunistic networks[j]. Journal of Software, 009, 0(1): [3],,. ON-CP: [J]., 010, 31(5): YE H, CHEN Z G, ZHAO M. ON-CP: cache relacement olicy for oortunistic networks[j]. Journa1 on Communications, 010, 31(5): [4],,. [J]. ( ), 01, 3(4): LIU Q S, ZHOU J E, ZHANG P N. Adative cache management method for oortunistic network based on number of message coies[j]. Journal of Chongqing University of Posts and Telecommu ications (Natural Science Edition), 01, 3(4): [5] BUGESS J, GALLAGHE B, JENSEN, et al. Maxro: routing for vehicle-based disrution-tolerant networks[a]. The 5th IEEE International Conference on Comuter Communications[C]. ashington C, USA, [6] BUNS B, BOCK O, LEVINE B N. Mv routing and caacity building in disrution tolerant networks[a]. The 4th Annual Joint Conference of Conference of the IEEE Comuter and Communicat ns Societies[C]. Miami, USA, [7] JATHA, GUPTA A. Probabilistic routing using contact sequencing in delay tolerant networks[a]. 010 the Second International Conference on Communication Systems and Networks[C]. Bangalore, India, [8] KO H, OH S, KIM C. Adative, asynchronous rendezvous rotocol for oortunistic networks[j]. Journal of Electronic Letters, 01, 48(8): [9] VAHAT A, BECKE. Eidemic outing for Partially Connected Ad Hoc Networks[] [18] [10] MATSUAA T, TAKINE T. (, q)-eidemic routing for sarsely oulated mobile ad hoc networks[j]. IEEE Journal on Selected Areas in Communications, 008, 6(5): [11] TOWE J P, LITTLE T C. A roosed scheme for eidemic routing with active curing for oortunistic networks[a]. The nd International Conference on Advanced Information Networking and Alications Workshos[C]. Okinawa, Jaan, [1] WANG X, SHU Y T, JIN Z G, et al. Adative randomized eidemic routing for disrution tolerant networks[a]. The 5th International Conference on Mobile Ad Hoc and Sensor Networks[C]. Wu Yi Mountain, China, [13],,. [J]., 010, 33(9): EN Z, HUANG Y, CHEN Q B. An efficient low-delay routing algorithm for oortunistic networks based on exchange of increments in acket indexes[j]. Chinese Journal of Comuters, 010, 33(9): [14] EMES A, GEENE, HAUSE C, et al. Eidemic algorithms for relicated database maintenance[a]. The 6th Symosium on Princiles of istributed Comuting[C]. British Columbia, Canada, [15],,. [P]., , 010. EN Z, CHEN Q B, HUNAG Y. A Fast Aroach for Sensing Encountered Nodes in Oortunistic Networks Based on Cross-Layer Triggering[P]. China Invention Patent, , 010. [16] COSON M S, PAPAEMETIOU S, PAPAEMETIOU P, et al. An internet MANET encasulation rotocol (IMEP) secification[eb/ol]. htt://tools.ietf.org/html/draft-ietf-manet-ime-sec-00, 011. [17] GOSSGLAUSE M, TSE N C. Mobility increases the caacity of ad hoc wireless networks[j]. IEEE/ACM Transactions on Network g, 00, 10(4): [18],,. [J]., 011, 34(4): LIN C, TIAN Y, YAO M. Green network and green evaluation: mechanism, modeling and evaluation[j]. Chinese Journal of Comuters, 011, 34(4):

Σχετικά έγγραφα

ER-Tree (Extended R*-Tree)

ER-Tree (Extended R*-Tree) 1-9825/22/13(4)768-6 22 Journal of Software Vol13, No4 1, 1, 2, 1 1, 1 (, 2327) 2 (, 3127) E-mail xhzhou@ustceducn,,,,,,, 1, TP311 A,,,, Elias s Rivest,Cleary Arya Mount [1] O(2 d ) Arya Mount [1] Friedman,Bentley