Multi-rate capabilities are supported by the physical layers of most 802.11 devices. To enhance the network throughput of MANETs, transfer rate adaptation schemes at MAC layer should employ the multi-rate capability at physical and the information of previous transmissions provided by MAC and physical layers. In this paper, we propose a transfer rate adaptation scheme plus back-to-back frame transmissions, and fragmentation at MAC layer, named TRAF. TRAF adopts a bi-direction-based approach with an extended option to select an appropriate rate for frame transmission under fast changing channel conditions. Consecutive back-to-back frame transmissions to fully utilize good channel quality during a coherent time interval and fragmentation algorithm to maintain high throughput under worse channel conditions are recommended in TRAF. Extensive simulation is experimented to evaluate the performance of TRAF. Regarding simulation results, frame delivery ratio, network throughput, and fairness of TRAF are significantly improved by comparing to that of fix rate, ARF, RBAR, OAR, and AAR protocols.

In this paper, we propose a modeling framework for supporting QoS routing in mobile ad-hoc wireless networks. The basic motivations of the proposed modeling approach stem from the commonality observed in the location uncertainty in mobile ad-hoc wireless networks and the concept of entropy. These common characteristics have motivated our work in developing an analytical modeling framework using entropy concepts and utilizing mobility information as the corresponding variable features, in order to support and evaluate route stability in self-organizing mobile ad-hoc wireless networks. The corresponding methodology, results and observations can be used by the routing protocols to select the most stable route between a source and a destination, in an environment where multiple paths are available, as well as to create a convenient performance measure to be used for the evaluation of the stability and connectivity in a mobile ad-hoc wireless networks.

Quality of Service (QoS) provisioning is a new but challenging research area in the field of Mobile Ad hoc Network (MANET) to support multimedia data communication. However, the existing QoS routing protocols in ad hoc network did not consider a major aspect of wireless environment, i.e., mutual interference. Interference between nodes belonging to two or more routes within the proximity of one another causes Route Coupling. This can be avoided by using zone-disjoint routes. Two routes are said to be zone disjoint if data communication over one path does not interfere with the data communication along the other path. In this paper, we have proposed a scheme for supporting priority-based QoS in MANET by classifying the traffic flows in the network into different priority classes and giving different treatment to the flows belonging to different classes during routing so that the high priority flows will achieve best possible throughput. Our objective is to reduce the effect of coupling between routes used by high and low priority traffic by reserving zone of communication. The part of the network, used for high priority data communication, i.e, high priority zone, will be avoided by low priority data through the selection of a different route that is maximally zone-disjoint with respect to high priority zones and which consequently allows contention-free transmission of high priority traffic. The suggested protocol in our paper selects shortest path for high priority traffic and diverse routes for low priority traffic that will minimally interfere with high priority flows, thus reducing the effect of coupling between high and low priority routes. This adaptive, priority-based routing protocol is implemented on Qualnet Simulator using directional antenna to prove the effectiveness of our proposal. The use of directional antenna in our protocol largely reduces the probability of radio interference between communicating hosts compared to omni-directional antenna and improves the overall utilization of the wireless medium in the context of ad hoc wireless network through Space Division Multiple Access (SDMA).

Recently, the mulitihop wireless network system attracts the interest of many people as a communication network system of the next generation. The multihop wireless network has unique features in which neither base stations nor wired backbone networks are required and a terminal can communicate with the other terminal beyond the transmission range by multihopping. In this network, a communication link between two terminals which can communicate directly is required a channel. Since cochannel interference may occur, we need to assign channels to communication links carefully. In this paper, we describe a channel assignment strategy which takes the degree of cochannel interference into consideration, and we evaluate an effectiveness of this strategy by computer simulations. We show that this strategy is more effective than a strategy which does not take the degree of cochannel interference into consideration. And we also consider a few channel assignment algorithms briefly.

In wireless communication systems where users compete for limited bandwidth, radio resource control is essential for throughput enhancement and delay reduction. In this paper, we present a game-theoretical approach to distributed resource control in CDMA systems. Incomplete information about channel conditions is considered. The resource control problem is formulated as a noncooperative game of incomplete information, with which the existence and uniqueness of the Bayesian Nash equilibrium (BNE) of the game is investigated. Since the equilibrium is Pareto inefficient, we propose a pricing policy to the resource control game by adding a penalty price to user's transmission cost. With the adoption of the price, user's aggressive behavior is depressed, and Pareto improvement is achieved. Also the Pareto efficient BNE of the game with pricing is studied. Simulation results show that users can obtain higher throughput and lower average packet transmission delay by proper pricing policy. It is also verified that the scheme of pricing policy is robust when information of channel conditions is inaccurate.

