BP-P2P: Belief Propagation-Based Trust and Reputation Management for P2P Networks

Size: px
Start display at page:

Download "BP-P2P: Belief Propagation-Based Trust and Reputation Management for P2P Networks"

Transcription

1 1 9th Annul IEEE Communictions Society Conference on Sensor, Mesh nd Ad Hoc Communictions nd Networs (SECON) BP-PP: Belief Propgtion-Bsed Trust nd Reputtion Mngement for PP Networs Ermn Aydy School of Electricl nd Comp. Eng. Georgi Institute of Technology Atlnt, GA 333, USA Emil: Frmrz Feri School of Electricl nd Comp. Eng. Georgi Institute of Technology Atlnt, GA 333, USA Emil: Abstrct In this pper, for the first time, we introduce Belief Propgtion (BP)-bsed distributed trust nd reputtion mngement lgorithm. The proposed lgorithm cn be utilized in mny distributed systems from Peer-to-peer (PP) networs to socil nd mesh networs. In this wor, we focus on PP networs nd explore the ppliction of BP-bsed trust nd reputtion mngement in decentrlized environment in the presence of mlicious peers. In typicl PP trust nd reputtion mngement system, fter ech trnsction, the client peer (who receives service) provides its rting bout the qulity of the service provided by the server peer for tht trnsction. In such system, we view the problem of trust nd reputtion mngement s to compute two sets of vribles: 1. the reputtion prmeters of peers bsed on their qulity of service, nd. the trustworthiness prmeters of peers bsed on the rtings they provide fter ech trnsction. We distinguish between these two prmeters s peer might provide high qulity service s server while providing mlicious rtings s client. The proposed scheme, referred to s BP-PP, relies on the BP lgorithm in n ppropritely chosen fctor grph representtion of the PP networ. The reputtion nd trustworthiness prmeters re computed by BPbsed distributed messge pssing lgorithm between the peers on the fctor grph. We provide detiled evlution of BP- PP vi nlysis nd computer simultions. We show tht BP- PP is very robust in computing trustworthiness vlues nd filtering out mlicious rtings. Specificlly, we prove tht BP-PP itertively reduces the error in the reputtion vlues of peers due to the mlicious rtings with high probbility. Further, comprison of BP-PP with some well-nown nd commonly used PP reputtion mngement techniques (e.g., EigenTrust nd Byesin Frmewor) indictes the superiority of the proposed scheme in terms of robustness ginst mlicious behvior. We lso show tht the computtionl complexity of BP-PP grows only linerly with the number of peers nd the communiction overhed of BP-PP is lower thn the well-nown EigenTrust lgorithm. I. INTRODUCTION Peer-to-peer (PP) networs [1] re commonly defined s distributed rchitectures in which the worlod is prtitioned between the peers nd ech peer is eqully privileged. As opposed to trditionl client-server networing (in which certin peers re responsible for providing resources while other peers only consume), every peer plys the role of both client nd server in the PP networs []. In other words, ech peer provides ccess to its resources (e.g., processing power, storge) s server without the need for centrl uthority. PP networs hve especilly becme populr s distributed file shring systems in which peers exchnge files between ech other (such s Gnutell or Npster). Due to their size nd the distributed rchitecture, PP systems re highly vulnerble to ttcs by the mlicious peers. The most common ttc to PP systems is in the form of inecting inuthentic files (or introducing viruses) to the networ. This mteril is bsed upon wor supported by the Ntionl Science Foundtion under Grnt No. IIS , nd gift from the Cisco University Reserch Progrm Fund, n dvised fund of Silicon Vlley Community Foundtion. Mlicious behvior in PP networs is minly confronted by utilizing trust nd reputtion mngement systems in which peers (s clients) get to rte the peers (cting s servers) bsed on the qulity of the trnsctions. A trust nd reputtion mngement mechnism is promising method to protect the client peer by forming some foresight bout the server peers before using their resources. Using distributed trust nd reputtion mngement mechnism, reputtion vlues of the servers nd the trustworthiness vlues of the clients (on their rtings) cn be computed by the peers without needing centrl uthority. As result of this, mlicious behvior cn be detected nd honest behvior cn be encourged in the networ. However, this rting mechnism puts the server peers in vulnerble position s the mlicious peers my undermine (or boost) the reputtion vlues of certin peers by providing incorrect rtings. Hence, building resilient trust nd reputtion mngement system tht is robust ginst mlicious ctivities becomes chllenging issue. Despite recent dvnces in trust nd reputtion mngement in PP networs, there is yet need to develop relible, sclble nd dependble schemes tht would lso be resilient to vrious wys distributed trust nd reputtion system cn be ttced. In this pper we introduce the first ppliction of the Belief Propgtion (BP), n itertive probbilistic lgorithm, in the design nd evlution of distributed trust nd reputtion mngement systems. Belief Propgtion [3], [4] is messge pssing lgorithm for performing inference on grphicl models. It is method for computing mrginl distributions of the unobserved nodes conditioned on the observed ones. BP hs demonstrted empiricl success in numerous pplictions including decoding of LDPC codes [5], recommender nd reputtion systems [6] [8] nd d-hoc networs [9]. In our previous wor, we developed the generl theory of BP-bsed reputtion mngement lgorithms for centrlized environments [1]. However, in distributed infrstructure, trust nd reputtion mngement is more complicted thn in the centrlized solutions. Hence, using the bsic theory in our previous wor [1], in this pper, we focus on PP networs nd explore the ppliction of BP-bsed trust nd reputtion mngement in decentrlized environment in the presence of mlicious peers. We note tht the proposed lgorithm cn lso be utilized in vrious distributed systems such s mesh nd socil networs. In mesh networs, the proposed lgorithm cn be used to evlute the types nd behviors of the nodes, while in socil networs, it cn be used to evlute the behviors nd trustworthiness vlues of the peers. We introduce the Belief Propgtion-Bsed Trust nd Reputtion Mngement for PP Networs (herefter referred to s BP-PP). Our obective is to compute both the reputtion vlues of the peers s servers nd their trustworthiness vlues s clients (bsed on the rtings they provide for the servers). We view this problem s n inference problem which involves computing /1/$31. 1 IEEE 578

2 the mrginl probbility distributions of the reputtion vlues from the globl oint probbility distribution function of mny vribles. This problem, however, cnnot be solved directly in lrge-scle system, becuse the number of terms grow exponentilly with the number of peers in the networ. The ey role of the BP lgorithm is tht we cn use it to compute those mrginl distributions in the complexity tht grows only linerly with the number of peers. BP-PP describes the PP networ on fctor grph; llowing the peers to compute the reputtion nd trustworthiness vlues by distributed messge pssing between ech other. The min contributions of our wor re summrized in the following. 1) We introduce the first ppliction of the Belief Propgtion (BP) lgorithm in the design nd evlution of distributed trust nd reputtion mngement systems for PP networs. We introduce grph-bsed mechnism which relies on fctor grph to compute the reputtion of ech peer (s server) nd its trustworthiness vlue (s client) by BP-bsed itertive nd distributed messge pssing lgorithm. ) The proposed distributed lgorithm enbles the peers to compute the reputtion vlues (of other peers) with smll error in the presence of ttcers. Further, it lso llows the peers to obtin the trustworthiness vlues (of other peers) by nlyzing the rtings provided, which enbles them detect nd filter out mlicious rtings effectively. 3) The computtionl complexity of BP-PP is t most liner in the number of peers in the networ, ming it very ttrctive for lrge-scle systems. Further, its communiction overhed is lower thn the well-nown EigenTrust lgorithm which is prticulrly designed for PP networs. 4) The proposed BP-PP outperforms the existing nd commonly used PP reputtion mngement techniques such s the EigenTrust lgorithm [11] nd the Byesin Approch [1] (which is lso proposed s the reputtion mngement system of the well-nown CONFIDANT protocol [13]) in the presence of ttcers. The rest of this pper is orgnized s follows. In the rest of this section, we summrize the relted wor. In Section II, we describe the proposed BP-PP in detil. Next, in Section III, we nlyze BP-PP using mthemticl model for the peers. Further, we evlute BP-PP vi computer simultions nd compre BP-PP with the existing nd commonly used PP reputtion mngement schemes. Finlly, in Section IV, we conclude the pper. A. Relted Wor nd Their Shortcomings Trust nd reputtion mngement systems for PP networs nd online systems received lot of ttention [11], [1], [14] [1]. In [14] nd [15], uthors provide good survey of the wor on the use of trust nd reputtion mngement systems for PP networs. Most proposed PP trust nd reputtion mngement mechnisms utilize the ide tht peer cn monitor others nd obtin direct observtions [16] or peer cn enquire bout the reputtion vlue of nother peer (nd hence, obtin indirect observtions) before using the service provided by tht peer [17], [18]. EigenTrust [11] is one of the most populr reputtion mngement lgorithms for PP networs. However, the EigenTrust lgorithm is constrined by the fct tht trustworthiness of peer (on its feedbc) is equivlent to its reputtion vlue. However, trusting peer s feedbc nd trusting peer s service qulity re two different concepts. As we will discuss in Section III-A, mlicious peer, by providing incorrect or mlicious rtings, my ttc the reputtion mngement system while providing high qulity service. In other words, node my hve high reputtion but low trustworthiness vlue. Thus, equting the two will ffect the performnce of the reputtion mngement. Further, the EigenTrust lgorithm relies on the presence of pre-trusted peers in the networ which is either imprcticl or limiting in most networs. Most importntly, the EigenTrust lgorithm computes the globl reputtion vlues by simple itertive weighted verging mechnism which is vulnerble to collbortive ttcs from the mlicious peers. Use of the Byesin Frmewor is lso proposed in [13]. In the Byesin Frmewor, ech reputtion vlue is computed independent of the other nodes reputtion vlues. However, the rtings provided by the nodes induce probbility distribution on the reputtion vlues. These distributions re correlted becuse they re induced by the overlpping set of nodes. Therefore, ignoring these dependencies could ffect the performnce drmticlly. The strength of BP-PP stems from the fct tht it cptures this correltion in nlyzing the rtings nd computing the trust nd reputtion vlues. Different from the existing schemes, BP- PP lgorithm is grph bsed itertive lgorithm motivted by the previous success on messge pssing techniques nd BP lgorithms on vrious pplictions such s inference nd decoding error correcting codes. II. BELIEF PROPAGATION-BASED TRUST AND REPUTATION MANAGEMENT FOR PP NETWORKS We ssume two different sets in the system: i) the set of servers, S nd ii) the set of clients, U. We further ssume tht every peer in the networ plys the role of both client nd server. In other words, ech peer provides ccess to its resources (e.g., provides files) s server. On the other hnd, ech peer lso uses the resources of other servers s client. Therefore, sets S nd U re not disoint nd ech peer i is represented both in set S (s server) nd in set U (s client). Trnsctions occur between the servers nd clients, nd clients provide feedbcs in the form of rtings bout servers fter ech trnsction (bsed on the service qulity of the trnsction). First, for the simplicity nd clrity of the presenttion, we will describe the fundmentl scheme ssuming tht ech peer computes its own reputtion vlue (s server) nd trustworthiness vlue (s client) vi distributed messge pssing nd report these vlues to other peers when they re queried. However, this fundmentl scheme is not completely secure s mlicious peers my report incorrect vlues for their own reputtion nd trustworthiness vlues upon n inquiry. Then, in Section II-A, we will describe how we me this scheme completely secure by llowing different groups of peers (referred s the score mngers) to compute the reputtion nd trustworthiness vlues of individul peers. Let G be the reputtion vlue of server ( S) ndt i be the rting tht client i (i U) reports bout server ( S), whenever trnsction is completed between the two peers. Moreover, let R i denote the trustworthiness of the peer i (i U) s client. In other words, R i represents the mount of confidence on the correctness of ny rting provided by client i. We ssume there re u clients nd s servers in the system (i.e., U = u nd S = s) 1.LetG = {G : S} nd R = {R i : i U} be the collection of vribles representing the reputtions of the servers nd the trustworthiness vlues of the clients, respectively. Further, let T be the s u serverclient mtrix tht stores the rting vlues (T i ), nd T i be the set of rtings provided by client i. We consider slotted time 1 Since ech peer is both server nd client, u = s in typicl PP networ. 579

