In this article, we introduce a new concept for the future information environment, called an "ambient information environment (AmIE)." We first explain it, especially emphasizing the difference from the existing ubiquitous information environment (UbIE), which is an interaction between users and environments. Then, we focus on an ambient networking environment (AmNE) which supports the AmIE as a networking infrastructure. Our approach of a biologically inspired framework is next described in order to demonstrate why such an approach is necessary in the AmIE. Finally, we show some example for building the AmNE.

Interaction between emergency medical technicians (EMTs) and doctors is essential in emergency medical care. Doctors require diverse information related to a patient to provide efficient aid. In 2005, we started the Ikoma119 project and have developed a ubiquitous communication platform for emergency medical care called Mobile ER. Our platform, which is based on wireless internet technology, has such desirable properties as low-cost, location-independent service, and ease of service introduction. We provide an overview of our platform and describe the services that we have developed. We also discuss the remaining issues to realize our platform's actual operation.

In this study, a performance isolation mechanism based on a fuzzy control technique is developed in such a way that ambiguous situations caused when estimating the workload of cluster-based web servers, client request rates, and dynamic request rates can be represented effectively. The proposed mechanism involving a fuzzy-based technique is compared with a non-fuzzy technique in terms of the response time in the 95th percentile. Experiments showed that the proposed technique improves the performance of web servers that provide differentiated services.

This paper proposes a point-to-multipoint (P2MP) Multi-Protocol Label Switching (MPLS) based hierarchical service management system. Traditionally, general management systems deployed in some service providers control MPLS Label Switched Paths (LSPs) (e.g., RSVP-TE and LDP) and services (e.g., L2VPN, L3VPN and IP) separately. In order for dedicated management systems for MPLS LSPs and services to cooperate with each other automatically, a hierarchical service management system has been proposed with the main focus on point-to-point (P2P) TE LSPs in MPLS path management. In the case where P2MP TE LSPs and services are deployed in MPLS networks, the dedicated management systems for P2MP TE LSPs and services must work together automatically. Therefore, this paper proposes a new algorithm that uses a correlation between P2MP TE LSPs and multicast VPN services based on a P2MP MPLS-based hierarchical service management architecture. Also, the capacity and performance of the proposed algorithm are evaluated by simulations, which are actually based on certain real MPLS production networks, and are compared to that of the algorithm for P2P TE LSPs. Results show this system is very scalable within real MPLS production networks. This system, with the automatic correlation, appears to be deployable in real MPLS production networks.

To develop a network management system (NMS) more easily, the authors developed an application programming interface (API) for configuring network devices. Because this API is used in a Java development environment, an NMS can be developed by utilizing the API and other commonly available Java libraries. It is thus possible to easily develop an NMS that is highly compatible with other IT systems. And operations that are generated from the API and that are exchanged between the NMS and network devices are based on NETCONF, which is standardized by the Internet Engineering Task Force (IETF) as a next-generation network-configuration protocol. Adopting a standardized technology ensures that the NMS developed by using the API can manage network devices provided from multi-vendors in a unified manner. Furthermore, the configuration items exchanged over NETCONF are specified in an object-oriented design. They are therefore easier to manage than such items in the Management Information Base (MIB), which is defined as data to be managed by the Simple Network Management Protocol (SNMP). We actually developed several NMSs by using the API. Evaluation of these NMSs showed that, in terms of configuration time and development time, the NMS developed by using the API performed as well as NMSs developed by using a command line interface (CLI) and SNMP. The NMS developed by using the API showed feasibility to achieve "autonomic network management" and "high interoperability with IT systems."

Privacy remains an issue for IT services. Users are concerned that their history of service use may be traceable since each user is assigned a single identifier as a means of authentication. In this paper, we propose a perfectly anonymous attribute authentication scheme that is both unidentifiable and untraceable. Then, we present the evaluation results of a prototype system using a PC and mobile phone with the scheme. The proposed scheme employs a self-blindable certificate that a user can change randomly; thus the certificate is modified for each authentication, and the authentication scheme is unidentifiable and untraceable. Furthermore, our scheme can revoke self-blindable certificates without leaks of confidential private information and check the revocation status without online access.

