Báo cáo hóa học: "Research Article Securing Collaborative Spectrum Sensing against Untrustworthy Secondary Users in Cognitive Radio Networks" potx

... pages doi:10.1155/2010/695750 Research Article Securing Collaborative Spectrum Sensing against Untrustworthy Secondary Users in Cognit ive Radio Networks Wenkai Wang, 1 Husheng Li, 2 Yan (Lindsay) Sun, 1 and Zhu ... information. In this section, we describe the scenario of collaborative spectrum sensing and present two attack models. 2.1. Collaborative Spectru...

Ngày tải lên: 21/06/2014, 19:20

... have proved fixed point theorems in intuitionistic fuzzy metric spaces or probabilistic metric spaces. In this paper, using similar proof as in 7, we give a new common fixed point theorem under ... points in fuzzy metric spaces,” Fuzzy Sets and Systems, vol. 27, no. 3, pp. 385–389, 1988. 8 Fixed Point Theory and Applications Step 2. Prove that g and F have a coupled coincidence poin...

Ngày tải lên: 21/06/2014, 05:20

... on Advances in Signal Processing The dominant term in the expression for w H 2 w 2 is given by the first term inside the bracket involving R −1 1 s 1,1 , which can be simplified using (A.11)as w H 2 w 2 ≈   β 1,1   2 ρ 4 1  R −1 1 s 1,1  H  R −1 1 s 1,1  = | β 1,1 | 2 ρ 4 1 N  σ 2 n + ... n / =n 1,j . (14) This spectrum indicates an in nite processing gain (at least in theory)...

Ngày tải lên: 21/06/2014, 22:20

... node densities. For instance, we confirm the results obtained in JumPS [16], showing that increasing the number of landmarks increases the accuracy of the underlying coordinate system. However, ... point of S 1 , that is, H  θ 1 , , θ N  = max θ∈S 1 min i∈{1, ,N} dist g  θ, θ i  . (8) We are interested in finding the minimizers of H. Interestingly, the function H can be rewritten using...

Ngày tải lên: 22/06/2014, 00:20

... Ahn, “Optimizing data replication for expanding ring-based queries in wireless sensor networks,” in Proceedings of the 4th International Symposium on Model- ing and Optimization in Mobile, Ad ... can buffer the minimal-hop path to each s ink node in a short time interval. We will explain the details about how to con- struct the routing tree with maximal path shar ing in the fol- lowi...

Ngày tải lên: 22/06/2014, 19:20

... efficient packet discarding pol- icy should consider preceding nodes’ invested energy. In the matter, the α  coefficients could evolve based on their sink proximity or, in the same way, in their distance ... nsumed energy by transmitting reliably the w h ole image (16 394 bytes, includ- ing the 10-byte image header) without applying DWT. In the following, we call that the original scenar...

Ngày tải lên: 22/06/2014, 22:20

... public binding keys K BIND 1 pub to K BIND N pub is lost if the hardware infrastructure of the control station is upgraded and this upgrade also includes TPM S .Toallow such maintenance, the binding ... Identity Key K AIK pub K AIK Signature Key K SIG pub K SIG Binding Keys K BIND 1 K BIND 1 pub K BIND 2 K BIND 2 pub . . . . . . K BIND N K BIND N pub levels. Data at different abstraction level...

Ngày tải lên: 21/06/2014, 11:20

... that the fixed points 0, ± √ α 2  are not attracting, since every solution starting on the line x  0 is 2-periodic. Remark 4.8. It is interesting to notice that, in the three cases in which there ... fixed points, stable but not asymptotically stable fixed points, nonattracting unstable fixed points, and attracting unstable fixed points. The paper is organized, besides this introduction, i...

Ngày tải lên: 21/06/2014, 05:20

... contraction mapping principle implies that  A n 0 has a unique fixed point x ∗ in CI,andso  A has a unique fixed point x ∗ in CI; by the definition of  A, A has a unique fixed point x ∗ in CI,thatis,x ∗ is ... by using cone expansion-compression fixed point theorem. In 3,the singular third-order three-point BVP 1.1 is considered under some conditions concerning the first eigenv...

Ngày tải lên: 21/06/2014, 05:20

... of signals. The Khinchine inequality (I.B.8 in [15]) is the analogous statement to Paley’s Theorem for the Walsh basis. Her e, again, one could gain solvability by taking the elements with indices {2 k } n k =1 , ... Advances in Signal Processing of subsets for an increasing sequence of dimensions and address whether the solvability constant remains bounded. Thus, we assume t hat {N k } ∞...

Ngày tải lên: 21/06/2014, 05:20