A novel adaptive cyclic prefix (CP) transmission scheme is proposed for the uplink of orthogonal frequency division multiple access (OFDMA) systems to reduce the power consumption of mobile stations (MSs). In the proposed scheme, an MS adaptively changes its CP length in each frame, while the guard interval is maintained at a fixed duration to avoid frame synchronization problem and the interference problem with frames of other users. Using the proposed scheme, MSs can save power by not transmitting signal during the time difference between the guard interval and the duration of the adaptive CP. We numerically analyze the performance of the proposed scheme in terms of achievable capacity, the amount of power saving, and the feedback overhead of CP values. The result shows that the proposed scheme can reduce MS power consumption by about 20% with a small amount of additional feedback overhead.

The Firing Squad Synchronization Problem (FSSP), one of the most well-known problems related to cellular automata, was originally proposed by Myhill in 1957 and became famous through the work of Moore [1]. The first solution to this problem was given by Minsky and McCarthy [2] and a minimal time solution was given by Goto [3]. A significant amount of research has also dealt with variants of this problem. In this paper, from a theoretical interest, we will extend this problem to number patterns on a seven-segment display. Some of these problems can be generalized as the FSSP for some special trees called segment trees. The FSSP for segment trees can be reduced to a FSSP for a one-dimensional array divided evenly by joint cells that we call segment array. We will give algorithms to solve the FSSPs for this segment array and other number patterns, respectively. Moreover, we will clarify the minimal time to solve these problems and show that there exists no such solution.

Distributed networks employing collaborative transmission (CT) from remote antennas can provide improved system capacity and cell-edge performance, by using appropriate transmission strategies. When compared to conventional non-collaborative transmission (NCT) from one base station (BS), we show that CT from two adjacent BSs can be beneficial in terms of the capacity, even when the transmission rate is normalized by the number of collaborating BSs. We further demonstrate that performing adaptive transmission (AT) between NCT and CT based on the instantaneous channel conditions provide an additional gain in capacity. The exact amount of achievable gain is quantified by the closed-form formula for the capacity distribution, which is derived using the Jacobian transformation. The presented distribution is immediately applicable to 6-sectored distributed cellular network, for which we present numerical verification of the results.

Continuously increasing the bandwidth to enhance the capacity is impractical because of the scarcity of spectrum availability. Fortunately, on the basis of the characteristics of the multihop cellular networks (MCNs), a new compact frequency reuse scheme has been proposed to provide higher spectrum utilization efficiency and larger capacity without increasing the cost on network. Base stations (BSs) and relay stations (RSs) could transmit simultaneously on the same frequency according to the compact frequency reuse scheme. In this situation, however, mobile stations (MSs) near the coverage boundary will suffer serious interference and their traffic quality can hardly be guaranteed. In order to mitigate the interference while maintaining high spectrum utilization efficiency, this paper introduces a fractional frequency reuse (FFR) scheme into multihop cellular networks, in which the principle of FFR scheme and characteristics of frequency resources configurations are described, then the transmission (Tx) power consumption of BS and RSs is analyzed. The proposed scheme can both meet the requirement of high traffic load in future cellular system and maximize the benefit by reducing the Tx power consumption. Numerical results demonstrate that the proposed FFR in compact frequency reuse achieves higher cell coverage probability and larger capacity with respect to the conventional schemes.

This paper presents a newly developed small-sized shaped beam base station antenna in order to reduce inter-sector interference for next generation high speed wireless data communication systems. The developed antenna realizes polarization diversity as a single small-sized antenna without decreasing the 3 dB main beamwidth compared with the conventional antenna by applying a newly designed beam shaping method. Furthermore, side sub-reflectors are newly installed in the radome to reduce the antenna beam gain in the direction toward the edge region neighboring the other sectors of the horizontal antenna pattern. By adopting this type of reflector, the diameter of the radome can be minimized at 0.65 λ, which is slightly longer than that of the conventional antenna. Both a computer simulation and a field measurement test based on an actual cellular network were conducted for the purpose of clarifying the validity of the shaped beam antenna. In the results, the CINR at the service area by the shaped beam antenna was 1 dB and 3.5 dB better than that of the conventional antenna at the median and 10% of CDF, respectively. The developed antenna will be expected to contribute to the enhancement of the quality of cellular radio systems in the future.