3 throughout this discussion. At ech time-slot (or epoch), BP- PP lgorithm is executed using the input prmeters T nd the present R to obtin the reputtion prmeters nd the updted trustworthiness vlues t ech peer. We note tht ech peer hs only prt of the input prmeters bsed on its previous trnsctions. More specificlly, we ssume tht every peer i nows the rtings it previously provided s client (i.e., T i )nd the set of servers for whom it provided these rtings. Moreover, every peer i nows the rtings it previously received from other peers s server nd the set of clients who provided these rtings (similr to [11]). After BP-PP completes its itertions, ech peer computes its new reputtion vlue s server s well s its updted trustworthiness vlue s client. For simplicity of presenttion, we ssume tht the rting vlues re from the set Υ={, 1}. The extension in which rting vlues cn te ny rel number cn be developed similrly. The reputtion mngement problem cn be viewed s finding the mrginl probbility distributions of ech vrible in G, given the observed dt (i.e., evidence). There re s mrginl probbility functions, p(g T, R), ech of which is ssocited with vrible G ; the reputtion vlue of server. We formulte the problem by considering the globl function p(g T, R), which is the oint probbility distribution function of the vribles in G given the rting mtrix nd the trustworthiness vlues of the clients. Then, clerly, ech mrginl probbility function p(g T, R) my be obtined s follows: p(g T, R) = p(g T, R), (1) G\{G } where G\{G } implies ll vribles in G except G. Unfortuntely, the number of terms in (1) grows exponentilly with the number of vribles, ming the computtion infesible for lrge-scle systems. Further, (1) cn only be solved in centrlized environment in which ll the evidence T nd R is vilble t centrl unit. On the other hnd, PP networs re typiclly distributed environments, nd hence, solving (1) t ech peer is not fesible in such networs in which ech peer hs only prt of the evidence. Thus, we propose to fctorize (1) to locl functions f i using fctor grph nd utilize the Belief Propgtion (BP) lgorithm to clculte the mrginl probbility distributions in liner complexity nd in distributed environment. A fctor grph is biprtite grph contining two sets of nodes (corresponding to vribles nd fctors) nd edges incident between two sets. Following [4], we form fctor grph by setting vrible node for ech vrible G, fctor node for ech function f i, nd n edge connecting vrible node to the fctor node i if nd only if G is n rgument of f i. We note tht computing mrginl probbility functions is exct when the fctor grph hs no cycles. However, the BP lgorithm still gives good pproximte results for the fctor grphs with cycles. T m b Fig. 1: Setup of the scheme. First, we rrnge the collection of the clients nd the servers together with their ssocited reltions (i.e., the rtings) s fctor grph, s in Fig. 1. In this representtion, ech client corresponds to fctor node shown s squre nd ech server is represented by vrible node shown s hexgon in the grph. Ech rting is represented by n edge from the fctor node to the vrible node. Hence, if client i (i U) hs rting bout server ( S), we plce n edge with vlue T i from n c T nc the fctor node i to the vrible node representing server. We note tht if ny new rting rrives from client i bout server, thet i vlue is updted by verging the new rting nd the old vlue of the edge multiplied with the fding fctor γ i (t) =ϑ t ti (where ϑ nd t i re the fding prmeter nd the time when the lst trnsction between client i nd server occurred, respectively). Next, we suppose tht the globl function p(g T, R) fctors into products of severl locl functions, ech hving subset of vribles from G s rguments s follows : p(g T, R) = 1 f i (G i, T i,r i ), () Z i U where Z is the normliztion constnt nd G i is subset of G. Hence, in the grph representtion of Fig. 1, ech fctor node is ssocited with locl function nd ech locl function f i represents the probbility distributions of its rguments given the trustworthiness vlue nd the existing rtings of the ssocited client. We now introduce the messges between the fctor nd the vrible nodes (i.e., between the servers nd the clients) to compute the mrginl distributions t ech server using BP. To tht end, we describe the messge exchnge between peer (s client) nd peer (s server) in Fig. 1. We represent the set of neighbors of the vrible node (server) nd the fctor node (client) s N s nd Nc, respectively (neighbors of server re the set of clients who rted the server while neighbors of client re the servers whom it rted). Superscripts in the representtion of the neighbors denote whether the neighbors of peer re determined considering the peer s client (c) or s server (s). We note tht neighbors of peer s server (or vrible node) do not need to be the sme s its neighbors s client (or fctor note). We further let Ξ=N s \{} nd Δ=N c \{}. Fctor nd vrible nodes in Fig. 1 itertively exchnge probbilistic messges following the BP lgorithm, updting the degree of beliefs on the reputtion vlues of the servers s well s the trustworthiness vlues of the clients t ech step, until the itertions stop. Let G (ν) = {G (ν) : S} be the collection of vribles representing the vlues of the vrible nodes t the itertion ν of the lgorithm. We denote the messges from the vrible nodes to the fctor nodes nd from the fctor nodes to the vrible nodes s μ nd λ, respectively. The messge μ (ν) (G(ν) ) denotes the probbility of G (ν) = l, l {, 1}, ttheν th itertion. On the other hnd, λ (ν) (G(ν) ) denotes the probbility tht G (ν) = l, forl {, 1}, ttheν th itertion given T nd R. The messge from the fctor node to the vrible node t the ν th itertion is formed using the principles of the BP s λ (ν) (G(ν) )= f (G (ν), T,R (ν 1) ) μ (ν 1) x (G(ν) x ), G (ν) \{G(ν) } x Δ (3) where G is the set of vrible nodes which re the rguments of the locl function f t the fctor node. This messge trnsfer is illustrted in Fig.. Further, R (ν 1) (the trustworthiness of client clculted t the end of (ν 1) th itertion) is vlue between zero nd one nd cn be clculted s follows: R (ν 1) =1 1 N c i N c x {,1} T i x μ (ν 1) i (x). (4) The bove eqution cn be interpreted s one minus the verge inconsistency of client clculted by using the messges it It is shown tht such fctoriztion eventully gives the mrginl probbility distributions vi the BP lgorithm [4]. 58

4 received from ll its neighbors. The bove computtion must be performed for every neighbors of ech fctor nodes. This finishes the first hlf of the ν th itertion. During the second hlf, the vrible nodes (servers) generte their messges (μ) nd send to their neighbors. Vrible node forms μ (ν) (G(ν) ) by multiplying ll informtion it receives from its neighbors excluding the fctor node, sshownin Fig. 3. Hence, the messge from vrible node to the fctor node t the ν th itertion is given by μ (ν) (G(ν) )= 1 λ (ν) h {,1} i Ξ i (h) i Ξ λ (ν) i (G(ν) ). (5) This computtion is repeted for every neighbors of ech vrible node. The lgorithm proceeds to the next itertion in the sme wy s the ν th itertion. It is worth noting tht since ech peer is both server nd client, t the first hlf of the itertion, ech peer genertes messges s client nd in the second hlf of the itertion, ech peer genertes messges s server. Further, ech peer wits for ll the messges from its neighbors before it cretes its new messge either s client or s server. We note tht the itertive lgorithm strts its first itertion by computing λ (1) ) in (3). However, insted (G(1) of clculting in (4), the trustworthiness vlue R from the previous execution of BP-PP is used s initil vlues in (3). BP-PP stops fter Ψ itertions (which is pre-defined number nd its selection will be discussed in Section III-C). At the end of ech itertion, the reputtions re clculted t ech server. To clculte the reputtion vlue G (ν), ech ) using (5) but replcing Ξ with server computes μ (ν), nd then sets G(ν) (G (ν) N s = 1 i= iμ(ν) (i). Thus, fter the lst itertion (i.e., Ψ th itertion), ech server peer obtins its updted reputtion vlue nd ech client peer obtins its updted trustworthiness vlue. A. Secure BP-PP As we discussed before, the fundmentl scheme described in Section II is not completely secure since ech peer computes nd reports (upon n inquiry) its own reputtion nd trustworthiness vlues. However, it is cler tht mlicious peer would report its own reputtion nd trustworthiness vlues to other peers incorrectly. Therefore, we propose to use group of rndomly selected peers (referred s the score mngers) to do the messge exchnge, nd hence, compute the reputtion nd trustworthiness vlues on behlf of ech peer s in [11]. It is importnt to note tht the score mngers re not trustworthy peers nd they cn lso be mlicious s will be discussed lter. Similr to [11], to ssign score mngers, we use Distributed Hsh Tble (DHT) []. DHTs use hsh function to deterministiclly mp the unique ID of ech peer into the points in logicl coordinte spce. At ny time, the coordinte spce is prtitioned mong the peers in the PP networ such tht every peer covers region in the coordinte spce. Hence, score mnger(s) of n rbitrry peer i is determined by hshing the unique ID of peer i into point in the coordinte spce nd the peer which currently covers this point s prt of its DHT region is ppointed s the score mnger of peer i 3. Thus, ny peer cn esily determine the score mnger(s) of peer i from its unique ID. We ssume tht the DHT cn cope with the dynmics of the networ (e.g., score mngers leving the system) s in [11]. Since it is not the min contribution of this pper, we do not give further detil bout the selection of the 3 If peer i hs more thn one score mngers, the unique ID of peer i cn be conctented with n integer before hshing. score mngers. As we mentioned before, our min contribution is the computtion of trust nd reputtion vlues t the score mngers vi the BP-bsed lgorithm. Next, we show how we modify our fundmentl scheme such tht it cn be executed by score mngers. Using the DHT, ech peer is ssigned with ξ score mngers from the set H = {H 1,H,...,Hξ }. We ssume tht ech score mnger of peer nows: i) neighbors of peer s server (i.e., N s ), nd hence, the score mngers of these neighbors, ii) neighbors of peer s client (i.e., N c ), nd hence, the score mngers of these neighbors, iii) rtings previously provided by peer s client (i.e., T ), iv) rtings previously received by peer s server, nd v) trustworthiness vlue of peer s client computed t the previous execution of the lgorithm. The score mngers in H generte the BP messges on behlf of peer both s server (vrible node) nd s client (fctor node). Further, they compute the reputtion vlue (s server) nd the trustworthiness vlue (s client) of peer bsed on the messges they receive from the score mngers of peer s neighbors. We note tht since ech peer in the networ plys the role of both client nd server; ech score mnger lso hs the sme property. Therefore, t the first hlf of n itertion, ech score mnger genertes messges s client (fctor node) nd in the second hlf of the itertion, the sme score mnger genertes messges s server (vrible node) on behlf of the peer it is responsible for. From now on, for the clrity of presenttion, we refer to score mnger s client score mnger when it genertes messges s client, nd s server score mnger when it genertes messges s server. Thus, different from the fundmentl scheme described in Section II, BP messges re now exchnged between the client score mngers nd the server score mngers. Due to this chnge, the fctor grph in Fig. 1 is lso modified bsed on the score mngers of the peers. As n exmple, we illustrte the chnge in the connectivity of client in Fig. 4 ssuming ξ =3. As illustrted in the figure, insted of connecting client to the servers it rted (, b nd c), we connect the score mngers of peer to the score mngers of peers, b nd c in the fctor grph. Messges re exchnged between the score mngers of the peers following the principles of the BP lgorithm (s described in Section II) nd the lgorithm stops fter Ψ itertions (selection of Ψ will be discussed in Section III-C). We note tht every score mnger wits to receive ll messges from its neighbors before it genertes its new messge. Further, score mngers eep trc of the itertion numbers to both remin loosely synchronized between ech other nd relize when to stop the lgorithm. When client i wnts to use the service of server, it queries the reputtion vlue G from the score mngers of the peer. Similrly, the trustworthiness vlue of peer (s client) cn lso be queried from its score mngers. Once the client i receives ll the computed G vlues from ξ different score mngers in H, it computes the men of the received reputtion vlues to determine the finl reputtion vlue of server. There is one obvious drwbc of using score mngers for BP-PP lgorithm. When mlicious peer becomes the score mnger of relible or mlicious peer, it my crete nd send bogus messges to its neighbors. Therefore, mlicious messges my propgte in the BP lgorithm ffecting the efficiency of the lgorithm. We describe the ttc strtegies of such mlicious score mngers in Section III-A. Further, we evlute BP-PP under this ttc both nlyticlly nd vi simultions in Sections III-B nd III-C, respectively. 581

