This paper proposes a handover method that uses a combination of bicast and forwarding (BIFO) of IP packets to achieve a short handover delay. BIFO achieves a lower amount of IP packet traffic in the backhaul for future IP-based radio access networks (RANs) than the bicast only method. To validate the effect of the proposed BIFO, we implement prototype experimental equipment comprising a RAN_access router (RAN_AR), Node Bs associated with a radio control server (RCS), and user equipment (UE) including a controller. The experimental results show that BIFO achieves a shorter handover delay than the conventional bicast method or forwarding method by taking advantage of the respective merits of bicast and forwarding. The results also confirm that BIFO achieves the handover delay time in the control plane of approximately 10-20 msec.

The emergence of Web 2.0 technologies such as Ajax and Mashup has revealed the weakness of the same-origin policy [1], the current de facto standard for the Web browser security model. We propose a new browser security model to allow fine-grained access control in the client-side Web applications for secure mashup and user-generated contents. We propose a browser security model that is based on information-flow-based access control (IBAC) to overcome the dynamic nature of the client-side Web applications and to accurately determine the privilege of scripts in the event-driven programming model.

In LTE, AC barring check is performed before RRC connection. In some cells with a low access probability, the UEs keep retrying access which results in higher connection failure and longer access delay. We therefore propose balancing the UEs by adjusting the cell reselection criteria based on the access probability, so that the UEs shall be more encouraged to reselect a cell with a higher access probability.

This paper presents experimental evaluations of the effect of time diversity obtained by hybrid automatic repeat request (HARQ) with soft combining in space and path diversity schemes on orthogonal frequency division multiplexing (OFDM)-based packet radio access in a downlink broadband multipath fading channel. The effect of HARQ is analyzed through laboratory experiments employing fading simulators and field experiments conducted in downtown Yokosuka near Tokyo. After confirming the validity of experimental results based on numerical analysis of the time diversity gain in HARQ, we show by the experimental results that, for a fixed modulation and channel coding scheme (MCS), time diversity obtained by HARQ is effective in reducing the required received signal-to-interference plus noise power ratio (SINR) according to an increase in the number of transmissions, K, up to 10, even when the diversity effects are obtained through two-branch antenna diversity reception and path diversity using a number of multipaths greater than 12 observed in a real fading channel. Meanwhile, in combined use with the adaptive modulation and channel coding (AMC) scheme associated with space and path diversity, we clarify that the gain obtained by time diversity is almost saturated at the maximum number of transmissions in HARQ, K ' = 4 in Chase combining and K ' = 2 in Incremental redundancy, since the improvement in the residual packet error rate (PER) obtained through time diversity becomes small owing to the low PER in the initial packet transmission arising from appropriately selecting the optimum MCS in AMC. However, the experimental results elucidate that the time diversity in HARQ with soft combining associated with antenna diversity reception is effective in improving the throughput even in a broadband multipath channel with sufficient path diversity.

This paper compares the expressive power of five language-based access control models. We show that the expressive powers are incomparable between any pair of history-based access control, regular stack inspection and shallow history automata. Based on these results, we introduce an extension of HBAC, of which expressive power exceeds that of regular stack inspection.

This paper proposes a new selective encryption scheme and a key management scheme for layered access control of H.264/SVC. This scheme encrypts three domains in hierarchical layers using different keys: intra prediction modes, motion vector difference values and sign bits of texture data. The proposed scheme offers low computational complexity, low bit-overhead, and format compliance by utilizing the H.264/SVC structure. It provides a high encryption efficiency by encrypting domains selectively, according to each layer type in the enhancement-layer. It also provides confidentiality and implicit authentication using keys derived in the proposed key management scheme for encryption. Simulation results show the effectiveness of the proposed scheme.

With the growth of wireless computing and the popularity of eXtensible Markup Language (XML), wireless XML data management is emerging as an important research area. In this paper, cache invalidation methodology with XML update is addressed in wireless computing environments. A family of XML cache invalidation strategies, called S-XIR, D-XIR and E-XIR, is suggested. Using S-XIR and D-XIR, the unchanged part of XML data, only its structure changes, can be effectively reused in client caching. E-XIR, which uses prefetching, can further improve access time. Simulations are carried out to evaluate the proposed methodology; they show that the proposed strategies improve both tuning time and access time significantly. In particular, the proposed strategies are on average about 4 to 12 times better than the previous approach in terms of tuning time.

