Backpressure Meets Taxes: Faithful Data Collection in Stochastic Mobile Phone Sensing Systems
|
|
- Ferdinand Hart
- 5 years ago
- Views:
Transcription
1 Backpressure Meets Taxes: Fathful Data Collecton n Stochastc Moble Phone Sensng Systems Shusen Yang Unversty of Lverpool Emal: shusen.yang@lverpool.ac.uk Usman Adeel Imperal College London Emal: u.adeel9@mperal.ac.uk Jule McCann Imperal College London Emal: j.mccann@mperal.ac.uk Abstract The use of sensor-enabled smart phones s consdered to be a promsng soluton to large-scale urban data collecton. In current approaches to moble phone sensng systems (MPSS), phones drectly transmt ther sensor readngs through cellular rados to the server. However, ths smple soluton suffers from not only sgnfcant costs n terms of energy and moble data usage, but also produces heavy traffc loads on bandwdth-lmted cellular networks. To address ths ssue, ths paper nvestgates cost-effectve data collecton solutons for MPSS usng hybrd cellular and opportunstc short-range communcatons. We frst develop an adaptve and dstrbute algorthm OptMPSS to maxmze phone user fnancal rewards accountng for ther costs across the MPSS. To ncentvze phone users to partcpate, whle not subvertng the behavor of OptMPSS, we then propose BMT, the frst algorthm that merges stochastc Lyapunov optmzaton wth mechansm desgn theory. We show that our proven ncentve compatble approaches acheve an asymptotcally optmal gross proft for all phone users. Experments wth Androd phones and trace-drven smulatons verfy our theoretcal analyss and demonstrate that our approach manages to mprove the system performance sgnfcantly (around 1%) whle confrmng that our system acheves ncentve compatblty, ndvdual ratonalty, and server proftablty. I. INTRODUCTION Ubqutous sensor-rch smartphones are begnnng to play an ncreasngly mportant role n the evoluton of the urban Internet of Thngs (IoTs), whch brdge the dgtal space to the physcal world at a socetal scale. Ther powerful computng and communcaton capactes, huge market prolferaton, and nherent moblty makes Moble Phone Sensng Systems (MPSS) [1] a much more flexble and cost-effectve sensng soluton compared wth tradtonal statc sensor networks. In turn ths has motvated the desgn of novel sensng applcatons [1], [2], coverng urban envronmental montorng [3], smart transportaton [4], and safety [5]. Most of current MPSSs transmt moble sensor data to the server through cellular networks. When MPSS becomes popular, ths smple soluton wll suffer from not only sgnfcant battery [6], [7] and 3G/4G fnancal costs [8] to the phone users, but also wll produce heavy traffc load on the underlyng bandwdth-lmted cellular networks, especally for MPSS applcatons that requre contnuous sensng wth fne granularty (e.g. [9]). Besdes the expensve cellular communcatons, current smartphones are beng equpped wth more and more shortrange wreless technologes such as WF, WF drect, and Bluetooth 4., whch enable opportunstc phone-to-phone and phone-to-server communcatons (e.g. through WF routers). Due to ther low energy and fnancal costs, t s promsng to explot the potental of short-range communcatons n MPSSs, especally for delay-tolerant moble sensng applcatons [7]. For nstance, wthout usng ts own cellular rado, a phone can report ts sensor data to the server, through another proxmty phone wth a cheaper cellular cost (e.g. unlmted moble data) or when t passes a free WF router. However, to buld such a MPSS wth hybrd cellular and short-range communcatons, the followng research ssues must be addressed: Networkng Issues. It s a challenge to perform the sensng and opportunstc mult-hop data transmsson tasks that are adaptve to the tme-varyng and potentally unpredctable network states, ncludng fluctuatng wreless channel qualty; ntermttent connectvty caused by phone user movement; heterogeneous transmsson and sensng costs across moble phones; 3G/4G moble data costs; and the opportunstc avalablty of nearby free Internet access ponts. Economc Issues. To encourage the phone users to partcpate the MPSS, they should be properly rewarded to cover sensng and transmsson costs [1] [12]. In addton, the self-nterest phone users may try to maxmze ther benefts strategcally by msreportng ther local state parameters. For nstance, n order to prolong battery lfetme, a phone user may hde that she s connected to a free WF router to avod relayng other nearby phone data to the server. Ths would result n sgnfcant performance degradaton of the system. Therefore, ncentvzaton s a key ssue for MPSS wth ths new networkng paradgm, whch s much more challengng compared to pure cellular networks. A. Our Approach In ths paper, we present theoretcal and practcal studes to address above two ssues. Our contrbutons are summarzed as follows: 1. We formulate a fnte-horzon stochastc optmzaton problem for contnuous data collecton n MPSS usng hybrd cellular and opportunstc short-range communcatons. The objectve of the formulated problem s to maxmze the global gross proft,.e. the total fnancal rewards of all phone users after costs ncurred by performng the sensng and transmsson tasks are deducted. 2. We develop a lghtweght jont sensng rate control and dynamc routng algorthm, OptMPSS to solves the data
2 collecton problem n a fully dstrbuted and therefore scalable way. We prove that OptMPSS s an asymptotcally optmal soluton to the formulated problem. 3. We propose a fully dstrbuted mechansm, Backpressure Meet Taxes (BMT), to ncentvze phone users to fathfully mplement OptMPSS, by mposng taxes or provdng subsdes for each phone user, dependng on her mpact on the rest of phone users n the MPSS. We prove that BMT manages to acheve asymptotc ncentve compatblty [13]. To our knowledge, BMT s the frst approach that ntegratng algorthmc mechansm desgn theory [14], [15] to the stochastc Lynapunov optmzaton framework [16]. Besdes MPSS, ths method developed for BMT also has a great potental to be apples to other stochastc dstrbuted systems wth self-nterest and strategc users. 4. Through experments wth WF-drect-enabled Androd devces and extensve smulatons wth real human moblty trace [17], we demonstrate that system performance can be sgnfcantly mproved by explotng low-cost short-range communcatons, n terms of global socal profts and phone users costs. Evaluaton results also show that each phone user can always get a postve net proft (.e. gross proft plus subsdes or mnus taxes) and the server never ncurs a defct (.e. the server always obtan a postve proft). Furthermore, each phone user cannot ncrease her net proft mprovement by lyng about her prvate parameters. These results demonstrate that BMT can acheve ndvdual ratonalty, server proftablty, and ncentve compatblty (fathful mplementaton) n practce. B. Related Work Recently, several ncentve-based mechansms have been proposed for MPSS [1] [12], [18]. [11] develops platformcentrc and user-centrc schemes based on a Stackelbergy game and aucton theory respectvely. [12] proposes a mechansm based on a Bayesan game to mnmze partcpaton costs whle ensurng certan servce qualtes, by determnng the level of user partcpaton (.e. sensng rate). However, all of these schemes focus on MPSS wth pure cellular rados only, whch cannot be drectly used n MPSS wth hybrd cellular and mult-hop short-range communcatons. The explosve growth of cellular traffc has motvated an ncrease n research nto cellular traffc offload usng other forms of opportunstc connectvty, ncludng WF [19] [21] and Bluetooth [22]. However, none of these focus on MPSS. EffSense [7], consders MPSS wth the same hybrd wreless networks as us. However, ths heurstc-based scheme does not provde any performance guarantees, and does not consder ncentvsaton for the strategc and self-nterest phone users. Stochastc Lyapunov optmzaton [16], [23] [26] provdes elegant and powerful theoretcal tools to derve backpressure style cross-layer network optmzaton and control algorthms. Due to ther adaptveness to network dynamcs, several backpressure rate control and routng schemes [23] [25] have been proposed for opportunstc moble networks. However, Fg. 1. An llustratve example of a MPSS wth hybrd cellular and short-range communcatons, consstng of 4 phones and a server. agan none of them focus on MPSS nor do they account for ncentvsaton and the strategc behavors of phone users. Mechansm desgn [14], [15] s concerned wth how to make a global decson wth desrable propertes n systems consstng of strategc self-nterest ndvduals who have prvate nformaton. Recent theoretcal work [13], [27] on dstrbuted Vckrey-Clarke-Groves (VCG) mechansms enables the fathful mplementaton of algorthms producng desred outcomes (such as dual decomposton and average consensus) n a dstrbuted way. However, these approaches focus on determnstc rather than stochastc systems. Our work combnes threads of all the above works n a novel way. C. Paper Organzaton The next secton presents the system model and desgn objectves. Secton III descrbes the OptMPSS algorthm. Mechansm desgn models are establshed n Secton IV. Secton V presents the BMT algorthm, then Secton VI dscusses the performance evaluaton. Fnally, we conclude the paper n Secton VII. II. SYSTEM MODEL AND OBJECTIVES As shown n Fg. 1, we consder a MPSS that conssts of a server S and a set of moble phones N collectng urban sensng data. The MPSS operates durng a fnte tme horzon (e.g. a week) wth dscrete tme slots t = {1, 2,...,t end }, t end < +. Every phone can communcate wth the servers through 3G/ 4G cellular rados, or through the low-cost WF when t passes a WF router (slots 1-3 n Fg. 1). In addton, phones n mmedate proxmty can communcate wth each other, usng short-range communcatons such as WF drect (slot 2) and Bluetooth 4. (slot 3). A. Sensng and Communcaton Models At each tme slot t, each phone produces r (t) r max sensor data packets, where the fnte sensng rate upper bound r max s defned by the specfc moble sensng applcaton. Let µ,j (t) be the channel capacty from a phone N to a phone j N or to the server j = S
3 at slot t,.e. the maxmum (nteger) number of data packets that can be successfully transmtted from to j durng slot t. It can be seen that µ,j (t) may vary sgnfcantly over the tme slots, due to the stochastc phone user movement and wreless channel qualtes. In practce, all possble channel capactes (.e. µ,j (t),, j, t) must have an fnte upper bound µ max, determned by the fnte data rate of the wreless transcevers. Each phone mantans a tme-varyng temporary neghbor table N (t), consstng of the server S (f currently connected) and the phones n proxmty at slot t: N (t) := {j : j N {S},µ,j (t) > } (1) In practce, N (t) can be establshed by usng neghbor dscovery schemes such as [28]. Denote f,j (t) µ,j (t) as the amount of forwarded data from phone to ts current neghbor j N (t) at slot t. We use a vector x (t) = (r (t), f,j (t), j N (t)) (2) to represent the sensng and data forwardng actons of a phone N at slot t. B. Queue Dynamcs Each phone mantans a data queue wth sze Q (t) to store the sensng data collected by tself and receved from other phones. Consderng sensng and data forwardng dynamcs, the queue backlog of each phone updates as follows: Q (t+1) = Q (t) f out (t) + +r (t)+f n (t) (3) where for any real number a, the operator a + = a f a > ; a + = otherwse. f out (t) = j N f (t),j(t), and f n (t) = j N f (t) j,(t) represent the total numbers of outgong and ncomng packets of phone at slot t respectvely. It s worth notng that the queue backlog of the server S s always zero,.e. Q S (t) =, t, snce t s the destnaton of all sensor data packets. C. Costs of Phones At each slot t, each phone ncurs costs due to sensng and data transmsson. Let p s (t) > be the per packet sensng prce of phone at slot t. Therefore, the sensng cost of phone at slot t s p s (t)r (t). In practce, the sensng prce p s (t) depends on both MPSS applcaton requrements, and the avalable resources that phone has at tme t such as remanng battery energy. Denote p t,j (t) as the per packet transmsson prce for phone to send a sensor data packet to a temporary neghborj. If j s the servers, then p t,j (t) depends on fnancal cellular costs, the avalablty of a nearby WF router, and the remanng battery level of phone. Specfcally, prce p t,j (t) are normally sgnfcantly smaller when sends data to the server through WF than through cellular rados. If j s another phone, the transmsson prce p t,j (t) manly depends on battery concerns of the users of phones and j. We can see that the data transmsson prce s hghly dynamc and heterogeneous across dfferent wreless transmsson lnks. It s worth notng that although sensng and transmsson prces are nfluenced by varous practcal aspects, they can be all normalzed to monetary values (e.g. US dollar or credts per packet), estmated by each phone user herself rather then the server. The detaled estmaton n practce s out of the scope of ths paper, but our BMT scheme can guarantee that fathful estmaton s the best strategy for each self-nterest phone user. For a gven slot t, the total cost of each phone N can be computed as where the vector cost (t) = p (t)x (t) (4) p (t) = (p s (t), pt,j (t), j N (t) (5) characterzes the prce profle of phone at slot t. D. Revenue and Gross Proft Maxmzaton Durng the complete tme horzon, the server obtans totally t end N v (r ) amount of monetary revenue (.e. global socal revenue), by sellng the collected moble sensng date to externa MPSSl users. Here, r represents the average sensng rate of phone over the tme horzon [1,t end ], and the revenue functon v (r ) can be any concave (ncludes lnear), dfferentable, and non-decreasng functon of r. The revenue functon may dffer across moble phones, dependng on specfc sensng applcatons and the Qualty of Informaton (QoI) of sensor data produced by each phone [12], [29]. Therefore, v (r ) ndcates the tme-average contrbuton level of phone to the MPSS. At slot t end, the server computes v (r ) and makes a payment αt end v (r ) to each phone (shown n Fg. 1), where the system parameter < α 1 s the percentage of the global socal revenue t end N v (r ) that s allocated to all phones. As a result, the tme-average gross proft of each phone user s gven by: ϕ = αv (r ) cost, N (6) where cost s the tme-average of cost (t) over tme horzon 1 t t end. We call the tme-average aggregated gross proft of all moble phones N ϕ, as the global gross proft. The MPSS ams to maxmze the global gross proft by solvng the followng fnte-horzon stochastc problem: maxmze x (t), N s.t. Φ = N ϕ (7) r (t) < r max, N 1 t t end (8) f,j (t) µ,j (t), N,j N (t), 1 t t end (9) r +f n f out =, N (1) where f n and f out are the tme-averages of f n (t) and f out (t) over tme horzon 1 t t end respectvely. Constrant (1) states the flow conservaton law,.e. the average
4 total ncomng and outgong data rate should be equal for each phone. Ths constrant also ensures that the server wll know the average sensng rate r for each phone N at slot t end. Secton III wll develop OptMPSS, an optmal dstrbuted soluton to problem (7)-(1). However, because each phone owner s only nterested n maxmzng her own proft ϕ rather than the global gross proft of the system Φ, the optmal soluton to problem (7)-(1) cannot be mplemented wthout proper ncentvzaton mechansm that encourages phone owners to apply the OptMPSS. All varables regardng the ncentvzaton mechansm such as net proft wll be defned n Secton IV. E. Objectve The objectve of ths paper s to develop an algorthm that can acheve the followng desred propertes: 1. Global Gross Proft Optmalty. The algorthm should be the optmal soluton to problem (7)-(1). 2. Adaptveness. The algorthm should be adaptve to all possble dynamc network states, ncludng tme-varyng and heterogeneous sensng and transmsson cost across phones; wreless lnk qualtes; and network connectvty (e.g. ncludng extremely dense networks where all phones can always communcate wth each other, to extremely sparse networks where short-range communcaton s rare or not avalable). 3. No Predcton Requrement. The desred algorthm s based on the current system state only, and does not requre the predcton of any future MPSS nformaton. 4. Dstrbuted and Real-tme Operatons. The computatonal and communcaton overheads of the algorthm should be lghtweght for real-tme operatons of each phone. 5. Indvdual Ratonalty. Each partcpatng phone user should obtan a non-negatve net proft, whch s formally defned n Equaton (18). 6. Server Proftablty. The server S should not ncur a defct, whch means a non-negatve server proft (formally defned n Equaton (19)) should be acheved. 7. Incentve Compatblty. Adoptng the acton suggested by the proposed algorthm should be the best strategy for each phone user, regardless others actons. An mportant corollary of ncentve compatblty s that usng hybrd cellular and (opportunstc) short-range communcatons wll always result n a same or ncreased net proft for each phone, compared wth usng the cellular communcatons alone. III. THE OPTMPSS ALGORITHM In ths secton, we develop an fully dstrbuted algorthm, OptMPSS to optmze global gross proft (7), by controllng the acton x (t) of each phone N at every slot 1 t t end : ts sensng rate r (t) and the data forwardng rate f,j (t) to each of ts temporary neghbors j N (t). Intally, n ths secton, we assume that all phone users are wllng to truthfully mplement the OptMPSS algorthm. We wll relax ths assumpton n later sectons. A. Dstrbuted Operatons of OptMPSS At each slot 1 t t end, each phone N operates as follows: 1. Sensng Rate Control. Phone sets ts sensng rate r (t) as r (t) = mn(r max,αv 1 ( Q (t)+vp s (t) )) (11) V where v 1 () represents the nverse functon of revenue functon v () s frst dervatve, and V > s a system parameter defned by the server. 2. Opportunstc Routng and Data forwardng. Phone computes a weght w,j (t) for each temporary neghbors j N (t) as w,j (t) = (Q (t) Q j (t))µ,j (t) Vp t,j (t) (12) Based on w,j (t), sets the forwardng rate f,j (t) for each of ts temporary neghbor j N (t) as: { µ,j (t) f w,j (t) > f,j (t) = (13) otherwse Remark 1. Snce every node N requres only the nformaton of ts temporary neghbors n N x (t), OptMPSS algorthm s fully dstrbuted. In addton, OptMPSS requres current knowledge of the network only for slot t and does not requre any future knowledge after slot t. At each slot, each phone broadcasts a one-hop beacon message to communcate ts queue backlog to ts current temporary neghbors and performs smple arthmetc calculatons. Therefore, the per slot per node communcaton of OptMPSS s O(1) wth respect to the network sze N. B. Asymptotcal Optmalty To prove the optmalty of OptMPSS, We dvde the tme horzon of the MPSS, 1 t t end, nto K successve frames wth sze T slots (.e. t end = KT ). We assume that there exsts an deal algorthm operatng at the frst slot of each frame t = (k 1)T + 1,1 k K, whch can obtan full nformaton regardng the dynamcs of the MPSS for future T slots (whch s mpossble n practce). Based on future knowledge, the deal algorthm solves problem (7)-(1) over each frame [(k 1)T + 1,kT], 1 k K rather than the whole horzon [1,t end ]. Note that when T = t end, the deal algorthm becomes the optmal soluton of the orgnal problem (7)-(1). Let Φ deal (k,t) denote the optmal global gross proft computed by the deal algorthm over each frame 1 k K. Theorem 1. The tme-average global gross proft computed by OptMPSS satsfes: Φ OptMPSS 1 K K k=1 Φ deal (k,t) MT V (14) where M = N (r max +µ max ) 2 /2 s a constant value. Proof. Theorem 1 can be proved by usng sample-path based
5 Lyapunov optmzaton theory. Due to page lmts, we present the detals ths proof n appendx ( Inequalty (14) shows that parameter V can be set as large as desred to force M T/V to be arbtrarly small. Specfcally, Theorem 1 also demonstrates that when T = t end, the optmal average global gross proft can be asymptotcally acheved by OptMPSS, as V. We can see that OptMPSS manages to attan the desred propertes 1 4, lsted n Subsecton II-E. We wll dscuss how to acheve the other propertes n later sectons. IV. MECHANISM DESIGN FOR FAITHFUL MPSS A key property of MPSS s that all parameters local to each phone are prvate and not observable to other phones and the server. Consequently, ths provde the phone users wth the opportunty to subvert the system by mscommuncatng ther local parameters. In ths secton, we brefly dscuss algorthmc mechansm desgn [15], whch studes fathful mplementaton of an ntended algorthm n a system wth a center and a set of ndvduals wth prvate parameters. MPSS can be vewed as such a system where the center s a server S and the ndvduals are moble phones, and we am to desgn a mechansm to fathfully mplement the ntended OptMPSS algorthm. A. Centralzed Mechansm Desgn Although we focus on dstrbuted mechansm desgn, for readablty, we frst dscuss drect revelaton (centralzed) mechansms [27] n the context of MPSS. 1) Effcent Socal Decson: For each phone, defne ts prvate type (parameters) as θ = (p (t),µ,j (t),j N (t),1 t t end ) Θ where Θ represents the set of all possble types θ. Denote the prvate types of all phones as θ = (θ 1,..., θ N (t)) (Θ 1,... Θ N ) = Θ, where the type space Θ represents the set of all possble θ. Let x(θ) represent the jont rate control and routng decsons of the MPSS durng the whole tme horzon 1 t t end. x = (x (t), N, 1 t t end ) = (r (t),f,j (t), N,j N (t),1 t t end ) X where X represents the set of all possble rate control and routng decsons. It s easy to see that the gross proft of each phone ϕ, N depends on ts prvate type θ and the decson x. Therefore, we can rewrte ϕ as ϕ (x,θ ). In mechansm theory, The functon x : Θ X s called a socal decson. Defnton 1 [Effcent Socal Decson] A decson x opt s sad to be effcent f ϕ (x,θ ) (15) N ϕ (x opt,θ ) N for all θ Θ and for all x X. Accordng to Theorem 1, t can be seen that the sensng rate control and routng decsons made by OptMPSS s the effcent socal decson when V. In order to make an effcent socal decson x( θ) n a centralzed way, each phone s asked to report ts type, denoted as θ, θ = ( p (t), µ,j (t),j N (t),1 t t end ) Θ to the server S, where θ Θ represents the reported types of all phones. Snce each phone user exhbts strategc behavors n realty, he or she may be untruthful and report a type value θ that s dfferent from the real type (.e. θ θ ), n order to derve an alternatve socal decson x ( θ) that results n a better gross proft ϕ (x ( θ),θ ) > ϕ (x opt,θ ). 2) Tax, Subsdy, Net Proft, and Server Proft: In order to make an effcent socal decson, server S ntroduces a monetary transfer functon λ : Θ R N λ( θ) = (λ 1 ( θ),...,λ N ( θ)) (16) to encourage the phone users to report ther true types. Based on the announcement of a phone s type θ (t), the functon λ ( θ ), where ths s negatve ths represents a tax that s mposed on phone, or where postve a subsdy s pad to. The combned socal decson and monetary transfer functon (x( θ),λ( θ)) s referred to as the socal choce functon [14]: g : Θ X R N (17) As a result, the net proft of each phone user s defned as u (θ, x( θ),λ ( θ)) = ϕ (x( θ),θ )+λ ( θ) (18) In our MPSS model, the tme-average server proft u S can be formally defned as u S = (1 α) v (r ) λ ( θ) (19) N N 3) VCG Mechansms: A drect revelaton mechansm s defned as (g,θ), wth a strategy (type) space Θ and socal choce functon g. A mechansm defnes a non-cooperatve game wth ncomplete nformaton as each phone has no knowledge of the types of other phones. Defnton 2 [Incentve Compatblty] A drect revelaton mechansm g(θ) s domnant strategy ncentve compatble, f the reported θ (t) s a domnant strategy for each phone N : u (g(θ,θ ),θ ) u (g( θ,θ ),θ ), θ,θ, θ θ, where θ (t) represents the types of all other phones j N {}. In ths case we say the socal choce functon s mplemented n ex-post Nash equlbra. The Vckrey-Clarke-Groves (VCG) mechansm s wellknown for the desred property of ncentve compatblty [14]. The socal decson rule of the VCG mechansm s gven by x vcg ( θ) = argmax x( θ) X ϕ (x( θ), θ ) (2) N
6 and the monetary transfer functon of each phone N s: λ vcg ( θ ) = ϕ j (x vcg ( θ), θ j ) max j } {{ } (a) x X j ϕ j (x, θ j ) } {{ } (b) (21) where the term (a) corresponds to the gross proft of all phones excludng (.e. all phones n N {}) when an effcent socal decson has been made, and term (b) represents the maxmum global gross proft achevable for all phones n N {}, wthout s presence n the MPSS. Therefore, the monetary transfer λ vcg ( θ ) represents the mpact (ether loss or ncrease) n value that s mposed on all other ndvduals (.e. margnal socal mpact) due to the socal decson that has been updated resultng from s presence n the MPSSs. B. Dstrbuted Mechansm Desgn A dstrbuted mechansm dm = (h, Π, A) [13], [27] defnes an outcome (.e. decson and taxng) functon h = (h x,h λ ), a feasble strategy space Π = (Π 1... Π N ) (.e. all possble sensng rate control and routng strateges n our MPSS model), and ntended dstrbuted algorthm (.e. strategy)a = (A 1,...,A N ), such as our OptMPSS algorthm. A strategy s = (s 1,...,s N ) Π s a mappng from type space to dstrbuted actons ncludng message transmsson and computaton. The socal choce functon can be vewed as g = h s(θ) = (x,λ). Fg. 2 llustrates the relatonshp between drected and dstrbuted mechansms. Fg. 2. The relatons between drect and dstrbuted mechansms. Defnton 3 [Fathful Implementaton]. A dstrbuted mechansm dm = (h,π,a) s an fathful mplementaton of the socal choce functon g = h A(θ) X R N, when the ntended dstrbuted algorthm (.e. strateges for phones) A = (A 1,...,A N ) s an ex post Nash equlbrum. u (h(a (θ ),A (θ ),θ ) u (h(a (θ ),A (θ ),θ ) for all N, A A, θ,θ. In ths case, the dstrbuted mechansm dm = (h, Π, A) s also sad to be ncentve compatble. In our MPSS model, the ntended dstrbuted algorthm A s OptMPSS. Due to the asymptotcal optmalty of our OptMPSS, we defne the asymptotc ncentve compatblty as follows: Defnton 4 [Asymptotc Incentve Compatblty]. A dstrbuted mechansm dm = (h, Π, A) s asymptotcally ncentve compatble, f u (h(a (θ ),A - (θ - ),θ ) u (h(a (θ ),A - (θ - ),θ ) ε(v) for all N,A A,θ,θ -, where ε(v) > and ε(v) as V. V. THE BMT ALGORITHM By applyng dstrbuted mechansm desgn to OptMPSS, we develop BMT, an on-lne and fully dstrbuted algorthm that calculates the margnal socal mpact (for computng the VCG tax) of each phone. n parallel wth the operatons of OptMPSS. A. Dstrbuted Operatons of BMT Durng the complete tme horzon 1 t t end, the BMT algorthm operates as follows: 1. Intalzaton. At begnnng of slot t = 1. The server: S broadcasts the set N, revenue functon αv (), and system parameters V and r max to each phone N. Moble phones: Besdes storng ts data queue holdng data, each phone ntalzes a vrtual queue length (a non-negatve nteger number)q j (t) for each of all other phones j N, j, where Q j (t) means the queue length of phone wthout phone j s presence. The ntal lengths of all vrtual queues are set as zero. 2. At each slot 1 t t end Dstrbuted Sensng and Routng. Each phone N adopts the OptMPSS algorthm for optmal dstrbuted sensng and data forwardng. Dstrbuted Margnal Socal Impact Computaton. In parallel, each phone N computes the vrtual sensng rate r j (t) and the vrtual cost cost j (t) for each of all other phones j N, j based on the correspondng vrtual queue length Q j (t), and r j (t) = mn(r max,αv 1 cost j (t) = p s (t)r j (t)+ (t)+p s (t) )) (22) V ( Q j where the vrtual forwardng rate s f j,k (t) = k N (t), k j { µ,k (t) f w j,k (t) > otherwse f j,k ct,k(t) (23) where for each k N (t), k j, the vrtual weght s (24) w j,k (t) = (Q j (t) Q j k (t))µ,k(t) Vp t,k(t) (25) The vrtual queue lengths Q j (t), j N {} are updated as Q j (t+1) = Q j (t) + k N (t) k N (t) f j k, (t) f j,k (t) + +r j (t)
7 The average vrtual sensng rates and vrtual costs for all j, j N are updated as 3. At slot t = t end. r j = (r j +(t 1)r j )/t cost j = (cost j +(t 1)cost j )/t Each phone reports the average vrtual sensng rates r j and vrtual cost cost j for all j N, j to the server. The server The server can compute the VCG tax λ vcg = (αv j (r j ) cost j ) j N {} j N {} (αv j (r j ) cost j ) of each phone N. Fnally, the server makes a payment of t end (αv (r )+λ vcg ( θ )) to phone. From a global vew of pont, the BMT algorthm runs n total one real and N vrtual OptMPSS algorthms n parallel durng the tme horzon of the MPSS: the real OptMPSS algorthm makes the actual sensng rate and routng decsons at each slot, whle N vrtual OptMPSS algorthms smulate N vrtual margnal socetes wth absence of each phone N to compute the fnal tax or subsdy for each phone n a fully dstrbuted way. Remark 2. It worth notng that the N 1 vrtual queue lengths mantaned n each phone are nteger numbers rather than real data packet queues, whch results n neglgble storage overheads for moble phones (e.g. only several KB storage overhead for a MPSS wth thousands of phones wth several GB RAMs). In addton, BMT requres each node to transmt O( N ) bytes of nformaton (ts real and mantaned vrtual queue backlogs) to ts current neghbors only, whle also performng O( N ) smple arthmetc calculatons. Ths s stll realstc for today s smart phones usng short-range rados such as WF drect that can acheve up to 25Mbps data transmsson rate. Due to ts dstrbuted operatons and lght overheads, BMT has a great potental to be appled n large-scale MPSS. B. Asymptotc Incentve Compatblty In ths subsecton, we prove that BMT acheves asymptotc ncentve compatblty. We frst ntroduce a new defnton and a supportung lemma. Defnton 5 [Asymptotcally Effcent Socal Decson] For a dstrbuted mechansm dm = (h, Π, A), a socal decson h x (θ) made by the suggested algorthm A s sad to be asymptotcally effcent f ϕ (h x A (θ),θ ) ε(v) N ϕ (h x A(θ),θ ) N for all θ Θ and for all A Π, where ε(v) > and ε(v) as V. Lemma 1. The socal decson made by BMT algorthm, x bmt Fg. 3. Experment Prototype Illustraton. s asymptotcally effcent. Proof. Snce the dstrbuted socal decson (e.g. sensng rate control and routng decsons) made by BMT s the same as that of OptMPSS, ths Lemma obvously holds when ε(v) = MT/V and frame sze T = t end, accordng to Theorem 1. Theorem 2. BMT acheves asymptotc ncentve compatblty. Proof. We prove Theorem 2 by contradcton. Consder a dstrbuted mechansm dm = (h,π,a bmt ), where A bmt = (A bmt 1,...,A bmt N ) s the dstrbuted strategy of each phone allocated by BMT algorthm. Suppose that BMT s not asymptotcally ncentve compatble,.e. N,A Abmt such that u (h(a bmt (θ ),A bmt (θ ),θ )+ε(v) = (a) ϕ (h x (A bmt (θ ),A bmt (θ )),θ ) = (b) < N N +h λ (A bmt (θ ),A bmt (θ ))+ε(v) ϕ (h x (A bmt (θ ),A bmt (θ )),θ ) max j ϕ j +ε(v) ϕ (h x (A (θ ),A bmt (θ ),θ ) max j ϕ j = u (h x (A (θ ),A bmt (θ ),θ ) (26) where equaltes (a) and (b) follow the defntons of net proft and VCG tax respectvely. It can be seen that nequalty (26) mples that ϕ (h x A (θ),θ ) ε(v) N ϕ (h x A bmt (θ),θ ) < N where A = (A bmt 1,...,A,...,Abmt N ). Ths contradcts the asymptotcally socal effcency of BMT,.e. Lemma 1. VI. EVALUATION In ths secton, we evaluate the performance of the BMT algorthm va both prototype experments and smulatons
8 global gross proft hybrd hybrd cheatng 3G only scenaros (a) ndvdual gross proft 4 2 no cheatng cheatng A B C nodes (b) ndvdual net proft cheatng no cheatng A B C nodes Fg. 4. Experment results: (a) tme-average global gross profts for the three experments. (b) and (c) shows the mpact of devce A s cheatng acton on the tme-average ndvdual gross and net profts of every devce respectvely. usng real human moblty traces. A. Experments Based on Androd Devce We mplemented the BMT algorthm n Androd OS 4.3, and developed an applcaton called BMT App. We constructed a proof-of-concept MPSS wth three WF-drect enabled Androd devces (.e. a Nexus 5 phone and two Nexus 7 tablets) and a server mplemented n NODE.JS ( as shown n Fg.3. The duraton of a slot was set as two seconds and the duraton of each experment was 1 mnutes. At the each slot, the BMT App run a dscovery phase to update the temporary neghbor table (e.g. the server and nearby devces), and then performed the sensng, routng, and margnal socal mpact computaton tasks as defned by the BMT algorthm. Each devce was held by a researcher moved around our lab. We use the revenue functon v (r ) = 4ln(1+r ) for each N, and set the system parameters V = 1 and α =.5. We use WF drect as the short-range rados. The channel capactes of all wreless rados are set at 25 packets per slot. The sensng prces and transmsson prces (n credts per data packet) for the data sent by WF drect were set as.1, for all three Androd devces A, B, and C. The 3G transmsson prces of A, B and C were set as.1, 1, and 1.5 respectvely 1. As shown n Fg.4 (a), the tme-average global gross proft of MPSS usng hybrd 3G and WF drect communcatons s approxmately twce of that usng 3G rados alone, whch demonstrates that sgnfcant performance mprovement can be acheved by usng hybrd cellular and short-range rado. In addton, we also evaluated the ncentve compatblty of BMT. Snce devce A had a much lower 3G prces than B and C, the routng decsons made by BMT would requre A to relay the sensor data packets collected by B and C (when A passed them) to the server, n order to maxmze the global gross proft. However, ths would result n an ndvdual gross profts reducton for A (due to the relayng cost), and therefore (the owner of) A may not want to fathfully adopt the dstrbuted routng actons suggested by BMT. To check 1 Ths mples that A may have an unlmted moble data budget, whle B and C may adopt a lmted monthly contract or pay as you go tarff rate. (c) packets per second profts scenaro 1 scenaro days (a) dynamc throughput global gross profts global net profts server profts scenaros (c) global profts packets per second ndvdual net proft 1 8 scenaro 1 scenaro days (b) average throughput no cheatng cheatng Fg. 5. Smulaton results of BMT node ID (d) ncentve compatblty whether BMT can avod ths, we mmc a qute ntutve cheatng behavor for A,.e. dsablng ts WF drect rado. Fg. 4 (b) shows that the ndvdual gross proft for each devce before and after A s cheatng acton. It can be seen that ths untruthful behavor can ndeed mprove A s ndvdual gross proft, but results n a sgnfcant degeneraton of global gross proft for the whole system, as shown n Fg. 4(a). As shown n Fg.4 (c), however, A eventually mssed the opportunty of obtanng approxmately 36% more net proft due to cheatng. Ths means that A would be better off relayng sensor data from other devces than msnformng the network. Ths demonstrates that n practce BMT can acheve the hghly desred ncentve compatblty property. In addton, the server proft and net proft of each devce and server proft were postve n all experments (These results are not plotted due to page lmts), whch demonstrates that BMT can acheve ndvdual ratonalty and server proftablty n practce. B. Trace-drven Smulatons To evaluate the practcal performance of BMT at scale, we establshed smulatons usng the real human trace collected from Infocom5 (41 nodes for 3 days) [17]. In all smulatons, each phone has both 3G, WF, and WF drect rados. When a phone meets a free WF router, t sends data through the WF rado rather than 3G. In each smulaton, a power-law dstrbuted random varable was assgned to each phone to smulate the heterogeneous free WF access probablty across phones, observed from real human moblty traces [3], [31]. The sensng and WF/Wf-drect transmsson prces for each phone were dynamcally set between and.1 for each slot (representng channel qualty varaton) at each slot, whle 3G transmsson prce of each phone was randomly set between.1 and.5 at the begnnng of each smulaton and remaned constant over slots. We set r max = 5 and the duraton of a
9 slot as one second. All other smulaton parameters were set the same as n the prototype experment represented earler. We agan run three smulatons: MPSS wth all wreless rados (scenaro 1), MPSS wthout WF drect (scenaro 2), and cheatng actons n MPSS wth all wreless rados (scenaro 3), where the users of phone 1 to 1 try to hde ther WF drect abltes. Fg. 5 (a) and (b) show the dynamc and tmeaverage throughput (.e. total sensng data packets produced by all phones at each slot) of MPSS respectvely, whch demonstrate that the BMT algorthm s adaptve to network dynamcs (e.g. moblty) and manages to converge to the tmeaverage optmal. In addton, Fgure 5 (c) and (d) demonstrate that usng mult-hop opportunstc short-range communcatons can sgnfcantly mprove network performance and BMT can acheve ncentve compatblty, ndvdual ratonalty, and server proftablty n practce. VII. CONCLUSION In ths paper we nvestgate a cost-effectve data collecton soluton to Moble Phone Sensng Systems (MPSS) that utlze hybrd cellular and opportunstc short-range wreless communcatons. We formulate a stochastc optmzaton problem for moble sensor data collecton, and develop OptMPSS, a scalable jont sensng rate control and routng algorthm to solve the formulated optmzaton problem n a fully dstrbuted and scalable way. In order to encourage phone users to fathfully apply the OptMPSS algorthm s control suggestons, we propose BMT, a jont networkng and taxng scheme, based on combng Lyapunov stochastc optmzaton and dstrbuted mechansm desgn theores. We prove that BMT acheves asymptotcal optmalty and ncentve compatblty. In order to evaluate the practcal performance of BMT, we developed BMT App, an Androd applcaton that mplements BMT algorthm for WF-drect-enabled devces. Trough experments and trace-drven smulatons, we demonstrate that BMT can effcently explot low-cost short-range communcatons, whch sgnfcantly mproves the global gross proft of the MPSS (around 1%). Evaluaton results show that the networkng actons suggested by BMT are the best choce for each ndvdual phone user. In addton, evaluaton results also demonstrate that our approach can acheve ndvdual ratonalty and server proftablty n practce. REFERENCES [1] R. K. Gant, F. Ye, and H. Le, Moble crowdsensng: current state and future challenges, IEEE Commun. Mag., vol. 49, no. 11, pp , 211. [2] N. D. Lane, E. Mluzzo, H. Lu, D. Peebles, T. Choudhury, and A. T. Campbell, A survey of moble phone sensng, IEEE Communcatons. Mag., vol. 48, no. 9, pp , 21. [3] R. K. Rana, C. T. Chou, S. S. Kanhere, N. Bulusu, and W. Hu, Earphone: an end-to-end partcpatory urban nose mappng system, n Proc. IPSN, 21, pp [4] A. Thagarajan, L. Ravndranath, K. LaCurts, S. Madden, H. Balakrshnan, S. Toledo, and J. Erksson, Vtrack: accurate, energy-aware road traffc delay estmaton usng moble phones, n Proc. ACM SenSys. [5] J. Whpple, W. Arensman, and M. S. Boler, A publc safety applcaton of gps-enabled smartphones and the androd operatng system, n Proc. IEEE SMC, 29, pp [6] X. Sheng, J. Tang, and W. Zhang, Energy-effcent collaboratve sensng wth moble phones, n IEEE INFOCOM, 212, pp [7] L. Wang, D. Zhang, and H. Xong, effsense: energy-effcent and cost-effectve data uploadng n moble crowdsensng, n Proc. ACM UbComp, 213, pp [8] H. Lu, S. Hu, W. Zheng, Z. Xe, S. Wang, P. Hu, and T. Abdelzaher, Effcent 3g budget utlzaton n moble partcpatory sensng applcatons, n Proc. IEEE INFOCOM, 213, pp [9] K. K. Rachur, C. Efstratou, I. Leontads, C. Mascolo, and P. J. Rentfrow, Mets: Explorng moble phone sensng offloadng for effcently supportng socal sensng applcatons, n Proc. IEEE PerCom, 213, pp [1] J.-S. Lee and B. Hoh, Sell your experences: a market mechansm based ncentve for partcpatory sensng, n Proc. IEEE PerCom 21, 21, pp [11] D. Yang, G. Xue, X. Fang, and J. Tang, Crowdsourcng to smartphones: ncentve mechansm desgn for moble phone sensng, n Proc. ACM Mobcom, 212, pp [12] I. Koutsopoulos, Optmal ncentve-drven desgn of partcpatory sensng systems, n Proc. IEEE INFOCOM, 213, pp [13] T. Tanaka, F. Farokh, and C. Langbort, A fathful dstrbuted mplementaton of dual decomposton and average consensus algorthms, n Proc. IEEE CDC, 213. [14] M. O. Jackson, Mechansm theory, The Encyclopeda of Lfe Support Systems, 2. [15] N. Nsan and A. Ronen, Algorthmc mechansm desgn, n Proc. ACM STOC, 1999, pp [16] L. Georgads, M. Neely, M. Neely, and L. Tassulas, Resource allocaton and cross-layer control n wreless networks. Now Pub, 26. [17] crawdad/cambrdge/haggle/. [18] T. Luo, H.-P. Tan, and L. Xa, Proft-maxmzng ncentve for partcpatory sensng, n Proc. IEEE Infocom, 214. [19] W. Dong, S. Rallapall, R. Jana, L. Qu, K. Ramakrshnan, L. Razoumov, Y. Zhang, and T. W. Cho, deal: Incentvzed dynamc cellular offloadng va auctons, n Proc. IEEE INFOCOM, 213, pp [2] X. Zhuo, W. Gao, G. Cao, and Y. Da, Wn-coupon: An ncentve framework for 3g traffc offloadng, n Proc. IEEE ICNP, 211, pp [21] K. Lee, J. Lee, Y. Y, I. Rhee, and S. Chong, Moble data offloadng: how much can wf delver? n In Proc. CoNEXT, 21, p. 26. [22] B. Han, P. Hu, V. A. Kumar, M. V. Marathe, J. Shao, and A. Srnvasan, Moble data offloadng through opportunstc communcatons and socal partcpaton, IEEE Trans. Mob. Comput., vol. 11, no. 5, pp , 212. [23] J. Ryu, V. Bhargava, N. Pane, and S. Shakkotta, Back-pressure routng and rate control for cns, n Proc. ACM Mobcom, 21, pp [24] S. Yang, U. Adeel, and J. A. McCann, Selfsh mules: Socal proft maxmzaton n sparse sensornets usng ratonally-selfsh human relays, IEEE J. Sel. Areas Commun., vol. 31, no. 6, pp , 213. [25] M. Alresan, M. Sathamoorthy, B. Krshnamachar, and M. J. Neely, Backpressure wth adaptve redundancy (bwar), n Proc. IEEE INFO- COM, 212, pp [26] S. Yang, Z. Sheng, J. McCann, and K. Leung, Dstrbuted stochastc cross-layer optmzaton for mult-hop wreless networks wth cooperatve communcatons, IEEE Trans. Mob. Comput., vol. 13, no. 1, pp , 214. [27] D. C. Parkes and J. Shnedman, Dstrbuted mplementatons of vckreyclarke-groves mechansms, n Proc. AAMAS, 24, pp [28] M. Bakht, M. Trower, and R. H. Kravets, Searchlght: won t you be my neghbor? n Proc. ACM Mobcom, 212, pp [29] C. H. Lu, P. Hu, J. W. Branch, C. Bsdkan, and B. Yang, Effcent network management for context-aware partcpatory sensng, n Proc. IEEE SECON, 211, pp [3] S. Yang, X. Yang, C. Zhang, and E. Spyrou, Usng socal network theory for modelng human moblty, IEEE Network, vol. 24, no. 5, pp. 6 13, 21. [31] A. Chantreau, P. Hu, J. Crowcroft, C. Dot, R. Gass, and J. Scott, Impact of human moblty on opportunstc forwardng algorthms, IEEE Trans. Mob. Comput., vol. 6, no. 6, pp , 27.
Utility-based Routing
Utlty-based Routng Je Wu Dept. of Computer and Informaton Scences Temple Unversty Roadmap Introducton Why Another Routng Scheme Utlty-Based Routng Implementatons Extensons Some Fnal Thoughts 2 . Introducton
More informationA Novel Optimization of the Distance Source Routing (DSR) Protocol for the Mobile Ad Hoc Networks (MANET)
A Novel Optmzaton of the Dstance Source Routng (DSR) Protocol for the Moble Ad Hoc Networs (MANET) Syed S. Rzv 1, Majd A. Jafr, and Khaled Ellethy Computer Scence and Engneerng Department Unversty of Brdgeport
More informationDynamic Optimization. Assignment 1. Sasanka Nagavalli January 29, 2013 Robotics Institute Carnegie Mellon University
Dynamc Optmzaton Assgnment 1 Sasanka Nagavall snagaval@andrew.cmu.edu 16-745 January 29, 213 Robotcs Insttute Carnege Mellon Unversty Table of Contents 1. Problem and Approach... 1 2. Optmzaton wthout
More informationResource Allocation Optimization for Device-to- Device Communication Underlaying Cellular Networks
Resource Allocaton Optmzaton for Devce-to- Devce Communcaton Underlayng Cellular Networks Bn Wang, L Chen, Xaohang Chen, Xn Zhang, and Dacheng Yang Wreless Theores and Technologes (WT&T) Bejng Unversty
More informationThe Spectrum Sharing in Cognitive Radio Networks Based on Competitive Price Game
8 Y. B. LI, R. YAG, Y. LI, F. YE, THE SPECTRUM SHARIG I COGITIVE RADIO ETWORKS BASED O COMPETITIVE The Spectrum Sharng n Cogntve Rado etworks Based on Compettve Prce Game Y-bng LI, Ru YAG., Yun LI, Fang
More informationComparative Analysis of Reuse 1 and 3 in Cellular Network Based On SIR Distribution and Rate
Comparatve Analyss of Reuse and 3 n ular Network Based On IR Dstrbuton and Rate Chandra Thapa M.Tech. II, DEC V College of Engneerng & Technology R.V.. Nagar, Chttoor-5727, A.P. Inda Emal: chandra2thapa@gmal.com
More informationDynamic Pricing Approach for Spectrum Allocation in Wireless Networks with Selfish Users
Dynamc Prcng Approach for Spectrum Allocaton n Wreless Networks wth Selfsh Users Zhu J and K. J. Ray Lu Electrcal and Computer Engneerng Department and Insttute for Systems Research Unversty of Maryland,
More informationResource Control for Elastic Traffic in CDMA Networks
Resource Control for Elastc Traffc n CDMA Networks Vaslos A. Srs Insttute of Computer Scence, FORTH Crete, Greece vsrs@cs.forth.gr ACM MobCom 2002 Sep. 23-28, 2002, Atlanta, U.S.A. Funded n part by BTexact
More informationDefine Y = # of mobiles from M total mobiles that have an adequate link. Measure of average portion of mobiles allocated a link of adequate quality.
Wreless Communcatons Technologes 6::559 (Advanced Topcs n Communcatons) Lecture 5 (Aprl th ) and Lecture 6 (May st ) Instructor: Professor Narayan Mandayam Summarzed by: Steve Leung (leungs@ece.rutgers.edu)
More informationDistributed Uplink Scheduling in EV-DO Rev. A Networks
Dstrbuted Uplnk Schedulng n EV-DO ev. A Networks Ashwn Srdharan (Sprnt Nextel) amesh Subbaraman, och Guérn (ESE, Unversty of Pennsylvana) Overvew of Problem Most modern wreless systems Delver hgh performance
More informationMTBF PREDICTION REPORT
MTBF PREDICTION REPORT PRODUCT NAME: BLE112-A-V2 Issued date: 01-23-2015 Rev:1.0 Copyrght@2015 Bluegga Technologes. All rghts reserved. 1 MTBF PREDICTION REPORT... 1 PRODUCT NAME: BLE112-A-V2... 1 1.0
More informationEnhancing Throughput in Wireless Multi-Hop Network with Multiple Packet Reception
Enhancng Throughput n Wreless Mult-Hop Network wth Multple Packet Recepton Ja-lang Lu, Paulne Vandenhove, We Shu, Mn-You Wu Dept. of Computer Scence & Engneerng, Shangha JaoTong Unversty, Shangha, Chna
More informationJoint Rate-Routing Control for Fair and Efficient Data Gathering in Wireless sensor Networks
Jont Rate-Routng Control for Far and Effcent Data Gatherng n Wreless sensor Networks Yng Chen and Bhaskar Krshnamachar Mng Hseh Department of Electrcal Engneerng Unversty of Southern Calforna Los Angeles,
More informationA TWO-PLAYER MODEL FOR THE SIMULTANEOUS LOCATION OF FRANCHISING SERVICES WITH PREFERENTIAL RIGHTS
A TWO-PLAYER MODEL FOR THE SIMULTANEOUS LOCATION OF FRANCHISING SERVICES WITH PREFERENTIAL RIGHTS Pedro Godnho and oana Das Faculdade de Economa and GEMF Unversdade de Combra Av. Das da Slva 65 3004-5
More informationQueuing-Based Dynamic Channel Selection for Heterogeneous Multimedia Applications over Cognitive Radio Networks
1 Queung-Based Dynamc Channel Selecton for Heterogeneous ultmeda Applcatons over Cogntve Rado Networks Hsen-Po Shang and haela van der Schaar Department of Electrcal Engneerng (EE), Unversty of Calforna
More informationA MODIFIED DIFFERENTIAL EVOLUTION ALGORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS
A MODIFIED DIFFERENTIAL EVOLUTION ALORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS Kaml Dmller Department of Electrcal-Electroncs Engneerng rne Amercan Unversty North Cyprus, Mersn TURKEY kdmller@gau.edu.tr
More informationReview: Our Approach 2. CSC310 Information Theory
CSC30 Informaton Theory Sam Rowes Lecture 3: Provng the Kraft-McMllan Inequaltes September 8, 6 Revew: Our Approach The study of both compresson and transmsson requres that we abstract data and messages
More informationCalculation of the received voltage due to the radiation from multiple co-frequency sources
Rec. ITU-R SM.1271-0 1 RECOMMENDATION ITU-R SM.1271-0 * EFFICIENT SPECTRUM UTILIZATION USING PROBABILISTIC METHODS Rec. ITU-R SM.1271 (1997) The ITU Radocommuncaton Assembly, consderng a) that communcatons
More informationFull-duplex Relaying for D2D Communication in mmwave based 5G Networks
Full-duplex Relayng for D2D Communcaton n mmwave based 5G Networks Boang Ma Hamed Shah-Mansour Member IEEE and Vncent W.S. Wong Fellow IEEE Abstract Devce-to-devce D2D communcaton whch can offload data
More informationA NSGA-II algorithm to solve a bi-objective optimization of the redundancy allocation problem for series-parallel systems
0 nd Internatonal Conference on Industral Technology and Management (ICITM 0) IPCSIT vol. 49 (0) (0) IACSIT Press, Sngapore DOI: 0.776/IPCSIT.0.V49.8 A NSGA-II algorthm to solve a b-obectve optmzaton of
More informationDistributed Topology Control of Dynamic Networks
Dstrbuted Topology Control of Dynamc Networks Mchael M. Zavlanos, Alreza Tahbaz-Saleh, Al Jadbabae and George J. Pappas Abstract In ths paper, we present a dstrbuted control framework for controllng the
More informationA Fuzzy-based Routing Strategy for Multihop Cognitive Radio Networks
74 Internatonal Journal of Communcaton Networks and Informaton Securty (IJCNIS) Vol. 3, No., Aprl 0 A Fuzzy-based Routng Strategy for Multhop Cogntve Rado Networks Al El Masr, Naceur Malouch and Hcham
More informationQoS Provisioning in Wireless Data Networks under Non-Continuously Backlogged Users
os Provsonng n Wreless Data Networks under Non-Contnuously Backlogged Users Tmotheos Kastrnoganns, and Symeon Papavasslou, Member, IEEE School of Electrcal and Computer Engneerng Natonal Techncal Unversty
More informationThe Impact of Spectrum Sensing Frequency and Packet- Loading Scheme on Multimedia Transmission over Cognitive Radio Networks
Ths artcle has been accepted for publcaton n a future ssue of ths journal, but has not been fully edted. Content may change pror to fnal publcaton. The Impact of Spectrum Sensng Frequency and Pacet- Loadng
More informationTODAY S wireless networks are characterized as a static
IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 10, NO. 2, FEBRUARY 2011 161 A Spectrum Decson Framework for Cogntve Rado Networks Won-Yeol Lee, Student Member, IEEE, and Ian F. Akyldz, Fellow, IEEE Abstract
More informationTo: Professor Avitabile Date: February 4, 2003 From: Mechanical Student Subject: Experiment #1 Numerical Methods Using Excel
To: Professor Avtable Date: February 4, 3 From: Mechancal Student Subject:.3 Experment # Numercal Methods Usng Excel Introducton Mcrosoft Excel s a spreadsheet program that can be used for data analyss,
More informationAdaptive Modulation for Multiple Antenna Channels
Adaptve Modulaton for Multple Antenna Channels June Chul Roh and Bhaskar D. Rao Department of Electrcal and Computer Engneerng Unversty of Calforna, San Dego La Jolla, CA 993-7 E-mal: jroh@ece.ucsd.edu,
More informationTraffic balancing over licensed and unlicensed bands in heterogeneous networks
Correspondence letter Traffc balancng over lcensed and unlcensed bands n heterogeneous networks LI Zhen, CUI Qme, CUI Zhyan, ZHENG We Natonal Engneerng Laboratory for Moble Network Securty, Bejng Unversty
More informationApplication of Intelligent Voltage Control System to Korean Power Systems
Applcaton of Intellgent Voltage Control System to Korean Power Systems WonKun Yu a,1 and HeungJae Lee b, *,2 a Department of Power System, Seol Unversty, South Korea. b Department of Power System, Kwangwoon
More informationTest 2. ECON3161, Game Theory. Tuesday, November 6 th
Test 2 ECON36, Game Theory Tuesday, November 6 th Drectons: Answer each queston completely. If you cannot determne the answer, explanng how you would arrve at the answer may earn you some ponts.. (20 ponts)
More informationCloud of Things for Sensing-as-a-Service: Architecture, Algorithms, and Use Case
Cloud of Thngs for Sensng-as-a-Servce: Archtecture, Algorthms, and Use Case Sherf Abdelwahab, Bechr Hamdaou, Mohsen Guzan, and Taeb Znat Oregon State Unversty, abdelwas,hamdaou@eecs.orst.edu Unversty of
More informationDecision aid methodologies in transportation
Decson ad methodologes n transportaton Lecture 7: More Applcatons Prem Kumar prem.vswanathan@epfl.ch Transport and Moblty Laboratory Summary We learnt about the dfferent schedulng models We also learnt
More informationPriority based Dynamic Multiple Robot Path Planning
2nd Internatonal Conference on Autonomous obots and Agents Prorty based Dynamc Multple obot Path Plannng Abstract Taxong Zheng Department of Automaton Chongqng Unversty of Post and Telecommuncaton, Chna
More informationOn Interference Alignment for Multi-hop MIMO Networks
013 Proceedngs IEEE INFOCOM On Interference Algnment for Mult-hop MIMO Networks Huacheng Zeng Y Sh Y. Thomas Hou Wenng Lou Sastry Kompella Scott F. Mdkff Vrgna Polytechnc Insttute and State Unversty, USA
More informationThroughput Maximization by Adaptive Threshold Adjustment for AMC Systems
APSIPA ASC 2011 X an Throughput Maxmzaton by Adaptve Threshold Adjustment for AMC Systems We-Shun Lao and Hsuan-Jung Su Graduate Insttute of Communcaton Engneerng Department of Electrcal Engneerng Natonal
More informationIEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 30, NO. 11, DECEMBER
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 30, NO. 11, DECEMBER 2012 2105 Local Publc Good Provsonng n Networks: A Nash Implementaton Mechansm Shrutvandana Sharma and Demosthens Teneketzs,
More informationOptimal Sizing and Allocation of Residential Photovoltaic Panels in a Distribution Network for Ancillary Services Application
Optmal Szng and Allocaton of Resdental Photovoltac Panels n a Dstrbuton Networ for Ancllary Servces Applcaton Reza Ahmad Kordhel, Student Member, IEEE, S. Al Pourmousav, Student Member, IEEE, Jayarshnan
More informationWalsh Function Based Synthesis Method of PWM Pattern for Full-Bridge Inverter
Walsh Functon Based Synthess Method of PWM Pattern for Full-Brdge Inverter Sej Kondo and Krt Choesa Nagaoka Unversty of Technology 63-, Kamtomoka-cho, Nagaoka 9-, JAPAN Fax: +8-58-7-95, Phone: +8-58-7-957
More informationEnabling Crowd-Sourced Mobile Internet Access
Enablng Crowd-Sourced Moble Internet Access George Iosfds, Ln Gao, Janwe Huang, and Leandros Tassulas Dept. of Informaton Engneerng, The Chnese Unversty of Hong Kong, Hong Kong Dept. of Electrcal and Computer
More information熊本大学学術リポジトリ. Kumamoto University Repositor
熊本大学学術リポジトリ Kumamoto Unversty Repostor Ttle Wreless LAN Based Indoor Poston and Its Smulaton Author(s) Ktasuka, Teruak; Nakansh, Tsune CtatonIEEE Pacfc RIM Conference on Comm Computers, and Sgnal Processng
More informationSecure Power Scheduling Auction for Smart Grids Using Homomorphic Encryption
Secure Power Schedulng Aucton for Smart Grds Usng Homomorphc Encrypton Haya Shajaah, Student Member, IEEE, Ahmed Abdelhad, Senor Member, IEEE, and Charles Clancy, Senor Member, IEEE Abstract In ths paper,
More informationCOMPUTER networks nowadays rely on various middleboxes,
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, VOL. 14, NO. 3, SEPTEMBER 2017 631 Effcent Algorthms for Throughput Maxmzaton n Software-Defned Networks Wth Consoldated Mddleboxes Metan Huang, Wefa
More informationTECHNICAL NOTE TERMINATION FOR POINT- TO-POINT SYSTEMS TN TERMINATON FOR POINT-TO-POINT SYSTEMS. Zo = L C. ω - angular frequency = 2πf
TECHNICAL NOTE TERMINATION FOR POINT- TO-POINT SYSTEMS INTRODUCTION Because dgtal sgnal rates n computng systems are ncreasng at an astonshng rate, sgnal ntegrty ssues have become far more mportant to
More informationA Predictive QoS Control Strategy for Wireless Sensor Networks
The 1st Worshop on Resource Provsonng and Management n Sensor Networs (RPMSN '5) n conjuncton wth the 2nd IEEE MASS, Washngton, DC, Nov. 25 A Predctve QoS Control Strategy for Wreless Sensor Networs Byu
More informationA MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION
A MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION Vncent A. Nguyen Peng-Jun Wan Ophr Freder Computer Scence Department Illnos Insttute of Technology Chcago, Illnos vnguyen@t.edu,
More informationPrevention of Sequential Message Loss in CAN Systems
Preventon of Sequental Message Loss n CAN Systems Shengbng Jang Electrcal & Controls Integraton Lab GM R&D Center, MC: 480-106-390 30500 Mound Road, Warren, MI 48090 shengbng.jang@gm.com Ratnesh Kumar
More informationSpectrum Auction Framework for Access Allocation in Cognitive Radio Networks
Spectrum Aucton Framework for Access Allocaton n Cogntve Rado Networks ABSTRACT Gaurav S. Kasbekar Department of Electrcal and Systems Engneerng Unversty of Pennsylvana kgaurav@seas.upenn.edu Cogntve rado
More informationA Strategy-Proof Combinatorial Heterogeneous Channel Auction Framework in Noncooperative Wireless Networks
Ths s the author s verson of an artcle that has been publshed n ths journal. Changes were made to ths verson by the publsher pror to publcaton. The fnal verson of record s avalable at http://dx.do.org/1.119/tmc.214.2343624
More informationTopology Control for C-RAN Architecture Based on Complex Network
Topology Control for C-RAN Archtecture Based on Complex Network Zhanun Lu, Yung He, Yunpeng L, Zhaoy L, Ka Dng Chongqng key laboratory of moble communcatons technology Chongqng unversty of post and telecommuncaton
More informationHigh Speed, Low Power And Area Efficient Carry-Select Adder
Internatonal Journal of Scence, Engneerng and Technology Research (IJSETR), Volume 5, Issue 3, March 2016 Hgh Speed, Low Power And Area Effcent Carry-Select Adder Nelant Harsh M.tech.VLSI Desgn Electroncs
More informationForwarding Redundancy in Opportunistic Mobile Networks: Investigation, Elimination and Exploitation
1 Forwardng Redundancy n Opportunstc Moble Networks: Investgaton, Elmnaton and Explotaton We Gao, Member, IEEE, Qnghua L, Member, IEEE, and Guohong Cao, Fellow, IEEE Abstract Opportunstc moble networks
More informationRESOURCE CONTROL FOR HYBRID CODE AND TIME DIVISION SCHEDULING
RESOURCE CONTROL FOR HYBRID CODE AND TIME DIVISION SCHEDULING Vaslos A. Srs Insttute of Computer Scence (ICS), FORTH and Department of Computer Scence, Unversty of Crete P.O. Box 385, GR 7 Heraklon, Crete,
More informationJoint Channel Assignment and Opportunistic Routing for Maximizing Throughput in Cognitive Radio Networks
Jont Channel Assgnment and Opportunstc Routng for Maxmzng Throughput n Cogntve Rado Networs Yang Qn*, Xaoxong Zhong*, Yuanyuan Yang +,Yanln L* and L L* *Key Laboratory of Networ Orented Intellgent Computaton,
More informationGAME THEORETIC FLOW AND ROUTING CONTROL FOR COMMUNICATION NETWORKS. Ismet Sahin. B.S., Cukurova University, M.S., University of Florida, 2001
GAME THEORETIC FLOW AND ROUTING CONTROL FOR COMMUNICATION NETWORKS by Ismet Sahn B.S., Cukurova Unversty, 996 M.S., Unversty of Florda, 00 Submtted to the Graduate Faculty of School of Engneerng n partal
More informationOptimal Multicast in Multi-Channel Multi-Radio Wireless Networks
Optmal Multcast n Mult-Channel Mult-Rado Wreless Networks Aay Gopnathan, Zongpeng L, Carey Wllamson Department of Computer Scence, Unversty of Calgary {agopnat,zongpeng,carey}@cpsc.ucalgary.ca Abstract
More informationTile Values of Information in Some Nonzero Sum Games
lnt. ournal of Game Theory, Vot. 6, ssue 4, page 221-229. Physca- Verlag, Venna. Tle Values of Informaton n Some Nonzero Sum Games By P. Levne, Pars I ), and ZP, Ponssard, Pars 2 ) Abstract: The paper
More informationWIRELESS sensor networks are used in a wide range of
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL X, NO X, MONTH 2X Optmzng Lfetme for Contnuous Data Aggregaton wth Precson Guarantees n Wreless Sensor Networks Xueyan Tang, Member, IEEE, and Janlang Xu, Member,
More informationJoint Adaptive Modulation and Power Allocation in Cognitive Radio Networks
I. J. Communcatons, etwork and System Scences, 8, 3, 7-83 Publshed Onlne August 8 n ScRes (http://www.scrp.org/journal/jcns/). Jont Adaptve Modulaton and Power Allocaton n Cogntve Rado etworks Dong LI,
More informationMultiband Jamming Strategies with Minimum Rate Constraints
Multband Jammng Strateges wth Mnmum Rate Constrants Karm Banawan, Sennur Ulukus, Peng Wang, and Bran Henz Department of Electrcal and Computer Engneerng, Unversty of Maryland, College Park, MD 7 US Army
More informationOpportunistic Beamforming for Finite Horizon Multicast
Opportunstc Beamformng for Fnte Horzon Multcast Gek Hong Sm, Joerg Wdmer, and Balaj Rengarajan allyson.sm@mdea.org, joerg.wdmer@mdea.org, and balaj.rengarajan@gmal.com Insttute IMDEA Networks, Madrd, Span
More informationantenna antenna (4.139)
.6.6 The Lmts of Usable Input Levels for LNAs The sgnal voltage level delvered to the nput of an LNA from the antenna may vary n a very wde nterval, from very weak sgnals comparable to the nose level,
More informationMulti-sensor optimal information fusion Kalman filter with mobile agents in ring sensor networks
Mult-sensor optmal nformaton fuson Kalman flter wth moble agents n rng sensor networs Behrouz Safarneadan *, Kazem asanpoor ** *Shraz Unversty of echnology, safarnead@sutech.ac.r ** Shraz Unversty of echnology,.hasanpor@gmal.com
More informationErgodic Capacity of Block-Fading Gaussian Broadcast and Multi-access Channels for Single-User-Selection and Constant-Power
7th European Sgnal Processng Conference EUSIPCO 29 Glasgow, Scotland, August 24-28, 29 Ergodc Capacty of Block-Fadng Gaussan Broadcast and Mult-access Channels for Sngle-User-Selecton and Constant-Power
More informationINCENTIVIZING INFORMATION SHARING IN NETWORKS
204 IEEE Internatonal Conference on Acoustc, Speech and Sgnal Processng (ICASSP) INCENTIVIZING INFORMATION SHARING IN NETWORKS Je Xu, Yangbo Song, Mhaela van der Schaar Department of Electrcal Engneerng,
More informationA study of turbo codes for multilevel modulations in Gaussian and mobile channels
A study of turbo codes for multlevel modulatons n Gaussan and moble channels Lamne Sylla and Paul Forter (sylla, forter)@gel.ulaval.ca Department of Electrcal and Computer Engneerng Laval Unversty, Ste-Foy,
More informationA New Type of Weighted DV-Hop Algorithm Based on Correction Factor in WSNs
Journal of Communcatons Vol. 9, No. 9, September 2014 A New Type of Weghted DV-Hop Algorthm Based on Correcton Factor n WSNs Yng Wang, Zhy Fang, and Ln Chen Department of Computer scence and technology,
More informationHUAWEI TECHNOLOGIES CO., LTD. Huawei Proprietary Page 1
Project Ttle Date Submtted IEEE 802.16 Broadband Wreless Access Workng Group Double-Stage DL MU-MIMO Scheme 2008-05-05 Source(s) Yang Tang, Young Hoon Kwon, Yajun Kou, Shahab Sanaye,
More informationAn Alternation Diffusion LMS Estimation Strategy over Wireless Sensor Network
Progress In Electromagnetcs Research M, Vol. 70, 135 143, 2018 An Alternaton Dffuson LMS Estmaton Strategy over Wreless Sensor Network Ln L * and Donghu L Abstract Ths paper presents a dstrbuted estmaton
More informationsensors ISSN by MDPI
Sensors 2007, 7, 628-648 Full Paper sensors ISSN 1424-8220 2007 by MDPI www.mdp.org/sensors Dstrbuted Partcle Swarm Optmzaton and Smulated Annealng for Energy-effcent Coverage n Wreless Sensor Networks
More informationPerformance Analysis of Multi User MIMO System with Block-Diagonalization Precoding Scheme
Performance Analyss of Mult User MIMO System wth Block-Dagonalzaton Precodng Scheme Yoon Hyun m and Jn Young m, wanwoon Unversty, Department of Electroncs Convergence Engneerng, Wolgye-Dong, Nowon-Gu,
More informationsensors ISSN
Sensors 009, 9, 8593-8609; do:10.3390/s91108593 Artcle OPEN ACCESS sensors ISSN 144-80 www.mdp.com/journal/sensors Dstrbuted Envronment Control Usng Wreless Sensor/Actuator Networks for Lghtng Applcatons
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More informationQuantifying Content Consistency Improvements Through Opportunistic Contacts
Unversty of Pennsylvana ScholarlyCommons Departmental Papers (ESE) Department of Electrcal & Systems Engneerng 8-12-29 Quantfyng Content Consstency Improvements Through Opportunstc Contacts Kn-Wah Kwong
More informationOptimal State Prediction for Feedback-Based QoS Adaptations
Optmal State Predcton for Feedback-Based QoS Adaptatons Baochun L, Dongyan Xu, Klara Nahrstedt Department of Computer Scence Unversty of Illnos at Urbana-Champagn b-l, d-xu, klara @cs.uuc.edu Abstract
More informationA Game Theoretic Approach for Distributed Resource Allocation and Orchestration of Softwarized Networks
A Game Theoretc Approach for Dstrbuted Resource Allocaton and Orchestraton of Softwarzed Networks Salvatore D Oro, Laura Gallucco, Member, IEEE, Sergo Palazzo, Senor Member, IEEE, Govann Schembra Abstract
More informationOptimal Placement of PMU and RTU by Hybrid Genetic Algorithm and Simulated Annealing for Multiarea Power System State Estimation
T. Kerdchuen and W. Ongsakul / GMSARN Internatonal Journal (09) - Optmal Placement of and by Hybrd Genetc Algorthm and Smulated Annealng for Multarea Power System State Estmaton Thawatch Kerdchuen and
More informationREAL-TIME SCHEDULING IN LTE FOR SMART GRIDS. Yuzhe Xu, Carlo Fischione
REAL-TIME SCHEDULING IN LTE FOR SMART GRIDS Yuzhe Xu, Carlo Fschone Automatc Control Lab KTH, Royal Insttue of Technology 1-44, Stockholm, Sweden Emal: yuzhe@kth.se, carlof@kth.se ABSTRACT The latest wreless
More informationAn Optimization Approach for Airport Slot Allocation under IATA Guidelines
An Optmzaton Approach for Arport Slot Allocaton under IATA Gudelnes Abstract Ar traffc demand has grown to exceed avalable capacty durng extended parts of each day at many of the busest arports worldwde.
More informationSelective Sensing and Transmission for Multi-Channel Cognitive Radio Networks
IEEE INFOCOM 2 Workshop On Cogntve & Cooperatve Networks Selectve Sensng and Transmsson for Mult-Channel Cogntve Rado Networks You Xu, Yunzhou L, Yfe Zhao, Hongxng Zou and Athanasos V. Vaslakos Insttute
More informationRational Secret Sharing without Broadcast
Ratonal Secret Sharng wthout Broadcast Amjed Shareef, Department of Computer Scence and Engneerng, Indan Insttute of Technology Madras, Chenna, Inda. Emal: amjedshareef@gmal.com Abstract We use the concept
More informationExploiting Idle Communication Power to Improve Wireless Network Performance and Energy Efficiency
Explotng Idle Communcaton ower to Improve Wreless Network erformance and Energy Effcency Le Guo, Xaonng Dng, Hanng Wang, un L, Songqng Chen 3, Xaodong Zhang Oho State Unversty College of Wllam and Mary
More informationAn Energy-aware Awakening Routing Algorithm in Heterogeneous Sensor Networks
An Energy-aware Awakenng Routng Algorthm n Heterogeneous Sensor Networks TAO Dan 1, CHEN Houjn 1, SUN Yan 2, CEN Ygang 3 1. School of Electronc and Informaton Engneerng, Bejng Jaotong Unversty, Bejng,
More informationA Comparison of Two Equivalent Real Formulations for Complex-Valued Linear Systems Part 2: Results
AMERICAN JOURNAL OF UNDERGRADUATE RESEARCH VOL. 1 NO. () A Comparson of Two Equvalent Real Formulatons for Complex-Valued Lnear Systems Part : Results Abnta Munankarmy and Mchael A. Heroux Department of
More informationOn the Feasibility of Receive Collaboration in Wireless Sensor Networks
On the Feasblty of Receve Collaboraton n Wreless Sensor Networs B. Bantaleb, S. Sgg and M. Begl Computer Scence Department Insttute of Operatng System and Computer Networs (IBR) Braunschweg, Germany {behnam,
More informationFair Coalitions for Power-Aware Routing in Wireless Networks
Unversty of Pennsylvana ScholarlyCommons Departmental Papers (ESE) Department of Electrcal & Systems Engneerng February 2007 Far Coaltons for Power-Aware Routng n Wreless Networks Ratul K. Guha Unversty
More informationControl Chart. Control Chart - history. Process in control. Developed in 1920 s. By Dr. Walter A. Shewhart
Control Chart - hstory Control Chart Developed n 920 s By Dr. Walter A. Shewhart 2 Process n control A phenomenon s sad to be controlled when, through the use of past experence, we can predct, at least
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 13, NO. 12, DECEMBER
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 3, NO. 2, DECEMBER 204 695 On Spatal Capacty of Wreless Ad Hoc Networks wth Threshold Based Schedulng Yue Lng Che, Student Member, IEEE, Ru Zhang, Member,
More informationMission-Aware Placement of RF-based Power Transmitters in Wireless Sensor Networks
Msson-Aware Placement of RF-based Power Transmtters n Wreless Sensor Networks Melke Erol-Kantarc, Member, IEEE and Hussen T. Mouftah, Fellow, IEEE School of Electrcal Engneerng and Computer Scence Unversty
More informationAsynchronous TDMA ad hoc networks: Scheduling and Performance
Asynchronous TDMA ad hoc networks: Schedulng and Performance Theodoros Salonds and Leandros Tassulas, Department of Electrcal and Computer Engneerng and Insttute of Systems Research Unversty of Maryland,
More informationExact Probabilistic Analysis of the Limited Scheduling Algorithm for Symmetrical Bluetooth Piconets
Exact Probablstc Analyss of the Lmted Schedulng Algorthm for Symmetrcal Bluetooth Pconets Gl Zussman *, Ur Yechal 2, and Adran Segall Department of Electrcal Engneerng Technon Israel Insttute of Technology,
More informationAn Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks
An Energy Effcent Herarchcal Clusterng Algorthm for Wreless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle School of Electrcal and Computer Engneerng Purdue Unversty West Lafayette, IN, USA {seema,
More informationA Benchmark for D2D in Cellular Networks: The Importance of Information
A Benchmark for D2D n Cellular Networks: The Importance of Informaton Yğt Özcan, Catherne Rosenberg Unversty of Waterloo {yozcan,cath}@uwaterloo.ca Fabrce Gullemn Orange Labs, France fabrce.gullemn@orange.com
More informationAdaptive Avatar Handoff in the Cloudlet Network
Adaptve Avatar Handoff n the Cloudlet Network 2018 IEEE. Personal use of ths materal s permtted. Permsson from IEEE must be obtaned for all other uses, n any current or future meda, ncludng reprntng/republshng
More informationPerformance Evaluation of QoS Parameters in Dynamic Spectrum Sharing for Heterogeneous Wireless Communication Networks
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 1, No 2, January 2012 ISSN (Onlne): 1694-0814 www.ijcsi.org 81 Performance Evaluaton of QoS Parameters n Dynamc Spectrum Sharng for Heterogeneous
More informationCharacterization and Analysis of Multi-Hop Wireless MIMO Network Throughput
Characterzaton and Analyss of Mult-Hop Wreless MIMO Network Throughput Bechr Hamdaou EECS Dept., Unversty of Mchgan 226 Hayward Ave, Ann Arbor, Mchgan, USA hamdaou@eecs.umch.edu Kang G. Shn EECS Dept.,
More informationC. G. Cassandras and Y. Geng
BUILDING A CYBER-PHYSICAL INFRASTRUCTURE FOR THE SMART CITY: THE CASE OF SMART PARKING C. G. Cassandras and Y. Geng Dvson of Systems Engneerng Dept. of Electrcal and Computer Engneerng Center for Informaton
More informationDecomposition Principles and Online Learning in Cross-Layer Optimization for Delay-Sensitive Applications
Techncal Report Decomposton Prncples and Onlne Learnng n Cross-Layer Optmzaton for Delay-Senstve Applcatons Abstract In ths report, we propose a general cross-layer optmzaton framework n whch we explctly
More informationLow Complexity Duty Cycle Control with Joint Delay and Energy Efficiency for Beacon-enabled IEEE Wireless Sensor Networks
Low Complexty Duty Cycle Control wth Jont Delay and Energy Effcency for Beacon-enabled IEEE 8254 Wreless Sensor Networks Yun L Kok Keong Cha Yue Chen Jonathan Loo School of Electronc Engneerng and Computer
More informationarxiv: v2 [cs.gt] 19 May 2017
Inter-Operator Resource Management for Mllmeter Wave, Mult-Hop Backhaul Networks Omd Semar, Wald Saad, Mehd Benns, and Zaher Dawy Wreless@VT, Bradley Department of Electrcal and Computer Engneerng, Vrgna
More informationPRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION. Evgeny Artyomov and Orly Yadid-Pecht
68 Internatonal Journal "Informaton Theores & Applcatons" Vol.11 PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION Evgeny Artyomov and Orly
More information