5 λ (v-1) μ b b μ λ m m (v-1) μ c peer s client (v-1) μ d λ n peer s server λi c Fig. : Messge from the fctor node (client) to the vrible node (server) t the ν th itertion. b c H 1 H 1 H H H H Fig. 4: Utilizing score mngers in BP-PP. B. Efficient BP-PP In this section, we provide some discussion on the computtionl complexity nd communiction overhed of BP-PP. 1) Computtionl Complexity: One cn show tht the computtionl complexity of BP-PP s mx(o ( ξc ), O ( ξv ) ) per peer in the number of multiplictions, where c nd v re smll numbers representing the verge number of rtings generted by client nd the verge number of rtings received by server. Therefore, the computtionl complexity of BP-PP is t most liner in the number of peers in the networ, ming it very ttrctive for lrge-scle systems. ) Communiction Overhed: In the fundmentl scheme described in Section II, ech client (nd ech server) sends different messges to ech of its neighbors t ech itertion. This introduces extr communiction overhed to the scheme when multiple score mngers re present for ech peer. Therefore, in the following, we modify the messges in (3) nd (5) between the peers (between the score mngers of the peers in the secure version described in Section II-A) to reduce the communiction overhed due to multiple score mngers for ech peer. Before discussing these modifictions in the messges between the score mngers, we first pproximte nd simplify the messge in (3) by ssuming tht the rguments of locl function t fctor node re independent from ech other (to reduce the computtionl complexity t the client peers). Using this ssumption, it cn be shown tht λ (ν) (G(ν) ) p(g (ν) T,R (ν 1) ), where p(g (ν) [ (R (ν 1) [ 1 R (ν 1) T,R (ν 1) )= + 1 R(ν 1) T +(R (ν 1) )T + 1 ] R(ν 1) (1 T ) G (ν) R(ν 1) H 3 H 3 d H b Hc ] )(1 T ) (1 G (ν) ). (6) This resembles the belief/pleusbility concept of the Dempster- Shfer Theory [3], [4]. Given T = 1, R (ν 1) cn be n Fig. 3: Messge from the vrible node (server) to the fctor node (client) t the ν th itertion. viewed s the belief of the client tht G (ν) is one (t the ν th itertion). In other words, in the eyes of client, G (ν) is equl to one with probbility R (ν 1). Thus, (1 R (ν 1) ) corresponds to the uncertinty in the belief of client. Inorder to remove this uncertinty nd express p(g (ν) T,R (ν 1) ) s the probbilities tht G (ν) is zero nd one, we distribute the uncertinty uniformly between two outcomes (one nd zero). Hence, in the eyes of the client, G (ν) is equl to one with probbility (R (ν 1) +(1 R (ν 1) )/), nd zero with probbility ((1 R (ν 1) )/). We note tht similr sttement holds for the cse when T =. It is worth noting tht, s opposed to the Dempster-Shfer Theory, we do not combine the beliefs of the clients. Insted, we consider the belief of ech client individully nd clculte probbilities tht G (ν) being one nd zero in the eyes of ech client s in (6). We now describe how we modify the BP messges in (6) nd (5) to reduce the communiction overhed cused by multiple score mngers per ech peer. Let H be the set of score mngers of peer (in the secure version described in Section II-A). In principl, t ech itertion, we let ech score mnger H i in H brodcst single messge to ll of its neighbors insted of sending different messges to ech of its neighbors. Then, ech neighbor of the score mnger H i computes the ctul BP messge in (6) or (5) using the brodcsted messge (from H i ) nd the informtion it lredy possesses. In the following, we discuss the detils of this. Let H N c denote the set of score mngers of neighbors of client. Insted of computing (6) for ll its neighbors seprtely, ech client score mnger in H (in the secure version) only computes nd brodcsts the updted trustworthiness vlue of the client to its neighbors in H N c insted of sending different messges to ech of its neighbors. Since the score mngers in H N c now the rting vlue given by client to the servers they re responsible for, ech score mnger in H N c computes the ctul messge itself. For exmple, since the score mngers of server now T, they compute the messge in (6) by only using the brodcsted R (ν 1) vlue. Similrly, ll messges from server score mnger (H)to its neighbors (in H N s ) my be communicted simultneously vi single brodcst step to decrese the communiction overhed. The messge from H to one of its neighbors i in H N s is formed by multiplying ll the messges received t H excluding the one received from the score mnger i (similr to (5)). Thus, H cn simply brodcst the multipliction of ll received messges to its neighbors, nd llow i (nd ll other neighbors) to deduce the ctul messge from this brodcst. Therefore, t ech itertion, server score mnger brodcsts single messge insted of sending different messges to ech of its neighbors. i 58

6 We note tht we used these modified messge formts for the evlution of BP-PP (in Section III). Let Ψ be the totl number of itertions required for single execution of the lgorithm nd ξ be the number of score mngers for ech peer. Then, ech score mnger sends (on the verge) ξψ messges during the execution of the BP-PP lgorithm (Ψ 1 s will be discussed in Section III-C). On the other hnd, in EigenTrust [11] ech score mnger sends (on the verge) mx(o ( ξψc ), O ( ξψv ) ) messges during the lgorithm, where c nd v represent the verge number of rtings generted by client nd the verge number of rtings received by server. Further, Ψ is reported to be (on the verge) 1 for EigenTrust [11]. Therefore, we conclude tht the proposed BP-bsed lgorithm does not introduce significnt communiction overhed to the networ. III. SECURITY EVALUATION In order to fcilitte future references, frequently used nottions re listed in Tble I. S The set of peers cting s servers U M The set of mlicious clients U R The set of non-mlicious clients H i The set of score mngers of peer i r m Rting given by mlicious client d Totl number of newly generted rtings, per time-slot, per non-mlicious client b Totl number of newly generted rtings, per time-slot, per mlicious client TABLE I: Nottions nd definitions. A. Thret Model We minly focus on the mlicious behviors of the clients nd score mngers nd explore their impct on the proposed trust nd reputtion mngement lgorithm. 1) Mlicious Clients: There re two mor ttcs tht re common for ny trust nd reputtion mngement mechnisms: i) Bd-mouthing, in which mlicious clients ttc the servers with the highest reputtion by giving low rtings in order to undermine them, nd ii) Bllot-stuffing, in which mlicious clients try to increse the reputtion vlues of servers with low reputtions. Further, there re opportunities for the mlicious score mngers to ttc specificlly to the BP lgorithm by creting incorrect BP messges. In the following, we describe how we modeled the dversry considering the forementioned threts to evlute BP-PP in the most dverse environment. We ssumed tht the mlicious clients initite bdmouthing 4. Further, ll the mlicious clients collude nd ttc the sme subset Γ of servers in ech time-slot (which represents the strongest ttc), by rting those servers s r m = (ssuming the rting vlues re either or 1). In other words, we denote by Γ the set of size b in which every victim server hs one edge from ech of the mlicious clients (in the fctor grph in Fig. 1). The subset Γ is chosen to include those servers who hve the highest reputtion vlues but received the lowest number of rtings from the non-mlicious clients (ssuming tht the ttcers hve this informtion 5 ). We note tht this ttc scenrio lso represents the RepTrp ttc in [5] which is shown to be strong ttc. To the dvntge of mlicious peers, we ssumed tht totl of T time-slots hd pssed since the initiliztion of the networ nd frction of the existing peers chnge behvior nd become mlicious fter T time-slots. In other words, mlicious clients behved lie non-mlicious clients nd incresed their trustworthiness vlues 4 Even though we use the bd-mouthing ttc, similr counterprt results hold for bllot-stuffing nd combintions of bd-mouthing nd bllot-stuffing. 5 Although it my pper unrelistic for some pplictions, vilbility of such informtion for the mlicious clients would imply the worst cse scenrio. before mounting their ttcs t the (T +1) th time-slot. We will evlute the performnce for the time-slot (T +1). ) Mlicious Score Mngers: As we discussed in Section II-A score mngers of n rbitrry peer i generte the BP messges on behlf of the peer i (both s server nd s client). Therefore, mlicious score mngers of peer my crete nd send incorrect messges to their neighbors. By doing so, mlicious score mngers specificlly ttc the ccurcy of the BP lgorithm. When mlicious peer is the score mnger of peer i (i.e., H i ) it cretes bogus BP messges depending on the type of peer i s below: If i is non-mlicious peer: When cretes messge s server score mnger on behlf of peer i, it reports n incorrect vlue for the = l (l {, 1}) t every itertion ν (e.g., if normlly G (ν) i =1with high probbility, cretes messge reporting tht G (ν) i =with probbility of 1 ϱ, whereϱ is positive number close to zero). When cretes messge s client score mnger on behlf of peer i, it reports low trustworthiness vlue for peer i s client (e.g., reports the probbility of G (ν) i trustworthiness vlue of peer i s R (ν) i = σ t every itertion ν, whereσ is positive number close to zero). If i is mlicious peer: When cretes messge s server score mnger on behlf of peer i, it reports high vlue for the probbility of G (ν) i =1t every itertion ν to fvor its lly (e.g., cretes messge reporting tht G (ν) i =1 with probbility of 1 ϱ, whereϱ is positive number close to zero). When cretes messge s client score mnger on behlf of peer i, it reports high trustworthiness vlue for the mlicious peer i s client (e.g., reports the trustworthiness vlue of peer i s R (ν) i = 1 σ t every itertion ν,whereσ is positive number close to zero). We note tht since the score mngers of the peers re ssigned vi DHT, we ssume tht mlicious score mngers do not collborte. We considered the bove thret models for both our nlyticl evlution nd simultions. B. Anlyticl Evlution We dopted the following models for vrious peers involved in the PP trust nd reputtion mngement system. We cnowledge tht lthough the models re not inclusive of every scenrio, they re good illustrtions to present our results. We ssumed tht the service qulity of ech server remins unchnged during our evlution. Moreover, the rting vlues re either or 1 where 1 represents good service qulity (e.g., providing uthentic files). Rtings generted by the non-mlicious clients re distributed uniformly mong the servers (i.e., their rtings/edges in the grph representtion re distributed uniformly mong the servers). We wish to evlute the performnce for the time-slot (T +1) t which mlicious peers chnge behvior nd initite their ttcs s discussed in Section III-A. The performnce of reputtion mngement mechnism is determined by its ccurcy of estimting the reputtion vlues of the servers. Therefore, we evlute BP-PP in terms of the Men Absolute Error (MAE) ( G Ĝ ) computed t ech non-mlicious score mnger of every server, whereĝ is 583

