Auction-based Bandwidth Allocation Mechanisms for Wireless Future Internet

An important aspect of the Future Internet is the efficient utilization of (wireless) network resources. In order for the - demanding in terms of QoS - Future Internet services to be provided, the current trend is evolving towards an "integrated" wireless network access model that enables users to enjoy mobility, seamless access and high quality of service in an all-IP network on an "Anytime, Anywhere" basis. The term "integrated" is used to denote that the Future Internet wireless "last mile" is expected to comprise multiple heterogeneous geographically coexisting wireless networks, each having different capacity and coverage radius. The efficient management of the wireless access network resources is crucial due to their scarcity that renders wireless access a potential bottleneck for the provision of high quality services. In this paper we propose an auction mechanism for allocating the bandwidth of such a network so that efficiency is attained, i.e. social welfare is maximized. In particular, we propose an incentive-compatible, efficient auction-based mechanism of low computational complexity. We define a repeated game to address user utilities and incentives issues. Subsequently, we extend this mechanism so that it can also accommodate multicast sessions. We also analyze the computational complexity and message overhead of the proposed mechanism. We then show how user bids can be replaced from weights generated by the network and transform the auction to a cooperative mechanism capable of prioritizing certain classes of services and emulating DiffServ and time-of-day pricing schemes. The theoretical analysis is complemented by simulations that assess the proposed mechanisms properties and performance. We finally provide some concluding remarks and directions for future research

A Flexible Handoff Prioritization Scheme for Improved Quality of Service in Mobile Networks

Efficient handoff prioritization schemes make mobile networks to perform better. However, most existing schemes have the common characteristics of reducing the call drop probability and increasing the call block probability; this decreases the general network performance. The reservation of channels for the use of handoff calls alone has not proved to be an efficient approach to optimally utilize the network limited channel resources. These approaches are such that even when the reserved channels are not in use, new calls could still get blocked if there are no channels among the shared channels to allocate to the new calls. In trying to maintain an improved QoS for handoff calls while ensuring an acceptable QoS for new calls, different methods have been suggested for new calls to access and use the reserved channels while priority is still given to handoff calls since it is more frustrating to have an on-going call dropped than blocking a new call. Network parameters such as call drop probability and traffic intensity had been used separately to determine when new calls could be granted access to use the reserved channels or otherwise. Handoff queuing and other call admission control approaches have also been used. This paper proposes the use of traffic intensity and call drop probability to decide whether the new calls could use the reserved channels or not. Also proposed is the need to keep the number of reserved channels fixed rather than calculating the numbers to reserve per time therefore reducing the computational complexity of the scheme. The simulation results showed an improved QoS for the handoff calls while producing a commensurate improvement for the new calls through a reduced Call drop Probability and call block probability. Keywords: Call block probability, Call drop probability, traffic intensity, handoff prioritization, mobile network DOI: 10.7176/JIEA/11-1-03 Publication date: January 31st 202

An optimum dynamic priority-based call admission control scheme for universal mobile telecommunications system

The dynamism associated with quality of service (QoS) requirement for traffic emanating from smarter end users devices founded on the internet of things (IoTs) drive, places a huge demand on modern telecommunication infrastructure. Most telecom networks, currently utilize robust call admission control (CAC) policies to ameliorate this challenge. However, the need for smarter CAC has becomes imperative owing to the sensitivity of traffic currently being supported. In this work, we developed a prioritized CAC algorithm for third Generation (3G) wireless cellular network. Based on the dynamic priority CAC (DP-CAC) model, we proposed an optimal dynamic priority CAC (ODP-CAC) scheme for Universal Mobile Telecommunication System (UMTS). We then carried out simulation under heavy traffic load while also exploiting renegotiation among different call traffic classes. Also, we introduced queuing techniques to enhance the new calls success probability while still maintaining a good handoff failure across the network. Results show that ODP-CAC provides an improved performance with regards to the probability of call drop for new calls, network load utilization and grade of service with average percentage value of 15.7%, 5.4% and 0.35% respectively

Optimization of handover in mobile system by using dynamic guard channel method

Handover process is a very essential process in the Global System for Mobile Communication system (GSM). Its study is one of the major key performance indicators in every GSM network, and its linked to the quality of service of an each service provider strives to attain. The failure of the handover process is regarded as the drop of quality of service which in turn dissatisfies the customers. This study, contributes more on improving call drop rate in general, reduce handover failure rate and thus save on upgrade costs, this will be beneficial to GSM service providers to easily optimize their network faults relating to the resource management. In this paper, dynamic guard channel algorithm is presented that was developed using JAVA Software. This algorithm prioritizes the handover calls over the new originated calls. All handover calls are ongoing calls and if they are dropped it causes frustrations. Matlab was used to compare simulated results to the other schemes by use of graphs and charts.  From this paper we were able to establish and come up with a definitive solution to the handover crisis befalling telecommunication companies

A source-destination based dynamic pricing scheme to optimize resource utilization in heterogeneous wireless networks