Band Division MC-CDM (BD-MC-CDM) has been proposed for high quality wireless communications and has been investigated in terms of link level performance. In this paper, we investigate frequency band and time slot selection technique from the viewpoint of system level performance in order to realize the efficient BD-MC-CDM system under cellular environments. Then a downlink frequency band and time slot selection scheme is proposed for cellular BD-MC-CDM systems. The proposed scheme selects transmission frequency band according to the signal-to-interference ratio (SIR) estimated by using the pilot signal at mobile stations and also selects transmission time slot by using the SIR threshold. Simulation results show that the proposed scheme improves the downlink throughput but degrades delay performance and it has a trade off between throughput and delay performance. By selecting suitable control parameters, the proposed scheme achieves the throughput improvement without sacrificing the delay performance.

The high-end telecom terminal and PDAs, sometimes called Personal Trusted Devices (PTDs) are programmable, have tens of megabytes memory, and rather fast processors. In this paper we analyze, when it is energy-efficient to transfer application data compressed over the downlink and then decompress it at the terminal, or compress it first at the terminal and then send it compressed over up-link. These questions are meaningful in the context of usual application code or data and streams that are stored before presentation and require lossless compression methods to be used. We deduce an analytical model and assess the model parameters based on experiments in 2G (GSM) and 3G (FOMA) network. The results indicate that if the reduction through compression in size of the file to be downloaded is higher than ten per cent, energy is saved as compared to receiving the file uncompressed. For the upload case even two percent reduction in size is enough for energy savings at the terminal with the current transmission speeds and observed energy parameters. If time is saved using compressed files during transmission, then energy is certainly saved. From energy savings at the terminal we cannot deduce time savings, however. Energy and time consumed at the server for compression/decompression is considered negligible in this context and ignored. The same holds for the base stations and other fixed telecom infrastructure components.

In communication systems such as mobile telecommunication systems and the Internet, resource sharing among coexisting real-time and non-real-time services is extremely important to provide multimedia services. This paper analytically investigates the performance of the packet data control algorithm proposed in. This algorithm efficiently uses radio resources by utilizing the remaining capacity that is not used by real-time services. The state probability vectors and transition probability matrices of both the real-time and non-real-time services are first derived and then the delay characteristics, the outage probability of voice users, and the outage probability of data users are evaluated. A performance analysis with high bit-rate non-real-time services is also presented.

W-CDMA (Wideband-CDMA) is expected to play a significant role in the radio access technology of third-generation mobile telecommunication systems. In second-generation systems, voice traffic from each user has been transmitted mainly via the dedicated transport (radio) channel. In addition, the third-generation systems will efficiently accommodate data traffic based on packet transmission in the shared common transport channel. Therefore, data traffic can be transmitted via one of two types of data channels: i.e., dedicated channels or common channels. However, the channel selecting/switching scheme has not been standardized; thus, system architectures and algorithms of channel-switching schemes in the RNC (Radio Network Controller) are dependent on its vendors, and network operators must determine the parameter settings related to channel selection. In this paper, we will deal with aspects of the architecture in detail, and propose possible algorithms for channel selecting/switching for fundamental reference systems which meet the specifications of the RNC. We will then evaluate our algorithms by means of simulations, and discuss the impact of parameter settings on performance, in terms of packet loss probability and utilization of dedicated channels.

In a telecommunication network system, a scheme for reforwarding call-terminating setup messages (SETUP messages) is used to guard against their loss. We have developed a method for evaluating the loss probability of these reforwarding schemes. We started with a stochastic model in which the messages are reforwarded after a constant time span from the time that the first messages have been forwarded. This model corresponds to the finite-capacity BPP/M/1/m model. We showed a method for calculating the "timeout" probability. We then added an approximate method for calculating the loss probability. Finally, using the proposed methods, we clarified the existence of the best reforwarding timelag.

In mobile multimedia environment, it is very important to minimize handoff latency due to mobility. In terms of reducing handoff latency, Hierarchical Mobile IPv6 (HMIPv6) can be an efficient approach, which uses a mobility agent called Mobility Anchor Point (MAP) in order to localize registration process. However, MAP can be a single point of failure or performance bottleneck. In order to provide mobile users with satisfactory quality of service and fault-tolerant service, it is required to cope with the failure of mobility agents. In, we proposed Robust Hierarchical Mobile IPv6 (RH-MIPv6), which is an enhanced HMIPv6 for fault-tolerant mobile services. In RH-MIPv6, an MN configures two regional CoA and registers them to two MAPs during binding update procedures. When a MAP fails, MNs serviced by the faulty MAP (i.e., primary MAP) can be served by a failure-free MAP (i.e., secondary MAP) by failure detection/recovery schemes in the case of the RH-MIPv6. In this paper, we investigate the comparative study of RH-MIPv6 and HMIPv6 under several performance factors such as MAP unavailability, MAP reliability, packet loss rate, and MAP blocking probability. To do this, we utilize a semi-Markov chain and a M/G/C/C queuing model. Numerical results indicate that RH-MIPv6 outperforms HMIPv6 for all performance factors, especially when failure rate is high.

