Optimization Of Wireless Pricing Scheme

The wireless service providers obtain surplus fromconsumers who applied the service. That pricing strategyis developed by considering the linearity factors, elasticityprice, price factors, acceptance factor and unit serviceprice. Previous researches are focussed on the introductionof the models in general. This new approach of the modelis by considering the model as the nonlinear programmingproblem that can be solved optimally using LINGO 13.0.The optimal solution could give information on decisionvariables and objective function to maximize the revenuefor the providers. The several objectives to be achieved byservice providers are by setting the increment ordecrement of price change due to QoS change and amountof QoS value

Nonlinear Programming Approach of Wireless Pricing Models

The pricing for wireless networks is developed to obtain surplus from subscribers. The linearity factors, elasticity price, price factors are discussed. the new approach of wireless pricing model proposed by previous research are approached by considering the model as the nonlinear programming problem that can be solved optimally using LINGO 13.0.  The problem is considered to be nonlinear programming that can be solved using optimization tools. The solutions are expected to give some information about the connections between the acceptance factor and the price. The models attempt to maximize the total price for a connection based on QoS parameter. The maximum goal to maximum price is achieved when the provider set the increment of price change due to QoS change and amount of QoS value. The linearity parameter set up for most cases is obtained in ceiling value. Linear price factor ranges between the prescribed value especially cases when we increase the price change due to QoS change and increase the amount of QoS values

Congestion control in multi-serviced heterogeneous wireless networks using dynamic pricing

Includes bibliographical references.Service providers, (or operators) employ pricing schemes to help provide desired QoS to subscribers and to maintain profitability among competitors. An economically efficient pricing scheme, which will seamlessly integrate users’ preferences as well as service providers’ preferences, is therefore needed. Else, pricing schemes can be viewed as promoting social unfairness in the dynamically priced network. However, earlier investigations have shown that the existing dynamic pricing schemes do not consider the users’ willingness to pay (WTP) before the price of services is determined. WTP is the amount a user is willing to pay based on the worth attached to the service requested. There are different WTP levels for different subscribers due to the differences in the value attached to the services requested and demographics. This research has addressed congestion control in the heterogeneous wireless network (HWN) by developing a dynamic pricing scheme that efficiently incentivises users to utilize radio resources. The proposed Collaborative Dynamic Pricing Scheme (CDPS), which identifies the users and operators’ preference in determining the price of services, uses an intelligent approach for controlling congestion and enhancing both the users’ and operators’ utility. Thus, the CDPS addresses the congestion problem by firstly obtaining the users WTP from users’ historical response to price changes and incorporating the WTP factor to evaluate the service price. Secondly, it uses a reinforcement learning technique to illustrate how a price policy can be obtained for the enhancement of both users and operators’ utility, as total utility reward obtained increases towards a defined ‘goal state’

Combinatorial Auction-based Mechanisms for Composite Web Service Selection

Composite service selection presents the opportunity for the rapid development of complex applications using existing web services. It refers to the problem of selecting a set of web services from a large pool of available candidates to logically compose them to achieve value-added composite services. The aim of service selection is to choose the best set of services based on the functional and non-functional (quality related) requirements of a composite service requester. The current service selection approaches mostly assume that web services are offered as single independent entities; there is no possibility for bundling. Moreover, the current research has mainly focused on solving the problem for a single composite service. There is a limited research to date on how the presence of multiple requests for composite services affects the performance of service selection approaches. Addressing these two aspects can significantly enhance the application of composite service selection approaches in the real-world. We develop new approaches for the composite web service selection problem by addressing both the bundling and multiple requests issues. In particular, we propose two mechanisms based on combinatorial auction models, where the provisioning of multiple services are auctioned simultaneously and service providers can bid to offer combinations of web services. We mapped these mechanisms to Integer Linear Programing models and conducted extensive simulations to evaluate them. The results of our experimentation show that bundling can lead to cost reductions compared to when services are offered independently. Moreover, the simultaneous consideration of a set of requests enhances the success rate of the mechanism in allocating services to requests. By considering all composite service requests at the same time, the mechanism achieves more homogenous prices which can be a determining factor for the service requester in choosing the best composite service selection mechanism to deploy

Game theory for dynamic spectrum sharing cognitive radio