7 the ctul vlue of the reputtion of server. We require two conditions to be stisfied: 1) the scheme should itertively reduce the impct of mlicious peers nd decrese the error in the reputtion vlues of the servers (computed t the nonmlicious score mngers) until the itertions stop, nd ) the error on the G vlue of ech server (computed t the nonmlicious score mngers) should be less thn or equl to ɛ (where ɛ should be smll vlue) fter the lst itertion (i.e., Ψ th itertion). In the following, we obtined the conditions nd probbilities to rrive t such scheme. We note tht lthough the discussions of the nlysis re bsed on RepTrp ttc vi bd-mouthing (s described in Section III-A), the system designed using these criteri will be robust ginst bllot-stuffing nd combintions of bd-mouthing nd bllotstuffing s well. The bd-mouthing ttc is imed to reduce the reputtion vlues of the victim servers. Hence, G vlue of victim server (computed t the non-mlicious score mngers in set H ) should be non-decresing function of itertions. This leds to the below lemm. Lemm 1: The error in the reputtion vlues of the servers decreses with ech successive itertions (until the itertions stop) if G () >G (1) is stisfied with high probbility t the non-mlicious score mngers of peer (H U R )forevery server ( S) with Ĝ =1 6. Proof: Let G (ω) nd G (ω+1) be the reputtion vlue of n rbitrry server with Ĝ =1clculted t the (ω) th nd (ω +1) th itertions t the non-mlicious score mngers of peer (H U R ), respectively. Further, let H R N denote the s set of score mngers of non-mlicious neighbors of server (i.e., N s U R)ndH M N denote the set of score mngers of s mlicious neighbors of server (i.e., N s U M ). G (ω+1) if the following is stisfied t the (ω +1) th itertion. G (ω) H R N s UR H R N s UR R (w+1) +1 1 R (w+1) R (w) +1 1 R (w) ˆR (w) H M N s UR H M N s UR (w+1) ˆR (w+1) ˆR (w) ˆR (w) ˆR > >, (7) where R (w) nd re the trustworthiness vlues of relible nd mlicious client clculted t non-mlicious score mnger (s in (4)) t the w th itertion, respectively. Given G (ω) >G (ω 1) holds t the ω th itertion, we would (w) (w+1) get ˆR > ˆR for H M N U s R nd R (w+1) R (w) for H R N U R. Thus, (7) would hold for the (w+1) th itertion. s On the other hnd, if G (ω) <G (ω 1),weget ˆR(w) (w+1) < ˆR for H M N U s R nd R (w+1) <R (w) for H R N U R. s Hence, (7) is not stisfied t the (w +1) th itertion. Therefore, if G (ω) > G (ω 1) holds for some itertion ω t the peers in H U R, then the BP-PP lgorithm reduces the error on the reputtion vlue (G ) until the itertions stop, nd hence, it is sufficient to stisfy G () > G (1) with high probbility t the non-mlicious score mngers of every server with Ĝ =1(the set of servers from which the victims re ten) to gurntee tht BP-PP itertively reduces the impct of mlicious clients t the non-mlicious score mngers until the itertions stop. 6 The opposite must hold for ny server with ˆ G =. Although becuse of the Lemm 1, the error in the reputtion vlues of the servers decrese with successive itertions, it is uncler wht would be the eventul impct of the mlicious peers. Once the condition in Lemm 1 is met nd ssuming Ψ be the totl number of itertions required for single execution of the BP-PP lgorithm, the probbility (P ) tht BP-PP provides n MAE tht is less thn ɛ for ech server t every non-mlicious score mngers cn be obtined s in (8). In ˆR (Ψ+1) (8), R (Ψ+1) nd re the trustworthiness vlues of relible nd mlicious client clculted t non-mlicious score mnger, respectively. Further, R(Ψ+1) is the trustworthiness vlue of mlicious client clculted t mlicious score mnger. In the following exmple, we illustrte the results of our nlyticl evlution. The prmeters we used re U M + U R = 1, S = 1, ϑ =.9, T =, b =1, ϱ = σ =.1, ξ = 3, nd Ψ = 1 (selection of Ψ will be discussed in Section III-C). Further, we ssumed tht d is rndom vrible with Yule-Simon distribution, which resembles the power-lw distribution used in modeling PP nd online systems [6], with the probbility mss function f d (d; ρ) = ρb(d, ρ +1) (with ρ = 1), where B is the Bet function. Finlly, we ssumed the thret model described in Section III-A. We note tht we lso evluted BP-PP with different prmeters nd obtined similr results. In Fig. 5, we illustrted the probbility of BP-PP providing MAE tht is less thn ɛ (t ech nonmlicious score mnger) versus frction of mlicious peers for two different ɛ vlues. We observed tht for n cceptble vlue of ɛ (ɛ =.1), BP-PP stisfies MAE <ɛwithhigh probbility for up to 3% mlicious peers. Moreover, Fig. 6 illustrtes the verge MAE vlues provided by BP-PP (t ech non-mlicious score mnger) with high probbility for different frctions of mlicious peers. We observed tht BP- PP provides significntly smll error vlues for up to 3% mlicious peers. We note tht these nlyticl results re lso consistent with our simultion results tht re illustrted in the next section. C. Simultions We evluted the performnce of BP-PP vi computer simultions (vi MATLAB) nd compred BP-PP with the Byesin reputtion mngement frmewor in [1] (which is lso proposed s the reputtion mngement system of the well-nown CONFIDANT protocol [13]) nd the EigenTrust lgorithm [11] in distributed PP networ environment. We ssumed tht d is rndom vrible with Yule-Simon distribution (with ρ =1) s discussed in Section III-B. We set T =, b =1, ρ =1, U = 1, S = 1, ϱ = σ =.1, ξ = 3, nd the fding prmeter s ϑ =.9 7.Further,we ssumed tht rting vlues re from the set Υ={, 1}. Finlly, we ssumed the thret model described in Section III-A in which there re both mlicious clients nd mlicious score mngers. Let Ĝ be the ctul reputtion vlue of server. We obtined the performnce of BP-PP, t ech time-slot, s the Men Absolute Error (MAE) G Ĝ, verged over the reputtion vlues of ll victim servers (i.e., the servers tht re under ttc) computed t their non-mlicious score mngers. For the Byesin frmewor [1], we used the prmeters from the originl wor [1] (devition threshold d =.5 nd trustworthiness threshold t =.75). Further, in fvor of the Byesin frmewor, we ssumed tht ech peer hve ccess to the server-client mtrix T. Therefore, we observed the reputtion vlues computed t ll non-mlicious peers nd 7 We note tht for the EigenTrust nd the Byesin frmewor we used the sme fding mechnism s BP-PP nd set the fding prmeter s ϑ =

8 P = { Pr ɛ 1 S (R (Ψ+1) H R N s UR 1 +1) H M N s UR H R N s UR (R (Ψ+1) (1 (Ψ+1) +1) (1 ˆR ) (1 H M N s UR H M N s UM (Ψ+1) (1 R )+ (1 R (Ψ+1) ) (1 + (Ψ+1) ˆR ) H M N s UM H R N s UR H M N s UR R (Ψ+1) ) (Ψ+1) ˆR ) H M N s UM (1 + R (Ψ+1) ) } (8) Pr(MAE < ε) ε =.1 ε = % mlicious peers Fig. 5: Probbility of MAE being less thn ɛ versus frction of mlicious peers. we verged the MAE over the reputtion vlues of the victim servers. For the EigenTrust, we implemented the distributed lgorithm described in [11] (with ξ =3score mngers for ech peer s in BP-PP) nd observed the reputtion vlues computed t the non-mlicious score mngers s we did for BP-PP. We note tht we did not ssume the existence of the pre-trusted peers for ny schemes. First, we determined the totl number of itertions (Ψ) required for the BP-PP lgorithm. Thus, in Fig. 7 8, we observed the verge number of required itertions for BP- PP to converge t ech peer (i.e., computed reputtion vlues stop chnging) for different frctions of mlicious peers (W = U M U M + U R ), t different time-slots (mesured since the ttc is pplied). We conclude tht the verge number of itertions for convergence is lwys less thn 1 nd it decreses with time nd decresing frction of mlicious peers. Thus, we used Ψ=1for the remining of this section. Then, we evluted the MAE performnce of BP-PP for different frctions of mlicious peers (W ), t different time-slots in Fig. 8. We observed tht BP-PP provides significntly low errors for up to bout W = 5% mlicious peers. Next, we observed the chnge in the verge trustworthiness (R i vlues) of mlicious clients computed t the non-mlicious score mngers. Figure 9 illustrtes the drop in the trustworthiness of the mlicious clients with time. We conclude tht the R i vlues of the mlicious clients (computed t non-mlicious score mngers) decrese over time, nd hence, the impct of their mlicious rtings is neutrlized over time. Finlly, we compred the MAE performnce of BP-PP with the Byesin Frmewor nd the EigenTrust lgorithm. Figure 1 illustrtes the comprison of BP-PP with these schemes for different frctions of mlicious peers t the first time-slot the ttc is pplied. It is cler tht BP-PP outperforms the Byesin Frmewor nd EigenTrust significntly. We note tht t lter time-slots, BP-PP still eeps its superiority over the other schemes. From this comprison, we conclude tht in EigenTrust, even the non-mlicious score mngers compute the reputtion vlues with lrge MAE in the presence of the ttcers. Further, when the mlicious nodes collbortively ttc, Byesin Frmewor results in 8 The plots in Figs. 7, 8 nd 9 re shown from the time-slot the dversry introduced its ttc. Averge(log 1 MAE) % mlicious peers Fig. 6: The verge MAE versus frction of mlicious peers. high MAE in the reputtion vlues of the servers. Finlly, we observed the impct of ξ (the number of score mngers for ech peer) to the performnce of BP-PP under the sme ttc scenrio (in which there re both mlicious clients nd mlicious score mngers s described in Section III-A). In Fig. 11, we illustrted MAE performnce of BP-PP for different vlues of ξ nd for different frctions of mlicious peers t the first time-slot the ttc is pplied. As expected, for smll vlues of ξ (i.e., ξ =1nd ξ =), BP-PP provides higher MAE vlues since the probbility tht ll score mngers of victim client being mlicious increses with decresing vlues of ξ. Next, we simulted the sme ttc scenrio when rtings re integers from the set Υ = {1,...,5} insted of binry vlues 9. Mlicious clients choose the victim servers from Γ nd rte them s r m = 4. The mlicious clients do not devite very much from the ctul Ĝ =5vlues to remin undercover s mny time-slots s possible. We lso tried higher devitions from the Ĝ vlue nd observed tht the mlicious clients were esily detected by BP-PP. We compred the MAE performnce of BP-PP with the other schemes t the first timeslot the ttc is pplied in Fig. 1 nd observed tht BP-PP outperforms ll the other techniques. We observed tht BP-PP provides significntly low MAE for up to W = 5% mlicious clients. We further observed tht the Byesin Frmewor performs better thn EigenTrust for this scenrio. IV. CONCLUSION In this pper, we introduced the first ppliction of the Belief Propgtion lgorithm in the design nd evlution of distributed trust nd reputtion mngement systems for PP networs. We presented the generl protocol for Belief Propgtion-Bsed Trust nd Reputtion Mngement for PP Networs (BP-PP). BP-PP is grph-bsed system in which the reputtion nd trustworthiness vlue of ech peer is computed by distributed messge pssing mong the peers in the grph. We studied BP-PP in detiled nlysis nd computer simultions. We showed tht proposed BP-PP is robust mechnism to evlute the reputtion vlues of the peers 9 For the ttc ginst the BP lgorithm, we ssumed similr scenrio to the binry cse s discussed in Section III-A. 585