Future mobile communication systems are expected to support multimedia applications (audio phone, video on demand, video conference, file transfer, etc.). Multimedia applications make a great demand for bandwidth and impose stringent quality of service requirements on the mobile wireless networks. In order to provide mobile hosts with high quality of service in the next generation mobile multimedia wireless networks, efficient and better bandwidth reservation schemes must be developed. A novel traffic-based bandwidth reservation scheme is proposed in this paper as a solution to support quality of service guarantees in the mobile multimedia wireless networks. Based on the existing network conditions, the proposed scheme makes an adaptive decision for bandwidth reservation and call admission by employing fuzzy inference mechanism, timing based reservation strategy, and round-borrowing strategy in each base station. The amount of reserved bandwidth for each base station is dynamically adjusted, according to the on-line traffic information of each base station. We use the dynamically adaptive approach to reduce the connection-blocking probability and connection-dropping probability, while increasing the bandwidth utilization for quality of service sensitive mobile multimedia wireless networks. Simulation results show that our traffic-based bandwidth reservation scheme outperforms the previously known schemes in terms of connection-blocking probability, connection-dropping probability, and bandwidth utilization.

As various mobile communication systems have developed, dramatically integrated wireless network, where users can communicate seamlessly via several wireless access systems, have become expected. At present, there are many studies of integrated wireless network, but no study of a network design method. Therefore, in this paper, we discuss a network design method for integrated wireless networks. Because of the handover procedure, the network design where adjacent base stations are connected to the same router, regardless of radio system type, is simply considered. However, in such a design, where mobile users crowd into a particular area and users' access to the base stations located there increases, the load of these accesses is centralized to the single router. To overcome this problem, we propose a new network design wherein the base stations of heterogeneous wireless communication systems, the service areas of which overlap, are connected to a different router. In the proposed network design, although users' accesses are concentrated on the base stations located in a particular area, users in that area can be assigned bandwidth of several upper links according to the access conditions of the base stations in neighboring areas. Finally, we show the excellent performance of the proposed design by simulation experiments.

Currently, the IP infrastructure is widely available, which reduces the deployment and implementation cost of IP-based wireless networks. But, the corresponding researches on Quality of Service (QoS) in wireless mobile networks have not been done sufficiently. Although All-IP network has gotten the spotlight for both wired and wireless integrated networks, it has some unavoidable defects as it is based on best-effort IP transmission technologies. By focusing our attention on this point, we propose an Advanced QoS Provisioning Scheme (AQPS) that can provide satisfied QoS for multimedia applications based on accurate traffic measurements. With the AQPS, we consider 1xEV-DV system as a target system, extract QoS requirements for this system, and develop a corresponding QoS provisioning method using CDMA traffic measurement. The AQPS is designed to estimate delay parameters between a mobile station and a BTS (or repeater), verify whether the mobile station can support RSVP or not, operate a corresponding scheduler, and assign appropriate time slots based on traffic classes. One of the interesting results of this research is that the capability of distinguishing BTS' traffic from repeater's traffic helps save implementation cost of CDMA systems. The AQPS has been verified to outperform the existing system used in the current CDMA network and to efficiently manage network resources by computer simulations.

This paper proposes "Handover with Proactive Anchor Router Relocation and Data Buffering" to suppress packet loss and packet miss-ordering during handover. To prevent packet miss-ordering, anchor router is proactively relocated to the optimal position before the mobile terminal performs handover. And, to eliminate packet loss during handover, anchor router buffers the packet only during handover. Moreover, anchor router assigns sequential numbers to the buffered packets to eliminate duplicate packet reception. Simulation results show that our proposal eliminates packet miss-ordering and duplicate reception while preventing packet loss.

