If a certain number of receiver processors (RPs) are reserved exclusively for new calls, some decrease in the probability of blocking new calls (Pn) can be obtained at the expense of increase in dropping handoff calls (Ph). This kind of prioritization has been often considered for handoff calls. Since soft handoff in CDMA systems results in sufficiently low Ph, an idea of prioritizing new calls is interesting when admitting more originating traffic into the system is relatively beneficial, which will be further investigated in this paper. An obvious constraint of the above idea is that Ph should be maintained below a given requirement. We formulate the proposed scheme as a mathematical programming problem and prove it improves the performance in terms of weighted carried traffic. As a result of this work, the prioritization of new calls is shown to possibly improve the traffic-carrying performance of a CDMA base station (BS) while maintaining an acceptable level of Ph, which can be prespecified by a system engineer.

This study investigates subcarrier and power allocation schemes in an OFDMA downlink system. To consider client demands, a goal programming approach is proposed. The proposed algorithm minimizes the weighted sum of each client's dissatisfaction index. Simulations show that the sum of dissatisfaction indices can be reduced significantly.

The need for data encryption that protects sensitive data in a database has increased rapidly. However, encrypted data can no longer be efficiently queried because nearly all of the data should be decrypted. Several order-preserving encryption schemes that enable indexes to be built over encrypted data have been suggested to solve this problem. They allow any comparison operation to be directly applied to encrypted data. However, one of the main disadvantages of these schemes is that they expose sensitive data to inference attacks with order information, especially when the data are used together with unencrypted columns in the database. In this study, a new order-preserving encryption scheme that provides secure queries by hiding the order is introduced. Moreover, it provides efficient queries because any user who has the encryption key knows the order. The proposed scheme is designed to be efficient and secure in such an environment. Thus, it is possible to encrypt only sensitive data while leaving other data unencrypted. The encryption is not only robust against order exposure, but also shows high performance for any query over encrypted data. In addition, the proposed scheme provides strong updates without assumptions of the distribution of plaintext. This allows it to be integrated easily with the existing database system.

A distributed denial-of-service (DDoS) attack presents a very serious threat to the stability of the Internet. In a typical DDoS attack, a large number of compromised hosts are amassed to send useless packets to jam a victim or its Internet connection, or both. Defense against DDoS attacks as well as identification of their sources comprise demanding challenges in the realm of Internet security studies. In this paper, effective measures are proposed for detecting attacks in routers through the use of queuing models, which help detect attacks closer to the attack sources. Utilizing these measures, an effective DDoS attack detection and packet-filtering scheme is proposed. The suggested approach is a cooperative technique among routers intended to protect the network from persistent and severe congestion arising from a rapid increase in attack traffic. Through computer simulations, it is shown that the proposed scheme can trace attacks near to the attack sources, and can effectively filter attack packets.

This letter discusses how to enhance the capacity of uplink DS-CDMA networks that support multihop transmission. For this purpose, we derived simple theoretic conditions by which one can choose between singlehop- and multihop transmission. Numerical results show that we can significantly increase the radio network capacity by adopting only a few number of multihop transmissions.

In order to exploit the benefits of soft handoff, finding good values of handoff control parameters is important. In cellular system specifications such as IS-95C and WCDMA, handoff decision algorithm includes signal strength averaging and drop timer in addition to hysteresis. This paper analyzes the effects of signal strength averaging and drop timer and their performance tradeoffs. Because averaging and drop timer are both based on time delay, one may expect that they have similar impact on soft handoff performance. The results show that the effects of averaging and drop timer are rather similar and closely connected in terms of reducing the signaling overhead. However, they have different impacts on resource usage and diversity gain of the system.

The capacity of multiuser OFDM systems can be maximized by allocating resources (subcarrier and power) to the user with the highest instantaneous channel gain. This assumes complete channel state information (CSI) at the transmitter, which is achieved by every user reporting its CSI for all subcarriers to the transmitter via feedback channel. In practice, due to the limited capacity of the feedback channel, the completeness of CSI may be severely restricted especially with a large number of users transmitting a large amount of feedback information. In order to reduce the amount of feedback information while preserving the maximal capacity, quality based CSI feedback (QCF) is proposed in this letter. The system capacity is derived with QCF and compared with that of full CSI feedback. The results show that QCF successfully reduces the amount of feedback information with little capacity loss.

Due to the exponentially increasing threat of cyber attacks, many e-commerce organizations around the world have begun to recognize the importance of information security. When considering the importance of security in e-commerce, we need to train e-commerce security experts who can help ensure the reliable deployment of e-commerce. The purpose of this research is to design and evaluate an e-commerce security curriculum useful in training e-commerce security experts. In this paper, we use a phase of the Delphi method and the Analytic Hierarchy Process (AHP) method. To validate our results, we divide the respondents into two groups and compare the survey results.

This paper aims at developing forward link power control methods for CDMA cellular systems. The purpose is to allocate available power to as many mobiles as possible. When a power allocation in the network is fixed, the power assigned to the cell where rare mobiles communicate is wasting, and moreover, is prohibitive if other cells fall short of transmitting power. In this case, re-allocation is necessary. Power control in this paper takes the form of allocating pilot and traffic power according to the different needs from each cell. Especially, the pilot power control method tends to balance nonuniformly imposed load through the network, and hence helps the network resources be utilized equally. With the proposed pilot control method, the number of simultaneously communicating mobiles increases by 10-25% over the reference methods.

This letter focuses on uplink transmission in OFDMA systems. A subcarrier and power allocation problem is formulated that maximizes the throughput of OFDMA uplink systems while satisfying each user's power constraints. A greedy algorithm known to be the most efficient algorithm for this problem can provide a high quality near-optimal solution, but has the disadvantage of incurring a long computation time. As this problem should be solved in a real-time environment, computation time is a very important performance measure of algorithms. In this letter, a computationally efficient algorithm that provides a nearly identical quality, near-optimal solution as the greedy algorithm but requires less than 10% of the computation time of the greedy algorithm is proposed.

Recently, cyber attacks have become a serious hindrance to the stability of Internet. These attacks exploit interconnectivity of networks, propagate in an instant, and have become more sophisticated and evolutionary. Traditional Internet security systems such as firewalls, IDS and IPS are limited in terms of detecting recent cyber attacks in advance as these systems respond to Internet attacks only after the attacks inflict serious damage. In this paper, we propose a hybrid intrusion forecasting system framework for an early warning system. The proposed system utilizes three types of forecasting methods: time-series analysis, probabilistic modeling, and data mining method. By combining these methods, it is possible to take advantage of the forecasting technique of each while overcoming their drawbacks. Experimental results show that the hybrid intrusion forecasting method outperforms each of three forecasting methods.

Multiple Input Multiple Output (MIMO) represents a highly promising technique for 4G communication networks as it uses multiple antennas at the transmitter and receiver to improve the reliability of transmissions and to provide a high data rate. This paper introduces an adjustable scheduling algorithm for multi-user MIMO systems that can provide an advantageous trade-off solution between throughput maximization and fair resource allocation among users. Specifically, our algorithm is proposed as a solution to system requirement issues through the flexible control of fairness factors.