A digital spiking neuron is a wired system of shift registers that can generate spike-trains having various spike patterns by adjusting the wiring pattern between the registers. Inspired by the ultra-wideband impulse radio, a novel theoretical synthesis method of the neuron for application to spike-pattern division multiplex communications in an artificial pulse-coupled neural network is presented. Also, a novel heuristic learning algorithm of the neuron for realization of better communication performances is presented. In addition, fundamental comparisons to existing impulse radio sequence design methods are given.

The purpose of this study is to estimate the possible effect of cellular radio on implantable cardiac pacemakers in elevators. We previously investigated pacemaker EMI in elevator by examining the E-field distribution of horizontal plane at the height of expected for implanted pacemakers inside elevators. In this paper, we introduce our method for estimating EMI impact to implantable cardiac pacemakers using EMF distributions inside the region of the human body in which pacemakers are implanted. Simulations of a human phantom in an elevator are performed and histograms are derived from the resulting EMF distributions. The computed results of field strengths are compared with a certain reference level determined from experimentally obtained maximum interference distance of implantable cardiac pacemakers. This enables us to carry out a quantitative evaluation of the EMI impact to pacemakers by cellular radio transmission. This paper uses a numerical phantom model developed based on an European adult male. The simulations evaluate EMI on implantable cardiac pacemakers in three frequency bands. As a result, calculated E-field strengths are sufficiently low to cause the pacemaker to malfunction in the region examined.

We present an adaptive power saving (APS) scheme to reduce downlink energy consumption of the transmit power in the cellular relay network (CRN). In the APS scheme, some cell topologies operating in 2-hop mode using relay stations (RSs) are converted to that of 3-hop mode and others are simultaneously converted to that of single-hop mode when the offered traffic load becomes very low, especially during night periods. By this means, we show the APS scheme outperforms the conventional CRN (CCRN) scheme in terms of energy consumption.

There is evidence in favor of a relationship between the presence of 1/f noise and computational universality in cellular automata. To confirm the relationship, we search for two-dimensional cellular automata with a 1/f power spectrum by means of genetic algorithms. The power spectrum is calculated from the evolution of the state of the cell, starting from a random initial configuration. The fitness is estimated by the power spectrum with consideration of the spectral similarity to the 1/f spectrum. The result shows that the rule with the highest fitness over the most runs exhibits a 1/f type spectrum and its transition function and behavior are quite similar to those of the Game of Life, which is known to be a computationally universal cellular automaton. These results support the relationship between the presence of 1/f noise and computational universality.

We propose a call admission control scheme in cellular and wireless local area networks (WLANs) integration: integrated service-based admission control with load-balancing capability (ISACL). The novel aspects of the ISACL scheme include that load transfer in the cellular/WLAN overlapping areas is allowed for the admission of originating data calls from the area with cellular access only and vertical handoff requests to the cellular network. Packet-level quality of service (QoS) constraints in the WLANs and other-cell interference in the code division multiple access (CDMA) cellular network are taken into account to derive the WLANs and cellular capacity. We model the integrated networks using a multi-dimensional Markov chain and the important performance measures are derived for effective optimization of the admission parameters. The analytical model is validated by a computer simulation. The variation of admission parameters with traffic load and the dependence of resource utilization on admission parameters are investigated. It is shown that optimal balancing of the traffic load between the cellular network and WLANs results in the maximum resource utilization. Numerical results demonstrate that substantial performance improvements can be achieved by applying the proposed ISACL scheme.

In this letter, we present a route discovery protocol for ad hoc multi-hop cellular networks which uses directional information towards the base station. The proposed protocol, based on the reactive approach, reduces flooding as much as possible. To quantify this, we analyze its performance in terms of how much progress it makes per hop and how much reduction in routing packet number it achieves per route discovery. The analytical, as well as simulation, results demonstrate that the proposed protocol significantly reduces flooding overheads and finds a route to the base station in a robust manner.