Recently, the appearance frequency of computer virus variants has increased. Updates to virus information using the normal pattern matching method are increasingly unable to keep up with the speed at which viruses occur, since it takes time to extract the characteristic patterns for each virus. Therefore, a rapid, automatic virus detection algorithm using static code analysis is necessary. However, recent computer viruses are almost always compressed and obfuscated. It is difficult to determine the characteristics of the binary code from the obfuscated computer viruses. Therefore, this paper proposes a method that unpacks compressed computer viruses automatically independent of the compression format. The proposed method unpacks the common compression formats accurately 80% of the time, while unknown compression formats can also be unpacked. The proposed method is effective against unknown viruses by combining it with the existing known virus detection system like Paul Graham's Bayesian Virus Filter etc.

Topology information has become more important for management of LANs due to the increasing number of hosts attached to a LAN. We describe three Ethernet topology discovery techniques that can be used even in LANs with Ethernet switches that have no management functionality. Our "Shared Switch Detection (SSD)" technique detects the Ethernet tree topology by testing whether two paths in the network share a switch. SSD uses only general MAC address learning. By borrowing MAC addresses from hosts, SSD can be run from a single host. The second technique determines whether two paths between two pairs of hosts contain a switch. The third reduces the number of shared switch detections. Simulation showed that these techniques can be used to detect the Ethernet topology with a reasonable search cost. Examination on a real-world testbed showed that they could detect an Ethernet topology consisting of six hosts and two switches within one second.

A time synchronization protocol for WSN is required to compensate time discrepancy. Time discrepancy among sensor nodes inevitably happens in WSN due to several internal and external factors. In order to make WSN's own job done effectively, a time synchronization protocol should be designed to achieve low execution time and low network traffic as well as accurate synchronization. Several synchronization protocols have been proposed to provide accurate time synchronization but do not consider execution time and network traffic for time synchronization. This paper proposes MNTP; it provides rapid and accurate time synchronization in multi-hop communication range. It presents a new broadcast scheme and time stamping mechanism to achieve low execution time and low network traffic along with accurate synchronization. Evaluation results show that MNTP improves synchronization accuracy up to 22% in single-hop and 51% in multi-hop respectively. MNTP also has 67 times and 58 times lower execution time and network traffic when 300 nodes are deployed in 2020 m² sensor field.

This paper proposes a VoIP (Voice over Internet Protocol) session capacity expansion method that uses periodic packet transmission suppression control for wireless LANs. The proposed method expands the VoIP session capacity of an AP without critically degrading the QoS (Quality of Service) of all stations. Simulation results show the proposed method with 0.5% packet suppression control on each station expands a VoIP session capacity by up to 5% compared to a legacy method while satisfying required QoS for all stations.

Climate change and/or pandemics are global life threatening concerns. For verifying and utilizing monitored data for solving to the Climate Change concerns, a network system based on device ID would be proposed. In this paper, we review the recent standardization initiatives in ITU-T, and propose an ID network that can be used to verify the solutions.

This article proposes a method that can calculate the blocking probability of multi-service cellular systems with Wideband Code Division Multiple Access radio interface. The method considers a finite and an infinite source population and takes into account the interdependency of calls service processes in neighboring cells and in both the uplink and the downlink directions. The basis of the proposed method is the fixed-point methodology. A comparison of the results of analytical calculations to those of simulations confirms the accuracy of the proposed method. The proposed scheme can realize cost-effective radio resource management in 3G mobile networks and can be easily applied to network capacity calculations.