IP multicast is seen as an efficient way of encouraging multimedia services such as Internet TV and Videoconferencing because it can deliver packets to multiple users while efficiently using network resources. Source Specific Multicast (SSM) is suggested as the IP multicast routing protocol and it can construct multicast trees efficiently. However it increases multicast forwarding table entries and fails to handle source mobility. This paper proposes the Unicast Extension Multicast Protocol (UMP) to solve these problems. In the protocol, only the routers that act as branching points keep multicast forwarding table entries, and packets are delivered between these routers using IP unicast. This prevents the multicast forwarding table entries from burdening other non-branch routers. Additionally, UMP supports source mobility by using the recursive join messages to prevent the creation of redundant paths while supporting source mobility.

Service differentiation has been a subject of research for the past few years in the IETF; and in the current Internet, IP flows are mostly treated in a best-effort approach. However, for next generation networks it is expected that users would like to obtain service differentiation based on their preferences or profiles as well as the different types of multimedia they opt to receive or send. In addition, current Quality of Service (QoS) provisioning architectures have been designed mostly for the fixed networks without taking into consideration the wireless or radio links special requirements, such as low bandwidth availability, error prone communications, etc. In this paper we propose a QoS provisioning architecture for next generation networks that uses a hybrid approach to deal with both the wireless and wired (fixed) part of the network. For administering the scarce resource of the radio environment, we have developed a resource allocation algorithm based on micro-economic principles that uses associated piecewise linear utility functions which describe the benefit a user receives from the allocation of various amounts of resource. For the wired part of the network we have also developed a Core-Stateless Utility based Rate allocation Framework (SURF) for performing traffic policing where the flow's requirements are expressed using utility functions. The core routers maintain no per-flow state and implement a simple packet level admission control algorithm that is based on a threshold utility value that is computed dynamically. To tie in these two mechanisms, we developed a signaling mechanism that collect network statistics when a user starts a call and a QoS administrator entity (or Broker) perform the computations for allocating resources based on the information of available resources in the fixed and the wireless sections of the network. A comparison between the hybrid approach and the SURF approach to show the performance of the proposed architecture is presented later in the paper.

This paper proposes the constraint availability and bandwidth shortest path (CABSP) selection algorithm and the extension of the adaptive modulation scheme to the CABSP (CABSP-AM) selection algorithm in the millimeter-wave (MMW) broadband entrance network for wireless heterogeneous systems. The CABSP algorithm considers the availability denoted as the quality of the MMW which is severely affected by the rainfall. The CABSP-AM algorithm, moreover, is proposed to further make more efficient use of bandwidth resources by considering the QoS requirements of each class of service in multimedia communication. As the results, the CABSP algorithm yields higher throughput performance than the conventional constraint shortest path (CSP) selection algorithm, but lower than the CABSP-AM algorithm. The spectrum efficiency improvements of the CABSP-AM over the CABSP are about 1.36 and 1.48 fold in case of error sensitive and non-sensitive classes respectively.

This paper considers a wireless LAN system operated in a multiple-cell environment with universal frequency reuse. A key technical goal is to increase cell-capacity within a cell. A very high-rate wireless LAN system, maximum data rates of over 100 Mbit/s, is proposed that offers an expanded signal-bandwidth compared to that specified in IEEE802.11a. The system employs OFDM and MC/CDMA signals in packet mode. It falls back from OFDM signals with low subcarrier modulation orders to MC/CDMA signals. A link level performance comparison shows that OFDM has superior performance to MC/CDMA at over 32 Mbit/s. Under 16 Mbit/s, however, MC/CDMA can establish wireless link connections unlike OFDM. Thus the fallback technique, which is triggered by the CIR environment, should select OFDM if the data rate exceeds 32 Mbit/s. It should fallback to MC/CDMA if the rate is less than 16 Mbit/s. We also evaluate the proposed scheme in a multiple-cell environment with universal frequency reuse, where the severe co-channel (other-cell) interference is present. We derive a cell capacity criterion for wireless LAN systems, and show that the proposed scheme offers a 2.2 times larger available transmission distance than the OFDM-only scheme. In addition, it is found that the proposed scheme offers a 1.3 times improvement in cell capacity compared to the MC/CDMA-only scheme, even if all other-cell interference is considered.

In this paper, an adaptive transmission scheme considering the stay time in a spot mobile access system is proposed. The proposed adaptive transmission scheme selects the modulation format according to the user's stay time in the spot communication zone and the types of data requested by each user. In the proposed system, when the stay time of a user is short, high-speed modulation is selected for this user. When the stay time of a user is long, a more reliable modulation format is selected. The computer simulation results show that the proposed transmission scheme without any channel estimation can achieve the same or better performance than when using the modulation format fixedly when the carrier-to-noise ratio changes rapidly.

