In this paper, we proposed a novel approach, called LDS-IVD, to model the entity interaction vulnerabilities in Large Distributed System (LDS) which results from the absence of necessary security mechanisms. LDS-IVD c...
详细信息
It's very important to help developers design user interface for application in an intelligent user interface. Nowadays, the number of mobile based applications increases greatly, but there are no proper user mode...
详细信息
A critical function of wireless sensor networks (WSNs) is data gathering. While, one is often only interested in collecting a relevant function of the sensor measurements at a sink node, rather than downloading all th...
详细信息
ISBN:
(纸本)9781424499199
A critical function of wireless sensor networks (WSNs) is data gathering. While, one is often only interested in collecting a relevant function of the sensor measurements at a sink node, rather than downloading all the data from all the sensors. This paper studies the capacity of computing and transporting the specific functions of sensor measurements to the sink node, called aggregation capacity, for WSNs. It focuses on random WSNs that can be classified into two types: random extended WSN and random dense WSN. All existing results about aggregation capacity are studied for dense WSNs, including random cases and arbitrary cases, under the protocol model (ProM) or physical model (PhyM). In this paper, we propose the first aggregation capacity scaling laws for random extended WSNs. We point out that unlike random dense WSNs, for random extended WSNs, the assumption made in ProM and PhyM that each successful transmission can sustain a constant rate is over-optimistic and unpractical due to transmit power *** derive the first result on aggregation capacity for random extended WSNs under the generalized physical model. Particularly, we prove that, for the type-sensitive perfectly compressible functions and type-threshold perfectly compressible functions, the aggregation capacities for random extended WSNs with n nodes are of order Θ ((log n) -β/2-1 ) and Θ (((log n) -β/2 )/(log log n)), respectively, where β >; 2 denotes the power attenuation exponent in the generalized physical model.
A quantum secure direct communication protocol with cluster states is *** with the deterministic secure quantum communication protocol with the cluster state proposed by Yuan and Song(***.,2009,7:689),this protocol ca...
详细信息
A quantum secure direct communication protocol with cluster states is *** with the deterministic secure quantum communication protocol with the cluster state proposed by Yuan and Song(***.,2009,7:689),this protocol can achieve higher intrinsic efficiency by using two-step *** implementation of this protocol is also discussed.
The diminished accuracy of port-based and payload-based classification motivates use of transport layer statistics for network traffic classification. A semi-supervised clustering approach based on improved K-Means cl...
详细信息
Four types of variable-rate convolutional network codes are investigated over a single-source finite cyclic network. It is found that variable-rate generic, dispersion and broadcast can be implemented on the same netw...
详细信息
Four types of variable-rate convolutional network codes are investigated over a single-source finite cyclic network. It is found that variable-rate generic, dispersion and broadcast can be implemented on the same network without changing the local encoding kernels of the non-source nodes. The efficient implementation has the advantage that each non-source node only needs to store one copy of the local encoding kernel within a session. However, it is also shown by an example that variable-rate multicast may not always be implemented under the above condition.
In this paper, we propose authentication protocols for 802.11s mesh networks, which support the mesh point's fast handoff between Mesh key distributors (MKDs). The protocols consist of the initial authentication p...
详细信息
The vehicular mobility models will seriously affect the simulation results of the key technologies for Vehicular Delay Tolerant Networks. Most of the existing vehicular mobility models are synthetic mobility models wh...
详细信息
Our concern, in the paper, is to construct information-theoretic secure network coding in the presence of eavesdroppers. Based on the generalized attack model and all-or-nothing transformation, the security of network...
详细信息
Our concern, in the paper, is to construct information-theoretic secure network coding in the presence of eavesdroppers. Based on the generalized attack model and all-or-nothing transformation, the security of network coding in the generalized combination network can be characterized by the network capacity and the min-cut bound of wiretapping set from the source. Furthermore, it can be extended to any directed acyclic networks with single source. Compared with the traditional results, we construct information-theoretic secure network coding without additional encryptions and giving up any capacity.
Fong et *** variable-rate linear network coding for linear ***,the authors didn't investigate it for the other three types of linear network *** this paper,by simple and clear proofs,it is found that there are sim...
详细信息
Fong et *** variable-rate linear network coding for linear ***,the authors didn't investigate it for the other three types of linear network *** this paper,by simple and clear proofs,it is found that there are similar results for variable-rate linear generic and linear dispersion if the field size is large *** means that linear generics and linear dispersions of different dimensions can be implemented on the same network,while each non-source node is required to store only one copy of the local encoding kernel within a ***,an example is given to show that there isn't a similar result for linear multicast.
暂无评论