Although wavelength division multiplexing-passive optical network (WDM-PON) is known as a high-speed transfer, it creates high channel costs per subscriber and low bandwidth utilization due to the fact that a wavelength is dedicated to each subscriber. Thus, it is imperative to reduce channel costs per subscriber and improve the bandwidth utilization. To achieve these, we first adopt a existing WDM-PON, which uses the bidirectional transmission with a single source for cost-efficiency by employing a gain-saturated reflective semiconductor optical amplifier (RSOA). Secondly, based on the existing WDM-PON, we propose an enhanced hybrid WDM/TDM-PON, which can extend the number of subscribers supported in each wavelength with splitters in the physical layer and a shared-time division duplex (TDD) frame format in the media access control (MAC) layer. Moreover, it can adaptively control the bandwidth through a dynamic bandwidth allocation (DBA) scheme according to the volume of traffic. Compared to the non TDD-based hybrid WDM/TDM-PON, it can reduce channel costs per subscriber from the extended number of subscribers supported in each wavelength. Furthermore, due to the DBA, it can improve the total queueing delay and throughput, and thus increase the bandwidth utilization.

Arrayed waveguide grating (AWG) is a promising technology for constructing high-speed large-capacity WDM switches, because it can switch fast, is scalable to large size and consumes little power. To take the full advantage of high-speed AWG, the routing control of a massive AWG-based switch should be as simple as possible. In this paper, we focus on the self-routing design of AWG-based switches with O(1) constant routing complexity and propose a novel construction of self-routing AWG switches that can guarantee the attractive nonblocking property for both the wavelength-to-wavelength and wavelength-to-fiber request models. We also fully analyze the proposed design in terms of its blocking property, hardware cost and crosstalk performance and compare it against traditional designs. It is expected that the proposed construction will be useful for the design and all-optical implementation of future ultra high-speed optical packet/burst switches.

We focus on non-conflicting construction of an optical multistage feedforward network to emulate the N-to-1 output buffer multiplexer by using switched fiber delay line (SDL). In [1], Y.T. Chen et al. presented a sufficient condition (an upper bound) for the number of delay lines required for such a multiplexer with variable length bursts. In this paper, we first give an improved upper bound. Then we develop a framework to construct an arrival case of bursts which can be used to achieve a necessary condition (a lower bound). These results are further extended to the feedforward construction of N-to-N output buffer switch. Through simulation and performance comparison, we find that the new bounds can significantly decrease the hardware cost for constructing both the feedforward SDL-based multiplexer and output buffer switch while still provide the same performance as that of the old ones.

In a multi-hop mobile ad-hoc network, broadcasting is an elementary operation to support many applications. Broadcasting by flooding may cause serious redundancy, contention, and collision in the network, which is referred to as the broadcast storm problem. Many broadcasting schemes have been proposed to give better performance than simple flooding in mobile ad-hoc network. How to decide whether rebroadcast or not also poses a dilemma between reachability and efficiency under different host densities. In this paper, we propose an enhanced broadcasting scheme, which can reduce rebroadcast packets without loss of reachability. Simulation results show that the proposed scheme offers better reachability and efficiency than other previous schemes.

Flooding is an indispensable operation for providing control or routing functionalities to mobile ad hoc networks (MANETs). Previously, many flooding schemes have been studied with the intention of curtailing the problems of severe redundancies, contention, and collisions in traditional implementations. A recent approach with relatively high efficiency is 1HI by Liu et al., which uses only 1-hop neighbor information. The scheme achieves local optimality in terms of the number of retransmission nodes with time complexity Θ(nlog n), where n is the number of neighbors of a node; however, this method tends to make many redundant transmissions. In this paper, we present a novel flooding algorithm, 2HBI (2-hop backward information), that efficiently reduces the number of retransmission nodes and solves the broadcast storm problem in ad hoc networks using our proposed concept, "2-hop backward information." The most significant feature of the proposed algorithm is that it does not require any extra communication overhead other than the exchange of 1-hop HELLO messages but maintains high deliverability. Comprehensive computer simulations show that the proposed scheme significantly reduces redundant transmissions in 1HI and in pure flooding, up to 38% and 91%, respectively; accordingly it alleviates contention and collisions in networks.