The wireless LAN standards of HiperLAN2 and HiSWANa provide wireless access with high data rates in the 5 GHz band. The specifications of these standards include connection control procedures but do not define them in detail. In this paper, practical procedures and additional functions of connection control are described, such as efficient DUC bandwidth control for unicast and multicast, non-authenticated multicast, and authentication with the AAA server. These procedures and functions exceed the scope of HiperLAN2 and HiSWANa standards. Ways of implementing these connection control procedures efficiently are also provided.

The rapid spread of cellular phones in recent years has facilitated not only voice communication but also Internet access via the cellular phone system, and in addition, subscriber demand has led to a diversification in the services provided. One service in high demand is the seamless use of cellular phones in both public and private wireless network areas. In the data world, there is already such an application in the form of public and private use of wireless LAN. However, an increase in the number of users would require the realization of low-cost, easy-to-install very small base stations (VSBS) that use the frequency band efficiently in order to allow private use of ordinary cellular phones. To bring such VSBS into effect, a technology that autonomously selects frequencies which do not interfere with the public communication system from out of the publicly used frequency band is essential for turning such VSBS into reality. This paper proposes a frequency selection algorithm that actively uses cellular phone features such as frequency selection and received signal level measurement, and discusses the results of verification experiments.

Hot spot service based on wireless LANs is expected to play an important role in the beyond 3G wireless networks. Although spatial coverage is very limited, a comfortable and higher speed compared with a cellular system is available there. However, there might exist nodes that cannot communicate directly with an Access Point (AP) because of the distant location or the shadowing due to obstacles. Accordingly, the introduction of two-hop relaying to the hot spot is useful to extend the coverage and avoid the dead spot. However, the throughput per node is getting decreased as the hot spot coverage area increases. Therefore, in this paper, we propose a scheme to reuse the same channel spatially wherever possible and apply it to the HiperLAN/2 based wireless LAN hot spot with two-hop relaying to compensate for the decrease of the throughput per node. Namely, we modify the HiperLAN/2 protocol in such a way that a time slot is reused at the nodes spatially separated far enough not to cause packet collision. Thus, the throughput is expected to be improved and confirmed by a theoretical analysis and computer simulations.

We consider a new post-filtering algorithm for residual acoustic echo cancellation in hands-free application. The new post-filtering algorithm is composed of AR analysis, pitch prediction, and noise reduction algorithm. The residual acoustic echo is whitened via AR analysis and pitch prediction during no near-end talker period and then is cancelled by noise reduction algorithm. By removing speech characteristics of the residual acoustic echo, noise reduction algorithm reduces the power of the residual acoustic echo as well as the ambient noise. For the hands-free application in the moving car, the proposed system attenuated the interferences more than 15 dB at a constant speed of 80 km/h.

The suitability of a complex MIMO channel matrix for spatial multiplexing is verified experimentally in terms of the Demmel condition number. The instantaneous 2 2 MIMO-OFDM channel measurements in several indoor environments indicate the location dependency of the condition number. Wideband frequency characteristics are also analyzed to evaluate the applicability of spatial multiplexing.

Orthogonal frequency division multiplexing (OFDM) is a possible candidate for the modulation used in mobile multimedia communications because of its robustness to fading and flexibility of transmission rate. Partial transmit sequence (PTS) is an effective technique for reducing the peak power of OFDM signals by means of phase rotation. In PTS, side information (SI) is transmitted to correct the effects of the phase rotation. We propose a new method based on rotationally invariant trellis coded modulation for coded OFDM with PTS. In this method, no SI is required and the few information bits affected by the phase rotation are not used as data. (They are regarded as dummy bits). It is shown that the proposed method yields better bit error rate (BER) performance than other methods using side information under the condition of almost the same transmission rate.

In this letter, we propose a packet scheduling algorithm to support both real-time voice and video traffic for wireless multimedia data service in orthogonal frequency division multiple access (OFDMA) system. Our design objective is to maximize the number of real-time service users that can be supported in the system subject to QoS requirement of packet loss rate (PLR). Both time slots and subcarriers are taken into account as the basic resource allocation unit in OFDMA/FDD system. The simulation results show that our proposed algorithm can dramatically increase the number of users satisfying the underlying QoS requirement for the real-time service, as compared to the existing algorithm.