This thesis was submitted for the degree of Doctor of Philosophy and was awarded by Brunel University on 21 June 2010.‘Game Theory’ is the formal study of conflict and cooperation. The theory is based on a set of tools that have been developed in order to assist with the modelling and analysis of individual, independent decision makers. These actions potentially affect any decisions, which are made by other competitors. Therefore, it is well suited and capable of addressing the various issues linked to wireless communications. This work presents a Green Game-Based Hybrid Vertical Handover Model. The model is used for heterogeneous wireless networks, which combines both dynamic (Received Signal Strength and Node Mobility) and static (Cost, Power Consumption and Bandwidth) factors. These factors control the handover decision process; whereby the mechanism successfully eliminates any unnecessary handovers, reduces delay and overall number of handovers to 50% less and 70% less dropped packets and saves 50% more energy in comparison to other mechanisms. A novel Game-Based Multi-Interface Fast-Handover MIPv6 protocol is introduced in this thesis as an extension to the Multi-Interface Fast-handover MIPv6 protocol. The protocol works when the mobile node has more than one wireless interface. The protocol controls the handover decision process by deciding whether a handover is necessary and helps the node to choose the right access point at the right time. In addition, the protocol switches the mobile nodes interfaces ‘ON’ and ‘OFF’ when needed to control the mobile node’s energy consumption and eliminate power lost of adding another interface. The protocol successfully reduces the number of handovers to 70%, 90% less dropped packets, 40% more received packets and acknowledgments and 85% less end-to-end delay in comparison to other Protocols. Furthermore, the thesis adapts a novel combination of both game and auction theory in dynamic resource allocation and price-power-based routing in wireless Ad-Hoc networks. Under auction schemes, destinations nodes bid the information data to access to the data stored in the server node. The server will allocate the data to the winner who values it most. Once the data has been allocated to the winner, another mechanism for dynamic routing is adopted. The routing mechanism is based on the source-destination cooperation, power consumption and source-compensation to the intermediate nodes. The mechanism dramatically increases the seller’s revenue to 50% more when compared to random allocation scheme and briefly evaluates the reliability of predefined route with respect to data prices, source and destination cooperation for different network settings. Last but not least, this thesis adjusts an adaptive competitive second-price pay-to-bid sealed auction game and a reputation-based game. This solves the fairness problems associated with spectrum sharing amongst one primary user and a large number of secondary users in a cognitive radio environment. The proposed games create a competition between the bidders and offers better revenue to the players in terms of fairness to more than 60% in certain scenarios. The proposed game could reach the maximum total profit for both primary and secondary users with better fairness; this is illustrated through numerical results

Modeling cooperative behavior for resilience in cyber-physical systems using SDN and NFV

Cyber-Physical Systems (CPSs) are increasingly important in everyday applications including the latest mobile devices, power grids and intelligent buildings. CPS functionality has intrinsic characteristics including considerable heterogeneity, variable dynamics, and complexity of operation. These systems also typically have insufficient resources to satisfy their full demand for specialized services such as data edge storage, data fusion, and reasoning. These novel CPS characteristics require new management strategies to support the resilient global operation of CPSs. To reach this goal, we propose a Software Defined Networking based solution scaled out by Network Function Virtualization modules implemented as distributed management agents. Considering the obvious need for orchestrating the distributed agents towards the satisfaction of a common set of global CPS functional goals, we analyze distinct incentive strategies to enact a cooperative behavior among the agents. The repeated operation of each agent’s local algorithm allows that agent to learn how to adjust its behavior following both its own experience and observed behavior in neighboring agents. Therefore, global CPS management can evolve iteratively to ensure a state of predictable and resilient operation

A user-centered approach to network quality of service and charging