Transient routing loops have been observed to form in Mobile Ad-hoc Networks running the OLSRv2 proactive link-state routing protocol. The packets falling into loops impact the surrounding network thus degrading throughput even though only a small proportion of the traffic may enter these loops and only for a short time. This becomes significantly more evident when Link Layer Notification is used to catch broken links, inadvertently leading to an increase in the number of loops. Two methods of Loop Detection are introduced and are used to trigger either Loop Suppression by selectively and preemptively discarding the looping packets that are unlikely to reach their destination, or Loop Correction by the notification of the routing protocol to cut the link over which the packet is looping. The newly introduced Loop Suppression and Loop Correction techniques used with Link Layer Notification are shown to significantly increase network performance over plain OLSRv2 and OLSRv2 with Link Layer Notification.

Recent research on overlay networks has revealed that user-perceived network performance, such as end-to-end delay performance, could be improved by an overlay routing mechanism. However, these studies consider only end-to-end delay, and few studies have focused on bandwidth-related information, such as available bandwidth and TCP throughput, which are important performance metrics especially for long-lived data transmission. In the present paper, we investigate the effect of overlay routing both delay and bandwidth-related information, based on the measurement results of network paths between PlanetLab nodes. We consider three metrics for selecting the overlay route: end-to-end delay, available bandwidth, and TCP throughput. We then show that the available bandwidth-based overlay routing provides significant gain, as compared with delay-based routing. We further reveal the correlation between the latency and available bandwidth of the overlay paths and propose several guidelines for selecting an overlay path.

The end-to-end round trip time (RTT) is one of the most important communication characteristics for Internet applications. From the viewpoint of network operators, RTT may also become one of the important metrics to understand the network conditions. Given this background, we should know how a factor such as a network incident influences RTTs. It is obvious that two or more factors may interfere in the observed delay characteristics, because packet transmission delays in the Internet are strongly dependent on the time-variant condition of the network. In this paper, we propose a modeling method by using mixed distribution which enables us to express delay characteristic more accurately where two or more factors exist together. And, we also propose an inferring method of network behavior by decomposition of the mixed distribution based on modeling results. Furthermore, in experiments we investigate the influence caused by each network impact factor independently. Our proposed method can presume the events that occur in a network from the measurements of RTTs by using the decomposition of the mixed distribution.

In this paper, a multi-cell joint channel estimation (JCE) method is proposed for the TD-SCDMA downlink. In the proposed multi-cell JCE approach, the received midambles from adjacent cells are jointly processed, rather than being treated as interference as in single cell channel estimation. By jointly processing all the received midambles, the user can simultaneously estimate the channel impulse responses (CIRs) for both its home cell and adjacent cells. If the received signal from adjacent cells has a delay, multi-cell JCE is still operable with slight adjustment in the midamble matrix, and the performance loss is also minor. The performance of multi-cell JCE is analyzed and evaluated by simulations. The results demonstrate that the proposed multi-cell JCE method can significantly improve the channel estimation accuracy. When the signal from each cell has similar power level, the mean square error (MSE) of the estimated CIRs for all cells is lower than 0.01. With more accurate CIRs from multi-cell JCE, multi-cell JD also yields better performance compared with the single cell channel estimation methods.

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

This paper proposes an adaptive selection algorithm for the surviving symbol replica candidates (ASESS) based on the maximum reliability in maximum likelihood detection with QR decomposition and the M-algorithm (QRM-MLD) for Orthogonal Frequency Division Multiplexing (OFDM) multiple-input multiple-output (MIMO) multiplexing. In the proposed algorithm, symbol replica candidates newly-added at each stage are ranked for each surviving symbol replica from the previous stage using multiple quadrant detection. Then, branch metrics are calculated only for the minimum number of symbol replica candidates with a high level of reliability using an iterative loop based on symbol ranking results. Computer simulation results show that the computational complexity of the QRM-MLD employing the proposed ASESS algorithm is reduced to approximately 1/4 and 1/1200 compared to that of the original QRM-MLD and that of the conventional MLD with squared Euclidian distance calculations for all symbol replica candidates, respectively, assuming the identical achievable average packet error rate (PER) performance in 4-by-4 MIMO multiplexing with 16QAM data modulation. The results also show that 1-Gbps throughput is achieved at the average received signal energy per bit-to-noise power spectrum density ratio (E_b/N₀) per receiver antenna of approximately 9 dB using the ASESS algorithm in QRM-MLD associated with 16QAM modulation and Turbo coding with the coding rate of 8/9 assuming a 100-MHz bandwidth for a 12-path Rayleigh fading channel (root mean square (r.m.s.) delay spread of 0.26 µs and maximum Doppler frequency of 20 Hz).

