A Novel Energy Efficient Key Distribution Scheme for Mobile WiMAX Networks

Mobile WiMAX is a broadband technology that is capable of delivering triple play services (voice, data, and video). However, mobility in mobile WiMAX system is still an issue when the mobile station (MS) moves and its connection is handed over between base stations (BSs). In the handover process, scanning is one of the required phases to find the target BS. During the handover scanning process, the MS must synchronize with all the advertised neighbour BSs (nBSs) to select the best BS candidate for the incoming handover action. Without terminating the connection between the SBS and MS, the SBS will schedule the scanning intervals and sleep-intervals (also called interleaving interval) to MS for the handover scanning. However, during the scanning interval period, all the coming transmissions will be paused. Therefore, the redundant or unnecessary scanning of neighbouring BS cause delay and MAC overhead which may affect real-time applications. In this paper, the MS movement direction prediction (MMDP) based handover scanning scheme is introduced to overcome the mobile WiMAX handover scanning issue. It based on dividing the BS coverage area is into zones and sectors. According to the signal quality; there are three zones, no handover (No-HO), low handover (Low-HO) and high handover (High-HO) zones respectively and six sectors. In this scheme, only two BSs can become candidates; the two that the MS moves toward them will be chosen as the candidate for the handover scanning purpose. Hence, the handover scanning process repetition will be reduced with these two shortlisted BS candidates instead of scanning all nBSs. Thus, MMDP will reduce scanning delay and the number of exchange messages during the handover scanning comparing to the conventional scanning scheme. Although, the MMDP may need an extra computational time, the prediction and scanning process will be finished before the MS reach the High-HO zone, which mean the end-user's running application will be affected. Simulation results show that the proposed MMDP scheme reduces the total handover scanning delay and scanning interval duration by 25 and 50 % respectively. Also, the size of scanning message is reduced, which leads to reduced signalling overhead.

Mobile WiMAX is a broadband technology that is capable of delivering triple play services (voice, data, and video). However, mobility in WiMAX system is still an issue when the mobile station (MS) moves and be handovered between base stations (BSs). This issue can cause unnecessary neighboring BS scanning and association, handover delay, and MAC overhead which may affect real-time applications. In this paper, the MS movement direction prediction (MMDP) based MS scanning to overcome the mobile WiMAX handover issues is presented. In this scheme, only potential BS candidates will be chosen for scanning purpose. Hence, the MS scanning process reputation will be reduced with these shortlisted BS candidates instead of scanning all neighbors BSs. Simulation results show that the proposed scheme reduces total scanning delay and scanning interval duration by 25% and 50% respectively.

As for radio channel control of a cellular mobile communication system, location measurement is an important technique for determining the base station to be Connected with the mobile station. This paper describes the radio zone selection characteristic when a part of the control channel is time‐shared by base stations and the reception level of each base station is measured at mobile stations. MSSC (Multitransmitter Simul/Sequential Casting) of control channels is proposed, which improves the location measurement and is suitable for a high‐capacity system. The MSSC channel consists of simul‐cast parts and sequential‐cast parts. Its speech connection control sequence when applied to the cellular mobile communication system is shown. Next, the relation between the reception level variation characteristic in land mobile communication and the average reception level measurement accuracy when burst signals are received several times is studied. Both analytical results and laboratory experimental simulation results are shown. Finally, the zone selecting rate of a mobile station is calculated and the effect of the proposed control channel configuration is clarified.