9 Number of itertions W=5% W=1% W=15% W=% W=5% W=3% time slot Fig. 7: The verge number of itertions versus time for BP-PP to converge when W of the existing peers become mlicious. MAE BP PP EigenTrust Byesin Frmewor % mlicious peers Fig. 1: MAE performnce of vrious schemes when different frctions of the existing peers become mlicious t the first time-slot the ttc is pplied. from the received rtings. Moreover, it effectively evlutes the trustworthiness of the peers (in the relibility of their rtings). We lso compred BP-PP with some well-nown PP reputtion mngement schemes nd showed the superiority of the proposed scheme in terms of its robustness ginst mlicious behvior. Finlly, we showed tht the computtionl complexity of the proposed scheme grows only linerly with the number of peers in the networ while its communiction overhed is lower tht the well-nown EigenTrust lgorithm. REFERENCES [1] B. Fn, J. C. S. Lui, nd D.-M. Chiu, The design trde-offs of bittorrentlie file shring protocols, IEEE/ACM Trnsctions on Networing, vol. 17, pp , April 9. [] M. Adler, R. Kumr, K. Ross, D. Rubenstein, T. Suel, nd D. D. Yo, Optiml peer selection for pp downloding nd streming, In Proceedings of IEEE INFOCOM 5, 5. [3] J. Perl, Probbilistic Resoning in Intelligent Systems: Networs of Plusible Inference. Morgn Kufmnn Publishers, Inc., [4] F. Kschischng, B. Frey, nd H. A. Loeliger, Fctor grphs nd the sumproduct lgorithm, IEEE Trnsctions on Informtion Theory, vol. 47, pp , Feb. 1. [5] B. N. Vellmbi nd F. Feri, Results on the improved decoding lgorithm for low-density prity-chec codes over the binry ersure chnnel, IEEE Trnsctions on Informtion Theory, vol. 53, no. 4, pp , April 7. [6] E. Aydy nd F. Feri, A belief propgtion bsed recommender system for online services, Proceedings of the fourth ACM conference on Recommender systems, pp. 17, 1. [7] E. Aydy, H. Lee, nd F. Feri, An itertive lgorithm for trust nd reputtion mngement, ISIT 9: Proceedings of IEEE Interntionl Symposium on Informtion Theory, 9. [8] E. Aydy nd F. Feri, BP-ITRM: belief propgtion for itertive trust nd reputtion mngement, Proceedings of ISIT 11: IEEE Interntionl Symposium on Informtion Theory, 11. [9], An itertive lgorithm for trust mngement nd dversry detection for dely tolernt networs, To pper in IEEE Trnsctions on Mobile Computing, 1. [1], Belief propgtion bsed itertive trust nd reputtion mngement, IEEE Trnsctions on Dependble nd Secure Computing, vol.9, no. 3, pp , 1. [11] S. D. Kmvr, M. T. Schlosser, nd H. Grci-Molin, The eigentrust lgorithm for reputtion mngement in PP networs, WWW 3: Proceedings of the 1th Interntionl Conference on World Wide Web, pp , 3. MAE W=5% W=1% W=15% W=% W=5% W=3% time slot Fig. 8: MAE performnce of BP-PP versus time when W of the existing peers become mlicious. MAE W=5% W=1% W=15% W=% W=5% W=3% ξ Fig. 11: MAE performnce of BP-PP for different vlues of ξ nd for different frctions of mlicious peers t the first time-slot the ttc is pplied. Averge trustworthiness of mlicious peers W=5% W=1% W=15% W=% W=5% W=3% time slot Fig. 9: Chnge in verge trustworthiness of mlicious clients versus time for BP- PP when W of the existing peers become mlicious. MAE BP PP EigenTrust Byesin Frmewor % mlicious peers Fig. 1: MAE performnce of vrious schemes when the rting vlues re from Υ={1,...,5}. [1] S. Buchegger nd J. Boudec, A robust reputtion system for pp nd mobile d-hoc networs, Proceedings of the Second Worshop on the Economics of Peer-to-Peer Systems, 4. [13], Performnce nlysis of CONFIDANT protocol (coorpertion of nodes: Firness in dynmic d-hoc networs), Proceedings of IEEE/ACM Symposium on Mobile Ad Hoc Networing nd Computing (MobiHOC), Jun.. [14] P. Resnic, R. Zechuser, E. Friedmn, nd K. Kuwbr, Reputtion systems: fcilitting trust in internet interctions, Communictions of the ACM, vol. 43, no. 1, pp ,. [15] A. Jøsng, R. Ismil, nd C. Boyd, A survey of trust nd reputtion systems for online service provision, Decision Support Systems, vol. 43, no., pp , 7. [16] K. Aberer nd Z. Despotovic, Mnging trust in peer--peer informtion system, CIKM 1: Proceedings of the 1th Interntionl Conference on Informtion nd nowledge mngement, pp , 1. [17] F. Cornelli, E. Dmini, S. D. C. di Vimercti, S. Prboschi, nd P. Smrti, Choosing reputble servents in PP networ, WWW : Proceedings of the 11th Interntionl Conference on World Wide Web, pp ,. [18] E. Dmini, D. C. di Vimercti, S. Prboschi, P. Smrti, nd F. Violnte, A reputtion-bsed pproch for choosing relible resources in peer-to-peer networs, CCS : Proceedings of the 9th ACM Conference on Computer nd Communictions Security, pp. 7 16,. [19] C. Dellrocs, Immunizing online reputtion reporting systems ginst unfir rtings nd discrimintory behvior, EC : Proceedings of the nd ACM conference on Electronic commerce, pp ,. [] G. Wng nd J. Wu, Flowtrust: trust inference with networ flows, Frontiers of Computer Science in Chin, vol. 5, no., pp , 11. [1] Y. Zhng nd Y. Fng, A fine-grined reputtion system for relible service selection in peer-to-peer networs, IEEE Trnsctions on Prllel nd Distributed Systems, vol. 18, no. 8, pp , 7. [] I. Stoic, R. Morris, D. Krger, M. F. Kshoe, nd H. Blrishnn, Chord: A sclble peer-to-peer looup service for internet pplictions, SIGCOMM 1: Proceedings of the 1 Conference on Applictions, Technologies, Architectures, nd Protocols for Computer Communictions, pp , 1. [3] G. Shfer, A Mthemticl Theory of Evidence. Princeton University Press, Princeton, N.J., [4], The dempster-shfer theory, Encyclopedi of Artificil Intelligence, 199. [5] Y. Yng, Q. Feng, Y. L. Sun, nd Y. Di, RepTrp: novel ttc on feedbc-bsed reputtion systems, SecureComm 8: Proceedings of the 4th Interntionl Conference on Security nd Privcy in Communiction Networs, pp. 1 11, 8. [6] F. Slnin nd Y. C. Zhng, Referee networs nd their spectrl properties, Act Physic Polonic B, vol. 36, pp , Sep

BP-P2P: Belief Propagation-Based Trust and Reputation Management for P2P Networks

BP-P2P: Belief Propagation-Based Trust and Reputation Management for P2P Networks BP-PP: Belief Propgtion-Bsed Trust nd Reputtion Mngement for PP Networs Ermn Aydy School of Electricl nd Comp. Eng. Georgi Institute of Technology Atlnt, GA 333, USA Emil: eydy@gtech.edu Frmrz Feri School

More information

Interference Cancellation Method without Feedback Amount for Three Users Interference Channel

Interference Cancellation Method without Feedback Amount for Three Users Interference Channel Open Access Librry Journl 07, Volume, e57 ISSN Online: -97 ISSN Print: -9705 Interference Cncelltion Method without Feedbc Amount for Three Users Interference Chnnel Xini Tin, otin Zhng, Wenie Ji School

More information

Y9.ET1.3 Implementation of Secure Energy Management against Cyber/physical Attacks for FREEDM System

Y9.ET1.3 Implementation of Secure Energy Management against Cyber/physical Attacks for FREEDM System Y9.ET1.3 Implementtion of Secure Energy ngement ginst Cyber/physicl Attcks for FREED System Project Leder: Fculty: Students: Dr. Bruce cillin Dr. o-yuen Chow Jie Dun 1. Project Gols Develop resilient cyber-physicl

More information

Algorithms for Memory Hierarchies Lecture 14

Algorithms for Memory Hierarchies Lecture 14 Algorithms for emory Hierrchies Lecture 4 Lecturer: Nodri Sitchinv Scribe: ichel Hmnn Prllelism nd Cche Obliviousness The combintion of prllelism nd cche obliviousness is n ongoing topic of reserch, in

More information

Energy Harvesting Two-Way Channels With Decoding and Processing Costs

Energy Harvesting Two-Way Channels With Decoding and Processing Costs IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING, VOL., NO., MARCH 07 3 Energy Hrvesting Two-Wy Chnnels With Decoding nd Processing Costs Ahmed Arf, Student Member, IEEE, Abdulrhmn Bknin, Student

More information

A Slot-Asynchronous MAC Protocol Design for Blind Rendezvous in Cognitive Radio Networks

A Slot-Asynchronous MAC Protocol Design for Blind Rendezvous in Cognitive Radio Networks Globecom 04 - Wireless Networking Symposium A Slot-Asynchronous MAC Protocol Design for Blind Rendezvous in Cognitive Rdio Networks Xingy Liu nd Jing Xie Deprtment of Electricl nd Computer Engineering

More information

Synchronous Machine Parameter Measurement

Synchronous Machine Parameter Measurement Synchronous Mchine Prmeter Mesurement 1 Synchronous Mchine Prmeter Mesurement Introduction Wound field synchronous mchines re mostly used for power genertion but lso re well suited for motor pplictions

More information

CHAPTER 2 LITERATURE STUDY

CHAPTER 2 LITERATURE STUDY CHAPTER LITERATURE STUDY. Introduction Multipliction involves two bsic opertions: the genertion of the prtil products nd their ccumultion. Therefore, there re two possible wys to speed up the multipliction:

More information

Synchronous Machine Parameter Measurement

Synchronous Machine Parameter Measurement Synchronous Mchine Prmeter Mesurement 1 Synchronous Mchine Prmeter Mesurement Introduction Wound field synchronous mchines re mostly used for power genertion but lso re well suited for motor pplictions

More information

MAXIMUM FLOWS IN FUZZY NETWORKS WITH FUNNEL-SHAPED NODES

MAXIMUM FLOWS IN FUZZY NETWORKS WITH FUNNEL-SHAPED NODES MAXIMUM FLOWS IN FUZZY NETWORKS WITH FUNNEL-SHAPED NODES Romn V. Tyshchuk Informtion Systems Deprtment, AMI corportion, Donetsk, Ukrine E-mil: rt_science@hotmil.com 1 INTRODUCTION During the considertion

More information

Exercise 1-1. The Sine Wave EXERCISE OBJECTIVE DISCUSSION OUTLINE. Relationship between a rotating phasor and a sine wave DISCUSSION

Exercise 1-1. The Sine Wave EXERCISE OBJECTIVE DISCUSSION OUTLINE. Relationship between a rotating phasor and a sine wave DISCUSSION Exercise 1-1 The Sine Wve EXERCISE OBJECTIVE When you hve completed this exercise, you will be fmilir with the notion of sine wve nd how it cn be expressed s phsor rotting round the center of circle. You

More information

Example. Check that the Jacobian of the transformation to spherical coordinates is

Example. Check that the Jacobian of the transformation to spherical coordinates is lss, given on Feb 3, 2, for Mth 3, Winter 2 Recll tht the fctor which ppers in chnge of vrible formul when integrting is the Jcobin, which is the determinnt of mtrix of first order prtil derivtives. Exmple.

More information

Adaptive Network Coding for Wireless Access Networks

Adaptive Network Coding for Wireless Access Networks Adptive Network Coding for Wireless Access Networks Tun Trn School of Electricl Engineering nd Computer Science Oregon Stte University, Corvllis, Oregon 9733 Emil: trntu@eecs.orst.edu Thinh Nguyen School

More information

Multi-beam antennas in a broadband wireless access system

Multi-beam antennas in a broadband wireless access system Multi-em ntenns in rodnd wireless ccess system Ulrik Engström, Mrtin Johnsson, nders Derneryd nd jörn Johnnisson ntenn Reserch Center Ericsson Reserch Ericsson SE-4 84 Mölndl Sweden E-mil: ulrik.engstrom@ericsson.com,

More information