The performance of a UHF-band passive RFID system in a dense multi-reader environment is limited by both the reader-to-reader interference and reader-to-tag interference. In this paper, first, we propose a combination of subcarrier modulation backscattering and reduced carrier frequency offset among readers to reduce both the reader-to-reader interference and the reader-to-tag interference. Then, we propose a new distributed modulation index control scheme using the readers' estimation of the tag's SINR in order to further reduce the reader-to-tag interference. By adaptively controlling each reader's transmission modulation index, the asymmetric reader-to-tag interference can be effectively controlled to satisfy the required SINR of tags. Computer simulations show that the proposed scheme can reduce the minimum required inter-reader distance or increase the number of concurrently operable readers in dense multi-reader environments, especially when there are large differences in the levels of reader-to-tag interference. We show some optimizations of the proposed scheme for practical RFID applications. We also propose a bandwidth efficient modulation scheme for reader transmission which is suitable for the proposed modulation index control scheme.

Equipping wireless routers with multiple radios further improves the capacity by transmitting over multiple radios simultaneously using orthogonal channels. Efficient channel assignment schemes can greatly alleviate the interference effect of nearby transmissions. One of the distinctive features in wireless multi-hop networks is the lack of any central controller, in which each node makes its own decisions. Therefore, fully cooperative behaviors, such as cooperation for increasing link capacity, alleviating interferences for one another, might not be directly applied. In this paper, we aim to present some applications to show how such a framework can be invoked to design efficient channel assignment algorithms in a non-cooperative, topology-blind environment as well as in environments where the competing players share perfect information about channel usage and topology environment and so on. Simulation results are presented to illustrate the effectiveness of the algorithms.

The binary exponential back-off mechanism is one of the basic elements that constitute the IEEE 802.11 protocol. The models of the back-off mechanism have been developed with the assumption that collisions occur only due to nodes within the carrier sensing range and the collision probability is constant in steady-state. However, the transmission collisions can occur due to hidden nodes and these tend to occur consecutively, contrary to the collisions due to nodes within the carrier sensing range. Consecutive collisions increase the back-off time exponentially, resulting in less frequent transmission attempts. Ignoring this collision characteristic in modeling the back-off mechanism can produce large errors in the performance analysis of networks. In this paper, we model the back-off process as a Markov renewal process by taking into account such consecutive collisions due to hidden nodes, and then compare this result with NS2 simulation results. According to the simulation results, the proposed model reduces the relative error in the attempt probability by more than 90% in the grid topology. We also propose a new collision model for a simple network considering consecutive collisions due to hidden nodes, and analyze the network under saturated traffic condition using the proposed models. The attempt and collision probabilities are estimated with high accuracy.

The use of cross-polarized antennas for multiple-input multiple-output (MIMO) systems is receiving attention as they are able to double the number of antenna for half antenna spacing needs. This paper presents the channel correlation property of the 3rd Generation Partner Project (3GPP)/3GPP2 spatial channel model (SCM) with the polarization propagation. The statistical average of the per path polarization correlation given random cross-polarization discrimination (XPD) with co-located ideal tilted dipole antennas is derived. The impact on the random behavior of the polarization correlation due to the slant offset angle, the per path angular spread (AS), and the random XPD is analyzed. The simulation results show that the variation of polarization correlation caused by the random XPD is maximized with a 58 slant offset angle under the assumptions of all predefined scenarios in SCM. The per path AS has minor impact on the statistics of the polarization correlations. The randomness of polarization correlation is negligible for an XPD with small standard deviation.

