Mobility and Queue Based Guard Channel Scheme for Cellular Networks

Date

2014-05-14

Author

Candan, Idil

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

172
views

0
downloads

This paper presents a dynamic and queue based bandwidth allocation scheme for cellular networks. According to mobility values, the bandwidth threshold is dynamically changed and a queuing policy is used for newly originating calls. If the number of busy bandwidth units is greater than or equal to bandwidth threshold, the arriving new calls are queued. The results indicate that, our scheme outperforms other proposed scheme in terms of handoff dropping, new call blocking probabilities and utilization, and also maintains its superiority under different network circumstances.

Subject Keywords

Handoff, Mobility, Bandwidth threshold, Cellular networks

URI

https://hdl.handle.net/11511/64122

Collections

Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Analytical modeling of a time-threshold based multi-guard bandwidth allocation scheme for cellular networks Candan, Idil; Salamah, Muhammed (2009-05-28) In this paper, the analytical modeling of a time-threshold based multi-guard bandwidth allocation scheme is presented using a two-dimensional markov chain. The main idea of the scheme is based on monitoring the elapsed real time of handoff calls and according to a time threshold (t(e)), a handoff call is either slightly-prioritized or fully-prioritized. A slightly-prioritized handoff call has higher priority than a new call and lower priority than a fully-prioritized handoff call. Also in this paper, the nu...
MULTI-GROUP MULTICAST BEAMFORMING FOR SIMULTANEOUS WIRELESS INFORMATION AND POWER TRANSFER Demir, Özlem Tuğfe; Tuncer, Temel Engin (2015-09-04) In this paper, simultaneous wireless information and power transfer (SWIPT) concept is introduced for multi group multicast beamforming. Each user has a single antenna and a power splitter which divides the radio frequency (RF) signal into two for both information decoding and energy harvesting. The aim is to minimize the total transmission power at the base station while satisfying both signal-to-interference-plus- noise-ratio (SINR) and harvested power constraints at each user. Unlike unicast and certain ...
Dynamic radio channel management in cellular mobile communication systems Yilmaz, N; Ergul, R (2004-09-29) We present a dynamic radio bandwidth management scheme for mobile communication systems to achieve a high level of QoS for both handoff calls and new calls, while at the same time to improve the utilization of wireless network resources. The simultaneous satisfaction of these two actually conflicting interests will be thanks to two major key features. First, due to the apriori information about handoff reservation requests that is provided by the mobile terminal. This information is based on the cell transi...
Learning Data Delivery Paths in QoI-Aware Information-Centric Sensor Networks Singh, Gayathri Tilak; Al-Turjman, Fadi M. (2016-08-01) In this paper, we envision future sensor networks to be operating as information-gathering networks in large-scale Internet-of-Things applications such as smart cities, which serve multiple users with diverse quality-of-information (QoI) requirements on the data delivered by the network. To learn data delivery paths that dynamically adapt to changing user requirements in this information-centric sensor network (ICSN) environment, we make use of cognitive nodes that implement both learning and reasoning in t...
Cooperative Localization In One-Hop And Multi-Hop Wireless Sensor Networks Using Alternating Minimization Algorithm Erdemir, Ece Naz; Tuncer, Temel Engin (2016-05-19) In this work, a new approach is proposed to solve cooperative localization problems in wireless sensor networks for both one-hop and multi-hop cases. To find the unknown positions of randomly distributed sensors with limited power and communication ability, noisy inter-sensor distances and anchor node positions are used. In a plane, when the distances between a sensor and at least three neighbor anchors are known, it is possible to find the sensor position by solving a linear set of equations. However, for ...

Citation Formats

I. Candan, “Mobility and Queue Based Guard Channel Scheme for Cellular Networks,” 2014, p. 0, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/64122.