Information-Coupled Turbo Codes for LTE Systems

Information-Coupled Turbo Codes for LTE Systems Informtion-Coupled Turbo Codes for LTE Systems Lei Yng, Yixun Xie, Xiowei Wu, Jinhong Yun, Xingqing Cheng nd Lei Wn rxiv:709.06774v [cs.it] 20 Sep 207 Abstrct We propose new clss of informtion-coupled

More information

The Discussion of this exercise covers the following points:

The Discussion of this exercise covers the following points: Exercise 4 Bttery Chrging Methods EXERCISE OBJECTIVE When you hve completed this exercise, you will be fmilir with the different chrging methods nd chrge-control techniques commonly used when chrging Ni-MI

More information

METHOD OF LOCATION USING SIGNALS OF UNKNOWN ORIGIN. Inventor: Brian L. Baskin

METHOD OF LOCATION USING SIGNALS OF UNKNOWN ORIGIN. Inventor: Brian L. Baskin METHOD OF LOCATION USING SIGNALS OF UNKNOWN ORIGIN Inventor: Brin L. Bskin 1 ABSTRACT The present invention encompsses method of loction comprising: using plurlity of signl trnsceivers to receive one or

More information

Postprint. This is the accepted version of a paper presented at IEEE PES General Meeting.

Postprint.   This is the accepted version of a paper presented at IEEE PES General Meeting. http://www.div-portl.org Postprint This is the ccepted version of pper presented t IEEE PES Generl Meeting. Cittion for the originl published pper: Mhmood, F., Hooshyr, H., Vnfretti, L. (217) Sensitivity

More information

Engineer-to-Engineer Note

Engineer-to-Engineer Note Engineer-to-Engineer Note EE-297 Technicl notes on using Anlog Devices DSPs, processors nd development tools Visit our Web resources http://www.nlog.com/ee-notes nd http://www.nlog.com/processors or e-mil

More information

(CATALYST GROUP) B"sic Electric"l Engineering

(CATALYST GROUP) Bsic Electricl Engineering (CATALYST GROUP) B"sic Electric"l Engineering 1. Kirchhoff s current l"w st"tes th"t (") net current flow "t the junction is positive (b) Hebr"ic sum of the currents meeting "t the junction is zero (c)

More information

ABB STOTZ-KONTAKT. ABB i-bus EIB Current Module SM/S Intelligent Installation Systems. User Manual SM/S In = 16 A AC Un = 230 V AC

ABB STOTZ-KONTAKT. ABB i-bus EIB Current Module SM/S Intelligent Installation Systems. User Manual SM/S In = 16 A AC Un = 230 V AC User Mnul ntelligent nstlltion Systems A B 1 2 3 4 5 6 7 8 30 ma 30 ma n = AC Un = 230 V AC 30 ma 9 10 11 12 C ABB STOTZ-KONTAKT Appliction Softwre Current Vlue Threshold/1 Contents Pge 1 Device Chrcteristics...

More information

Dataflow Language Model. DataFlow Models. Applications of Dataflow. Dataflow Languages. Kahn process networks. A Kahn Process (1)

Dataflow Language Model. DataFlow Models. Applications of Dataflow. Dataflow Languages. Kahn process networks. A Kahn Process (1) The slides contin revisited mterils from: Peter Mrwedel, TU Dortmund Lothr Thiele, ETH Zurich Frnk Vhid, University of liforni, Riverside Dtflow Lnguge Model Drsticlly different wy of looking t computtion:

More information

Study on SLT calibration method of 2-port waveguide DUT

Study on SLT calibration method of 2-port waveguide DUT Interntionl Conference on Advnced Electronic cience nd Technology (AET 206) tudy on LT clibrtion method of 2-port wveguide DUT Wenqing Luo, Anyong Hu, Ki Liu nd Xi Chen chool of Electronics nd Informtion

More information

Redundancy Data Elimination Scheme Based on Stitching Technique in Image Senor Networks

Redundancy Data Elimination Scheme Based on Stitching Technique in Image Senor Networks Sensors & Trnsducers 204 by IFSA Publishing, S. L. http://www.sensorsportl.com Redundncy Dt Elimintion Scheme Bsed on Stitching Technique in Imge Senor Networks hunling Tng hongqing Technology nd Business

More information

Module 9. DC Machines. Version 2 EE IIT, Kharagpur

Module 9. DC Machines. Version 2 EE IIT, Kharagpur Module 9 DC Mchines Version EE IIT, Khrgpur esson 40 osses, Efficiency nd Testing of D.C. Mchines Version EE IIT, Khrgpur Contents 40 osses, efficiency nd testing of D.C. mchines (esson-40) 4 40.1 Gols

More information

Section 16.3 Double Integrals over General Regions

Section 16.3 Double Integrals over General Regions Section 6.3 Double Integrls over Generl egions Not ever region is rectngle In the lst two sections we considered the problem of integrting function of two vribles over rectngle. This sitution however is

More information

A New Stochastic Inner Product Core Design for Digital FIR Filters

A New Stochastic Inner Product Core Design for Digital FIR Filters MATEC Web of Conferences, (7) DOI:./ mtecconf/7 CSCC 7 A New Stochstic Inner Product Core Design for Digitl FIR Filters Ming Ming Wong,, M. L. Dennis Wong, Cishen Zhng, nd Ismt Hijzin Fculty of Engineering,

More information

A Cluster-based TDMA System for Inter-Vehicle Communications *

A Cluster-based TDMA System for Inter-Vehicle Communications * JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 30, 213-231 (2014) A Cluster-bsed TDMA System for Inter-Vehicle Communictions * Deprtment of Electricl Engineering Ntionl Sun Yt-Sen University Kohsiung,

More information

DYE SOLUBILITY IN SUPERCRITICAL CARBON DIOXIDE FLUID

DYE SOLUBILITY IN SUPERCRITICAL CARBON DIOXIDE FLUID THERMAL SCIENCE, Yer 2015, Vol. 19, No. 4, pp. 1311-1315 1311 DYE SOLUBILITY IN SUPERCRITICAL CARBON DIOXIDE FLUID by Jun YAN, Li-Jiu ZHENG *, Bing DU, Yong-Fng QIAN, nd Fng YE Lioning Provincil Key Lbortory

More information

A Development of Earthing-Resistance-Estimation Instrument

A Development of Earthing-Resistance-Estimation Instrument A Development of Erthing-Resistnce-Estimtion Instrument HITOSHI KIJIMA Abstrct: - Whenever erth construction work is done, the implnted number nd depth of electrodes hve to be estimted in order to obtin

More information

Understanding Basic Analog Ideal Op Amps

Understanding Basic Analog Ideal Op Amps Appliction Report SLAA068A - April 2000 Understnding Bsic Anlog Idel Op Amps Ron Mncini Mixed Signl Products ABSTRACT This ppliction report develops the equtions for the idel opertionl mplifier (op mp).

More information

On the Prediction of EPON Traffic Using Polynomial Fitting in Optical Network Units

On the Prediction of EPON Traffic Using Polynomial Fitting in Optical Network Units On the Prediction of EP Trffic Using Polynomil Fitting in Opticl Networ Units I. Mmounis (1),(3), K. Yinnopoulos (2), G. Ppdimitriou (4), E. Vrvrigos (1),(3) (1) Computer Technology Institute nd Press

More information

Demand response for aggregated residential consumers with energy storage sharing

Demand response for aggregated residential consumers with energy storage sharing 21 IEEE 4th Annul Conference on Decision nd Control (CDC December 1-18, 21. Os, Jpn Demnd response for ggregted residentil consumers with energy storge shring Kveh Pridri, Alessndr Prisio, Henri Sndberg

More information

Experiment 3: Non-Ideal Operational Amplifiers

Experiment 3: Non-Ideal Operational Amplifiers Experiment 3: Non-Idel Opertionl Amplifiers Fll 2009 Equivlent Circuits The bsic ssumptions for n idel opertionl mplifier re n infinite differentil gin ( d ), n infinite input resistnce (R i ), zero output

More information

Foot-Pedal: Haptic Feedback Human Interface Bridging Sensational Gap between Remote Places

Foot-Pedal: Haptic Feedback Human Interface Bridging Sensational Gap between Remote Places Foot-Pedl: Hptic Feedbck Humn Interfce Bridging Senstionl Gp between Remote Plces Mincheol Kim 1, De-Keun Yoon 2, Shin-Young Kim 1, Ji-Hi Cho 1, Kwng-Kyu Lee 1, Bum-Je You 1,3 1 Center of Humn-centered

More information

Jamming-Resistant Collaborative Broadcast In Wireless Networks, Part II: Multihop Networks

Jamming-Resistant Collaborative Broadcast In Wireless Networks, Part II: Multihop Networks Jmming-Resistnt ollbortive Brodcst In Wireless Networks, Prt II: Multihop Networks Ling Xio Ximen University, hin 361005 Emil: lxio@xmu.edu.cn Huiyu Di N Stte University, Rleigh, N 27695 Emil: huiyu di@ncsu.edu

More information

Fuzzy Logic Controller for Three Phase PWM AC-DC Converter

Fuzzy Logic Controller for Three Phase PWM AC-DC Converter Journl of Electrotechnology, Electricl Engineering nd Mngement (2017) Vol. 1, Number 1 Clusius Scientific Press, Cnd Fuzzy Logic Controller for Three Phse PWM AC-DC Converter Min Muhmmd Kml1,, Husn Ali2,b

More information

Simulation of Transformer Based Z-Source Inverter to Obtain High Voltage Boost Ability

Simulation of Transformer Based Z-Source Inverter to Obtain High Voltage Boost Ability Interntionl Journl of cience, Engineering nd Technology Reserch (IJETR), olume 4, Issue 1, October 15 imultion of Trnsformer Bsed Z-ource Inverter to Obtin High oltge Boost Ability A.hnmugpriy 1, M.Ishwry

More information

Experiment 3: Non-Ideal Operational Amplifiers

Experiment 3: Non-Ideal Operational Amplifiers Experiment 3: Non-Idel Opertionl Amplifiers 9/11/06 Equivlent Circuits The bsic ssumptions for n idel opertionl mplifier re n infinite differentil gin ( d ), n infinite input resistnce (R i ), zero output

More information

Kyushu Institute of Technology

Kyushu Institute of Technology Title: Integrted Rescue Service Stellite (IRS-St) Primry Point of Contct (POC): Mohmed Ibrhim Co-uthors: Btsuren Amglnbt, Puline Fure, Kevin Chou Orgniztion:, 1-1 Sensui, Tobt, Kitkyushu 804-8550, Jpn

More information

LECTURE 9: QUADRATIC RESIDUES AND THE LAW OF QUADRATIC RECIPROCITY

LECTURE 9: QUADRATIC RESIDUES AND THE LAW OF QUADRATIC RECIPROCITY LECTURE 9: QUADRATIC RESIDUES AND THE LAW OF QUADRATIC RECIPROCITY 1. Bsic roerties of qudrtic residues We now investigte residues with secil roerties of lgebric tye. Definition 1.1. (i) When (, m) 1 nd

More information

First Round Solutions Grades 4, 5, and 6

First Round Solutions Grades 4, 5, and 6 First Round Solutions Grdes 4, 5, nd 1) There re four bsic rectngles not mde up of smller ones There re three more rectngles mde up of two smller ones ech, two rectngles mde up of three smller ones ech,

More information

CSI-SF: Estimating Wireless Channel State Using CSI Sampling & Fusion

CSI-SF: Estimating Wireless Channel State Using CSI Sampling & Fusion CSI-SF: Estimting Wireless Chnnel Stte Using CSI Smpling & Fusion Riccrdo Crepldi, Jeongkeun Lee, Rul Etkin, Sung-Ju Lee, Robin Krvets University of Illinois t Urbn-Chmpign Hewlett-Pckrd Lbortories Emil:{rcrepl,rhk}@illinoisedu,

