Parallel downloading retrieves different pieces of a file from different servers simultaneously and so is expected to greatly shorten file fetch times. A key requirement is that the different servers must hold the same file. We have already proposed a proxy system that can ensure file freshness and concordance. In this paper, we combine parallel downloading with the proxy server technology in order to download a file quickly and ensure that it is the latest version. Our previous paper on parallel downloading took neither the downloading order of file fragments nor the buffer space requirements into account; this paper corrects those omissions. In order to provide the user with the required file in correct order as a byte stream, the proxy server must reorder the pieces fetched from multiple servers and shuffle in the delayed blocks as soon as possible. Thus, "substitution download" is newly introduced, which requests delayed blocks from other servers to complete downloading earlier. Experiments on substitution download across the Internet clarify the tradeoff between the buffering time and the redundant traffic generated by duplicate requests to multiple servers. As a result, the pseudo-optimum balance is discovered and our method is shown both not to increase downloading time and to limit the buffer space. This network software can be applied to download files smoothly absorbing the difference in performance characteristics among heterogeneous networks.

In the age of pervasive computing, ubiquitous collaboration has become an every-day life paradigm. Without an ideal computing infrastructure, issues with ubiquitous collaboration, such as network unreliability, platform heterogeneity, and client's resource constraints, are inevitable. The traditional replication scheme copes with network unreliability by replicating all the objects of a shared application together at once. This is, however, suitable for neither cooperative applications nor mobile computing devices. These problems can be naturally addressed by using a fine-grained replication scheme that enables a portion of the application objects to be replicated. This paper presents an object-oriented middleware that is capable of dynamically and transparently replicating remotely shared Java applications in a partially and on-demand incremental manner. It is also able to maintain various consistency semantics and enables the coexistence of fine-grained replications and conventional remote method invocations. Empirical results indicate several practical benefits of the middleware.

Data grid consists of scattered computing and storage resources located dispersedly in the grid network. These large sized data sets are replicated in more than one site for the better availability to the other nodes in a grid. Downloading the dataset from these replicated locations have practical difficulties and we find interest in a co-allocated download framework, which enables parallel download of replicated data from multiple servers. In this paper, we proposed a dynamic co-allocation scheme for parallel data transfer in grid environment, which copes up with highly inconsistent network and server performance. The model comprises of co-allocator, monitor and control mechanisms. The scheme initially obtains the bandwidth parameter from the monitor module to fix the partition size and the data transfer tasks are allocated onto the servers in duplication. In this way, the process of data transfer can neither be interrupted nor paralyzed, even when the network link is broken or server crash. We used Globus toolkit for our framework by making use of grid information and GridFTP services. We compared our scheme with the existing schemes and the results show notable improvement in overall completion time of data transfer.

Key agreement for collaborative groups has become an increasingly popular research area. However, most of previous work requires each member to not only maintain the whole key tree structure whose size is O(N), where N is the size of group, but also involve rekeying operation upon each membership change, resulting in high costs in terms of storage, communication and computation and thus suffers from poor scalability. In this paper, we propose a scalable Distributed and collaborative group key agreement scheme using a Virtual Key Tree (D-VKT). Each group member in D-VKT only reserves and maintains partial information of the whole key tree structure with requirement of O(log N). Furthermore, a distributed tree balancing algorithm is presented to keep the whole key tree as balanced as possible for rekeying efficiency. In addition, a distributed group batch rekeying protocol is proposed to further reduce the computation and communication workload of group rekeying in a highly dynamic environment. The experiment results demonstrate that D-VKT can scale to large and dynamic collaborative groups.

This paper proposes a new identifier scheme for Internet Indirection Infrastructure (i3). i3 is an overlay network on top of IP, and realizes rendezvous-based communications. It provides a general solution to deal with communication primitives such as host mobility, multicast and anycast. Although i3 provides flexible communication mechanisms, it is not optimized for mobile and wireless communications. Thus, three key problems still remain to be addressed: header overhead, multiple trigger updates and detection of a close i3 server after handover. The proposed identifier scheme, called local ID, significantly reduces the overhead without sacrificing the flexibility of i3. In a typical case, the local ID makes the total header size nearly half that of the original protocol. This paper also discusses how to adapt the local ID to various types of i3 primitives, so that a mobile host can receive all the benefits of i3 communications.

