scholarly journals Multiple Power-Saving MSSs Scheduling Methods for IEEE802.16e Broadband Wireless Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Shih-Chang Huang
Keyword(s):  
Wireless Networks ◽  
Power Saving ◽  
Base Station ◽  
Bandwidth Utilization ◽  
Broadband Wireless ◽  
Unsolicited Grant Service ◽  
Scheduling Method ◽  
Multiple Power ◽  
Simulation Results ◽  
Mobile Subscriber

This work proposes two enhanced multiple mobile subscriber stations (MSSs) power-saving scheduling methods for IEEE802.16e broadband wireless networks. The proposed methods are designed for the Unsolicited Grant Service (UGS) of IEEE802.16e. To reduce the active periods of all power-saving MSSs, the base station (BS) allocates each MSS fewest possible transmission frames to retrieve its data from the BS. The BS interlaces the active periods of each MSS to increase the amount of scheduled MSSs and splits the overflowing transmission frames to maximize the bandwidth utilization. Simulation results reveal that interlacing the active periods of MSSs can increase the number of scheduled MSSs to more than four times of that in the Direct scheduling method. The bandwidth utilization can thus be improved by 60%–70%. Splitting the overflowing transmission frames can improve bandwidth utilization by more than 10% over that achieved using the method of interlacing active periods, with a sacrifice of only 1% of the sleep periods in the interlacing active period method.

Load Based Sleep Scheduling with Reduced State Transitions for IEEE 802.16e Networks

2018 ◽  
Vol 14 (2) ◽  
pp. 71-85
Author(s):  
Gopalan M. ◽  
Marthandan G. ◽  
Eswaran C.
Keyword(s):  
High Speed ◽  
Power Saving ◽  
Window Size ◽  
Base Station ◽  
State Transitions ◽  
Sleep Scheduling ◽  
Ieee 802.16E ◽  
Network Load ◽  
Mobile Subscriber ◽  
Reduced State

IEEE 802.16e is extensively used these days for both data and voice communications as it makes available high-speed wireless access. However, in view of the fact that mobile subscriber stations are powered by a limited capacity battery, power saving mechanism is necessary to improve network performance. In this article, the authors introduce a load based sleep scheduling mechanism with reduced state transitions for IEEE 802.16e Networks. The mechanism encompasses two phases, load-based sleep scheduling and a reduced state transition (RST) algorithm. Considering network load information, the Base Station (BS) assigns a sleep window size for each mobile subscriber station (MS). The proposed RST algorithm reduces the number of state transitions between sleep and active mode by watchfully combining any two adjacent active bands. Further, the technique considers network load and delay as QoS metrics. Through simulation results, the authors prove the proficiency of their mechanism.

Interference Minimization and Dynamic Sub-Carrier Allocation in Broadband Wireless Networks

2014 ◽  
Vol 3 (3) ◽  
pp. 1-15
Author(s):  
Ju Wang ◽  
Jonathan Liu
Keyword(s):  
Wireless Networks ◽  
Numerical Experiments ◽  
Control Method ◽  
Channel Allocation ◽  
Base Station ◽  
Allocation Problem ◽  
Broadband Wireless ◽  
Access Methods ◽  
Distributed Approach ◽  
Distributed Channel Allocation

Efficient channel allocation is the key to fully exploit the signal diversity presented in the multi-carrier physical link in today's broadband wireless access networks. There are mounting evidences that the 4G and future-generation systems will take advantage of two opposite types of access methods, one using centralized control method and the other using a distributed approach. The authors study the distributed channel allocation problem in this article, formulated as a non-linear optimization problem, in broadband wireless networks. The signal properties of the multi-carrier radio interface in 3G and 4G networks are discussed to comprehend the complexity of the channel allocation problem. The authors propose a novel distributed heuristic algorithm based on the particle-swarm searching method. The distributed approach allows user stations to quickly switch sub-carriers with minimum intervention from the base station. The work presented in this paper shows an effective method to allocate a large number of channels while minimizing the possible interference. Extensive numerical experiments are conducted to evaluate several versions of distributed channel allocation algorithm for these new problem settings. The authors' results show that PSO-based method converges quickly in all our numerical experiments despite the high-dimensional searching space. The proposed technologies will eventually allow the true mobile steaming video/audio experience anywhere and anytime, which will have the huge impact to business, entertainment and people's quality of life.

QoS-based active dropping mechanism for NGN video streaming optimization

2014 ◽  
Vol 29 (4) ◽  
pp. 484-495 ◽  
Author(s):  
Chi-Yuan Chen ◽  
Tin-Yu Wu ◽  
Wei-Tsong Lee ◽  
Han-Chieh Chao ◽  
Jen-Chun Chiang
Keyword(s):  
Wireless Networks ◽  
Video Streaming ◽  
Scalable Video Coding ◽  
Video Quality ◽  
Buffer Management ◽  
Base Station ◽  
Effective Bandwidth ◽  
Bandwidth Utilization ◽  
Network Loading ◽  
The Impact

AbstractVideo streaming over mobile wireless networks is getting popular in recent years. High video quality relies on large bandwidth provisioning, however, it decreases the number of supported users in wireless networks. Thus, effective bandwidth utilization becomes a crucial issue in wireless network as the bandwidth resource in wireless environment is precious and limited. The NGN quality of service mechanisms should be designed to reduce the impact of traffic burstiness on buffer management. For this reason, we propose an active dropping mechanism to deal with the effective bandwidth utilization in this paper. We use scalable video coding extension of H.264/AVC standard to provide different video quality for users of different levels. In the proposed dropping mechanism, when the network loading exceeds the threshold, the dropping mechanism starts to drop data of the enhancement layers for users of low service level. The dropping probability alters according to the change in network loading. With the dropping mechanism, the base station increases the system capability and users are able to obtain better service quality when the system is under heavy loading. We also design several methods to adjust the threshold value dynamically. By using the proposed mechanism, better quality can be provided when the network is in congestion.

MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS

2009 ◽  
Vol 01 (01) ◽  
pp. 45-57 ◽  
Author(s):  
DEYING LI ◽  
LIN LIU ◽  
HUIQIANG YANG
Keyword(s):  
Wireless Networks ◽  
Undirected Graph ◽  
Dominating Set ◽  
Approximation Ratio ◽  
Dominating Set Problem ◽  
Simulation Results

In this paper, we study the connected r-hop k-dominating set problem in wireless networks. We propose two algorithms for the problem. We prove that algorithm I for UDG has (2r + 1)3 approximate ratio for k ≤ (2r + 1)2 and (2r + 1)((2r + 1)2 + 1)-approximate ratio for k > (2r + 1)2. And algorithm II for any undirected graph has (2r + 1) ln (Δr) approximation ratio, where Δr is the largest cardinality among all r-hop neighborhoods in the network. The simulation results show that our algorithms are efficient.

Sign in / Sign up

Export Citation Format

Share Document