Recently, low-density parity-check (LDPC) codes have attracted much attention. LDPC codes can achieve the near Shannon limit performance like turbo codes. For the LDPC codes, the reduced complexity decoding algorithms referred to as uniformly most powerful (UMP) BP- and normalized BP-based algorithms were proposed for BPSK on an additive white Gaussian noise (AWGN) channel. The conventional BP and BP-based algorithms can be applied to BPSK modulation. For high bit-rate transmission, multilevel modulation is preferred. Thus, the BP algorithm for multilevel modulations is proposed in . In this paper, we propose the BP algorithm with reduced complexity for multilevel modulations, where the first likelihood of the proposed BP algorithm is modified to adjust multilevel modulations. We compare the error rate performance of the proposed algorithm with that of the conventional algorithm on AWGN and flat Rayleigh fading channels. We also propose the UMP BP- and normalized BP-based algorithms for multilevel modulations on AWGN and flat Rayleigh fading channels. We show that the error rate performance of the proposed BP algorithm is almost identical to that of the algorithm in, where the decoding complexity of the proposed BP algorithm is less than that of the algorithm in. We also show that the proposed BP-based algorithms can achieve the good trade-off between the complexity and the error rate performance.

Multiuser diversity, identified by recent information theoretic results, is a form of diversity inherent in a wireless network. The diversity gain is obtained from independent time-varying fading channels across different users. The main practical issue in multiuser diversity is lack of Quality of Service (QoS) guarantees. This study proposes a wireless scheduling algorithm named MUDSEQ for downlink channels exploiting multiuser diversity under explicit QoS constraints. The numerical results demonstrate that the novel algorithm can yield non-negligible diversity gain even under tight QoS constraints and little scattering or slow fading environments. Additionally, a system framework for dynamic resource allocation based on the proposed algorithm is developed.

General closed-form expressions are derived and analyzed for the exact bit error rate (BER) performance of the arbitrary rectangular Gray coded QAM signal in conjunction with maximal-ratio combining (MRC) diversity on frequency non-selective slow m-distributed Nakagami fading channel. The analyses consider four channel models, independent and identical, independent and nonidentical, identical but correlated, and arbitrary correlated fading. Numerical results demonstrate error performance improvement with the use of MRC diversity reception. The new expressions presented here are suitable for evaluating various cases of practical interest on wireless communication channels.

In this paper, the design of signature waveforms for asynchronous CDMA systems equipped with a correlation receiver is first considered. Optimal signature waveforms that minimize the average multiple access interference (MAI) at the output of a correlation receiver are found, while satisfying the constraint on available transmission bandwidth. Comparison to signature waveforms previously obtained for synchronous systems is also made to justify the superior performance of the designed signature waveforms in asynchronous systems. Furthermore, for direct-sequence CDMA (DS-CDMA) systems with random signature sequences, the use of multiple chip waveforms is also proposed as a means of suppressing MAI. Bandwidth constrained multiple chip waveforms that maximize the signal-to-interference ratio (SIR) at the output of each correlation receiver are found. Numerical results show that by using double chip waveforms instead of a single chip waveform, it is possible to reduce the MAI by 10% for a fixed transmission bandwidth (or equivalently, to save about 10% of transmission bandwidth for a given SIR requirement). The advantage of using double chip waveforms is also demonstrated in terms of the bit error rate (BER), whose calculation is based on our extension to Holtzman's approximation in.

In the present paper, we evaluate the inter-cell interference of AS-CDMA systems. First, the cross-correlation property of AS-CDMA systems is examined by theoretical study in order to clarify the fundamental feature of the inter-cell interference. The result shows that the influence of one interference terminal in each adjacent cell is dominant regardless of whether approximate synchronization is maintained. Next, the ratio of interference signal power and desired signal power is evaluated by computer simulation. The simulation result shows that total interference power does not increase even when approximate synchronization is not maintained.

Satellite communication can be operated with various levels of on-board processing in order to transmit the signal effectively. In this paper, the BER performances of the bent pipe transponder (BPT), dehop only transponder (DOT) and dehop and rehop transponder (DRT) systems with FH-MFSK modulation are investigated in the presence of broad band interference, narrow band interference and tone-type interference. In this case, the BER performances are compared for the variants of the data rates, spreading bandwidth and interference power. The numerical results show that DRT outperforms BPT and DOT. DOT is less sensitive to uplink interference power under broad band interference environment than DRT. In the case of narrow band interference, the DRT system is more sensitive to ρ value, i.e., the ratio of the interference bandwidth to the spreading bandwidth, than DOT. Among various interference types, the performance in n = 1 band multi-tone interference is shown to be the worst.

