The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Secure scalar product protocol is an important fundamental protocol in secure multi-party computation. Serving as a basic building block for many other secure protocols, it is widely used in data mining, statistical analysis and scientific computation. Based on additive homomorphism public key cryptosystem, we develop a new secure scalar product protocol under semi-honest model with low communication...
We consider the problem of finding a multicast tree rooted at the source node and including all the destination nodes such that the maximum weight of the tree arcs is minimized. It is of paramount importance for many optimization problems, e.g., the maximum-lifetime multicast problem in multihop wireless networks, in the data networking community. We explore some important properties of this problem...
Transmitter preceding is a crucial technique for harnessing the potential of multiple-input multiple-output (MIMO) fading channels. In many practical wireless systems, a limited amount of feedback from the receiver is available at the transmitter, which can be used to direct the choice of the precoder from a codebook to match the channel state. Assuming noiseless, limited-rate feedback, this work...
This paper proposes a new survivable algorithm named sub-path protection based on auxiliary virtual topology (SPAVT) to tolerate the single-link failure in WDM optical networks. According to the protection-switching time constraint, SPAVT constructs the virtual topology. Then, it only needs to run one time of routing algorithm to find the feasible virtual route in virtual topology. Simulation results...
We consider the lifetime optimization problem for multicast communications in wireless ad hoc networks with directional antennas. In this paper, we propose a new distributed algorithm, whose performance, in terms of both approximation ratio and message complexity, is guaranteed by our theoretical analysis. We prove that its approximation ratio is bounded by a finite number and it has a linear message...
We consider an optimization problem in wireless sensor networks (WSNs) that is to find a multicast tree with maximum lifetime. While a recently proposed distributed algorithm for this problem guarantees to obtain optimal solutions, its high message complexity may prevent such contribution from being practically used in resource-constrained WSNs. In this paper, we proposed a new distributed algorithm...
We consider an optimization problem in wireless sensor networks (WSNs) that is to find a multicast tree rooted at the source node and including all the destination nodes such that the lifetime of the tree is maximized. While a recently proposed distributed algorithm for this problem guarantees to obtain optimal solutions, we show that its high message complexity may prevent such contribution from...
Partial transmit sequences (PTS) seems to be attractive for peak to average power ratio (PAPR) reduction in OFDM system, since it obtains better PAPR property by modifying OFDM signals without distortion. Meanwhile it also shows the potential to be utilized in MIMO-OFDM system. In this paper, a dynamic PTS algorithm with a simplified minimum maximum (minimax) criterion is proposed to optimize the...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.