Hierarchical Mobile IPv6 (HMIPv6) was designed to reduce the long handover time associated with MIPv6 by employing a hierarchy of Mobile Anchor Points (MAPs). However, the selection of MAP and its load status critically affect the system performance. Thus, in this paper, we introduce two novel dynamic MAP selection schemes for HMIPv6, that relieve overloaded MAPs as well as select a more suitable MAP according to each Mobile Node (MN)'s up-to-date mobility towards reducing inter-domain handover, resulting in saving the overall signaling cost. Further, we develop an analytical model of the average signaling cost for inter-domain handover to investigate the performance of another existing approach with its basis on IETF HMIPv6 as well as our schemes. We also perform simulations to evaluate the performance of our proposed schemes. It is shown via simulation and numerical results that the proposed dynamic MAP selection schemes can significantly reduce the number of inter-domain handovers and the average signaling cost as well as distribute load over multiple MAPs compared to the other existing approaches.

Currently, Mobile IPv6 (MIPv6) working group of Internet Engineering Task Force (IETF) recommends to execute the Binding Update (BU) using Return Routability (RR) procedure. However, the RR procedure doesn't entirely satisfy the security requirements of MIPv6. The previous BU protocols are also likely to reduce the efficiency since they iterate entirely BU protocol courses in Pico/Micro cellular environment in which it occurs frequently handoff or handover and some protocols don't consider that the Correspondent Node (CN) is movable node and has the limited resources. In this paper we propose the ETBU protocol, which is based on Cryptographically Generated Address (CGA) to provide mutual authentication between nodes; it considers that the CN is a movable node. This protocol doesn't require a Mobile Node (MN) to create a signature each time it obtains a new Care-of Address (CoA) unlike the previous CGA-based BU protocol. An MN and its CN issue the ticket to minimize the computing costs that need to calculate CGA. Also, the ETBU protocol minimizes the loss of traffic using smooth handoff or handover. A performance analysis shows that the scheme provides the security as much as the previous BU protocols and more efficiency than them in case that each node obtains the ticket. Therefore, the proposed ETBU protocol can be applied easily to the mobile network environments.

This paper presents sector based flooding (SBF) and adaptive sector-based flooding (ASBF) that are flooding methods for mobile ad hoc networks using position information. SBF, which divides the communication area of a sender node into sectors, allows only the node nearest to a sector representative position in each sector to rebroadcast a packet. SBF is divided into two methods, SBF-1 and SBF-2; the difference is the number of criteria used to decide whether to rebroadcast or to drop the packet. In ASBF, each node selects a flooding method from among SBF-1, SBF-2, and pure flooding, depending on its local node density. The node density is obtained from the distance between the sector representative position and its nearest node. Simulation results show that SBF reduces the number of packet transmissions generated in flooding and ASBF has high packet reachability with few packet transmissions.

Geographic distributed hash table (DHT) protocols are considered to be efficient for P2P object sharing in mobile ad-hoc networks. These protocols assume that the set of <key, value> pairs, called indexes, should be distributed among nodes according to the following hashing mapping rule: A key hashes into a geographic coordinate, and the corresponding index is stored at the node closest to the key's hash value. Therefore, when a node changes its position, some indexes have to be redistributed to other nodes in order to keep the hashing mapping rule consistent. The overhead of index redistribution may be high enough to impact the normal lookup operation if each node contains a large number of indexes. In this paper, we propose an efficient lookup protocol, called Double Indirect Access, that dispenses with index redistribution to improve lookup performance. The main idea is to determine the mapping from an index to a node not by the node's position, but by the node's static identifier that is obtained by hashing its MAC address into a geographic coordinate. However, a key lookup request will be routed to some node based on the key's hash value, resulting in failure of locating the index. In Double Indirect Access, the node to which a key lookup request has been routed is named as an indirection server, and it is responsible for relaying the lookup request to the node storing the corresponding index. In order for the indirection server to find out the correct destination node for the lookup request, it maintains a list of nodes' static identifiers whose values (i.e., geographic coordinates) are close to the location of the indirection server. Simulation results show that, when the average number of objects per node is more than 256, our approach is able to reduce the number of packet transmissions by about a half compared to the conventional geographical DHT protocol. It is also shown that, even when the average number of objects per node is about 9-16, the overhead of our approach is comparable with the conventional protocol.