The number of network users is expected to triple between 1998 and 2002 (Cullinane, 1998). While a vision of the future Internet offers the potential to break traditional barriers in communications and commerce, the current level of service does not satisfy the requirements of many users (Network Reliability Steering Committee, 1998, Cullinane, 1998). This thesis is concerned with users' perceptions of Quality of Service (QoS), and their attitudes to charging mechanisms applied to wide-area networks. Whilst the majority of research in this area has been conducted from a technical point of view, studies addressing issues of QoS and charging from a users' perspective are limited. The aim of this research was to investigate the latter issue to provide a more complete and integrated perspective on QoS and charging in the user-network system. The thesis first addresses previous work that looks at QoS and charging, establishing a justification for the new research. This part of the thesis concludes that, whilst part of our understanding of QoS requirements can be explained by technical and economic paradigms, additional research is required to examine the perceptions and concomitant behaviour of users. The methodology employed is outlined in relation to obtaining this objective. The second part of the thesis details work undertaken. This work has made the following main contributions: *Developed a set of conceptual models that describe users' perceptions of network QoS. *Shown that these models can be used to predict users' behaviour in different contexts by capturing subjective evaluations of QoS. * Shown how a combination of established and new methods can be successfully applied in capturing and assessing users' perceptions of QoS. *Shown how the new data relates to technical and econometric research. *Provided concrete examples of how the new research can inform network systems design. The work documented in this thesis has implications for user-centred, technical and econometric research. This thesis therefore contributes, not only to the field of HCI to which it is most closely related, but provides guidelines that can be used by econometricians and network designers. The research from all three of these perspectives is concerned with the efficient function of network resource allocation systems. The work documented in this thesis has suggested how it is possible to integrate these perspectives to provide valued levels of QoS to users

A Game-Theoretic Approach to Strategic Resource Allocation Mechanisms in Edge and Fog Computing

With the rapid growth of Internet of Things (IoT), cloud-centric application management raises questions related to quality of service for real-time applications. Fog and edge computing (FEC) provide a complement to the cloud by filling the gap between cloud and IoT. Resource management on multiple resources from distributed and administrative FEC nodes is a key challenge to ensure the quality of end-user’s experience. To improve resource utilisation and system performance, researchers have been proposed many fair allocation mechanisms for resource management. Dominant Resource Fairness (DRF), a resource allocation policy for multiple resource types, meets most of the required fair allocation characteristics. However, DRF is suitable for centralised resource allocation without considering the effects (or feedbacks) of large-scale distributed environments like multi-controller software defined networking (SDN). Nash bargaining from micro-economic theory or competitive equilibrium equal incomes (CEEI) are well suited to solving dynamic optimisation problems proposing to ‘proportionately’ share resources among distributed participants. Although CEEI’s decentralised policy guarantees load balancing for performance isolation, they are not faultproof for computation offloading. The thesis aims to propose a hybrid and fair allocation mechanism for rejuvenation of decentralised SDN controller deployment. We apply multi-agent reinforcement learning (MARL) with robustness against adversarial controllers to enable efficient priority scheduling for FEC. Motivated by software cybernetics and homeostasis, weighted DRF is generalised by applying the principles of feedback (positive or/and negative network effects) in reverse game theory (GT) to design hybrid scheduling schemes for joint multi-resource and multitask offloading/forwarding in FEC environments. In the first piece of study, monotonic scheduling for joint offloading at the federated edge is addressed by proposing truthful mechanism (algorithmic) to neutralise harmful negative and positive distributive bargain externalities respectively. The IP-DRF scheme is a MARL approach applying partition form game (PFG) to guarantee second-best Pareto optimality viii | P a g e (SBPO) in allocation of multi-resources from deterministic policy in both population and resource non-monotonicity settings. In the second study, we propose DFog-DRF scheme to address truthful fog scheduling with bottleneck fairness in fault-probable wireless hierarchical networks by applying constrained coalition formation (CCF) games to implement MARL. The multi-objective optimisation problem for fog throughput maximisation is solved via a constraint dimensionality reduction methodology using fairness constraints for efficient gateway and low-level controller’s placement. For evaluation, we develop an agent-based framework to implement fair allocation policies in distributed data centre environments. In empirical results, the deterministic policy of IP-DRF scheme provides SBPO and reduces the average execution and turnaround time by 19% and 11.52% as compared to the Nash bargaining or CEEI deterministic policy for 57,445 cloudlets in population non-monotonic settings. The processing cost of tasks shows significant improvement (6.89% and 9.03% for fixed and variable pricing) for the resource non-monotonic setting - using 38,000 cloudlets. The DFog-DRF scheme when benchmarked against asset fair (MIP) policy shows superior performance (less than 1% in time complexity) for up to 30 FEC nodes. Furthermore, empirical results using 210 mobiles and 420 applications prove the efficacy of our hybrid scheduling scheme for hierarchical clustering considering latency and network usage for throughput maximisation.Abubakar Tafawa Balewa University, Bauchi (Tetfund, Nigeria