Mobile wireless resources demand is rapidly growing due to the proliferation of bandwidth-hungry mobile devices and applications. This has resulted in congestion in mobile wireless networks (MWN) especially during the peak hours when user traffic can be as high as tenfold the average traffic. Mobile network operators (MNOs) have been trying to solve this problem in various ways. First, MNOs have tried to expand the network capacity but have still been unable to meet the peak hour demand. Focus has then shifted to economic and behavioral mechanisms. The widely used of these economic mechanisms is dynamic pricing which varies the MWN resources' price according to the congestion level in the MWN. This encourages users to shift their non-critical traffic from the busy hour, when the MWN is congested, to off-peak hours when the network is under-utilized. As a result, congestion of the MWN during the peak hours is reduced. At the same time, the MWN utilization during the off-peak hours is also increased. The current dynamic pricing schemes, however, only consider the congestion level in the call-originating cell and neglect the call-destination cell when computing the dynamic price. Due to this feature, we refer the current dynamic pricing schemes as source–based dynamic pricing (SDP) schemes in this work. The main problem with these schemes is that, when the majority of the users in a congested cell are callees, dynamic pricing is ineffective because callers and not callees pay for network services, and resources used by callers and callees are the same for symmetric services. For example, application of dynamic pricing does not deter a callee located in a congested cell from receiving a call, which originates from a caller located in an uncongested cell. Also, when the distribution of prospective callees is higher than that of callers in an underutilized cell, SDP schemes are ineffective as callees do not pay for a call and therefore low discounts do not entice them to increase utilization. In this distribution, dynamic pricing entices prospective callers to make calls but since their distribution is low, the MWN resource utilization does not increase by any significant margin. To address these problems, we have developed a source-destination based dynamic pricing (SDBDP) scheme, which considers congestion levels in both the call-originating and calldestination cells to compute the dynamic price to be paid by a caller. This SDBDP scheme is integrated with a load-based joint call admission control (JCAC) algorithm for admitting incoming service requests in to the least utilized radio access technology (RAT). The load-based JCAC algorithm achieves uniform traffic distribution in the heterogeneous wireless network (HWN). To test the SDBDP scheme, we have developed an analytical model based on M/M/m/m queuing model. New or handoff service requests, arriving when all the RATs in the HWN are fully utilized, lead to call blocking for new calls and call dropping for handoff calls. The call blocking probability, call dropping probability and percentage MWN utilization are used as the performance metrics in evaluating the SDBDP scheme. An exponential demand model is used to approximate the users' response to the presented dynamic price. The exponential demand model captures both the price elasticity of demand and the demand shift constant for different users. The matrix laboratory (MATLAB) tool has been used to carry out the numerical simulations. An evaluation scenario consisting of four groups of co-located cells each with three RATs is used. Both SDP and the developed SDBDP schemes have been subjected under the evaluation scenario. Simulation results show that the developed SDBDP scheme reduces both the new call blocking and handoff call dropping probabilities during the peak hours, for all callercallee distributions. On the other hand, the current SDP scheme only reduces new call blocking and handoff call dropping probabilities only under some caller –callee distributions (When the callers were the majority in the HWN). Also, the SDBDP scheme increases the percentage MWN utilization during the off-peak for all the caller-callee distributions in the HWN. On the other hand, the SDP scheme is found to increase the percentage MWN utilization only when the distribution of callers is higher than that of callees in the HWN. From analyzing the simulations results, we conclude that the SDBDP scheme achieves better congestion control and MWN resource utilization than the existing SDP schemes, under arbitrary caller-callee distribution

Buffer management and cell switching management in wireless packet communications

The buffer management and the cell switching (e.g., packet handoff) management using buffer management scheme are studied in Wireless Packet Communications. First, a throughput improvement method for multi-class services is proposed in Wireless Packet System. Efficient traffic management schemes should be developed to provide seamless access to the wireless network. Specially, it is proposed to regulate the buffer by the Selective- Delay Push-In (SDPI) scheme, which is applicable to scheduling delay-tolerant non-real time traffic and delay-sensitive real time traffic. Simulation results show that the performance observed by real time traffics are improved as compared to existing buffer priority scheme in term of packet loss probability. Second, the performance of the proposed SDPI scheme is analyzed in a single CBR server. The arrival process is derived from the superposition of two types of traffics, each in turn results from the superposition of homogeneous ON-OFF sources that can be approximated by means of a two-state Markov Modulated Poisson Process (MMPP). The buffer mechanism enables the ATM layer to adapt the quality of the cell transfer to the QoS requirements and to improve the utilization of network resources. This is achieved by selective-delaying and pushing-in cells according to the class they belong to. Analytical expressions for various performance parameters and numerical results are obtained. Simulation results in term of cell loss probability conform with our numerical analysis. Finally, a novel cell-switching scheme based on TDMA protocol is proposed to support QoS guarantee for the downlink. The new packets and handoff packets for each type of traffic are defined and a new cutoff prioritization scheme is devised at the buffer of the base station. A procedure to find the optimal thresholds satisfying the QoS requirements is presented. Using the ON-OFF approximation for aggregate traffic, the packet loss probability and the average packet delay are computed. The performance of the proposed scheme is evaluated by simulation and numerical analysis in terms of packet loss probability and average packet delay