Some major P2P file distribution systems adopt Tit-For-Tat exchange strategy, which means "initially cooperate, then respond in kind to a previous opponent's action, i.e. cooperative or not." However, when sharing a file on such P2P systems, the random peer selection has a problem in that each peer cannot download the file enough efficiently. The peer selection method that groups peers according to their rate has been proposed to solve this problem. This method is supposed to be able to alleviate the difference in performance among peers because it lets peers with similar transmitting rate connect to each other. However, when reduction in peer performance or link one occurs, which is often observed on today's Internet, some problems will emerge, such as it takes a long time for the existing method to reconfigure groups; 2) immediate reconstruction of neighbor peers has not been taken into account when peers detect deterioration in downloading performance. Therefore, we propose a method that reconfigures the group of neighbor peers once a peer notices that the performance of connected peers decreases. The proposed method is evaluated through simulation experiments using BitTorrent as an instance of Tit-For-Tat strategy. The download time of all peers and that of the peer with performance deterioration are estimated focusing on the effect of switching a degraded peer to another immediately. As a result, we confirm that our proposal can distribute files among all peers faster than the existing method keeping incentives for users to some extent. We believe that the proposal which can adapt to the sudden network deterioration is one of the most important technologies for evolution of network software.

In this paper we focus on building a large scale keyword search service over structured Peer-to-Peer (P2P) networks. Current state-of-the-art keyword search approaches for structured P2P systems are based on inverted list intersection. However, the biggest challenge in those approaches is that when the indices are distributed over peers, a simple query may cause a large amount of data to be transmitted over the network. We propose in this paper a new P2P keyword search scheme, called "Proof," which aims to reduce the network traffic generated during the intersection process. We applied three main ideas in Proof to reduce network traffic, including (1) using a sorted query flow, (2) storing content summaries in the inverted lists, and (3) setting a stop condition for the checking of content summaries. We also discuss the advantages and limitations of Proof, and conducted extensive experiments to evaluate the search performance and the quality of search results. Our simulation results showed that, compared with previous solutions, Proof can dramatically reduce network traffic while providing 100% precision and high recall of search results, at some additional storage overhead.

In peer-to-peer (P2P) networks, reputation is used to estimate the trustworthiness of servents and to help prevent untrustworthy resources from spreading by malicious servents. However, in dynamic scenarios with arrivals and departures of servents and resources, servent reputation is not enough to reduce the impacts of malicious behaviors such as lying, whitewashing, etc. In this paper, we propose a new reputation management model using both servent and resource reputation and demonstrate detail protocols to implement our model in structured P2P networks. Simulation results show that our model can reduce the rate of downloading untrustworthy resources more rapidly than the previous models even in dynamic scenarios where servents can rejoin with new identities, introduce new untrustworthy resources, and send wrong feedbacks. Also, we show that the proposed model and protocol can effectively share the load between servents.

We have successfully applied Generalized Multiprotocol Label Switching (GMPLS) architecture to the Wavelength Assignment Photonic Switching System (WAPS) to create an internet access system that can provide, between terminals, not only conventional best-effort type of IP packet forwarding, but also high-speed and Quality of Service (QoS)-guaranteed IP forwarding. In this paper the system architecture, system specifications, and system hardware/software implementations are described.

In this paper, we examine the Interleaved Polling with Adaptive Cycle Time (IPACT) that was proposed to control upstream traffic for Gigabit Ethernet-PONs, a promising technology for the Fiber To The Home (FTTH). We analyzed the performance for the gated service and the limited service mathematically. To do this, the IPACT protocol was modeled as a polling system and analyzed by using mean-value analysis technique. The traffic arrival rate λ was divided into three regions, and each region was analyzed separately and merged appropriately by using an interpolation method. The average packet delay, average queue size, and average cycle time of both the gated service and the limited service were obtained through the analysis. In order to evaluate the accuracy of the mathematical analysis, discrete event simulation was performed for the IPACT protocol. Simulation results show the accuracy of the mathematical analysis. The analysis results can be widely used in the design of the FTTH system based on EPON, as the performance results in the present study can be obtained in a rather short time. We can design an appropriate system depending on various traffic conditions by adjusting system parameters, such as the number of users N, the maximum transfer window W_MAX, and so on.

