In the application of periodic data-gathering in sensor networks,sensor nodes located near the sink have to forward the data received from all other nodes to the sink,which depletes their energy very quickly.A moving ...In the application of periodic data-gathering in sensor networks,sensor nodes located near the sink have to forward the data received from all other nodes to the sink,which depletes their energy very quickly.A moving scheme for the sink based on local residual energy was proposed.In the scheme,the sink periodically moves to a new location with the highest stay-value defined by the average residual energy and the number of neighbors.The scheme can balance energy consumption and prevent nodes around sink from draining their energy very quickly in the networks.The simulation results show that the scheme can prolong the network lifetime by 26%-65%compared with the earlier schemes where the sink is static or moves randomly.展开更多
In this paper, the security technology of ad hoc networks is studied.To improve the previous multi-receiver signcryption schemes, an ID-based multi-message and multi-receiver signcryption scheme for rekeying in ad hoc...In this paper, the security technology of ad hoc networks is studied.To improve the previous multi-receiver signcryption schemes, an ID-based multi-message and multi-receiver signcryption scheme for rekeying in ad hoc networks is proposed.In this scheme, a sender can simultaneously signcrypt n messeges for n receivers, and a receiver can unsigncrypt the ciphertext to get his message with his own private key.An analysis of this scheme indicates that it achieves authenticity and confidentiality in the random oracle model while being of lower computation and communication overhead.Finally, for the application of our scheme in ad hoc, a threshold key updating protocol for ad hoc networks is given.展开更多
In rechargeable wireless sensor networks, a sensor cannot be always benefi cial to conserve energy when a network can harvest excessive energy from the environment due to its energy replenished continually and limited...In rechargeable wireless sensor networks, a sensor cannot be always benefi cial to conserve energy when a network can harvest excessive energy from the environment due to its energy replenished continually and limited energy storage capacity. Therefore, surplus energy of a node can be utilized for strengthening packet delivery efficiency and improving data collection rate. In this work, we propose an algorithm to compute an upper data generation rate that maximizes it as an optimization problem for a network with multiple sinks, which is formulated as a linear programming problem. Subsequently, a dual problem by introducing Lagrange multipliers is constructed, and subgradient algorithms are used to solve it in a distributed manner. The resulting algorithms are guaranteed to converge to an optimal data generation rate, which are illustrated by an example in which an optimum data generation rate is computed for a network of randomly distributed nodes. Through extensive simulation and experiments, we demonstrate our algorithm is efficient to maximize data collection rate in rechargeable wireless sensor networks.展开更多
This paper presents two optimizations to improve the network receive performance in Xen, espe- cially for receiving small packets, by reducing per-packet overhead of network virtualization. First, the universal receiv...This paper presents two optimizations to improve the network receive performance in Xen, espe- cially for receiving small packets, by reducing per-packet overhead of network virtualization. First, the universal receive aggregation assembles incoming packets to decrease the cost of software bridge and bridge netfilter, no matter which protocol these packets use or whether they belong to the same TCP link. Second, the grant page sharing makes as many packets as possible share a single grant page to decrease the cost of expensive grant operations effectively. Experiment demonstrates that compared with default network virtualization in Xen, these two optimizations can reduce CPU cycles per packet by 31.20%, and improve UDP and TCP throughput by 37.73% and 25.62% on average.展开更多
This paper proposes new interference estimation for power control in broadband wireless data networks. The proposed approach gives the filtered interference power in real-time removing undesired effects such as the fl...This paper proposes new interference estimation for power control in broadband wireless data networks. The proposed approach gives the filtered interference power in real-time removing undesired effects such as the fluctuation of interference power and the measurement noise due to receiver noise. The well-known Finite Impulse Response （FIR） structure filter is adopted for both the interference and the noise covarianee estimation. The proposed mechanism provides both the filtered interference power and the filtered number of active co-channel interferers, which shows good inherent properties. And the filtered interference power is not affected by the constant number of active co-channel interferes. It is also shown that the filtered number of active co-channel interference is separated from the filtered interference power. From discussions about the choice of design parameters such as window length and eovariance ratio, they can make the estimation performance of the proposed FIR filtering based mechanism as good as possible. Via extensive computer simulations, the performance of the proposed mechanism is shown to be superior to the existing Kalman filtering based mechanism.展开更多
We present a scheme for remotely preparing a state via the controls of many agents in a network.In thescheme,the agents' controls are achieved by utilizing quantum key distribution.Generally,the original state can...We present a scheme for remotely preparing a state via the controls of many agents in a network.In thescheme,the agents' controls are achieved by utilizing quantum key distribution.Generally,the original state can berestored by the receiver with probability 1/2 if all the agents collaborate.However,for certain type of original states therestoration probability is unit.展开更多
基金Project(60673164)supported by the National Natural Science Foundation of ChinaProject(20060533057)supported by the Specialized Research Foundation for the Doctoral Program of Higher Education of China
文摘In the application of periodic data-gathering in sensor networks,sensor nodes located near the sink have to forward the data received from all other nodes to the sink,which depletes their energy very quickly.A moving scheme for the sink based on local residual energy was proposed.In the scheme,the sink periodically moves to a new location with the highest stay-value defined by the average residual energy and the number of neighbors.The scheme can balance energy consumption and prevent nodes around sink from draining their energy very quickly in the networks.The simulation results show that the scheme can prolong the network lifetime by 26%-65%compared with the earlier schemes where the sink is static or moves randomly.
文摘In this paper, the security technology of ad hoc networks is studied.To improve the previous multi-receiver signcryption schemes, an ID-based multi-message and multi-receiver signcryption scheme for rekeying in ad hoc networks is proposed.In this scheme, a sender can simultaneously signcrypt n messeges for n receivers, and a receiver can unsigncrypt the ciphertext to get his message with his own private key.An analysis of this scheme indicates that it achieves authenticity and confidentiality in the random oracle model while being of lower computation and communication overhead.Finally, for the application of our scheme in ad hoc, a threshold key updating protocol for ad hoc networks is given.
基金supported by The Natural Science Foundation of Jiangsu Province of China(Grant No.BK20141474)funded by China Postdoctoral Science Foundation(Grant No.2015M571639)+3 种基金three Projects Funded by The Jiangsu Planned Projects for Postdoctoral Research Funds(Grant No.1402018C)The Key Laboratory of Computer Network and Information Integration(Southeast University)Ministry of Education(Grant No.K93-9-2015-09C)The Priority Academic Program Development(PAPD)of Jiangsu Higher Education Institutions
文摘In rechargeable wireless sensor networks, a sensor cannot be always benefi cial to conserve energy when a network can harvest excessive energy from the environment due to its energy replenished continually and limited energy storage capacity. Therefore, surplus energy of a node can be utilized for strengthening packet delivery efficiency and improving data collection rate. In this work, we propose an algorithm to compute an upper data generation rate that maximizes it as an optimization problem for a network with multiple sinks, which is formulated as a linear programming problem. Subsequently, a dual problem by introducing Lagrange multipliers is constructed, and subgradient algorithms are used to solve it in a distributed manner. The resulting algorithms are guaranteed to converge to an optimal data generation rate, which are illustrated by an example in which an optimum data generation rate is computed for a network of randomly distributed nodes. Through extensive simulation and experiments, we demonstrate our algorithm is efficient to maximize data collection rate in rechargeable wireless sensor networks.
文摘This paper presents two optimizations to improve the network receive performance in Xen, espe- cially for receiving small packets, by reducing per-packet overhead of network virtualization. First, the universal receive aggregation assembles incoming packets to decrease the cost of software bridge and bridge netfilter, no matter which protocol these packets use or whether they belong to the same TCP link. Second, the grant page sharing makes as many packets as possible share a single grant page to decrease the cost of expensive grant operations effectively. Experiment demonstrates that compared with default network virtualization in Xen, these two optimizations can reduce CPU cycles per packet by 31.20%, and improve UDP and TCP throughput by 37.73% and 25.62% on average.
文摘This paper proposes new interference estimation for power control in broadband wireless data networks. The proposed approach gives the filtered interference power in real-time removing undesired effects such as the fluctuation of interference power and the measurement noise due to receiver noise. The well-known Finite Impulse Response （FIR） structure filter is adopted for both the interference and the noise covarianee estimation. The proposed mechanism provides both the filtered interference power and the filtered number of active co-channel interferers, which shows good inherent properties. And the filtered interference power is not affected by the constant number of active co-channel interferes. It is also shown that the filtered number of active co-channel interference is separated from the filtered interference power. From discussions about the choice of design parameters such as window length and eovariance ratio, they can make the estimation performance of the proposed FIR filtering based mechanism as good as possible. Via extensive computer simulations, the performance of the proposed mechanism is shown to be superior to the existing Kalman filtering based mechanism.
基金Supported by the program for New Century Excellent Talents at the University of China under Grant No.NCET-06-0554the National Natural Science Foundation of China under Grant Nos.60677001,50672001,10874122,and 10747146+2 种基金the Science-Technology Fund of Anhui Province for Outstanding Youth under Grant No.06042087the Key Fund of the Ministry of Education of China under Grant No.206063the Natural Science Foundation of Guangdong Province under Grant Nos.06300345 and 7007806
文摘We present a scheme for remotely preparing a state via the controls of many agents in a network.In thescheme,the agents' controls are achieved by utilizing quantum key distribution.Generally,the original state can berestored by the receiver with probability 1/2 if all the agents collaborate.However,for certain type of original states therestoration probability is unit.