Future IP networks will provide multi-class-services that have multiple levels of Quality of Services (QoS) at different prices. One of the issues for the network service provider (NSP) will be how to profit by providing them. This paper proposes a scheme that maximizes the profit of the NSP by controlling the service-list under the constraint of the available network resources. We introduce a model in which the users' selection from among the multiple classes is influenced not just by the price and QoS of one class, but the prices and QoS levels of all classes. In short, the user's selection involves a balance between the price and QoS levels of all classes. To model the users' class choice, we adopt discrete choice analysis; it can estimate the model parameters such that the model fits actual choice data. This paper proposes a functional framework that consists of User Choice Model Function, Original Demand Forecast Function, and Service-list Determination Function. The proposed model has the advantage of following actual changes adaptively. Effectiveness of the proposed scheme is evaluated by computer simulation for a multiple class service; even if the real parameters are changed, the proposal can follow the change and provide the optimal service-list that maximizes profit adaptively.

A traffic engineering problem in a network consists of setting up paths between the edge nodes of the network to meet traffic demands while optimizing network performance. It is known that total traffic throughput in a network, or resource utilization, can be maximized if a traffic demand is split over multiple paths. However, the problem formulation and practical algorithms, which calculate the paths and the load-splitting ratios by taking bandwidth, the route constraints or policies into consideration, have not been much touched. In this paper, we formulate the constrained multipath-routing problems with the objective of minimizing the maximum of link utilization, while satisfying bandwidth, the maximum hop count, and the not-preferred node/link list in Linear Programming (LP). Optimal solutions of paths and load-splitting ratios found by an LP solver are shown to be superior to the conventional shortest path algorithm in terms of maximum link utilization, total traffic volume, and number of required paths. Then, we propose a heuristic algorithm with low computational complexity that finds near optimal paths and load-splitting ratios satisfying the given constraints. The proposed algorithm is applied to Multi-Protocol Label Switching (MPLS) that can permit explicit path setup, and it is tested in a fictitious backbone network. The experiment results show that the heuristic algorithm finds near optimal solutions.

Environment measurement is an important issue for various applications including household robots. Pulse radars are promising candidates in a near future. Estimating target shapes using waveform data, which we obtain by scanning an omni-directional antenna, is known as one of ill-posed inverse problems. Parametric methods such as Model-fitting method have problems concerning calculation time and stability. We propose a non-parametric algorithm for high-resolution estimation of target shapes in order to solve the problems of parametric algorithms.

This paper deals with a simple and practical power loss analysis simulator, which can actually estimate the total power losses of three phase voltage-fed Auxiliary resonant commutation pole snubber assisted soft switching inverter as well as hard-switching inverter. In order to estimate the switching power losses and conduction power losses of switching semiconductor power devices (IGBTs), which are incorporated into the inverters, the proposed practical simulator is making use of feasible switching power loss data tables and conduction power loss data tables, which are accumulated from the measured voltage and current operating waveforms of power semiconductor switching devices. The practical effectiveness of feasible simulation technique and power loss evaluations for power electronic conversion circuits and systems are confirmed by the simulation and experimental results basis under the conditions of soft switching and hard switching sinusoidal PWM schemes.

In this paper, we study an effective video-on-demand traffic control algorithm using the metadata over the network supporting bandwidth-renegotiations. The proposed algorithm includes bandwidth smoothing, bandwidth-burstiness estimation and rate adaptation algorithms. The proposed video-on-demand server has not only video database but also metadata database that includes coding information of the compressed video in video database and the traffic burst characteristics with respect to control parameters of the bandwidth smoothing algorithm. Thus, we can predict the traffic properties accurately with a low computational complexity by using the stored metadata, and then determine the efficient bandwidth renegotiating variables such as the renegotiating instants and the required bandwidth in terms of network utilization and video-on-demand service quality. In addition, we present a rate adaptation algorithm that pursues an effective trade-off between spatial and temporal qualities of the decoded video to improve the perceptual video quality when the bandwidth request is rejected.

We propose a new authentication and key establishment (AKE) protocol that can be applied to low-power PDAs in Public Wireless LANs (PWLANs), using two factor authentication and precomputation. This protocol provides mutual authentication, identity privacy, and half forward-secrecy. The computational complexity that the client must perform is just one symmetric key encryption and five hash functions during the runtime of the protocol.

In this letter, we show that a key agreement and password authentication protocol proposed by Kwon and Song is potentially vulnerable to a reflection attack, and then suggest simple improvements.

We propose adaptive variable-rate constant-power scheme for ad hoc wireless networks, employing the modification of Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. Potential improvements in throughput and back-off probability are presented for different system parameters.

Due to limited radio resource, an effective paging strategy is essential for improving the utility of radio channels. This paper proposes a new paging strategy that can reduce the paging cost on radio channels by introducing the paging agent in location area (LA). When a mobile-terminated call occurs, the mobile switching center (MSC) looks up a corresponding LA paging agent to determine the exact base station (BS) of the target mobile and pages only one cell. The performance of the proposed strategy is evaluated by an analytical model, and compared with the traditional simultaneous paging strategy and a recent proposal using paging agents of BSs. The numerical results demonstrates that the proposed strategy reduces the paging cost on radio channels compared with other paging strategies.

