A considerable amount of energy efficient routing algorithms have been proposed to save energy and prolong network lifetime. Those algorithms mainly focus on forwarding packets along the minimum energy path to the sin...
详细信息
ISBN:
(纸本)9781509025367
A considerable amount of energy efficient routing algorithms have been proposed to save energy and prolong network lifetime. Those algorithms mainly focus on forwarding packets along the minimum energy path to the sink to merely minimize energy consumption, which causes an unbalanced distribution of residual energy among sensor nodes, and eventually results in a network partition. In this paper, we propose a distributed energy balanced routing algorithm using energy prediction metric (EBEP). The routing scheme considers not only efficient energy but also energy balance. Firstly, with the help of Markov chain model and state conversion model, the future residual energy of front neighbor nodes can be predicted so that it is the most important local information when a node makes routing decision. Furthermore, the function of cost is adopted by our EBEP routing algorithm in order to synthetically evaluate and then select the best candidate of next step. Finally, the experimental results demonstrate the performance advantages of our EBEP routing algorithm.
In this paper, we have introduced a cross-layer design model which is based on multimedia services in order to favor the QoS demand in wireless mesh networks. By means of this model the relevant parameters in each lay...
详细信息
Clustering protocol for data gathering is one of the effective ways to solve the energy hole problem in wireless sensor networks. However, most of the existing clustering protocols focus on the network model with unif...
详细信息
Clustering protocol for data gathering is one of the effective ways to solve the energy hole problem in wireless sensor networks. However, most of the existing clustering protocols focus on the network model with uniform node distribution. They cannot effectively apply to the real network where the sensor nodes are randomly non-uniformly deployed. In this paper, we propose an energy-balanced clustering routing protocol (EBCRP) based on task separation. In this scheme, the network is firstly divided into clusters by using global information. And each of them has the same number of sensor nodes in order to balance the energy consumption of intra-cluster. In succession, task separation, the tasks of traditional single cluster head are separated and achieved by two cluster heads respectively, is proposed to reduce the traffic burden for single cluster head. Then, we explore an energy-efficient and reliable inter-cluster routing algorithm, which considers comprehensively three factors: residual energy, distance and available buffer space of nodes. Simulation results and performance evaluation of EBCRP show significant improvement in network lifetime and energy balance.
With the development of privacy protection, reversible data hiding methods in encrypted image have drawn extensive research interest. Among them, a new method is proposed based on embedding prediction errors, i.e., EP...
详细信息
Aiming at the mobile short message (SMS) hot topic extraction, the text features and statistical regularity of SMS are analyzed in this study. The formal description of SMS hot topic is given and an algorithm of SMS h...
详细信息
The flooding of adult short message has become an urgent problem of safety of message content. Existing researches on short message filtering pay much attention to rubbish and advertising short messages, and the granu...
详细信息
The flooding of adult short message has become an urgent problem of safety of message content. Existing researches on short message filtering pay much attention to rubbish and advertising short messages, and the granularity of categorization were too coarse. With an analysis of the characteristics of adult short messages, and considering the effectiveness and real time performance of filtering algorithm, this paper proposes an adult short message discriminating algorithm based on adultism-degree computation, and a threshold selecting algorithm based on close test optimization. Experiments show that the proposed algorithm can effectively discriminate adult short message with a 94.4％ correction rate, meanwhile it can meet the requirements of practical processing.
Linear (k,n) secret sharing scheme is a class of (k,n) secret sharing, where all the n shares of a secret satisfy a linear relationship. It plays an important role in other cryptographic systems, such as multi-party c...
详细信息
Linear (k,n) secret sharing scheme is a class of (k,n) secret sharing, where all the n shares of a secret satisfy a linear relationship. It plays an important role in other cryptographic systems, such as multi-party computation and function sharing schemes. On the other hand, cheating problem in (k,n) secret sharing is an important issue, such that cheaters (dishonest players) submit forged shares during secret reconstruction to fool honest players. During decades of research on cheating prevention, vast (k,n) secret sharing schemes against cheating have been proposed. However, most of these schemes are not linear schemes since it contains redundant information in their shares to achieve cheating detection. Since linear (k,n) secret sharing is an important primitive in threshold cryptography, linear (k,n) secret sharing scheme with the capability of cheating detection is also worthwhile to be discussed. In this paper, we propose a linear (k,n) secret sharing scheme against cheating based on Shamir's original scheme, which possesses the following merits: (1) Our scheme is just combination of two Shamir's schemes. Therefore, our scheme can be used in other threshold cryptographic systems which are based on Shamir's scheme. (2) The size of share in proposed scheme almost reaches its theoretic lower bound in (k,n) secret sharing with cheating detection. (3) In the phase of cheating detection, only one honest player can detect the cheating from other k-1 cheaters, which achieves a stronger detection effective than the previous linear secret sharing schemes against cheating.
Clustering is one of the effective ways to solve energy hole problem for Wireless Sensor network. So far, the approaches of heterogeneous cluster size mainly have concentrated on the design of unequal cluster protocol...
详细信息
User interaction is one of the most important features of online social networks, and is the basis of research of user behavior analysis, information spreading model, etc. However, existing approaches focus on the int...
详细信息
User interaction is one of the most important features of online social networks, and is the basis of research of user behavior analysis, information spreading model, etc. However, existing approaches focus on the interactions between adjacent nodes, which do not fully take the interactions and relationship between local region users into consideration as well as the details of interaction process. In this paper, we find that there exists influence transfer effect in the process of user interactions, and present a regional user interaction model to analyze and understand interactions between users in a local region by influence transfer effect. Based on real data from Sina Weibo, we validate the effectiveness of our model by the experiments of user type classification, influential user identification and zombie user identification in online social networks. The experimental results show that our model present better performance than the PageRank based method and machine learning method.
Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as ...
详细信息
暂无评论