An effective operation mode and a space-time synchronization technique for the spaceborne/airborne hybrid bistatic synthetic aperture radar (SA-BSAR) using sources of opportunity are presented. Our motivation lies in the fact that the existing approaches in the literature, where the transmitter antenna must be steered, can only be used in the hybrid bistatic SAR systems with cooperative transmitter. The presented mode is to widen the receiving beam for the purpose to increase the scene extension in azimuth. The inspiration comes from the much shorter receiving distance as compared to the one in mono-static spaceborne SAR. This means that the receiving gain can be significantly reduced to provide the same signal-to-noise ratio (SNR) with respect to the mono-static case. The feasibility of the wide-beam mode is first preliminarily verified by a quantitative analysis of SNR and a demonstration that the pulse repetition frequency (PRF) used in the spaceborne illuminator can easily satisfy the PRF constraints of the SA-BSAR. The influence on the azimuth ambiguity to signal ratio (AASR) is also discussed and the corresponding broadening factor of the maximum allowable for receiver beamwidth is subsequently derived. Afterwards, the formulae for calculating the overlap time, the scene extension and the azimuth resolution are deduced. As there are no grating lobes in satellite antenna pattern since the non-cooperative illuminator normally operates in the side-looking mode, an existing technique for the space-time synchronization in cooperative hybrid systems can not be directly applied. The modification performed and its underlying principle are presented in detail. The simulation results demonstrate the effectiveness of the wide-beam mode, and show that in most cases a useful scene extension (on the order of at least 1 km) can be achieved with a roughly equivalent azimuth resolution as compared to the one in mono-static spaceborne SAR. In some cases, explicit measures to suppress the azimuth ambiguity must be taken to achieve the expected scene extension.

A novel method is proposed to track the position of MS in the mixed line-of-sight/non-line-of-sight (LOS/NLOS) conditions in cellular network. A first-order markov model is employed to describe the dynamic transition of LOS/NLOS conditions, which is hidden in the measurement data. This method firstly uses modified EKF banks to jointly estimate both mobile state (position and velocity) and the hidden sight state based on the the data collected by a single BS. A Bayesian data fusion algorithm is then applied to achieve a high estimation accuracy. Simulation results show that the location errors of the proposed method are all significantly smaller than that of the FCC requirement in different LOS/NLOS conditions. In addition, the method is robust in the parameter mismodeling test. Complexity experiments suggest that it supports real-time application. Moreover, this algorithm is flexible enough to support different types of measurement methods and asynchronous or synchronous observations data, which is especially suitable for the future cooperative location systems.

The proposed quasi-resonant (QR) zero current switching (ZCS) switched-capacitor (SC) converter is a new type of bidirectional power flow control conversion scheme. The proposed converter is able to provide voltage conversion ratios from -3/- (triple-mode/ trisection-mode) to -n/- (-n-mode/--mode) by adding a different number of switched-capacitors and power MOSFET switches with a small series connected resonant inductor for forward and reverse power flow control schemes. It possesses the advantages of low switching losses and current stress in this QR ZCS SC converter. The principle of operation, theoretical analysis of the proposed triple-mode/ trisection-mode bidirectional power conversion scheme is described in detail with circuit model analysis. Simulation and experimental studies are carried out to verify the performance of the proposed inverting type ZCS SC QR bidirectional converter. The proposed converters can be applied to battery equalization for battery management system (BMS).

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.

In this letter, a simple product code is proposed for constant-amplitude biorthogonal multicode (CABM) modulation. In CABM modulation, vertical redundant bits are used for constant amplitude coding. The proposed product code can be constructed by using additional horizontal redundant bits. The hardware complexity of the encoder and decoder pair is very low. Simulation results show that the bit error rate performance of the system with the proposed coding scheme is improved as compared with conventional CABM demodulation.