A receiver access control scheme is proposed to protect the multicast distribution tree from DoS attack induced by unauthorized use of IGMP, by extending the security-related functionality of IGMP. Based on a specific network and business model adopted for commercial deployment of IP multicast applications, a key management scheme is also presented for bootstrapping the proposed access control as well as accounting and billing for CP (Content Provider), NSP (Network Service Provider), and group members.

As a flexible, cost effective solution for a large-scale access network to the Internet, we have studied the design optimization of the Wireless Internet-access Mesh NETwork (WIMNET). WIMNET consists of multiple access points (APs) that have wireless links between them mainly on the wireless distribution system (WDS). In WIMNET, the links around the Internet gateway can be bottlenecks because every packet passes through it after multihop link activations. Besides, the link quality may be degraded by obstacles in indoor environments. Thus, the proper allocation of APs is essential in WIMNET, so that the communication quality should be ensured while the installation and management cost be minimized. In this paper, we formulate this AP allocation problem for indoor environments in WIMNET with the proof of the NP-completeness of its decision version. Then, we present its two-stage heuristic algorithm composed of the initial greedy allocation and the iterative improvement. The effectiveness of our proposal is verified through extensive simulations in three indoor environments.

Similar to orthogonal frequency-division multiplexing (OFDM) systems, orthogonal frequency-division multiple access (OFDMA) is vulnerable to carrier frequency offset (CFO). Since the CFO of each user is different, CFO compensation in OFDMA uplink is much more involved than that in OFDM systems. It has been shown that the zero-forcing (ZF) compensation method is a simple yet effective remedy; however, it requires the inversion of a large matrix and the computational complexity can be very high. Recently, we have developed a low-complexity iterative method to alleviate this problem. In this paper, we consider the theoretical aspect of the algorithm. We specifically analyze the output signal-to-interference-plus-noise-ratio (SINR) of the algorithm. Two approaches are used for the analysis; one is simple but approximated, and the other is complicated but exact. The convergence problem is also discussed. In addition to the analysis, we propose a pre-compensation (PC) method enhancing the performance of the algorithm. Simulations show that our analysis is accurate and the PC method is effective.

In this paper, the impacts of using multiple transmit antennas under doubly correlated MIMO channels on CDMA uplink code acquisition is studied. The performance of a MIMO code acquisition system is analyzed by considering spatial fading correlations, which depend on antenna spacing and azimuth spread at both MS and BS. The detection performance and mean acquisition time in the presence of spatially correlated MIMO channel are presented on a frequency selective fading channel and compared with the cases of spatial fading decorrelation via numerical evaluation. It is observed that the acquisition performance relies on the degree of spatial fading correlations. In addition, it is surprisingly seen that a MIMO code acquisition system provides worse performance than SIMO.

An expectation for more intelligent Web is recently being reflected through the new research field called Semantic Web. In this paper, related with Semantic Web security, we introduce an RDF triple based access control model having explicit authorization propagation by inheritance and implicit authorization propagation by inference. Especially, we explain an authorization conflict problem between the explicit and the implicit authorization propagation, which is an important concept in access control for Semantic Web. We also propose a novel conflict detection algorithm using graph labeling techniques in order to efficiently find authorization conflicts. Some experimental results show that the proposed detection algorithm has much better performance than the existing detection algorithm when data size and number of specified authorizations become larger.

We propose attribute-based encryption schemes where encryptor-specified policies (called ciphertext policies) are hidden. By using our schemes, an encryptor can encrypt data with a hidden access control policy. A decryptor obtains her secret key associated with her attributes from a trusted authority in advance and if the attributes associated with the decryptor's secret key do not satisfy the access control policy associated with the encrypted data, the decryptor cannot decrypt the data or guess even what access control policy was specified by the encryptor. We prove security of our construction based on the Decisional Bilinear Diffie-Hellman assumption and the Decision Linear assumption. In our security notion, even the legitimate decryptor cannot obtain the information about the access control policy associated with the encrypted data more than the fact that she can decrypt the data.

In this paper, performance of a novel interference cancellation technique for the single user detection in a direct-sequence code-division multiple access (DS-CDMA) system has been investigated. This new algorithm is based on the Cycle-and-Add property of PN (Pseudorandom Noise) sequences and can be applied for both synchronous and asynchronous systems. The proposed strategy provides a simple method that can delete interference signals one by one in spite of the power levels of interferences. Therefore, it is possible to overcome the near-far problem (NFP) in a successive manner without using transmit power control (TPC) techniques. The validity of the proposed procedure is corroborated by computer simulations in additive white Gaussian noise (AWGN) and frequency-nonselective fading channels. Performance results indicate that the proposed receiver outperforms the conventional receiver and, in many cases, it does so with a considerable gain.

