In cyberspace security,the privacy in location-based services(LBSs) becomes more critical. In previous solutions,a trusted third party(TTP) was usually employed to provide disturbance or obfuscation,but it may become ...In cyberspace security,the privacy in location-based services(LBSs) becomes more critical. In previous solutions,a trusted third party(TTP) was usually employed to provide disturbance or obfuscation,but it may become the single point of failure or service bottleneck. In order to cope with this drawback,we focus on another important class,establishing anonymous group through short-range communication to achieve k-anonymity with collaborative users. Along with the analysis of existing algorithms,we found users in the group must share the same maximum anonymity degree,and they could not ease the process of preservation in a lower one. To cope with this problem,we proposed a random-QBE algorithm to put up with personalized anonymity in user collaboration algorithms,and this algorithm could preserve both query privacy and location privacy. Then we studied the attacks from passive and active adversaries and used entropy to measure user's privacy level. Finally,experimental evaluations further verify its effectiveness and efficiency.展开更多
To provide scalable and simple Quality of Service（QoS） mechanism for multicast services, Probe-Based Multicast Admission Control （PBMAC） scheme was proposed. In this paper, PBMAC is studicd and a so-called subsequ...To provide scalable and simple Quality of Service（QoS） mechanism for multicast services, Probe-Based Multicast Admission Control （PBMAC） scheme was proposed. In this paper, PBMAC is studicd and a so-called subsequent request problem is found in PBMAC, which degrades system performance significantly when the network traffic is heavily loaded. Based on the analysis on subsequent request problem, an Enhance PBMAC （EPBMAC） scheme is proposed, in which complementary probing is devised to solve the problem. Using a new metric of normalized requested equivalent link capacity, the pertbrmance of PBMAC and EPBMAC is analyzed and evaluated. Two implementations are proposed for incremental dcployment. The paper finally introduces evaluation with packet-based simulations. Both analytical and simulation results show the significant improvement in performance.展开更多
Aiming at the significance of the energy controls of wireless sensor networks, an economical energy consumption algorithm for wireless communicating in Wireless Sensor Networks (WSN) is presented. Based on the algorit...Aiming at the significance of the energy controls of wireless sensor networks, an economical energy consumption algorithm for wireless communicating in Wireless Sensor Networks (WSN) is presented. Based on the algorithm, the maximal system throughput of WSN is analyzed, and the upper bound of throughput of WSN is proposed and proved. Some numerical simulations are conducted and analyzed. The conclusions include that the transmitting radius of sensor node and the parameters of the energy cost function have significant influence upon the throughput, but the monitoring region radius has little influence. For the same transmitting distance, the more the hopping of information trans- mitting, the better the throughput of WSN. On the other hand, for the energy optimization of the whole WSN, the trade-off problem between the throughput capacity and the relay nodes is proposed, and the specific expression of relay hops that minimized the energy consumptions and the maximal throughput of WSN under the specific situation is derived.展开更多
In this paper,we present a new self-similar traffic shaping mechanism and investigate its effect on the output traffic characteristics and network performance under self-similar traffic.Simulation results show that ou...In this paper,we present a new self-similar traffic shaping mechanism and investigate its effect on the output traffic characteristics and network performance under self-similar traffic.Simulation results show that our proposed mechanism can not only effectively reduce the burstiness of input traffic,but also perform better than the non-traffic shaping scheme in the terms of packet-loss rate and blocking probability.展开更多
基金supported by the National Natural Science Foundation of China (Grant No.61472097)the Specialized Research Fund for the Doctoral Program of Higher Education(Grant No.20132304110017)+1 种基金the Natural Science Foundation of Heilongjiang Province of China (Grant No.F2015022)the Fujian Provincial Key Laboratory of Network Security and Cryptology Research Fund (Fujian Normal University) (No.15003)
文摘In cyberspace security,the privacy in location-based services(LBSs) becomes more critical. In previous solutions,a trusted third party(TTP) was usually employed to provide disturbance or obfuscation,but it may become the single point of failure or service bottleneck. In order to cope with this drawback,we focus on another important class,establishing anonymous group through short-range communication to achieve k-anonymity with collaborative users. Along with the analysis of existing algorithms,we found users in the group must share the same maximum anonymity degree,and they could not ease the process of preservation in a lower one. To cope with this problem,we proposed a random-QBE algorithm to put up with personalized anonymity in user collaboration algorithms,and this algorithm could preserve both query privacy and location privacy. Then we studied the attacks from passive and active adversaries and used entropy to measure user's privacy level. Finally,experimental evaluations further verify its effectiveness and efficiency.
文摘To provide scalable and simple Quality of Service（QoS） mechanism for multicast services, Probe-Based Multicast Admission Control （PBMAC） scheme was proposed. In this paper, PBMAC is studicd and a so-called subsequent request problem is found in PBMAC, which degrades system performance significantly when the network traffic is heavily loaded. Based on the analysis on subsequent request problem, an Enhance PBMAC （EPBMAC） scheme is proposed, in which complementary probing is devised to solve the problem. Using a new metric of normalized requested equivalent link capacity, the pertbrmance of PBMAC and EPBMAC is analyzed and evaluated. Two implementations are proposed for incremental dcployment. The paper finally introduces evaluation with packet-based simulations. Both analytical and simulation results show the significant improvement in performance.
文摘Aiming at the significance of the energy controls of wireless sensor networks, an economical energy consumption algorithm for wireless communicating in Wireless Sensor Networks (WSN) is presented. Based on the algorithm, the maximal system throughput of WSN is analyzed, and the upper bound of throughput of WSN is proposed and proved. Some numerical simulations are conducted and analyzed. The conclusions include that the transmitting radius of sensor node and the parameters of the energy cost function have significant influence upon the throughput, but the monitoring region radius has little influence. For the same transmitting distance, the more the hopping of information trans- mitting, the better the throughput of WSN. On the other hand, for the energy optimization of the whole WSN, the trade-off problem between the throughput capacity and the relay nodes is proposed, and the specific expression of relay hops that minimized the energy consumptions and the maximal throughput of WSN under the specific situation is derived.
基金Supported by the National Natural Science Foundation of China(No.60132020 ,60302026)
文摘In this paper,we present a new self-similar traffic shaping mechanism and investigate its effect on the output traffic characteristics and network performance under self-similar traffic.Simulation results show that our proposed mechanism can not only effectively reduce the burstiness of input traffic,but also perform better than the non-traffic shaping scheme in the terms of packet-loss rate and blocking probability.