In this paper, Cellular Neural Networks using genetic algorithm (GA-CNNs) are designed for CMOS image noise reduction. Cellular Neural Networks (CNNs) could be an efficient way to apply to the image processing technique, since CNNs have high-speed parallel signal processing characteristics. Adaptive CNNs structure is designed for the reduction of Photon Shot Noise (PSN) changed according to the average number of photons, and the design of templates for adaptive CNNs is based on the genetic algorithm using real numbers. These templates are optimized to suppress PSN in corrupted images. The simulation results show that the adaptive GA-CNNs more efficiently reduce PSN than do the other noise reduction methods and can be used as a high-quality and low-cost noise reduction filter for PSN. The proposed method is designed for real-time implementation. Therefore, it can be used as a noise reduction filter for many commercial applications. The simulation results also show the feasibility to design the CNNs template for a variety of problems based on the statistical image model.

This paper investigates the gain of inter-Node B macro diversity for a scheduled-based shared channel using single-carrier FDMA radio access in the Evolved UTRA (UMTS Terrestrial Radio Access) uplink based on system-level simulations. More specifically, we clarify the gain of inter-Node B soft handover (SHO) with selection combining at the radio frame length level (=10 msec) compared to that for hard handover (HHO) for a scheduled-based shared data channel, considering the gains of key packet-specific techniques including channel-dependent scheduling, adaptive modulation and coding (AMC), hybrid automatic repeat request (ARQ) with packet combining, and slow transmission power control (TPC). Simulation results show that the inter-Node B SHO increases the user throughput at the cell edge by approximately 10% for a short cell radius such as 100-300 m due to the diversity gain from a sudden change in other-cell interference, which is a feature specific to full scheduled-based packet access. However, it is also shown that the gain of inter-Node B SHO compared to that for HHO is small in a macrocell environment when the cell radius is longer than approximately 500 m due to the gains from hybrid ARQ with packet combining, slow TPC, and proportional fairness based channel-dependent scheduling.

In this paper, a novel decentralised dynamic sub-carrier assignment (DSA) algorithm for orthogonal frequency division multiple access (OFDMA)-based adhoc and cellular networks operating in time division duplexing (TDD) mode is proposed to solve the hidden and exposed node problem in media access control (MAC). This method reduces the co-channel interference (CCI), and thus increases the overall throughput of the network. Reduced CCI and increased throughput can be achieved, if time and frequency selectivity of the multi-path fading channel and the channel reciprocity offered by the TDD are fully exploited. The time and frequency selectivity of the channel are usually the main problem in mobile communication. However, in the context of channel assignment for OFDMA-based networks in TDD mode, the time and frequency selectivity of the channel are the key to reduce the interference. In the proposed channel assignment mechanism, several clusters of sub-carriers are assigned for data transmission between a transmitter and a receiver only if the corresponding channels of those sub-carriers linking this transmitter to potential victim receivers are deeply faded. In addition, the proposed algorithm works in a fully decentralised fashion and, therefore, it is able to effectively support ad hoc and multihop communication as well as network self-organisation. Numerical results show that the throughput obtained by the proposed approach for a given quality of service is higher than those of the conventional methods in any precondition of adhoc geographic scenario.

A microcellular network will be a good candidate for the future broadband mobile network. It is expected to support high-bit-rate connection for many fast mobile users if the handover is processed fast enough to lessen its impact on QoS requirements. One of the promising techniques is believed to use for the wireless interface in such a microcellular network is the WLAN (Wireless LAN) technique due to its very high wireless channel rate. However, the less capability of mobility support of this technique must be improved to be able to expand its utilization for the microcellular environment. The reason of its less support mobility is large handover latency delay caused by contention-based handover to the new BS (base station) and delay of re-forwarding data from the old to new BS. This paper presents a proposal of multi-polling and dynamic LMC (Logical Macro Cell) to reduce mentioned above delays. Polling frame for an MT (Mobile Terminal) is sent from every BS belonging to the same LMC -- a virtual single macro cell that is a multicast group of several adjacent micro-cells in which an MT is communicating. Instead of contending for the medium of a new BS during handover, the MT responds to the polling sent from that new BS to enable the transition. Because only one BS of the LMC receives the polling ACK (acknowledgement) directly from the MT, this ACK frame has to be multicast to all BSs of the same LMC through the terrestrial network to continue sending the next polling cycle at each BS. Moreover, when an MT hands over to a new cell, its current LMC is switched over to a newly corresponding LMC to prevent the future contending for a new LMC. By this way, an MT can do handover between micro-cells of an LMC smoothly because the redundant resource is reserved for it at neighboring cells, no need to contend with others. Our simulation results using the OMNeT++ simulator illustrate the performance achievements of the multi-polling and dynamic LMC scheme in eliminating handover latency, packet loss and keeping mobile users' throughput stable in the high traffic load condition though it causes somewhat overhead on the neighboring cells.

