Priority-based message forwarding and query processing in opportunistic wireless sensor network

HTML
DOWNLOAD

Μέγεθος: px

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

Download "Priority-based message forwarding and query processing in opportunistic wireless sensor network"

Ξάνθος Παυλόπουλος
6 χρόνια πριν
Προβολές:

1 35 3 Vol.35 No Journal on Communications March 2014 doi: /.issn x ( ) (PBQ) PBQ TN A X(2014) Priority-based message forwarding and query processing in opportunistic wireless sensor network LAI Yong-xuan 1, LIN Zi-yu 2 (1. Department of Software Engineering, Xiamen University, Xiamen , China; 2. Department of Computer Science, Xiamen University, Xiamen , China) Abstract: A priority-based algorithm called PBQ was proposed for the query forwarding and processing in opportunistic wireless sensor network. Through the user-defined query priorities, the proposed algorithm properly selects the relay nodes and controlls the forwarding and the amount of messages. Meanwhile, the query priorities were adusted dynamically so that the query results could be forwarded back to the source node of the query quickly and the residual query request messages could be cleaned up from the network, saving lots of unnecessary transmissions and improving the overall utility of query processing. Simulating results show that PBQ could effectively improve the success rate of queries, and reduce the cost and delay of query processing in opportunistic wireless sensor network. Key words: query priority; query processing; opportunistic network; wireless sensor network 1 (opportunistic wireless sensor network) (mobile wireless sensor network) [1] [2] [3] [4] [5] [6] TAG [6] PULL/PUSH [7] ( , )(2011J05156, 2013J05099) ( ) Foundation Items: The National Natural Science Foundation of China( , ); The Natural Science Foundation of Fuian Province (2011J05156, 2013J05099); Fundamental Research Funds for the Central Universities( )

2 ) 2) 3) 4) PBQ, priority-based query forwarding and processing PBQ PBQ 2 [8~10] [11] (controlled flooding) [12] Cure-Ack PREP(prioritized epidemic) [13] ZebraNet [3] sink PROPHET [14] [15] CMTS [16~18] (centrality) BUBBLE Rap [18] (betweenness) [16] [19] DelQue [20] semi-markov

3 3 87 [21] 3 requester re (replier) re rs rs re RS h(re)=rs rs=rs 1 P(Q(t, w)) = st +(1 α) w t sw, t[st/t 1, ] w[0,t 2 sw] (1) α t w T 1 T 2 st t w sw P t w P(S(st, sw))=1 0P(Q(t, w))αt 1 +(11 α) T 2 (2) sw 1.0 st t w re rs f t w f(re,rs) (t,w) f(re,rs) (t,w) 4 1 1) 2) 3) 4) (standard query) S(re, rs, st, sw) sw st re rs S 1 S S(re, rs, st, sw) Q(re, rs, t, w) (1) 4.1 PBQ 8 2 2

4 ) A 2) 3) B 4) B 5) B 6) 7) 8) A 4 PBQ 4.2 PBQ [11] CL(contact list) CL id A 1 RE RS KQ p p Q(re, t, w) <Receiver, QP, Prior>Receiver id src U src.clqp P(Q(re, t, w))prior p Prior p.prior=p(q(re,t, w)) 3 s i s s i s id A id id s i s s s i p1 4 Ns ( i) usizes ( i) A(s i )=γ (1 ) 0.5 Nmax size( si ) (3) γ N(s i ) s i N max N max =max(n(s k ))s k SS size(s i ) s i usize(s i ) s i < id query type content> 1 3 s i 1) s i p1 p2 p2 s p2 p2 p2 Prior=MAXMAX p2 As ( ) p2 Prior=p Prior p2 A( s ) A( s ) p2 Prior>p1 QP mpp2 mp 2) s i p2 s i s i

5 3 89 3) p2 s i p1 As ( ) p1 Prior=p Prior A( si) A( s) 4) s i s PBQ 4.4 p 4.3 p p Q(re, t, w) <Receiver, QP, Prior> rsp p Prior=P(Q(re, t, w)) Receiver id CL s i s s i p3 p3 Type=RS; s p3 Receiver (4) RS p3 p4 p4 Prior= MAX, s src (5) p3 Prior QP, s src CL MAX QP P(Q(re, t, w)) p4 3 1) p4 s i src s =srcp ) s i s s src CLp4 p3 QP p4 s p3 p4 s i p3 Prior= p3 As ( ) Prior s p4 Prior= p3 Prior A( si) A( s) As ( ) A( si) A( s) 3) s 2 p4 p4 s i p5 p5 Type=RE; QueryId(p5)=QueryId(p4) (6) QueryId(p) p id 4.5 s i s p4 p p KQ id p Prior=MAXp s s i p id QueryId(p)=QueryId(p ) (7) p 4.3 PBQ

