In this paper, we study the problem of resource allocation as well as pricing in the context of Internet of things (IoT) networks. We provide a novel pricing model for IoT services where all the parties involved in the communication scenario as well as their revenue and cost are determined. We formulate the resource allocation in the considered model as a multi-objective optimization problem where in addition to the resource allocation variables, the price values are also optimization variables. To solve the proposed multi-objective optimization problem, we use the scalarization method which gives different Pareto optimal solutions. We solve the resulting problems using the alternating approach based on the successive convex approximation (SCA) method which converges to a local solution with few iterations. We also consider a conventional approach where each entity tries to maximize its own revenue independently. Simulation results indicate that by applying the proposed joint framework, we can increase the total revenue compared to the conventional case while providing an almost complete fairness among the players. This is while the conventional approach fails to provide such a fairness.
There are a number of works in wireless networking literature that use pricing methods to model the trade-offs among different entities @cite_51 @cite_38 . Examples include secondary and primary operators in cognitive radio networks @cite_42 , device to device (D2D) communications @cite_6 , and different base stations in heterogeneous networks @cite_46 . The existing literature focuses on bandwidth as the resource to be traded @cite_53 .
@cite_38 @cite_53 @cite_42 @cite_6 @cite_46 @cite_51
2571224123 2540490069 2748476900 1994534328
The Internet of Things has drawn lots of research attention as the growing number of devices connected to the Internet. Long Term Evolution-Advanced (LTE-A) is a promising technology for wireless communication and it's also promising for IoT. The main challenge of incorporating IoT devices into LTE-A is a large number of IoT devices attempting to access the network in a short period which will greatly reduce the network performance. In order to improve the network utilization, we adopted a hierarchy architecture using a gateway for connecting the devices to the eNB and proposed a multiclass resource allocation algorithm for LTE based IoT communication. Simulation results show that the proposed algorithm can provide good performance both on data rate and latency for different QoS applications both in saturated and unsaturated environment. In this paper, we study resource allocation for a multicarrier-based cognitive radio (CR) network. More specifically, we investigate the problem of secondary users’ energy-efficiency (EE) maximization problem under secondary total power and primary interference constraints. First, assuming cooperation among the secondary base stations (BSs), a centralized approach is considered to solve the EE optimization problem for the CR network where the primary and secondary users are using either orthogonal frequency-division multiplexing (OFDM) or filter bank based multicarrier (FBMC) modulations. We propose an alternating-based approach to solve the joint power-subcarrier allocation problem. More importantly, in the first place, subcarriers are allocated using a heuristic method for a given feasible power allocation. Then, we conservatively approximate the nonconvex power control problem and propose a joint successive convex approximation-Dinkelbach algorithm (SCADA) to efficiently obtain a solution to the nonconvex power control problem. The proposed algorithm is shown to converge to a solution that coincides with the stationary point of the original nonconvex power control subproblem. Moreover, we propose a dual decomposition-based decentralized version of the SCADA. Second, under the assumption of no cooperation among the secondary BSs, we propose a fully distributed power control algorithm from the perspective of game theory. The proposed algorithm is shown to converge to a Nash-equilibrium (NE) point. Moreover, we propose a sufficient condition that guarantees the uniqueness of the achieved NE. Extensive simulation analyses are further provided to highlight the advantages and demonstrate the efficiency of our proposed schemes. Device-to-device (D2D) communication is developed as a new paradigm to enhance network performance according to LTE and WiMAX advanced standards. The D2D communication may have dedicated spectrum (overlay) or shared spectrum (underlay). However, the allocated dedicated spectrum may not be effectively used in the overlay mode, while interference between the D2D users and cellular users cause impairments in the underlay mode. Can the resource allocation of a D2D system be optimized using the cognitive approach where the D2D users opportunistically access the underutilized radio spectrum? That is the focus of this paper. In this paper, the transmission rate of the D2D users is optimized while simultaneously satisfying five sets of constraints related to power, interference, and data rate, modeling D2D users as cognitive secondary users. Furthermore, a two-stage approach is considered to allocate the radio resources efficiently. A new adaptive subcarrier allocation scheme is designed first, and then, a novel power allocation scheme is developed utilizing geometric water-filling approach that provides optimal solution with low computation complexity for this nonlinear problem. Numerical results show that the proposed approach achieved significant performance enhancement than the existing schemes. In this paper, we propose a joint subchannel and power allocation algorithm for the downlink of an orthogonal frequency-division multiple access (OFDMA) mixed femtocell macrocell network deployment. Specifically, the total throughput of all femtocell user equipments (FUEs) is maximized while the network capacity of an existing macrocell is always protected. Towards this end, we employ an iterative approach in which OFDM subchannels and transmit powers of base stations (BS) are alternatively assigned and optimized at every step. For a fixed power allocation, we prove that the optimal policy in each cell is to give each subchannel to the user with the highest signal-to-interference-plus-noise ratio (SINR) on that subchannel. For a given subchannel assignment, we adopt the successive convex approximation (SCA) approach and transform the highly nonconvex power allocation problem into a sequence of convex subproblems. In the arithmetic-geometric mean (AGM) approximation, we apply geometric programming to find optimal solutions after condensing a posynomial into a monomial. On the other hand, logarithmic and d ifference-of-two- c oncave-functions (D.C.) approximations lead us to solving a series of convex relaxation programs. With the three proposed SCA-based power optimization solutions, we show that the overall joint subchannel and power allocation algorithm converges to some local maximum of the original design problem. While a central processing unit is required to implement the AGM approximation-based solution, each BS locally computes the optimal subchannel and power allocation for its own servicing cell in the logarithmic and D.C. approximation-based solutions. Numerical examples confirm the merits of the proposed algorithm.