The purpose of this paper is to investigate the possible impact of cellular phones' signals on implantable cardiac pacemakers in elevators. This is achieved by carrying out precise numerical simulations based on the Finite-Difference-Time-Domain method to examine the electromagnetic fields in elevator models. In order to examine the realistic and complicated situations where humans are present in the elevator, we apply the realistic homogeneous human phantom and cellular radios operating in the frequency bands 800 MHz, 1.5 GHz and 2 GHz. These computed results of field strength inside the elevator are compared with a certain reference level determined from the experimentally obtained maximum interference distance of implantable cardiac pacemakers. This enables us to carry out a quantitative evaluation of the EMI risk to pacemakers by cellular radio transmission. The results show that for the case when up to 5 mobile radio users are present in the elevator model used, there is no likelihood of pacemaker malfunction for the frequency bands 800 MHz, 1.5 GHz and 2 GHz.

In this paper, we propose a modified scheme of MSODB and PMS, called Predictive User Mobility Behavior (PUMB) to improve performance of resource reservation and call admission control for cellular networks. This algorithm is proposed in which bandwidth is allocated more efficiently to neighboring cells by key mobility parameters in order to provide QoS guarantees for transferring traffic. The probability is used to form a cluster of cells and the shadow cluster, where a mobile unit is likely to visit. When a mobile unit may change the direction and migrate to the cell that does not belong to its shadow cluster, we can support it by making efficient use of predicted nonconforming call. Concomitantly, to ensure continuity of on-going calls with better utilization of resources, bandwidth is borrowed from predicted nonconforming calls and existing adaptive calls without affecting the minimum QoS guarantees. The performance of the PUMB is demonstrated by simulation results in terms of new call blocking probability, handoff call dropping probability, bandwidth utilization, call successful probability, and overhead message transmission when arrival rate and speed of mobile units are varied. Our results show that PUMB provides the better performances comparing with those of MSODB and PMS under different traffic conditions.

For integrated WLAN/cellular networks, we propose an energy-efficient vertical handover mechanism that both improves the energy efficiency of the mobile nodes and reduces the WLAN frame overhead.

In addition to high bit error rates, large and sudden variations in delay often occur in wireless cellular networks. The delay can be several times the typical round-trip time, which can cause the spurious timeout. In this letter, we propose a new window control algorithm to improve TCP performance in wireless cellular networks with large delay variation and high bit error rates. Simulation results illustrate that our proposal improves the performance of TCP in terms of fairness and link utilization.

We address the problem of multiuser co-channel interference scheduling in multicell interference-limited networks. Our target is to optimize the network capacity under the SIR-balanced power control policy. Since it's difficult to optimize the original problem, we derive a new problem which maximizes the lower bound of the network capacity. Based on the analysis of this new problem, we propose an interference matched scheduling algorithm. This algorithm considers the caused co-channel interference and the channel conditions to schedule the "matched" users at the same time. We prove that this interference matched scheduling algorithm optimizes the lower bound of the network capacity for any arbitrary numbers of cells and users. Moreover, this scheduling method is low-complexity and can be implemented in a fully distributed fashion. Simulation results reveal that the performance of the proposed algorithm achieves near optimal capacity, even though it does not optimize the network capacity directly. Finally, the proposed algorithm holds a great gain over formerly proposed round robin and power matched scheduling method, especially when the scale of the network is large.