In this letter, we derive an exact bit error rate (BER) expression for downlink multi-carrier code division multiple access (MC-CDMA) systems with orthogonal restoring combining (ORC) in Nakagami-m fading channel. A simple approximated expression is also provided. For uncoded and coded MC-CDMA systems, the BER expressions are calculated based on the moment generating function (MGF) of the combined fading random variable. The derived analytic expressions are verified by simulation results.

A multi-domain GMPLS layer-2 switch capable network with VLAN tag swapping is demonstrated for the first time. In this demonstration, we verify three new features, establishing path with designating VLAN IDs, swapping VLAN ID on prototype switch, and management of VLAN IDs per domain. Using those three features, carrier-class Ethernet backbone networks which supports path route designation in multi-domain network can be established.

In this paper we propose a novel RFID anti-collision technique that intelligently combines polling and random access schemes. These two fundamentally different medium access control protocols are coherently integrated in our design while functionally complementing each other. The polling mode is designed to enable fast collision-free identification for the tags that exist within reader's coverage across the sessions. In contrast, the random access mode attempts to read the tags uncovered by the polling mode. Our proposed technique is particularly suited for a class of RFID applications in which a stationary reader periodically attempts to identify the tags with slow mobility. Numerical results show that our proposed technique yields much faster identification time against the existing approaches under various operating conditions.

A call admission control (CAC) scheme based on statistical information is proposed, called the statistical CAC scheme. A conventional scheme needs to manage session information for each link to update the residual bandwidth of a network in real time. This scheme has a scalability problem in terms of network size. The statistical CAC rejects session setup requests in accordance to a pre-computed ratio, called the rejection ratio. The rejection ratio is computed by using statistical information about the bandwidth requested for each link so that the congestion probability is less than an upper bound specified by a network operator. The statistical CAC is more scalable in terms of network size than the conventional scheme because it does not need to keep accommodated session state information. Numerical results show that the statistical CAC, even without exact session state information, only slightly degrades network utilization compared with the conventional scheme.

In this letter, we propose a novel signal detection method, reduced complexity QRM-MLD, which achieves almost identical error performance to that of the conventional QRM-MLD while significantly reducing the computational complexity.

Cooperative transmission is an efficient approach to improve the performance of wireless communications over fading channels without the need for physical co-located antenna arrays. In this paper, we propose a novel cooperative protocol with selective decode-and-forward relays and generalized selection combining (GSC) technique at destination. The advantage of this scheme is that it not only allows us to optimize the structure of destination but also to fully exploit the diversity offered by the channels with an appropriate number of chosen strongest paths. For an arbitrary number of relays, an exact and closed-form expression of the Symbol Error Rate (SER) is derived for M-ary PSK in independent but not identically distributed Rayleigh fading channels. Various simulations are performed and their results exactly match the results of analyses.

In this letter, a closed form of the sum rate for multiple random beamforming is derived. A numerical evaluation verifies the tightness of the proposed solution to sample average of the sum rate.

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

It is known that MIMO channel matrix condition number influences detectors performance. Several authors have proposed combined decoders, mainly suboptimal, to cope with this fact. These combined algorithms require an estimation of the MIMO channel matrix condition number and a selection of a suitable threshold condition number. This letter presents practical algorithms to carry out the referred tasks and shows their performance in practice.

In this letter, a new joint precoding and decoding design scheme for multiuser MIMO downlink is proposed which dispenses with iterative operations and can achieve better performance. This scheme introduces zero-force processing into minimum mean square error (MMSE) design scheme to avoid iterative operations. We derived closed-form precoders and decoders and transmit power allocation strategy of proposed design scheme, validated performance of proposed design scheme by computer simulation. The simulation results show that the proposed design scheme can achieve better bit error rate (BER) and sum capacity performance compared to an existing non-iterative design scheme.

Time-variant channels degrade the performance of Orthogonal Frequency Division Multiplexing (OFDM) systems because they collapse the orthogonality between the sub-carriers, which necessitates estimating the resulting off-diagonals of the channel matrix in order to properly equalize the received signal. This letter presents a new method of estimating the channel matrix for OFDM systems in rapidly time-variant channels. The method approximates the time variation of the channel over a few successive OFDM symbols making use of Newton polynomial interpolation.