Orthogonal frequency division multiplexing (OFDM) has been widely regarded as an effective modulation technique for mitigating the effects of ISI in a frequency selective fading channel and for providing reliable high data rate transmission over wireless links. Adaptive antenna arrays at the base and mobile stations can achieve further increases in system's capacity and bandwidth efficiency, as well as in QoS improvement in conventional OFDM systems. The conventional adaptive antenna arrays based OFDM systems always use the sub-carriers characterized by the first largest eigenvalues to transmit the OFDM block symbols. In this paper and in contrast to previous work, we propose dynamic sub-channel allocation with adaptive beamforming for broadband OFDM wireless transmission systems. The proposed system adaptively selects the eigenvectors associated with the relatively large sub-channel eigenvalues to generate the beamforming weights at the mobile and base stations and then dynamically assigns the corresponding best sub-channels to transmit the OFDM block symbols. It is shown by simulation that, without adding much complexity, the proposed system can achieve a better performance than an adaptive antenna arrays based OFDM system without dynamic sub-channel allocation over multipath fading channels. Simulation results also reveal that the proposed system is not too sensitive to channel estimation errors.

Fuzzy logic based layers 2 and 3 handovers in IEEE 802.16e network

The Internet protocol (IP) can potentially become the universal network-layer protocol over all wireless systems as it already is for wireline packet networks. Such an all-IP wireless and wireline network can bring the proven advantages of IP networking to mobile users. However, realizing an all-IP wireless network introduces many challenges, among which is soft handoff. Two major problems need to be solved in order to support soft handoff. First, multiple streams of the same IP traffic have to be distributed via multiple base stations to a mobile station. Second, pieces of data arriving at the mobile station at the same time from different base stations need to be copies of the same data in order for the mobile station's radio system to correctly combine these different pieces into a single copy. A similar problem also needs to be resolved in the reverse direction from mobile stations to base stations. Solving these problems in a distributed all-IP wireless network remains a challenge. Although solutions exist for today's circuit-switched wireless systems. This article presents a new approach for soft handoff in distributed all-IP wireless networks. It consists of two main parts. First, a new design of IP-based distributed base stations enables mobile stations in multiple cells to be on the same IP subnet and multiple streams of the same data to be distributed via multiple base stations to a mobile without broadcasting/multicasting and with minimal signaling. Second, a novel IP-layer procedure performed by the base stations ensures that the data coming simultaneously from multiple base stations to a mobile station are copies of the same data.

The IEEE 802.16e-2005 standard for broadband wireless access provides a rich quality of service (QoS) framework suitable for supporting a multitude of services. In IEEE 802.16e, the uplink resource allocation is based on a request-grant mechanism where a mobile stations (MS) requests allocations of transmission opportunities from the base station (BS). Every frame, the BS decides the amount of resources to be granted for each uplink connection according to its QoS parameters. While the grant is decided on a connection basis, the BS aggregates the grants allocated for all connections of each MS and adds a single entry for each MS in the allocation MAP message. Two main challenges exist for scheduling at the MS side: the first is how to divide the grant among the connections according to their declared QoS parameters and requested bandwidth and the second is to be able to perform this operation prior to the arrival of the subsequent allocation from the BS. In this paper, we describe a new efficient scheme for mobile station uplink scheduling that meets these challenges. The scheme is a hierarchical credit-based algorithm based on the deficit round robin method. The algorithm is designed to prevent bandwidth stealing and starvation of low-priority connections. We provide simulation results that show the excellent performance of the scheme even under extreme overload conditions. The results show the isolation of service classes and the stability of the scheme.

WiBro is defined as a subset of the IEEE 802.16 standard and is developed based on the mobile WiMAX. WiBro delivers wireless data with a high transfer rate to provide mobile broadband services. However, it is necessary to consider radio resources efficiency due to limited resources. In this paper, we propose frequency assignment (FA) load balancing algorithm in order to use resources efficiently, by controlling two types of handover procedure and scheduling. When the resource unbalancing is detected in a FA, we choose BS (base station) initiated handover or MS (mobile station) initiated handover adaptively to disperse users entering and guarantee QoS (quality of service) in real time services. The difference between call admission control (CAC) and FA load balancing scheme is that FA load balancing scheme makes the MS connect with other FAs without disconnection. The proposed algorithm shows the performance improvement which is a lot for the existing algorithm in the user acceptance and QoS in real time service.