6 C# PBQ K group area gi Way-Point 1 gi 100 id TOP10 S 200 s 1.0 t w 0t~N(200, 200)w~N(1,0.5) 0.03 / id 1 2 Epidemic [11] PROPHET [14] PBQ PBQ Epidemic 72%~81%Epidemic PBQ CL KQ 2 N 50 W m90 m K 10 R/m 6 Sim_T/s min, max/m s 1 1, 5 bandwidth/packet s 1 [5,50] gi 0.6 α 0.5 γ 0.7 mp 0.1 MAX 10 BufferSize/packet 200 QueueSize/packet PBQ 5%~18% 63% PBQ Epidemic PROPHET

7 3 91 PBQ PBQ s PBQ 800~1 000 s [220 s, 300 s] 7 8 PBQ 2 PBQ 16% 6 7 PROPHET Epidemic 500 Epidemic % 8

8 92 35 RP (request percentage) RE RS RP RE RP= (8) RE RS 9 RP PBQ RP 2 6% PBQ CL (8) RS PBQ [1],,. [J]., 2009, 20(1): XIONG Y P, SUN L M, NIU J W, et al. Opportunistic networks[j]. Journal of Software, 2009, 20(1): [2] HULL B, BYCHKOVSKY V, ZHANG Y, et al. CarTel: a distributed mobile sensor computing system[a]. Proceedings of the 4th International Conference on Embedded Networked Sensor Systems[C]. ACM, Boulder, Colorado, USA [3] JUANG P, OKI H, WANG Y, et al. Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with zebranet[j]. ACM SIGOPS Operating Systems Review, 2002, 36(5): [4] OCHIAI H, ISHIZUKA H, KAWAKAMI Y, et al. A dtn-based sensor data gathering for agricultural applications[j]. Sensors Journal, IEEE, 2011, (11): [5] PENTLAND A, FLETCHER R, HASSON A. Daknet: rethinking connectivity in developing nations[j]. Computer, 2004, 37(1): [6] MADDEN S, FRANKLIN M J, HELLERSTEIN J M, et al. TAG: a tiny aggregation service for ad-hoc sensor networks[j]. ACM SIGOPS Operating Systems Review, 2002, 36(SI): [7] LIU X, HUANG Q, ZHANG Y. Combs, needles, haystacks: balancing push and pull for discovery in large scale sensor networks[a]. Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems[C]. ACM, Baltimore, MD, USA, [8] SCOTT K L, BURLEIGH S. Bundle protocol specification[eb/ol]. [9] FALL K. A delay-tolerant network architecture for challenged internets[a]. Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications[C]. ACM, Karlsruhe, Germany, [10],,. [J]., 2010, 21(10): ZHANG L, ZHOU X W, WANG J P, et al. Routing protocols for delay and disruption tolerant networks[j]. Journal of Software, 2010, 21(10): [11] VAHDAT A, BECKER D. Epidemic Routing for Partially Connected Ad Hoc Networks[R]. Duke University, [12] HARRAS A, ALMEROTH K C, BELDING-ROYER E M. Delay tolerant mobile networks (dtmns): controlled flooding in sparse mobile

Systems[C]. Waterloo, Canada, 2005.1180-1192. [13] RAMANATHAN R, HANSEN R, BASU P, et al. Prioritized epidemic routing for opportunistic networks[a].

9 3 93 networks[a]. Proceedings of the 4th TC6 International Conference on Networking Technologies, Services, and Protocols, Performance of Computer and Communication Networks, Mobile and Wireless Communication Systems[C]. Waterloo, Canada, [13] RAMANATHAN R, HANSEN R, BASU P, et al. Prioritized epidemic routing for opportunistic networks[a]. Proceedings of the 1st international MobiSys Workshop on Mobile Opportunistic Networking[C]. ACM, PR, USA, [14] LINDGREN A, DORIA A, SCHELÉN O. Probabilistic routing in intermittently connected networks[j]. Service Assurance with Partial and Intermittent Resources, [15],,. [J]., 2009,(12): NIU J W, ZHOU X, LIU Y, et al. A message transmission scheme for community based opportunistic network[j]. Journal of Computer Research and Development, 2009,(12): [16] BULUT E, SZYMANSKI B K. Exploiting friendship relations for efficient routing in mobile social networks[j]. IEEE Transactions on Parallel and Distributed Systems, 2012,23: [17] CAO G G, PORTA T L, HAN J. On exploiting transient social contact patterns for data forwarding in delay tolerant networks[j]. IEEE Transactions on Mobile Computing, 2011,12(1): [18] HUI P, CROWCROFT J, YONEKI E. Bubble rap: social-based forwarding in delay tolerant networks[a]. Proceedings of the 9th ACM International Symposium on Mobile Ad hoc Networking and Computing[C]. ACM, [19] ZHOU Y, LEVINE B N, CROFT W B. Distributed Information Retrieval for Disruption-tolerant Mobile Networks[R]. CIIR Technical Report IR-412, University of Massachusetts Amherst, [20] FAN J, CHEN J, DU Y P, et al. Delque: a socially-aware delegation query scheme in delay tolerant networks[j]. IEEE Transactions on Vehicular Technology, 2011, 60(5): [21] ZHAO Y, WU J. Socially-aware publish/subscribe system for human networks[a]. Proceedings of the Wireless Communications and Networking Conference[C]. Sydney, Australia,

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

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