Multipath routing employs multiple parallel paths between the source and destination for a connection request to improve resource utilization of a network. In this paper, we present an integrated design of multipath routing with delay constraints and failure survivability in MPLS networks. By combining the failure survivability schemes into the multipath routing algorithms, path protection or restoration policies will enable the network to accommodate link failures and at the same time achieve significant improvement on network resource utilization. We propose a number of multipath routing algorithms, working-backup path selection and bandwidth allocation schemes. We evaluate the performance of the proposed schemes in terms of call blocking probability, network resource utilization and load balancing factor. Extensive simulation results validate the effectiveness of the proposed schemes. In particular, we compare these multipath schemes to the existing failure recovery schemes that mostly focus on single path routing. The results demonstrate that the proposed integrated design framework can provide effective network failure survivability, and also achieve better load balancing and/or higher network resource utilization.

This paper addresses the issue of deafness in MAC (Medium Access Control) protocols for wireless ad hoc networks using directional antennas. Directional antennas are expected to provide significant improvements over omni-directional antennas in ad hoc networks, such as high spatial reuse and range extension. Recently, several MAC protocols using directional antennas, typically referred to as directional MAC protocols, have been proposed for ad hoc networks. However, directional MAC protocols inherently introduce new kinds of problems arising from directivity. One major problem is deafness, caused by a lack of state information of neighbor nodes, whether idle or busy. This paper proposes DMAC/DA (Directional MAC with Deafness Avoidance) to overcome the deafness problem. DMAC/DA modifies the previously proposed MAC protocol, MDA (MAC protocol for Directional Antennas), to reduce the number of control messages and also maintain the ability to handle deafness. In DMAC/DA, WTS (Wait To Send) frames are simultaneously transmitted by the transmitter and the receiver after the successful exchange of directional RTS (Request To Send) and CTS (Clear To Send) to notify the on-going communication to potential transmitters that may experience deafness. The experimental results show that DMAC/DA outperforms existing directional MAC protocols, such as DMAC (Directional MAC) and MDA, in terms of throughput, control overhead and packet drop ratio under the different values of parameters such as the number of flows and the number of beams. In addition, qualitative evaluation of 9 MAC protocols is presented to highlight the difference between DMAC/DA and existing MAC protocols.

The dynamics of Mobile Ad-hoc NETworks (MANETs), as a consequence of mobility of mobile hosts, pose a problem in finding stable multi-hop routes for communication between a source and a destination. Traditional ad-hoc routing protocols are proposed to find multi-hop routes based on shortest path routing algorithms, which cannot effectively adapt to time-varying radio links and network topologies of MANETs. In this paper, a novel stability-based ad hoc routing protocol, which is named as Ad-hoc On-demand Stability Vector (AOSV) routing protocol, is proposed to properly and effectively discover stable routes with high data throughput and long lifetime by considering the radio propagation effect on signal strength. Here, a stochastic mobile-to-mobile radio propagation model is proposed to predict path loss as well as received signal strength between adjacent nodes, and the estimation of link/route stability is derived from the prediction of signal strength. With awareness of link and route stabilities, a path finding algorithm is designed to explore the stable route with largest route stability for a source and destination pair. The performance of AOSV protocol is compared with the well-known Ad-hoc On-demand Distance Vector (AODV) routing protocol and other related works. Simulation results indicate that the AOSV routing protocol leads to significant throughput increases up to 70% improvement comparing to AODV, and provides better performance than related works.

In this paper, we discuss TCP performance in a wireless overlay network where wireless LANs and cellular networks are integrated. In the overlay network, vertical handover, where a mobile node changes its access link during a session, is one of the most important technologies. When a vertical handover occurs, throughput performance of a TCP flow is degraded due to not only packet losses during the handover, but drastic change of its bandwidth-delay product. In this paper, we propose an ACK-pacing mechanism for TCP congestion control to improve the performance degradation. The proposed system is receiver-driven, so no modification is required to the mechanism of TCP sender. In the proposed system, a TCP receiver adjusts a transmission rate of ACKs according to the relationship between bandwidth-delay products before and after a handover. Since the ACK-clocking mechanism of TCP adjusts the transmission rate of TCP segments, the TCP receiver can seamlessly adjust its congestion window size to the new bandwidth-delay product. Computer simulation results show that the proposed system can improve the TCP performance during the vertical handover.