More information

CS 135: Computer Architecture I. Boolean Algebra. Basic Logic Gates

CS 135: Computer Architecture I. Boolean Algebra. Basic Logic Gates Bsic Logic Gtes : Computer Architecture I Boolen Algebr Instructor: Prof. Bhgi Nrhri Dept. of Computer Science Course URL: www.ses.gwu.edu/~bhgiweb/cs35/ Digitl Logic Circuits We sw how we cn build the

More information

Application of Wavelet De-noising in Vibration Torque Measurement

Application of Wavelet De-noising in Vibration Torque Measurement IJCSI Interntionl Journl of Computer Science Issues, Vol. 9, Issue 5, No 3, September 01 www.ijcsi.org 9 Appliction of Wvelet De-noising in Vibrtion orque Mesurement Ho Zho 1 1 Jixing University, Jixing,

More information

Multipath Mitigation for Bridge Deformation Monitoring

Multipath Mitigation for Bridge Deformation Monitoring Journl of Globl Positioning Systems (22) Vol. 1, No. 1: 25-33 Multipth Mitigtion for Bridge Deformtion Monitoring G. W. Roberts, X. Meng, A. H. Dodson, E. Cosser Institute of Engineering Surveying nd Spce

More information

Spiral Tilings with C-curves

Spiral Tilings with C-curves Spirl Tilings with -curves Using ombintorics to Augment Trdition hris K. Plmer 19 North Albny Avenue hicgo, Illinois, 0 chris@shdowfolds.com www.shdowfolds.com Abstrct Spirl tilings used by rtisns through

More information

Soft switched DC-DC PWM Converters

Soft switched DC-DC PWM Converters Soft switched DC-DC PWM Converters Mr.M. Prthp Rju (), Dr. A. Jy Lkshmi () Abstrct This pper presents n upgrded soft switching technique- zero current trnsition (ZCT), which gives better turn off chrcteristics

More information

Geometric quantities for polar curves

Geometric quantities for polar curves Roerto s Notes on Integrl Clculus Chpter 5: Bsic pplictions of integrtion Section 10 Geometric quntities for polr curves Wht you need to know lredy: How to use integrls to compute res nd lengths of regions

More information

9.4. ; 65. A family of curves has polar equations. ; 66. The astronomer Giovanni Cassini ( ) studied the family of curves with polar equations

9.4. ; 65. A family of curves has polar equations. ; 66. The astronomer Giovanni Cassini ( ) studied the family of curves with polar equations 54 CHAPTER 9 PARAMETRIC EQUATINS AND PLAR CRDINATES 49. r, 5. r sin 3, 5 54 Find the points on the given curve where the tngent line is horizontl or verticl. 5. r 3 cos 5. r e 53. r cos 54. r sin 55. Show

More information

EXIT CHARTS FOR TURBO RECEIVERS IN MIMO SYSTEMS

EXIT CHARTS FOR TURBO RECEIVERS IN MIMO SYSTEMS EXIT CHATS FO TUBO ECEIVES IN MIMO SYSTEMS Césr Hermosill Universidd Técnic Federico Snt Mrí Vlpríso, Chile hermosil@inrs-telecomuquebecc Leszek Szczeciński Institut Ntionl de l echerche Scientifique-EMT

More information

Domination and Independence on Square Chessboard

Domination and Independence on Square Chessboard Engineering nd Technology Journl Vol. 5, Prt, No. 1, 017 A.A. Omrn Deprtment of Mthemtics, College of Eduction for Pure Science, University of bylon, bylon, Irq pure.hmed.omrn@uobby lon.edu.iq Domintion

More information

A Novel Back EMF Zero Crossing Detection of Brushless DC Motor Based on PWM

A Novel Back EMF Zero Crossing Detection of Brushless DC Motor Based on PWM A ovel Bck EMF Zero Crossing Detection of Brushless DC Motor Bsed on PWM Zhu Bo-peng Wei Hi-feng School of Electricl nd Informtion, Jingsu niversity of Science nd Technology, Zhenjing 1003 Chin) Abstrct:

More information

Network Sharing and its Energy Benefits: a Study of European Mobile Network Operators

Network Sharing and its Energy Benefits: a Study of European Mobile Network Operators Network Shring nd its Energy Benefits: Study of Europen Mobile Network Opertors Mrco Ajmone Mrsn Electronics nd Telecommunictions Dept Politecnico di Torino, nd Institute IMDEA Networks, mrco.jmone@polito.it

More information

MATH 118 PROBLEM SET 6

MATH 118 PROBLEM SET 6 MATH 118 PROBLEM SET 6 WASEEM LUTFI, GABRIEL MATSON, AND AMY PIRCHER Section 1 #16: Show tht if is qudrtic residue modulo m, nd b 1 (mod m, then b is lso qudrtic residue Then rove tht the roduct of the

More information

Soft-decision Viterbi Decoding with Diversity Combining. T.Sakai, K.Kobayashi, S.Kubota, M.Morikura, S.Kato

Soft-decision Viterbi Decoding with Diversity Combining. T.Sakai, K.Kobayashi, S.Kubota, M.Morikura, S.Kato Softdecision Viterbi Decoding with Diversity Combining T.Ski, K.Kobyshi, S.Kubot, M.Morikur, S.Kto NTT Rdio Communiction Systems Lbortories 2356 Tke, Yokosukshi, Kngw, 2383 Jpn ABSTRACT Diversity combining

More information

April 9, 2000 DIS chapter 10 CHAPTER 3 : INTEGRATED PROCESSOR-LEVEL ARCHITECTURES FOR REAL-TIME DIGITAL SIGNAL PROCESSING

April 9, 2000 DIS chapter 10 CHAPTER 3 : INTEGRATED PROCESSOR-LEVEL ARCHITECTURES FOR REAL-TIME DIGITAL SIGNAL PROCESSING April 9, 2000 DIS chpter 0 CHAPTE 3 : INTEGATED POCESSO-LEVEL ACHITECTUES FO EAL-TIME DIGITAL SIGNAL POCESSING April 9, 2000 DIS chpter 3.. INTODUCTION The purpose of this chpter is twofold. Firstly, bsic

More information

4110 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 66, NO. 5, MAY 2017

4110 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 66, NO. 5, MAY 2017 40 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 66, NO. 5, MAY 07 Trnsmit Power Control for DD-Underlid Cellulr Networs Bsed on Sttisticl Fetures Peng Sun, Kng G. Shin, Life Fellow, IEEE, Hilin Zhng,

More information

Simultaneous Adversarial Multi-Robot Learning

Simultaneous Adversarial Multi-Robot Learning Simultneous Adversril Multi-Robot Lerning Michel Bowling nd Mnuel Veloso Computer Science Deprtment Crnegie Mellon University Pittsburgh PA, 15213-3891 Abstrct Multi-robot lerning fces ll of the chllenges

More information

& Y Connected resistors, Light emitting diode.

& Y Connected resistors, Light emitting diode. & Y Connected resistors, Light emitting diode. Experiment # 02 Ojectives: To get some hndson experience with the physicl instruments. To investigte the equivlent resistors, nd Y connected resistors, nd

More information

Kirchhoff s Rules. Kirchhoff s Laws. Kirchhoff s Rules. Kirchhoff s Laws. Practice. Understanding SPH4UW. Kirchhoff s Voltage Rule (KVR):

Kirchhoff s Rules. Kirchhoff s Laws. Kirchhoff s Rules. Kirchhoff s Laws. Practice. Understanding SPH4UW. Kirchhoff s Voltage Rule (KVR): SPH4UW Kirchhoff s ules Kirchhoff s oltge ule (K): Sum of voltge drops round loop is zero. Kirchhoff s Lws Kirchhoff s Current ule (KC): Current going in equls current coming out. Kirchhoff s ules etween

More information

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad Hll Ticket No Question Pper Code: AEC009 INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigl, Hyderd - 500 043 MODEL QUESTION PAPER Four Yer B.Tech V Semester End Exmintions, Novemer - 2018 Regultions:

More information

University of North Carolina-Charlotte Department of Electrical and Computer Engineering ECGR 4143/5195 Electrical Machinery Fall 2009

University of North Carolina-Charlotte Department of Electrical and Computer Engineering ECGR 4143/5195 Electrical Machinery Fall 2009 Problem 1: Using DC Mchine University o North Crolin-Chrlotte Deprtment o Electricl nd Computer Engineering ECGR 4143/5195 Electricl Mchinery Fll 2009 Problem Set 4 Due: Thursdy October 8 Suggested Reding:

More information

Adaptive VoIP Smoothing of Pareto Traffic Based on Optimal E-Model Quality

Adaptive VoIP Smoothing of Pareto Traffic Based on Optimal E-Model Quality Adptive VoIP Smoothing of Preto Trffic Bsed on Optiml E-Model Qulity Shyh-Fng Hung 1, Eric Hsio-Kung Wu 2, nd Po-Chi Chng 3 1 Deprtment of Electricl Engineering, Ntionl Centrl University, Tiwn hsf@vplb.ee.ncu.edu.tw

More information

Joanna Towler, Roading Engineer, Professional Services, NZTA National Office Dave Bates, Operations Manager, NZTA National Office

Joanna Towler, Roading Engineer, Professional Services, NZTA National Office Dave Bates, Operations Manager, NZTA National Office . TECHNICA MEMOANDM To Cc repred By Endorsed By NZTA Network Mngement Consultnts nd Contrctors NZTA egionl Opertions Mngers nd Are Mngers Dve Btes, Opertions Mnger, NZTA Ntionl Office Jonn Towler, oding

More information

Synchronous Generator Line Synchronization

Synchronous Generator Line Synchronization Synchronous Genertor Line Synchroniztion 1 Synchronous Genertor Line Synchroniztion Introduction One issue in power genertion is synchronous genertor strting. Typiclly, synchronous genertor is connected

More information

Eliminating Non-Determinism During Test of High-Speed Source Synchronous Differential Buses

Eliminating Non-Determinism During Test of High-Speed Source Synchronous Differential Buses Eliminting Non-Determinism During of High-Speed Source Synchronous Differentil Buses Abstrct The t-speed functionl testing of deep sub-micron devices equipped with high-speed I/O ports nd the synchronous

More information

A Stochastic Geometry Approach to the Modeling of DSRC for Vehicular Safety Communication

A Stochastic Geometry Approach to the Modeling of DSRC for Vehicular Safety Communication A Stochstic Geometry Approch to the Modeling of DSRC for Vehiculr Sfety Communiction Zhen Tong, Student Member, IEEE, Hongsheng Lu 2, Mrtin Henggi, Fellow, IEEE, nd Christin Poellbuer 2, Senior Member,

More information

CS2204 DIGITAL LOGIC & STATE MACHINE DESIGN fall 2008

CS2204 DIGITAL LOGIC & STATE MACHINE DESIGN fall 2008 CS224 DIGITAL LOGIC & STATE MACHINE DESIGN fll 28 STAND ALONE XILINX PROJECT 2-TO- MULTIPLEXER. Gols : Lern how to develop stnd lone 2-to- multiplexer () Xilinx project during which the following re introduced

More information

Polar Coordinates. July 30, 2014