In this letter, a pre-processed lattice reduction (PLR) scheme is developed for the lattice reduction aided (LRA) detection of multiple input multiple-output (MIMO) systems in spatially correlated channel. The PLR computes the LLL-reduced matrix of the equivalent matrix, which is the product of the present channel matrix and unimodular transformation matrix for LR of spatial correlation matrix, rather than the present channel matrix itself. In conjunction with PLR followed by recursive lattice reduction (RLR) scheme [7], pre-processed RLR (PRLR) is shown to efficiently carry out the LR of the channel matrix, especially for the burst packet message in spatially and temporally correlated channel while matching the performance of conventional LRA detection.

We introduce a novel power allocation scheme for decode-and-forward relaying system with partial channel state (CSI) information, i.e., the source knows full CSI of source-relay link but only statistical CSI of source-destination and relay-destination links. Our objective is to minimize the outage probability by jointly allocating the transmit power between the source and relays. To avoid exhaustive search, the MAOP scheme and the MMS scheme are proposed to approach the optimal allocation in the high and low signal-to-noise ratio regimes, respectively.

This letter derives the packet error rate (PER) in terms of the retry limit and the channel error probability in wireless local area networks (WLANs), when an additional number of retries is allocated to a block of packets to be transmitted. We prove that the lower bound of the PER is the dropping probability which is defined as the probability of any given packet being dropped after its retry limit has been reached.

The ability of a modified bow-tie dipole antenna, which has an asymmetric-feed structure to operate at UHF-band (470-862 MHz) and dual ISM-band (2.4 GHz and 5.8 GHz) is demonstrated. Experimental results indicate that the VSWR 2:1 bandwidths achieved were 125.7%, 8.2% and 23.6% at 660 MHz, 2.45 GHz and 5.5 GHz. The proposed modified bow-tie dipole exhibits a nearly omni-directional radiation pattern with very easy to fabricate structure, and so is suitable for various commercial wideband applications.

A mode-matching model for an electromagnetically coupled coaxial dipole array antenna is presented. The Fourier transfor m/series technique is used to represent the continuous and discrete modes of scattered fields. The mode-matching is utilized to constitute a set of simultaneous equations for discrete modal coefficients. Numerical computation is performed to show its radiation behavior in terms of various antenna parameters.

Radiation of a Hertzian dipole placed within a cylindrical cavity with narrow slots is investigated. Narrow axial and transverse slots are considered. Scattered fields are expanded in terms of eigenfunctions and boundary conditions are enforced to obtain a set of simultaneous equations. Computations are performed to check the validity of the formulation.

A prototype of a three-axis electro-optic (EO) probe is developed that has the linearity of approximately 0.5 dB in the specific absorption rate (SAR) range of 0.01 to 100 W/kg and the directivities are eight-shaped with cross-axis sensitivity isolation of greater than 30 dB. It is confirmed that electric fields and SAR distributions can be measured using a three-axis EO probe.

For robust time delay estimation, we propose a new subspace-based algorithm which estimates the phase shift not between the adjacent samples of the dechirped sinusoid but between the dechirped sinusoids in different bands. We analyze the proposed and the conventional method in AWGN channel and verifiy the proposed algorithm through Monte-carlo simulations in AWGN and multi-path channels.

Tracking a large quantity of moving target tags simultaneously is essential for the localization and guidance of people in welfare facilities like hospitals and sanatoriums for the aged. The locating system using active RFID technology consists of a number of fixed RFID readers and tags carried by the target objects, or senior people. We compare the performances of several determination algorithms which use the power measurement of received signals emitted by the moving active RFID tags. This letter presents a study on the effect of collision in tracking large quantities of objects based on active RFID real time location system (RTLS). Traditional trilateration, fingerprinting, and well-known LANDMARC algorithm are evaluated and compared with varying number of moving tags through the SystemC-based computer simulation. From the simulation, we show the tradeoff relationship between the number of moving tags and estimation accuracy.