From the introduction of CodeRed and Slammer worms, it has been learned that the early detection of worm epidemics is important in order to reduce the damage resulting from outbreaks. A prominent characteristic of Internet worms is the random selection of subsequent targets. In this paper, we propose a new worm detection mechanism by checking the random distribution of destination addresses in network traffic. The proposed mechanism constructs a matrix from network traffic and checks the rank of the matrix in order to detect the spreading of Internet worms. From the fact that a random binary matrix holds a high rank value, ADUR (Anomaly Detection Using Randomness check) is proposed for detecting unknown worms based on the rank of the matrix. From experiments on various environments, it is demonstrated that the ADUR mechanism effectively detects the spread of new worms in the early stages, even when there is only a single host infected in a monitoring network. Also, we show that ADUR is highly sensitive so that the worm epidemic can be detectable quickly, e.g., three times earlier than the infection of 90% vulnerable hosts.

In DS-CDMA cellular communications systems, the single frequency reuse can be utilized. Since large other-cell interference is produced, the well known soft handover or site diversity must be used. If the single frequency reuse is not utilized to avoid the other-cell interference, we will face the frequency allocation problem, similar to FDMA systems. In this paper, a DS-CDMA cellular system using band division is proposed. The available wide frequency band is divided into several narrow frequency bands and the different frequency bands are allocated to adjacent cells so as to avoid the large other-cell interference. For the frequency allocation, the channel segregation distributed channel allocation (CS-DCA) algorithm is applied. The link capacity is evaluated by computer simulation.

In a typical installation of an 802.11 based WLAN (Wireless Local Area Network), mobile hosts would access the network through APs (Access Points), even when two mobile stations communicate within the same WLAN. Effectively, all the packets in a WLAN are required to forward through the AP according to the MAC (Medium Access Control) layer protocol. Since the AP has the same priority as the other mobile stations to access the channel, the AP usually becomes a bottleneck in WLANs and the network performance degrades significantly. In this paper, we propose a new MAC layer protocol for WLANs in order to improve the throughput performance. Theoretical analysis and simulation results show that our new protocol works much better in WLAN than the standard DCF.

MC-CDMA is an attractive multi-access method for the next generation high-speed mobile communication systems. The uplink transmission performance is limited by the multi-access interference (MAI) from other users since all users share the same bandwidth. Adaptive antenna array can be used to suppress the MAI and to improve the uplink transmission performance. In this paper, we propose a frequency-domain adaptive antenna array for multi-code MC-CDMA. The proposed frequency-domain adaptive antenna array uses a simple normalized LMS (NLMS) algorithm. Although the NLMS algorithm is used, very fast weight convergence within one MC-CDMA symbol duration is achieved since the weight updating is possible as many times as the number of subcarriers within one MC-CDMA symbol duration.

This paper proposes a maximum likelihood sequence estimation (MLSE) for the differential space-time block code (DSTBC) in cooperation with blind linear prediction (BLP) of fast frequency-flat fading channels. This method that linearly predicts the fading complex envelope derives its linear prediction coefficients by the method of Lagrange multipliers, and does not require data of decision-feedback or information on the channel parameters such as the maximum Doppler frequency in contrast to conventional ones. Computer simulations under fast fading conditions demonstrate that the proposed method with an appropriate degree of polynomial approximation is superior in BER performance to the conventional method that estimates the coefficients by the RLS algorithm using a training sequence.