Polar Coordinates. July 30, 2014 Polr Coordintes July 3, 4 Sometimes it is more helpful to look t point in the xy-plne not in terms of how fr it is horizontlly nd verticlly (this would men looking t the Crtesin, or rectngulr, coordintes

More information

Lecture 20. Intro to line integrals. Dan Nichols MATH 233, Spring 2018 University of Massachusetts.

Lecture 20. Intro to line integrals. Dan Nichols MATH 233, Spring 2018 University of Massachusetts. Lecture 2 Intro to line integrls Dn Nichols nichols@mth.umss.edu MATH 233, Spring 218 University of Msschusetts April 12, 218 (2) onservtive vector fields We wnt to determine if F P (x, y), Q(x, y) is

More information

DNN-based Causal Voice Activity Detector

DNN-based Causal Voice Activity Detector D-bsed Cusl Voice Activity Detector Ivn J. Tshev Microsoft Reserch One Microsoft Wy, Redmond, WA 9851, USA ivntsh@microsoft.com Seyedmhdd Mirsmdi University of Texs t Dlls 8 West Cmpbell Rod, Richrdson,

More information

This is a repository copy of Effect of power state on absorption cross section of personal computer components.

This is a repository copy of Effect of power state on absorption cross section of personal computer components. This is repository copy of Effect of power stte on bsorption cross section of personl computer components. White Rose Reserch Online URL for this pper: http://eprints.whiterose.c.uk/10547/ Version: Accepted

More information

EET 438a Automatic Control Systems Technology Laboratory 5 Control of a Separately Excited DC Machine

EET 438a Automatic Control Systems Technology Laboratory 5 Control of a Separately Excited DC Machine EE 438 Automtic Control Systems echnology bortory 5 Control of Seprtely Excited DC Mchine Objective: Apply proportionl controller to n electromechnicl system nd observe the effects tht feedbck control

More information

Mixed CMOS PTL Adders

Mixed CMOS PTL Adders Anis do XXVI Congresso d SBC WCOMPA l I Workshop de Computção e Aplicções 14 20 de julho de 2006 Cmpo Grnde, MS Mixed CMOS PTL Adders Déor Mott, Reginldo d N. Tvres Engenhri em Sistems Digitis Universidde

More information

10.4 AREAS AND LENGTHS IN POLAR COORDINATES

10.4 AREAS AND LENGTHS IN POLAR COORDINATES 65 CHAPTER PARAMETRIC EQUATINS AND PLAR CRDINATES.4 AREAS AND LENGTHS IN PLAR CRDINATES In this section we develop the formul for the re of region whose oundry is given y polr eqution. We need to use the

More information

Solutions to exercise 1 in ETS052 Computer Communication

Solutions to exercise 1 in ETS052 Computer Communication Solutions to exercise in TS52 Computer Communiction 23 Septemer, 23 If it occupies millisecond = 3 seconds, then second is occupied y 3 = 3 its = kps. kps If it occupies 2 microseconds = 2 6 seconds, then

More information

Distributed two-hop proportional fair resource allocation in Long Term Evolution Advanced networks

Distributed two-hop proportional fair resource allocation in Long Term Evolution Advanced networks WIRELESS COMMUNICATIONS AND MOBILE COMPUTING Wirel. Commun. Mob. Comput. 2016; 16:264 278 Published online 12 August 2014 in Wiley Online Librry (wileyonlinelibrry.com)..2517 RESEARCH ARTICLE Distributed

More information

RSS based Localization of Sensor Nodes by Learning Movement Model

RSS based Localization of Sensor Nodes by Learning Movement Model RSS bsed Locliztion of Sensor Nodes by Lerning Movement Model 1 R.ARTHI, 2 P.DEVARAJ, 1 K.MURUGAN 1 Rmnujn Computing Centre, Ann University, Guindy, Chenni, Indi 2 Deprtment of Mthemtics, College of Engineering,

More information

Section 17.2: Line Integrals. 1 Objectives. 2 Assignments. 3 Maple Commands. 1. Compute line integrals in IR 2 and IR Read Section 17.

Section 17.2: Line Integrals. 1 Objectives. 2 Assignments. 3 Maple Commands. 1. Compute line integrals in IR 2 and IR Read Section 17. Section 7.: Line Integrls Objectives. ompute line integrls in IR nd IR 3. Assignments. Red Section 7.. Problems:,5,9,,3,7,,4 3. hllenge: 6,3,37 4. Red Section 7.3 3 Mple ommnds Mple cn ctully evlute line

More information

Temporal Secondary Access Opportunities for WLAN in Radar Bands

Temporal Secondary Access Opportunities for WLAN in Radar Bands The 4th Interntionl Symposium on Wireless Personl Multimedi Communictions WPMC'), Temporl Secondry Access Opportunities for WLAN in Rdr Bnds Miurel Tercero, Ki Won Sung, nd Jens Znder Wireless@KTH, Royl

More information

Address for Correspondence

Address for Correspondence Mrndn et l., Interntionl Journl of Advnced Engineering Technology E-ISSN 0976-3945 Reserch Pper A LATTICE REDUCTION-AIDED INFORMATION PRECODER FOR MULTIUSER COMMUNICATION SYSTEM S. Mrndn, N. Venteswrn

More information

B inary classification refers to the categorization of data

B inary classification refers to the categorization of data ROBUST MODULAR ARTMAP FOR MULTI-CLASS SHAPE RECOGNITION Chue Poh Tn, Chen Chnge Loy, Weng Kin Li, Chee Peng Lim Abstrct This pper presents Fuzzy ARTMAP (FAM) bsed modulr rchitecture for multi-clss pttern

More information

Area-Time Efficient Digit-Serial-Serial Two s Complement Multiplier

Area-Time Efficient Digit-Serial-Serial Two s Complement Multiplier Are-Time Efficient Digit-Seril-Seril Two s Complement Multiplier Essm Elsyed nd Htem M. El-Boghddi Computer Engineering Deprtment, Ciro University, Egypt Astrct - Multipliction is n importnt primitive

More information

Design and Modeling of Substrate Integrated Waveguide based Antenna to Study the Effect of Different Dielectric Materials

Design and Modeling of Substrate Integrated Waveguide based Antenna to Study the Effect of Different Dielectric Materials Design nd Modeling of Substrte Integrted Wveguide bsed Antenn to Study the Effect of Different Dielectric Mterils Jgmeet Kour 1, Gurpdm Singh 1, Sndeep Ary 2 1Deprtment of Electronics nd Communiction Engineering,

More information

Outcome Matrix based Phrase Selection

Outcome Matrix based Phrase Selection Outcome Mtrix bsed Phrse Selection Aln R Wgner Georgi Tech Reserch Institute 50 4 th Street NW, Atlnt GA 0-08 Abstrct This rticle presents method for using outcome mtrices for socil phrse selection. An

More information

Signaling-Embedded Preamble Design for Flexible Optical Transport Networks

Signaling-Embedded Preamble Design for Flexible Optical Transport Networks Signling-Embedded Premble Design for Flexible Opticl Trnsport Networks Linglong Di nd Zhocheng Wng Tsinghu Ntionl Lbortory for Informtion Science nd Technology, Deprtment of Electronic Engineering, Tsinghu

More information

Improving synchronized transfers in public transit networks using real-time tactics

Improving synchronized transfers in public transit networks using real-time tactics Improving synchronized trnsfers in public trnsit networks using rel-time tctics Zhongjun Wu 1,2,3, Grhm Currie 3, Wei Wng 1,2 1 Jingsu Key Lbortory of Urbn ITS, Si Pi Lou 2#, Nnjing, 210096, Chin 2 School

More information

LATEST CALIBRATION OF GLONASS P-CODE TIME RECEIVERS

LATEST CALIBRATION OF GLONASS P-CODE TIME RECEIVERS LATEST CALIBRATION OF GLONASS P-CODE TIME RECEIVERS A. Fos 1, J. Nwroci 2, nd W. Lewndowsi 3 1 Spce Reserch Centre of Polish Acdemy of Sciences, ul. Brtyc 18A, 00-716 Wrsw, Polnd; E-mil: fos@c.ww.pl; Tel.:

More information

MEASURE THE CHARACTERISTIC CURVES RELEVANT TO AN NPN TRANSISTOR

MEASURE THE CHARACTERISTIC CURVES RELEVANT TO AN NPN TRANSISTOR Electricity Electronics Bipolr Trnsistors MEASURE THE HARATERISTI URVES RELEVANT TO AN NPN TRANSISTOR Mesure the input chrcteristic, i.e. the bse current IB s function of the bse emitter voltge UBE. Mesure

More information

ECE 274 Digital Logic. Digital Design. Datapath Components Shifters, Comparators, Counters, Multipliers Digital Design

ECE 274 Digital Logic. Digital Design. Datapath Components Shifters, Comparators, Counters, Multipliers Digital Design ECE 27 Digitl Logic Shifters, Comprtors, Counters, Multipliers Digitl Design..7 Digitl Design Chpter : Slides to ccompny the textbook Digitl Design, First Edition, by Frnk Vhid, John Wiley nd Sons Publishers,

More information

A Key Set Cipher for Wireless Sensor Networks

A Key Set Cipher for Wireless Sensor Networks A Key Set Cipher for Wireless Sensor etworks Subhsh Kk Abstrct This pper proposes the use of sets of keys, together with corresponding identifiers, for use in wireless sensor networks (WS) nd similr computing

More information

Robustness Analysis of Pulse Width Modulation Control of Motor Speed

Robustness Analysis of Pulse Width Modulation Control of Motor Speed Proceedings of the World Congress on Engineering nd Computer Science 2007 WCECS 2007, October 24-26, 2007, Sn Frncisco, USA obustness Anlysis of Pulse Width Modultion Control of Motor Speed Wei Zhn Abstrct

More information

A Simple Approach to Control the Time-constant of Microwave Integrators

A Simple Approach to Control the Time-constant of Microwave Integrators 5 VOL., NO.3, MA, A Simple Approch to Control the Time-constnt of Microwve Integrtors Dhrmendr K. Updhyy* nd Rkesh K. Singh NSIT, Division of Electronics & Communiction Engineering New Delhi-78, In Tel:

More information

Convolutional Networks. Lecture slides for Chapter 9 of Deep Learning Ian Goodfellow

Convolutional Networks. Lecture slides for Chapter 9 of Deep Learning Ian Goodfellow Convolutionl Networks Lecture slides for Chpter 9 of Deep Lerning In Goodfellow 2016-09-12 Convolutionl Networks Scle up neurl networks to process very lrge imges / video sequences Sprse connections Prmeter

More information

Genetic Representations for Evolutionary Minimization of Network Coding Resources

Genetic Representations for Evolutionary Minimization of Network Coding Resources Genetic Representtions for Evolutionry Minimiztion of Network Coding Resources Minkyu Kim 1, Vrun Aggrwl 2, Un-My O Reilly 2, Muriel Médrd 1, nd Wonsik Kim 1 1 Lortory for Informtion nd Decision Systems

More information

High-speed Simulation of the GPRS Link Layer

High-speed Simulation of the GPRS Link Layer 989 High-speed Simultion of the GPRS Link Lyer J Gozlvez nd J Dunlop Deprtment of Electronic nd Electricl Engineering, University of Strthclyde 204 George St, Glsgow G-lXW, Scotlnd Tel: +44 4 548 206,

More information

Make Your Math Super Powered

Make Your Math Super Powered Mke Your Mth Super Powered: Use Gmes, Chllenges, nd Puzzles Where s the fun? Lern Mth Workshop model by prticipting in one nd explore fun nocost/low-cost gmes nd puzzles tht you cn esily bring into your

More information

EE Controls Lab #2: Implementing State-Transition Logic on a PLC

EE Controls Lab #2: Implementing State-Transition Logic on a PLC Objective: EE 44 - Controls Lb #2: Implementing Stte-rnsition Logic on PLC ssuming tht speed is not of essence, PLC's cn be used to implement stte trnsition logic. he dvntge of using PLC over using hrdwre

More information

A New Algorithm to Compute Alternate Paths in Reliable OSPF (ROSPF)

A New Algorithm to Compute Alternate Paths in Reliable OSPF (ROSPF) A New Algorithm to Compute Alternte Pths in Relile OSPF (ROSPF) Jin Pu *, Eric Mnning, Gholmli C. Shoj, Annd Srinivsn ** PANDA Group, Computer Science Deprtment University of Victori Victori, BC, Cnd Astrct

More information