TCP is a reliable transport protocol tuned to perform well in traditional wired networks, where most packet losses are due to congestion. In wireless networks, however, packet losses result from wireless link loss in addition to congestion loss. Thus, TCP suffers a significant degradation in performance over wireless networks because it does not distinguish wireless link loss from congestion loss. To overcome this problem, the explicit wireless loss notification (EWLN) scheme is proposed to explicitly inform wireless link loss to the TCP sender. Previous work to deploy EWLN often lacked explicit specification of the interplay between EWLN and link-layer protocols, including error recovery mechanisms. In addition, many systems, or being based on computation demanding functionality of agents at a base station, were designed for the scenario where information is accessed from a mobile station through a wireless-to-wired connection. In this paper, we present an EWLN scheme that deploys the information from the MAC layer and takes into account the interplay with the error recovery mechanism at the link layer. The scheme does not require different implementations for mobile terminals and base stations and hence can support efficient TCP-based data transmission over wired-to-wireless and wireless-to-wired connections as well as ad-hoc networks. We also present EWLN-enabled TCP implementations which, showed significant improvements over the standard TCP-Reno and TCP-SACK protocols, as evidenced by simulation studies over ns-2 network simulator.

Cell selection is the process of determining the cell(s) that provide service to each mobile station. Optimizing these processes is an important step toward maximizing the utilization of current and future cellular networks. We study the potential benefit of global cell selection versus the current local mobile SNR-based decision protocol. In particular, we study the new possibility available in OFDMA-based systems, such as IEEE 802.16m and LTE-Advanced, of satisfying the minimal demand of a mobile station simultaneously by more than one base station. We formalize the problem as an optimization problem, and show that in the general case this problem is not only NP-hard but also cannot be approximated within any reasonable factor. In contrast, under the very practical assumption that the maximum required bandwidth of a single mobile station is at most an r-fraction of the capacity of a base station, we present two different algorithms for cell selection. The first algorithm produces a (1-r)-approximate solution, where a mobile station can be covered simultaneously by more than one base station. The second algorithm produces a 1-r/2-r-approximate solution, while every mobile station is covered by at most one base station. We complete our study by an extensive simulation study demonstrating the benefits of using our algorithms in high-loaded capacity-constrained future 4G networks, compared to currently used methods. Specifically, our algorithms obtain up to 20 percent better usage of the network's capacity, in comparison with the current cell selection algorithms.

We investigate a wireless system of multiple cells, each having a downlink shared channel in support of high-speed packet data services. In practice, such a system consists of hierarchically organized entities including a central server, Base Stations (BSs), and Mobile Stations (MSs). Our goal is to improve global resource utilization and reduce regional congestion given asymmetric arrivals and departures of mobile users, a goal requiring load balancing among multiple cells. For this purpose, we propose a scalable cross-layer framework to coordinate packet-level scheduling, call-level cell-site selection and handoff, and system-level cell coverage based on load, throughput, and channel measurements. In this framework, an opportunistic scheduling algorithm--the weighted Alpha-Rule--exploits the gain of multiuser diversity in each cell independently, trading aggregate (mean) down-link throughput for fairness and minimum rate guarantees among MSs. Each MS adapts to its channel dynamics and the load fluctuations in neighboring cells, in accordance with MSs' mobility or their arrival and departure, by initiating load-aware handoff and cell-site selection. The central server adjusts schedulers of all cells to coordinate their coverage by prompting cell breathing or distributed MS handoffs. Across the whole system, BSs and MSs constantly monitor their load, throughput, or channel quality in order to facilitate the overall system coordination. Our specific contributions in such a framework are highlighted by the minimum-rate guaranteed weighted Alpha-Rule scheduling, the load-aware MS handoff/cell-site selection, and the Media Access Control (MAC)-layer cell breathing. Our evaluations show that the proposed framework can improve global resource utilization and load balancing, resulting in a smaller blocking rate of MS arrivals without extra resources while the aggregate throughput remains roughly the same or improved at the hot-spots. Our simulation tests also show that the coordinated system is robust to dynamic load fluctuations and is scalable to both the system dimension and the size of MS population.