In multi-input multi-output orthogonal frequency division multiplexing (MIMO-OFDM) systems, phase tracking schemes suffer from co-channel interference (CCI) and inter-carrier interference (ICI) caused by residual frequency offset. In this paper, we propose a residual frequency offset compensation scheme using feedback phase tracking to eliminate the effect of both ICI and CCI for MIMO-OFDM systems. The proposed phase tracking scheme estimates the amount of residual frequency offset in the frequency domain, and compensates for it in the time domain, periodically. Thus, the effect of ICI can be reduced. Furthermore, we consider two methods of channel estimation that enable the system to estimate the channel response several times within a packet to eliminate the effect of CCI. This is because the channel is generally estimated at the beginning of a packet, and this estimation is affected by residual frequency offset. First is the method that employs midambles. Second is the one that reuses the preamble. When the channel is estimated several times within a packet, the effect of CCI can be reduced. Simulation results show the proposed scheme can compensate for residual frequency offset and CCI more accurately than the conventional scheme, and improve the packet error rate (PER) performance.

This paper presents a novel threshold-based selection scheme to combine adaptive transmit antenna selection with an adaptive quadrature amplitude modulation (AQAM) for a spatial multiplexing (SM) multiple-input multiple-output (MIMO) system with linear receivers in practical uncorrelated and correlated channel conditions. The proposed scheme aims to maximize the average spectral efficiency (ASE) for a given bit error rate (BER) constraint and also to lower the hardware complexity. Our simulations are run on a general MIMO channel model, under the assumption that the channel state information (CSI) is known at the receiver and the adaptive control signaling can be perfectly fed back to the transmitter. We deploy the low rank-revealing QR (LRRQR) algorithm in transmit antenna subset selection. LRRQR is computationally less expensive than a singular value decomposition (SVD) based algorithm while the two algorithms achieve similar error rate performances. We show that both the conventional AQAM scheme (i.e., without adaptive transmit antenna selection) and the SM scheme perform poorly in a highly correlated channel environment. We demonstrate that our proposed scheme provides a well-behaved trade-off between the ASE and BER under various channel environments. The ASE (i.e., throughput) can be maximized with a proper choice of the channel quality threshold and AQAM mode switching threshold levels for a target BER.

Ultra-wideband impulse-radio systems have the ability to resolve multiple paths of the transmit radio and to mitigate the fading. Rake reception is capable of combining these paths, thereby improving the signal-to-noise ratio. In LOS channel, however, the improvement may be comparatively small for the cost of increasing receiver system complexity. This is because the LOS path should be dominant for the total energy in all paths. In this paper the distribution of the energy captured by Rake receiver is first presented for 160 measured LOS channel cases and then discussed. Rake reception with reflector is next suggested in order to effectively increase the signal energy without increasing the complexity, that is, increased number of Rake fingers. The use of reflector is also suggested for non-LOS channel and experimentally discussed where the Rake gain is compared with conventional Rake without reflector. The measurement results show the usefulness.

Antenna array is essential factor for multiple- input multiple-output (MIMO) wireless systems. Since the antenna array is composed of closely spaced elements, the mutual coupling among the elements cannot be ignored for the best performance of the array. Mutual coupling affects the MIMO channel, so the performance of a MIMO system, including channel capacity and diversity, varies with the degree of mutual coupling. The effect of mutual coupling is a function of the antenna load impedance. Therefore, designing an optimal element-matched array for a MIMO system requires consideration of the optimal matching condition for the array elements, the one that maximizes the channel capacity. We evaluated the effects of mutual coupling with various matching conditions in dipole arrays, and investigated their effects on the path correlation and channel capacity of MIMO systems. Simulation showed that the conventional conjugate matching of each element is still suitable for closely spaced elements except when the separation is about less than 0.1λ. Theoretical consideration of the received power of a closely-spaced-element array is also provided to show the effects of mutual coupling.

Minimizing the Side Lobe Level (SLL) and attain highest achievable Beam Collection Efficiency (BCE) is a critical goal for Solar Power Station/Satellite (SPS). If all antennas are uniformly excited then the main beam will carry only a part of the total energy due to the higher SLL. SLL is decreased and BCE is increased by adopting edge tapering for SPS. But edge tapering is a complex technical problem for SPS. So an optimization is needed between uniform amplitude distribution and edge tapering system. We have derived a new method of edge tapering called Isosceles Trapezoidal Distribution (ITD) edge tapering. Only a small number of antennas from each side of the phased array antenna are tapered in this method. ITD edge tapering is almost uniform so it is technically better. We have compared different amplitude distribution systems; uniform, Gaussian, Dolph-Chebyshev and the newly derived ITD method. The SLL reduction in ITD is even lower than those of other kinds of edge tapering. Therefore the amount of losing power in the SLL in ITD is lower. As a result the interference level becomes lower and BCE becomes higher in this method. The higher BCE and better SLL performance than those with uniform distribution can be achieved in ITD with phase error and under unit failed condition.