The bit error rate (BER) performance of a fast frequency-hopped frequency division multiple access (FH-FDMA) system is evaluated with diversity combining receivers. The clipper receiver and the normalized envelope detection (NED) receiver which show better performance than other diversity combining receivers under n = 1 band multitone interference (MTI) are chosen as combining alternatives. From simulation results, n = 1 band MTI is the most destructive multitone interference strategy for the FH-FDMA system. As the number of groups increases, eventually becoming a FHMA system, the worst case performance of FH-FDMA with the clipper receiver improves monotonically, while that of the NED receiver hardly improves when the effect of the interference is relatively large. From the viewpoint of BER performance, the FHMA system with the clipper receiver is the most effective solution among the FH-FDMA systems in the presence of the worst case band MTI.

We present a new space-time successive interference cancellation (ST-SIC) scheme with multiple transceiver antennas for direct-sequence code division multiple access (DS-CDMA) systems. The proposed scheme is computationally very efficient, while maintains the performance close to the previous space-time multiuser detection (ST-MUD) scheme. The bit error rate (BER) performance of the ST-SIC scheme for coherent phase shift keying (PSK) modulation is analytically examined in Rayleigh fading channels, and its validity and usefulness are demonstrated by computer simulations.

In this paper, we derive expressions for the bit error probability of QPSK/OFDM on frequency-selective Rayleigh fading channels. In the OFDM system, ICI (interchannel interference) caused by Doppler spread of the channel degrades the error performance of the system and introduces the error floor even for coherent detection. Analysis results show that the error performance of QPSK/OFDM can be degraded as the normalized maximum Doppler frequency f_D /B_sub is increased where f_D is the maximum Doppler frequency and B_sub is the subchannel bandwidth. Computer simulations confirm the theoretical analysis results for BPSK and QPSK signals.

This letter evaluates the peak-to-average power ratio (PAR) performance in a space-time block coded (STBC) multicode CDMA (MC-CDMA) system using a selected mapping (SLM) approach. The ordinary method is to apply the SLM scheme for each transmit antenna individually, while the investigated SLM-based STBC MC-CDMA system selects the transmitted sequence with the lowest average PAR over all transmit antennas concurrently. SLM-based STBC MC-CDMA system retrieves the side information very accurately at the expense of a slight degradation of the PAR performance, which can improve the overall detection performance of the STBC MC-CDMA system in the presence of erroneous side information compared to the ordinary SLM approach.

Rapid time variations of the mobile communication channel have a dramatic impact on the performance of multicarrier modulation. This letter analyzes the effect of the Doppler-induced interchannel interference (ICI) on a space-time block coded (STBC) OFDM-CDMA system in a time-varying Rayleigh fading channel. At the same time, we compute the effect of the ICI on the BER performance of the STBC OFDM-CDMA system using the maximal ratio combining (MRC) and equal gain combining (EGC) schemes.

We propose an optical packet switch (OPS) using a hybrid buffer structure for the contention resolution of asynchronous variable length packets. The hybrid buffer consists of a fiber delay line (FDL) buffer as the prime buffer and a shared electronic buffer as the supplementary buffer. For the performance evaluation, a modified void filling scheduling algorithm that can be applied to the OPS was proposed. Simulation results show that the use of the electronic buffer together with the FDL buffer significantly reduce the number of FDLs required for contention resolution and considerably lower packet loss.

The objective of this research is to compare the performance of the Matrix Pencil Method (MPM) and well known root-MUSIC algorithm for high resolution DOA estimation. Performance of each technique in terms of the probability of resolution and SNR in the presence of noise is investigated. Simulation results show that the MPM has a superior resolution to the root-MUSIC algorithm.

We study the user reneging behavior in a hybrid Multimedia-on-Demand (MoD) system, which provides both interactive and batch services. Reneging happens when users become reluctant to wait for a batch service and quit the service. They will either join the interactive service or quit the system. In this letter, the analytical model for the MoD system with user reneging behavior is provided. Numerical results show that the reneging behavior has a significant impact on system performance. Therefore, careful consideration on reneging behavior should be made for designing a MoD system.

Image rectification is a method of aligning epipolar lines of image pairs taken from widely variant viewpoints. Using the rectified images, we can easily obtain corresponding points. This paper presents a rectification method for object segmentation. Using the rectified image pairs obtained with the proposed method, we are able to find the reliable disparity and estimate the 3D depth of the pixel that is effective in the object segmentation.