In a cellular communication system, deploying a relay station (RS) is an effective alternative to installing a new base station (BS). A dual-hop network enhances the throughput of mobile stations (MSs) located in shadow areas or at cell edges by installing RSs between BSs and MSs. Because additional radio resources should be allocated to the wireless link between BS and RS, a frame to be transmitted from BS is divided into an access zone (AZ) and a relay zone (RZ). BS and RS communicate with each other through the RZ, and they communicate with their registered MSs through an AZ. However, if too many MSs are registered with a certain BS or RS, MS overloading may cause performance degradation. To prevent such performance degradation, it is very important to find the proper positions for RSs to be deployed. In this paper, we propose a method for finding the sub-optimal RS deployment location for the purpose of load-balancing and throughput enhancement. The advantage of the proposed method is the efficiency in find the sub-optimal location of RSs and its reliable tradeoff between load-balancing throughput enhancement. Since the proposed scheme finds the proper position by adjusting the distance and angle of RSs, its computational complexity lower than other global optimization approach or learning-based approach. In addition, the proposed scheme is constituted with the two stages of load-balancing and throughput enhancement. These procedures result in the appropriate tradeoff between load-balancing and throughput enhancement. The simulation results support these advancements of the proposed scheme.

This paper proposes an agglomerating radio resource control method for wireless packet access systems that makes effective use of limited radio resources to provide users with their desired bandwidths. In the proposed method, each mobile station (MS) communicates with multiple base stations (BSs) simultaneously, and gathers from the neighboring BSs, as well as from the BS currently communicating with the MS, information about radio resources that have not been allocated to other MSs. The MS then sums up the bandwidths supported by the vacant resources, and if the total bandwidth is found to be larger than the MS's requirement, it keeps the connections with the multiple BSs to ensure communication continuity. This method is especially effective when traffic load is heavy in the cell hosting the mobile user. This paper evaluates the performance of the proposed method in various aspects such as throughput efficiency, resource allocation and successful packet transmission probabilities, as well as resource utilization ratio, under interference-limited environments.

In this paper, a generalized 3-D scattering model is presented for macrocellular land mobile radio cellular systems with a mobile station (MS) located at the center of a 3-D scattering semispheroid and a base station (BS) employing a directional antenna located outside of the semispheroid. The effect of the directional antenna is thoroughly observed on spatial and temporal characteristics of the proposed model. Closed-form expressions for joint and marginal probability density functions (pdf's) of the angle of arrival (AoA) seen at the MS and the BS in correspondence with azimuth and elevation angles are derived. Furthermore, closed-form expressions for propagation path delays and trivariate joint pdf's of the time of arrival (ToA) seen at the MS and the BS in correspondence with azimuth and elevation angles are derived. Moreover, the theoretical results, along with observations, are shown that illustrate the effect of the directional antenna on the spatiotemporal statistics of the proposed 3-D model. The proposed 3-D scattering model is shown to deduce all previously proposed 2-D and 3-D models that assume a uniform distribution of scatters with directional or omnidirectional antennas found in the literature for a macrocell environment. The obtained theoretical results are compared with some notable 2-D and 3-D scattering models to validate the generalization of the proposed model.

This paper investigates the effect of two control parameters of the Universal Mobile Telecommunications System (UMTS) handoff algorithm on the total peak base station (BS) transmit power required per mobile station (MS) to satisfy a prescribed outage probability. Denoting the set of BSs supporting an MS in soft handoff (SH) as the active group, the first parameter n is the maximum allowed size of the active group. The second, denoted /spl tau/, is the upper limit on the difference between the path loss of the dominant BS and that of any other member of the active group, where the term "dominant" refers to the BS with the lowest path loss to the MS. It was assumed that the MS is equipped with a Rake receiver capable of performing "maximal ratio combining" of the signals it receives from the transmitting BSs. General analytical derivations along with results derived for specific situations through numerical integration are presented.