In this letter, we propose a new modification to the belief propagation (BP) decoding algorithm for Finite-Geometry low-density parity-check (LDPC) codes. The modification is based on introducing feedback into the iterative process, which can break the oscillations of bit log-likelihood ratio (LLR) values. Simulations show that, with a given maximum iteration, the "feedback BP" (FBP) algorithm can achieve better performance than the conventional belief propagation algorithm.

To control various access privileges in group-oriented applications having multiple data streams, we present a novel reactive key management scheme where each member can obtain the key of a data stream from public parameters only when necessary. Compared with the previous schemes, this scheme significantly reduces the amount of rekey messages for dynamic membership change due to its reactive nature.

In recent years, the inherent effectiveness of Peer-to-Peer (P2P) networks has been advocated to address scalability issues in large scale Internet-based on-Demand streaming services. Most of existing works adopt Cache-and-Relay (CR) scheme to exploit a cooperative paradigm among peers. In this paper, we mainly present our practical evaluation study of the scalability of the CR scheme by taking into account of more than 20,000,000 collected real traces. Based on trace-driven simulations, we conclude that the CR scheme is not as effective as previously reported in terms of saving server bandwidth.

In this letter, we propose a new State Model for IPv6 Interfaces, which can help the administrator in determining the status of the IPv6 Interface at any instant. This State Model is superior to the current model as it provides additional information as to why an IPv6 Interface is unavailable for performing the provisioned service and, it is also flexible to define new Secondary State and Secondary State Qualifiers in the future. This State Model helps the administrator to decide what actions he may need to take to bring the Interface UP. Ths State Model is based on the Control State Machine implemented in the Samsung's IPv6 Protocol Stack.

Spatial multiplexing (SM) offers a linear increase in transmission rate without bandwidth expansion or power increase. In SM systems, the LMMSE receiver establishes a good tradeoff between the complexity and performance. The performance of the LMMSE receiver would be degraded by MIMO channel estimation errors. This letter focus on obtaining the asymptotic convergence of output interference power and SIR performance for the LMMSE receiver with channel uncertainty. Exactly matched simulation results verify the validity of analysis in the large-system assumption. Furthermore, we find that the analytical results are also valid in the sense of average results for limited-scale system in spite of the asymptotic assumption used in derivation.

Based on the channel properties of of the meteor burst communication, a kind of semi-irregular LDPC codes suitable for MBC is presented. Simulation results show that the application of this kind of semi-irregular LDPC codes in MBC yields better performance than the regular ones. Some theoretical analyses are given.

The main disadvantage of orthogonal frequency division multiplexing (OFDM) is the high time domain PAPR. The larger PAPR signal would fatally degrade BER performance in non-linear channels. This paper proposes an improved DSI method, which can achieve better PAPR and BER performances in the non-linear channel with less computation complexity than the conventional DSI method. The feature of proposed method is to employ the time-frequency domain swapping algorithm in the determination of frequency data for dummy sub-carriers. This paper presents various computer simulation results to verify the effectiveness of proposed DSI method.

In this letter, the effects of transmit beamforming on downlink performance in DS-CDMA communication systems are examined. We present a simple-to-use expression for the conditional instantaneous SINR after Rake combining. Assuming BPSK modulation, the performance of average bit error rate is evaluated. We compare the average BER performance obtained by different beamforming methods under frequency selective multipath fading channels.

Since the accuracy of channel prediction influences the performance of adaptive multiple-input-multiple-output (MIMO) systems in Rayleigh fading channels, we analyze the performance of adaptive V-BLAST systems with a minimum-mean-square-error (MMSE) channel predictor in this paper. Considering the channel prediction error, we obtain the closed-form expressions for the bit-error-rate (BER) and throughput of adaptive V-BLAST systems, and maximize system transmission rate by choosing optimum block length under BER constraint. The numerical results reveal the critical value of channel prediction error below which systems can match the transmission rate of the systems with perfect channel prediction.