In this letter, new families of binary low correlation zone (LCZ) sequences based on the interleaving technique and quadratic form sequences are constructed, which include the binary LCZ sequence set derived from Gordon-Mills-Welch (GMW) sequences. The constructed sequences have the property that, in a specified zone, the out-of-phase autocorrelation and cross-correlation values are all equal to -1. Due to this property, such sequences are suitable for quasi-synchronous code-division multiple access (QS-CDMA) systems.

This paper presents a novel interference cancellation (IC) scheme for both synchronous and asynchronous direct-sequence code-division multiple-access (DS-CDMA) wireless channels. In the DS-CDMA system, the multiple access interference (MAI) and the near-far problem (NFP) are the two factors which reduce the capacity of the system. In this paper, we propose a new algorithm that is able to detect all interference signals as an individual MAI signal by maximum correlation detection. It is based on the discovery of all the unknowing spreading codes of the interference signals. Then, all possible MAI patterns so called replicas are generated as a summation of interference signals. And the true MAI pattern is found by taking correlation between the received signal and the replicas. Moreover, the receiver executes MAI cancellation in a successive manner, removing all interference signals by single-stage. Numerical results will show that the proposed IC strategy, which alleviates the detrimental effect of the MAI and the near-far problem, can significantly improve the system performance. Especially, we can obtain almost the same receiving characteristics as in the absense of interference for asynchrnous system when received powers are equal. Also, the same performances can be seen under any received power state for synchronous system.

Exact bit error probabilities (BEP) are derived in closed-form for binary pulsed direct sequence (DS-) and hybrid direct sequence time hopping code division multiple access (DS/TH-CDMA) systems that have potential applications in ultra-wideband (UWB) communications. Flat Nakagami fading channel is considered and the characteristic function (CF) method is adopted. An exact expression of the CF is obtained through a straightforward method, which is simple and good for any arbitrary pulse shape. The CF is then used to obtain the exact BEP that requires less computational complexity than the method based on improved Gaussian approximation (IGA). It is shown under identical operating conditions that the shape of the CF, as well as, the BEP differs considerably for the two systems. While both the systems perform comparably in heavily faded channel, the hybrid system shows better BEP performance in lightly-faded channel. The CF and BEP also strongly depend on chip length and chip-duty that constitute the processing gain (PG). Different combinations of the parameters may result into the same PG and the BEP of a particular system for a constant PG, though remains nearly constant in a highly faded channel, may vary substantially in lightly-faded channel. A comparison of the results from the exact method with those from the standard Gaussian approximation (SGA) reveals that the SGA, though accurate for both the systems in highly-faded channel, becomes extremely optimistic for low-duty systems in lightly-faded channel. The SGA also fails to track several other system trade-offs.

Wide area ubiquitous wireless networks, which consist of access points (APs) connected to the fixed network and a great many wireless terminals (WTs), can offer a wide range of applications everywhere. In order to enhance network performance, we need to collect different kinds of data from as many WTs as possible; each AP must be capable of accommodating more than 103 WTs. This requirement can be achieved by employing DSA, a typical centralized media access control scheme, since it has high resource utilization efficiency. In this paper, we propose a novel DSA scheme that employs three new techniques to enhance throughput performance; (1) considering that most terminals tend to send data periodically, it employs both polling-based schemes, i.e. request-polling and data-polling, and a random access scheme. (2) In order to enhance bandwidth utilization effectiveness by polling, the polling timing is decided according to the data generation timing. (3) The AP decides the polled data size according to the latest distribution of data size and polls the WT for the data directly. If the data-polling size can not be determined with confidence, the AP uses request-polling instead of data-polling. Simulations verify that the proposed scheme offers better transmission performance than the existing schemes.

In this letter, a decision-directed MOE detector with excellent robustness against signature waveform mismatch is proposed for DS-CDMA systems. Both the theoretic analysis and computer simulation results demonstrate that the proposed detector can provide better SINR performance than that of conventional detectors.

We propose two multiple assignment secret sharing schemes realizing general access structures. One is always more efficient than the secret sharing scheme proposed by Ito, Saito and Nishizeki [5] from the viewpoint of the number of shares distributed to each participant. The other is also always more efficient than the scheme I of [7].