An Extra Power Saving Scheme for Prolonging Lifetime of Mobile Handset in the 4G Mobile Networks

Chen, Jenhui; Tarn, Woei-Hwa; Lee, Jiann-Der

doi:10.1371/journal.pone.0103429

Cited by 3 publications

(3 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The last two decades have witnessed a boom in the use of cellular communication technologies. Billions of people are now requesting high-quality mobile wireless services with end-user data rates of several megabits per second over wide areas and tens, or even hundreds end is expected to continue in the future, with volumes predicted to increase around 15 times their current levels by 2016—2017, reaching 11.2 exabytes per month by 2017 [ 1 , 2 ]. Recently, in order to meet and encourage such ever-increasing service demands, heterogeneous networks (HetNets) have been widely discussed, perhaps most significantly in the 3GPP long term evolution-advanced (LTE-A).…”

Section: Introductionmentioning

confidence: 99%

Base Station Placement Algorithm for Large-Scale LTE Heterogeneous Networks

Lee

Kim

et al. 2015

PLoS ONE

View full text Add to dashboard Cite

Data traffic demands in cellular networks today are increasing at an exponential rate, giving rise to the development of heterogeneous networks (HetNets), in which small cells complement traditional macro cells by extending coverage to indoor areas. However, the deployment of small cells as parts of HetNets creates a key challenge for operators’ careful network planning. In particular, massive and unplanned deployment of base stations can cause high interference, resulting in highly degrading network performance. Although different mathematical modeling and optimization methods have been used to approach various problems related to this issue, most traditional network planning models are ill-equipped to deal with HetNet-specific characteristics due to their focus on classical cellular network designs. Furthermore, increased wireless data demands have driven mobile operators to roll out large-scale networks of small long term evolution (LTE) cells. Therefore, in this paper, we aim to derive an optimum network planning algorithm for large-scale LTE HetNets. Recently, attempts have been made to apply evolutionary algorithms (EAs) to the field of radio network planning, since they are characterized as global optimization methods. Yet, EA performance often deteriorates rapidly with the growth of search space dimensionality. To overcome this limitation when designing optimum network deployments for large-scale LTE HetNets, we attempt to decompose the problem and tackle its subcomponents individually. Particularly noting that some HetNet cells have strong correlations due to inter-cell interference, we propose a correlation grouping approach in which cells are grouped together according to their mutual interference. Both the simulation and analytical results indicate that the proposed solution outperforms the random-grouping based EA as well as an EA that detects interacting variables by monitoring the changes in the objective function algorithm in terms of system throughput performance.

show abstract

Section: Introductionmentioning

confidence: 99%

Base Station Placement Algorithm for Large-Scale LTE Heterogeneous Networks

Lee

Kim

et al. 2015

PLoS ONE

View full text Add to dashboard Cite

show abstract

“…Thus, recent network research has focused on IP mobility management. Mobile IPv6 (MIPv6) [ 1 – 2 ], a host-based mobility management protocol developed by the Internet Engineering Task Force (IETF), has been proposed to enable IP services in the mobile IP network environment. However, the mobile node (MN) of MIPv6 is required to support the mobility protocol stack to handle IP mobility, making the deployment of MIPv6 inefficient in practice.…”

Section: Introductionmentioning

confidence: 99%

Implementation of fast handover for proxy mobile IPv6: Resolving out-of-order packets

Kang¹,

Anh

Choo

2017

PLoS ONE

View full text Add to dashboard Cite

Mobile IP allows for location-independent routing of IP datagrams on the Internet. Mobile IP specifies how a mobile node (MN) registers with its home agent and how the home agent routes datagrams to the MN through the tunnel. Current Mobile IP protocols have difficulties meeting the stringent handover delay requirements of future wireless networks. Fast handover for Proxy Mobile IPv6 (FPMIPv6) is used to resolve handover latency and packet loss problems that occur in the Proxy Mobile IPv6 (PMIPv6) protocol. However, while implementing the FPMIPv6 scheme in a testbed, we encounter the out-of-order packet (OoOP) problem. The cause of this problem is the existence of two paths for data transmitted from a correspondent node (CN) to an MN. Since the problem affects the quality of service (QoS) of the network and the performance of the MN, we propose a new scheme using the last packet marker and packet buffering to solve this problem in FPMIPv6. The new Mobile Access Gateway (MAG) can control and deliver the data transmitted via the old path or the new path to an MN in order, using the last packet marker to notify the end of the data delivery in the old path and the packet buffering for holding the data delivered in the new path. We implement both the proposed scheme and FPMIPv6 in a testbed as a real network environment to demonstrate the correctness, cost effectiveness, and performance of the proposed scheme. A performance evaluation reveals that the proposed scheme can handle the OoOP problem efficiently.

show abstract

“…According to different types of applications in the media access control (MAC) layer, different scheduling service types, or called quality-of-service (QoS) classes, prioritize the radio resource allocation. Tables 1 and 2 summarize the priority order of QoS classes of IEEE 802.16m and LTE-A systems, respectively [4].…”

Section: Introductionmentioning

confidence: 99%

Fairness Consideration of Scheduling for Real-Time Services in 4G Systems

Tarn

Chen

Lee

2015

Mathematical Problems in Engineering

Self Cite

View full text Add to dashboard Cite

In order to achieve higher resource utilization, the call admission control (CAC) will allow the number of connections into the system more than the system capacity can offer. However, the fairness problem will occur when these connections are real-time services. To solve this problem, in this paper, we propose a fair scheduling algorithm named contribution-based scheduling algorithm (CSA) for real-time polling service (rtPS) or guarantee bit rate (GBR) in the uplink direction in the forth-generation (4G) systems. In CSA, a mobile subscriber (MS) gains its contribution credit value at the end of each transmission time interval (TTI), which is based on the contribution of MS to the radio resource scheduling. The base station (BS) schedules the bandwidth according to the credit value. Simulation results show that CSA achieves higher fairness in bandwidth allocation while connection drop rate and queuing delay are also guaranteed as compared to the roundrobin (RR) and early deadline first (EDF) mechanisms.

show abstract

An Extra Power Saving Scheme for Prolonging Lifetime of Mobile Handset in the 4G Mobile Networks

Cited by 3 publications

References 19 publications

Base Station Placement Algorithm for Large-Scale LTE Heterogeneous Networks

Base Station Placement Algorithm for Large-Scale LTE Heterogeneous Networks

Implementation of fast handover for proxy mobile IPv6: Resolving out-of-order packets

Fairness Consideration of Scheduling for Real-Time Services in 4G Systems

Contact Info

Product

Resources

About