By Topic
Skip to Results

Search Results

You searched for: ((non-cooperative versus cooperative approaches for distributed network synchronization)metadata)
143 Results returned
Skip to Results
  • Save this Search
  • Download Citations Disabled
  • Save To Project
  • Email
  • Print
  • Export Results
  • Full text access may be available. Click article title to sign in or learn about subscription options.

    Non-cooperative versus Cooperative Approaches for Distributed Network Synchronization

    Scaglione, A. ; Pagliari, R.
    Pervasive Computing and Communications Workshops, 2007. PerCom Workshops '07. Fifth Annual IEEE International Conference on

    DOI: 10.1109/PERCOMW.2007.85
    Publication Year: 2007 , Page(s): 537 - 541
    Cited by:  Papers (2)

    IEEE Conference Publications

    In this paper we compare the so called pulse coupled oscillator (PCO) protocol with an alternative gossiping algorithm, known as average consensus protocol, considering the application of decentralized network synchronization. The main difference between the PCO algorithm and the average consensus protocol is that the latter is based on the explicit exchange of time-stamps in the pay load of packets, which are delivered with contention to the neighbors. The PCO scheme, instead, implicitly encodes the computed state into the transmission time, driving the nodes to transmit packets in synchrony. Our results show clearly how as more nodes tend to transmit at unison, cooperative transmission emerges boosting up the signal level and, therefore, speeding up the algorithm convergence. Conversely, the average consensus protocol, requires increasing energy as the number of nodes increases View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    A Non-Cooperative Game Approach for Distributed Power Allocation in Multi-Cell OFDMA-Relay Networks

    Xinmin Yu ; Tong Wu ; Jing Huang ; Ying Wang
    Vehicular Technology Conference, 2008. VTC Spring 2008. IEEE

    DOI: 10.1109/VETECS.2008.435
    Publication Year: 2008 , Page(s): 1920 - 1924
    Cited by:  Papers (6)

    IEEE Conference Publications

    This paper presents a distributed power allocation (PA) algorithm for the downlink of relay enhanced cellular networks. The PA problem is built into a non-cooperative game where a utility function is formulated and maximized. The utility function is comprised of two parts considering the interests of the node B and the relay node respectively, which facilitates the distributed PA on the nodes. Since the relay user's data rate is constrained by the minimum capacity of the two hops, a novel pricing function is developed to avoid allocating excess power to the second hop when the capacity is inferior in the first hop. The proposed game theoretic approach is compared with the uniform power allocation and the pure iterative water-filling method. Simulation results show that within a few steps of iteration, the proposed scheme can not only achieve the highest system capacity, but also efficiently balance the capacities of relay users in the two hops. View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    Distributed rate and admission control in home M2M networks: A non-cooperative game approach

    Rong Yu ; Yan Zhang ; Yanrong Chen ; Chujia Huang ; Yang Xiao ; Guizani, M.
    Computer Communications Workshops (INFOCOM WKSHPS), 2011 IEEE Conference on

    DOI: 10.1109/INFCOMW.2011.5928807
    Publication Year: 2011 , Page(s): 196 - 200
    Cited by:  Papers (2)

    IEEE Conference Publications

    It is envisioned that home networks will shift from the current machine-to-human communications to the machine-to-machine (M2M) paradigm with the rapid penetration of embedded devices in home surroundings. In this paper, we first proposed an architecture of home M2M networks that is decomposed into three sub-areas depending on the radio service ranges and potential applications. We then concentrate on the Quality-of-Service (QoS) management in home M2M networks. Although generic QoS architectures for home M2M networks have been proposed in existing standards, the concrete QoS schemes and algorithms are still missing. Based on the proposed architecture, a cross-layer design of distributed admission and rate control is put forwarded. This proposed scheme, named DRAC, is integrated with a game theory analysis module to model the competition of radio bandwidth among M2M home devices, and embrace the distributed operations of QoS-aware and fair sharing in transmission opportunities. Simulation results indicate that the proposed DRAC scheme allows the M2M home devices to intelligently share the radio bandwidth based on QoS demands in resource-constrained home M2M networks. View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    Power minimization for multi-cell OFDM networks using distributed non-cooperative game approach

    Zhu Han ; Zhu Ji ; Liu, K.J.R.
    Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE

    Volume: 6
    DOI: 10.1109/GLOCOM.2004.1379068
    Publication Year: 2004 , Page(s): 3742 - 3747 Vol.6
    Cited by:  Papers (34)

    IEEE Conference Publications

    In this paper, we use a noncooperative game approach to have distributed subchannel assignment, adaptive modulation, and power control for multi-cell OFDM networks. The goal is to minimize the overall transmitted power under each user's maximal power and minimal rate constraints. Our contribution is to model and solve this complicated problem by a distributed noncooperative game approach: Each user water-fills its power to different subchannels regarding other users' powers as interference. A noncooperative game is constructed for each user to compete with others. A method is constructed as a mediator (judge) for the game. From the simulation results, the proposed scheme reduces the overall transmitted power greatly compared with the fixed channel assignment algorithm and pure water-filling algorithm. View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    A potential game governing a non-cooperative distributed Cognitive Radio Network: A price-based approach

    Mostaani, A. ; Sabahi, M.F.
    Electrical Engineering (ICEE), 2012 20th Iranian Conference on

    DOI: 10.1109/IranianCEE.2012.6292554
    Publication Year: 2012 , Page(s): 1286 - 1291

    IEEE Conference Publications

    In the following paper a Cognitive Radio Network (CRN) is studied by means of the “mathematical tool of game theory”. When we are faced with a distributed CRN, it is observed that selfishness of users will decrease the efficiency of network resource usage. Indeed, this is the selfishness of the users dispossessing them of optimum achievable state in the network. Using a game theoretical approach, we will offer a suitable pricing method which formulates the game as a potential one and allows the users to get more of network resources as long as they pay for it. Furthermore, how this method functions in a simulated CRN will be shown. According to simulation results, it can be perceived that in a non-cooperative environment, an ordinary network face a considerable drop in the number of convergence trials and the access of users to network resources, whereas exploiting the suggested pricing method mitigates the negative effects of selfishness of users. Moreover, the simulation results show that there are even some parameters which are bettered using the pricing method in the network in comparison with cooperative setting. View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    A game theoretic approach for distributed generations in DC microgrid

    Lei Dong ; Furong Xiao ; Xiaozhong Liao
    Transportation Electrification Asia-Pacific (ITEC Asia-Pacific), 2014 IEEE Conference and Expo

    DOI: 10.1109/ITEC-AP.2014.6941041
    Publication Year: 2014 , Page(s): 1 - 6

    IEEE Conference Publications

    This paper presents a new control strategy for distributed generations (DGs) in a DC microgrid. The proposed technique is derived based on game theory and is independent of the communication network. In the presented paper, the operation of the DC microgrid with non-communication structure is regarded as a non-cooperative game. With reasonable game mechanisms, the operation of the DC microgrid converges to a stable equilibrium, known as Nash equilibrium. Compared with the traditional droop control, the proposed approach eliminates the trade-off between the power sharing accuracy and the output voltage deviation. Finally, the simulation and experimental results corroborate the theoretic analysis. View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    Non-cooperative power scheduling for wireless MIMO networks

    Chao Zhou ; Yizhi Xu ; Bui Thi Oanh ; Pingping Xu
    Advanced Technologies for Communications (ATC), 2010 International Conference on

    DOI: 10.1109/ATC.2010.5672742
    Publication Year: 2010 , Page(s): 164 - 167

    IEEE Conference Publications

    This paper presents a non-cooperative method to maximize the throughput of a set of distributed links in wireless MIMO ad hoc networks. The space-time power scheduling in each link is built into a non-cooperative game where its utility function is identified and maximized. The link quality is introduced into the pricing function in order to obtain Pareto improvement. The gradient projection methods are compared with the proposed game theoretic approach by simulations, and the results show that the proposed method provides a distributed scheduling of resources with low computational complexity and without significantly sacrificing the network throughput. View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    Non-cooperative block-faded orthogonal multiple access with source correlation: Performance limits and practical schemes

    Abrardo, A. ; Ferrari, G. ; Martalò€, M.
    Wireless Pervasive Computing (ISWPC), 2010 5th IEEE International Symposium on

    DOI: 10.1109/ISWPC.2010.5483792
    Publication Year: 2010 , Page(s): 1 - 6

    IEEE Conference Publications

    In this paper, we study the performance of non-cooperative wireless multiple access systems with noisy separated channels, where correlated sources communicate to an access point (AP) in the presence of block-faded links. This is meaningful for pervasive wireless scenarios, e.g., wireless sensor networks, where information may be exchanged between a multitude of nodes. Our goal is to explore the potential benefits which can be obtained when source correlation is exploited at the AP, comparing the performance with that obtained by using distributed source coding (DSC) at the nodes. We consider both the average bit error probability and the outage probability as performance indicators, and we derive a theoretical approach to evaluate their limits. Our results show that the improvement brought by the exploitation of the correlation at the AP is more evident when the correlation becomes sufficiently high. Moreover, some simulation results are presented for two classes of channels codes: serially concatenated convolutional codes (SCCCs) and low-density parity-check (LDPC) codes. Our results show that SCCCs can exploit better the correlation in scenarios with high values of the correlation coefficient (e.g., 0.999). View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    Asynchronous Power Control Game with Channel Outage Constraints in Cognitive Radio Networks

    Pan Zhou ; Yusun Chang ; Copeland, J.A.
    Communications (ICC), 2011 IEEE International Conference on

    DOI: 10.1109/icc.2011.5962576
    Publication Year: 2011 , Page(s): 1 - 5
    Cited by:  Papers (3)

    IEEE Conference Publications

    This study provides a general framework for distributed multi-user power control problems in cognitive radio (CR) networks over fading channels. Using a non-cooperative game with coupled constraints in CR and primary channel outages, the fundamental performance traits of power control for multiple CR users are analyzed in the present of multiple primary users (PUs) in fading environments for the first time. While the feasibility of target SINRs are always guaranteed in most studies for no-fading environments, the adopted channel outage model incorporates the probability that the SINR falls below a target threshold due to fast fading or interferences from other CR users. For the tractable analysis of the formulated problem, geometric programming approach is used to transfer it as a convex one. A dual decomposition approach is applied with layered structure for the constrained game, where each subproblem is full of economic interpretation. The properties of Nash Equilibrium (N.E.) for the proposed game are thoroughly investigated. An asynchronous distributed power control algorithm converging to the N.E. is designed, which ensures the robust implementation in fading environments. Finally, the simulation results and analysis are shown to enforce the effectiveness of the proposed algorithms for CR users over fading channels. View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    Multi-Player Game Theoretic MAC Strategies for Energy Efficient Data Dissemination

    Antonopoulos, A. ; Verikoukis, C.
    Wireless Communications, IEEE Transactions on

    Volume: 13 , Issue: 2
    DOI: 10.1109/TWC.2013.120713.120790
    Publication Year: 2014 , Page(s): 592 - 603

    IEEE Journals & Magazines

    The existence of multiple active sources in wireless data dissemination scenarios raises considerable channel access issues. Although the overall goal in the network is the successful accomplishment of the dissemination, the individual wireless nodes aim at maximizing their battery lifetime by minimizing their particular energy consumption. Considering thus the self-centered behavior of the nodes, we anticipate to design Medium Access Control (MAC) policies in order to provide the terminals with energy efficient solutions without compromising the dissemination completion time. In this paper, we propose non-cooperative game theoretic channel access strategies by estimating equilibrium points that achieve balance between conserving energy and completing the data dissemination. In particular, we present two different MAC strategies: i) a distributed approach for ad-hoc networks, and ii) a coordinated approach for infrastructure networks, where a central controller is sporadically used to accelerate the data dissemination. In addition, network-coded transmissions are considered to eliminate the need of control packets exchange. Both analytical and simulation results are provided to evaluate our proposed schemes, demonstrating the significant gains that game theoretic techniques can bring to the network performance compared to standardized solutions. View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    A game-theoretical model for wireless information and power transfer in relay interference channels

    He Chen ; Yunxiang Jiang ; Yonghui Li ; Yuanye Ma ; Vucetic, B.
    Information Theory (ISIT), 2014 IEEE International Symposium on

    DOI: 10.1109/ISIT.2014.6875015
    Publication Year: 2014 , Page(s): 1161 - 1165

    IEEE Conference Publications

    In this paper, we consider simultaneous wireless information and power transfer (SWIPT) in relay interference channels, where multiple source-destination pairs communicate through their dedicated energy harvesting relays. Game theory is applied to design a distributed power splitting scheme for the considered system. Particularly, a non-cooperative game is formulated, in which each link is modeled as a strategic player who aims to maximize its own achievable rate. The existence and uniqueness of the Nash equilibrium (NE) for the formulated game is analyzed. A distributed algorithm is proposed based on the best response functions to achieve the NE. Numerical results show that the proposed game-theoretical approach can achieve a near-optimal network-wide performance. View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    Feedback Control Game for Channel State Information in Wireless Networks

    Lingyang Song ; Zhu Han ; Qihao Li ; Bingli Jiao
    Communications (ICC), 2011 IEEE International Conference on

    DOI: 10.1109/icc.2011.5962622
    Publication Year: 2011 , Page(s): 1 - 5

    IEEE Conference Publications

    It has been well recognized that channel state information (CSI) feedback is important for dowlink transmissions of closed-loop wireless networks. In this paper, we investigate the CSI feedback rate control problem in the analytical setting of a game theoretic framework, where a multiple-antenna base station (BS) communicates with a number of co-channel mobile stations (MS) through a minimum mean square error (MMSE) precoder. Specifically, we present a non-cooperative feedback-rate control game with price (NFCP) over orthogonal feedback channels with a total bandwidth constraint. The game utility is defined as the performance gain by CSI feedback minus the price as a linear function of the CSI feedback rate, subject to an overall bandwidth constraint. The existence of the Nash equilibrium of such a game is investigated. Simulation results show that the distributed game approach results in close optimal performance compared with the centralized scheme. View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    Study of Co-Operation among Selfish Neighbors in MANET under Evolutionary Game Theoretic Model

    Komathy, K. ; Narayanasamy, P.
    Signal Processing, Communications and Networking, 2007. ICSCN '07. International Conference on

    DOI: 10.1109/ICSCN.2007.350717
    Publication Year: 2007 , Page(s): 133 - 138
    Cited by:  Papers (2)

    IEEE Conference Publications

    Trust among nodes in a self-organizing network such as mobile ad hoc networks presents a number of problems and paradoxes. This paper explores the emanation of trust with a simple, dynamic and distributed framework using evolutionary game theory. Strategic, non-cooperative game theory has been exploited to study the behavior of selfish nodes. An evolutionary stable strategy has been derived applying genetic algorithm. The proposed model demonstrates that it can also induce cooperation among selfish nodes, albeit without negotiations. The cooperation level goes high when every node follows the evolved strategy and the trust mechanism. The investigation on the results has shown that the ad hoc paradigm can be modeled using an approach that has been developed for game theory View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    Multi-leader Multi-follower Game Power Control with Utility Learning for Cooperative Relay Networks over Interference Channels

    Zhengfa Zhu ; Jun Peng ; Shuo Li ; Fu Jiang ; Weirong Liu ; Qi Tong ; Chaoliang Zhu
    High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing (HPCC_EUC), 2013 IEEE 10th International Conference on

    DOI: 10.1109/HPCC.and.EUC.2013.67
    Publication Year: 2013 , Page(s): 422 - 427

    IEEE Conference Publications

    In this study, the power control problem for multi-user and multi-relay decode-and-forward (DF) cooperative networks over interference channels is investigated. To improve efficiency of power assumption in wireless networks with self-interested nodes, a utility learning based multi-leader and multi-follower stackelberg game-theoretic model is proposed to jointly allocate the power of users and relays, where users and relays are modeled as followers and leaders respectively. In order to motivate the relays to participate in the cooperative transmission, we assume that each relay can get proper profit by introducing the price policy in economics. And the competition among the relays is modeled as a non-cooperative game, where each relay maximizes its utility through dynamically adjusting the price factor. Meanwhile, given specific prices, the users also compete with each other for power resource using non-cooperative game. To reduce the complexity and communication overhead of the power control approach, a distributed utility learning algorithm is proposed to update the game policies of users and relays based on local channel state information(CSI). Simulation results demonstrate that the proposed power control algorithm can improve the energy utilization while guaranteeing the performance of the system. View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    Centralised and distributed power allocation algorithms in cooperative networks

    Adeane, J. ; Rodrigues, M.R.D. ; Wassell, I.J.
    Signal Processing Advances in Wireless Communications, 2005 IEEE 6th Workshop on

    DOI: 10.1109/SPAWC.2005.1506042
    Publication Year: 2005 , Page(s): 333 - 337
    Cited by:  Papers (4)

    IEEE Conference Publications

    Cooperation among network nodes provides transmit diversity in cases where wireless transmitters, due to size and power limitation, cannot support multiple antennas. We consider cooperation among M nodes, where each node achieves space diversity by using other nodes' antennas as relays. Cooperation among nodes has been shown to achieve impressive bit error rate (BER) gains as compared to a non-cooperative system while maintaining the same information rate, transmit power, and bandwidth [ A. Sendonaris et al. (2003), J. N. Laneman et al. (2004), T. E. Hunter et al.]. Firstly, this paper formulates an optimum, centralised power allocation scheme appropriate for a cooperative network that employs transparent relaying. It will be shown that the proposed allocation scheme significantly outperforms the equal power allocation scheme, e.g., by up to 5 dB for a 3-user case at a bit error rate of 10-3. Secondly, this paper proposes a distributed power allocation scheme where each node independently calculates its power allocation factors, and it will be shown that it converges to the optimum allocation yielded by the centralised approach. Finally, this paper presents a distributed power allocation algorithm to optimise the BER performance of cooperative networks only with partial knowledge of the channel state information (CSI) of the non-adjacent nodes. View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    Content distribution in vehicular networks using coalitional graph game

    Xiang Fei ; Xi Luan ; Na Yi ; Xiaoning Zhang ; Jianjun Wu
    Advanced Communication Technology (ICACT), 2014 16th International Conference on

    DOI: 10.1109/ICACT.2014.6779147
    Publication Year: 2014 , Page(s): 1194 - 1197

    IEEE Conference Publications

    The popular content distribution (PCD) problem in Vehicular Ad-hoc Networks (VANETs) is considered. We model this problem as a coalitional graph game in which the on-board units (OBUs) try to form a peer-to-peer (P2P) network where one OBU transmits files to multi OBUs but receives from only one OBU each time, to complete the data dissemination efficiently. In this game, the OBUs engage in bilateral negotiations which result in a bilaterally agreement of forming a directed link among OBUs. Once the network is constructed, the OBUs will transmit the content pieces to each other. We study this game under a form of myopic dynamics which is carried out by each OBU in a distributed way. Furthermore, the network formed in this game is a pairwise stable network. Simulation results show that the proposed approach performs better comparing with the non-cooperative case. View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    Power control under best response dynamics for interference mitigation in a two-tier femtocell network

    Douros, Vaggelis G. ; Toumpis, Stavros ; Polyzos, G.C.
    Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), 2012 10th International Symposium on

    Publication Year: 2012 , Page(s): 398 - 405
    Cited by:  Papers (2)

    IEEE Conference Publications

    Femtocell networks are about to be extensively deployed with the aim of providing substantial improvements to cellular coverage and capacity. However, their deployment is nontrivial because of the extra interference that the femtocell nodes cause to the macrocell nodes with which they share the same portion of the spectrum. This paper proposes a non-cooperative power control approach for interference mitigation in a two-tier femtocell network where the first tier is a conventional cellular network and the second tier is a set of (short-range) femtocells. We define objective functions that are different for Femtocell Mobile Nodes (FMNs) and macrocell Mobile Nodes (MNs). We then define a power control game, we prove the existence of a Nash Equilibrium (NE) for that game and we analyze the necessary and sufficient conditions so that the NE is unique. Based on the best response dynamics method, we propose a distributed iterative power control scheme that, starting from any initial power vector, converges to that NE. We simulate various scenarios that are based on realistic assumptions and topologies. Results show that, in many cases, in the NE, smooth coexistence of all entities of the topology is feasible. View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    Combined Admission, Power and Rate Control for Cognitive Radios in Dynamic Spectrum Access Ad-Hoc Networks

    Rawat, D.B. ; Bista, B.B. ; Gongjun Yan
    Network-Based Information Systems (NBiS), 2010 13th International Conference on

    DOI: 10.1109/NBiS.2010.16
    Publication Year: 2010 , Page(s): 240 - 245

    IEEE Conference Publications

    Dynamic spectrum access in cognitive radio (CR) networks is emerging concept to utilize the scarce spectrum in an efficient manner. CR systems will operate in heterogeneous networks in which efficient use of resources will require control of both transmission rate and power for active CRs. In this paper we propose an algorithm for resource allocation in dynamic spectrum access ad-hoc networks where active CR links satisfy their own quality-of-service (QoS) requirements as well as the interference constraints to respect the incumbent primary user-transmissions. We formulate the problem of joint transmission rate and power control for active CR links to maximize their surplus (or net utility) functions using distributed interference compensation as a non-cooperative game. We illustrate the proposed approach with numerical results obtained from simulations. View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    Price-based distributed resource allocation for femtocell networks

    Pu Yuan ; Ying-Chang Liang ; Guoan Bi
    Communication Systems (ICCS), 2012 IEEE International Conference on

    DOI: 10.1109/ICCS.2012.6406182
    Publication Year: 2012 , Page(s): 418 - 422
    Cited by:  Papers (1)

    IEEE Conference Publications

    In this paper, we investigate the resource allocation issues in spectrum-sharing-based two-tier networks, which are composed of several underlaid femtocells and a macrocell. The macrocell base station (MBS) partially shares its sub-carriers with femtocell users (FUs) while being protected by per-sub-carrier interference temperature constraint. We formulate this multi-user-multi-channel problem as a non-cooperative game, in which each FU acts individually to maximize its own profits, regardless of the impact on other players. To avoid serious interference to MBS, we introduce a price-based utility function of FUs with a per-channel interference constraint instead of the spectrum mask constraint. We prove the existence and uniqueness of Nash Equilibrium (NE) and introduce fully distributed algorithm based on simultaneous iterative-water-filling (IWF) like algorithm, which adjusts the sub-carrier price iteratively and the maximum transmit power. This approach enables FUs to select suitable sub-carriers and allocate the power in a distributed manner. Meanwhile, it gives sufficient protection to MBS in each sub-carrier. Experimental results have shown that the proposed approach converges fast to the NE while providing sufficient protection to the macrocell users. View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    Game theoretic approach for channel assignment and power control with no-internal-regret learning in wireless ad hoc networks

    Tan, C.K. ; Sim, M.L. ; Chuah, T.C.
    Communications, IET

    Volume: 2 , Issue: 9
    DOI: 10.1049/iet-com:20070547
    Publication Year: 2008 , Page(s): 1159 - 1169
    Cited by:  Papers (5)

    IET Journals & Magazines

    In wireless ad hoc networks, co-channel interference can be suppressed effectively through proper integration of channel assignment (CA) and power control (PC) techniques. Unlike centralised cellular networks where CA and PC can be coordinated by base stations, the integration of CA and PC into infrastructureless wireless ad hoc networks where no global information is available is more technically challenging. The authors model the CA and PC problems as a non-cooperative game, in which all wireless users jointly pick an optimal channel and power level to minimise a joint cost function. To prove the existence and uniqueness of Nash equilibrium (NE) in the proposed non-cooperative CA and PC game (NCPG), the authors break the NCPG into a CA subgame and a PC subgame. It is shown that if NE exists in these two subgames, the existence of NE in the NCPG is ensured. Nonetheless, due to unpredictable network topology and diverse system conditions in wireless ad hoc networks, the NCPG may encounter the dasiaping-pongdasia effect that renders NE unattainable. By incorporating a call-dropping strategy and no-internal-regret learning into the NCPG, an iterative and distributed algorithm that ensures convergence to NE is proposed. It is shown through simulation results that the proposed approach leads to convergence and results in significant improvements in power preservation and system capacity as compared with the popular distributed dynamic CA technique incorporated with PC. View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    On Selfish Behavior in Wireless Sensor Networks: A Game Theoretic Case Study

    Mi Yan ; Liang Xiao ; Liang Du ; Lianfen Huang
    Measuring Technology and Mechatronics Automation (ICMTMA), 2011 Third International Conference on

    Volume: 2
    DOI: 10.1109/ICMTMA.2011.472
    Publication Year: 2011 , Page(s): 752 - 756
    Cited by:  Papers (1)

    IEEE Conference Publications

    In this paper, we study the selfish behavior in wireless sensor networks and apply a game theory method to address this problem in a CSMA/CA protocol. More specifically, we formulate the Media Access Control (MAC) layer activity in sensor networks as an optimization problem in terms of the random accessing problem. Then we propose a distributed algorithm for the system to reach the Nash Equilibrium (NE). We have de-fined a Contention Window Select Game (CWSG) in which each sensor selects its own contention window to control the access probability. This approach can improve the average performance, compared to a random strategy with each sensor selecting its own window independently. We prove the unique existence of NE in the CWSG, and propose a penalizing mechan-ism based on repeated game to prevent the non-cooperative selfish behavior of decreasing the contention window without per-mission. View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    Threshold-Based Multichannel Access with Energy Constraint

    Bo Yang ; Yanyan Shen ; Johansson, M. ; Xinping Guan
    Communications (ICC), 2010 IEEE International Conference on

    DOI: 10.1109/ICC.2010.5502753
    Publication Year: 2010 , Page(s): 1 - 5

    IEEE Conference Publications

    This paper considers multiaccess control for the uplink in orthogonal-frequency-division-multiple-access (OFDMA) wireless networks. To avoid extensive information exchange with the access point in centralized approaches, we propose a distributed threshold-based scheme, where each user accesses multiple channels simultaneously based on a comparison between measured channel gains and a channel gain threshold. Each user will adapts its channel gain threshold based on local measurements of collision on each channel and the energy consumption for channel contention. The problem is formulated as a constrained non-cooperative game. We show existence and uniqueness of the Nash equilibrium. A gradient-based algorithm is proposed to update the channel gain threshold. Furthermore, the convergence of this algorithm is proved. In addition, for heterogeneous systems, our proposed scheme can maintain multiuser diversity gains considering the time-varying channel gain and energy consumption. Compared with peer distributed OFDMA schemes and random channel selection algorithms, our proposed schemes reduce overhead and achieve a higher throughput. View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    Fair Bandwidth Allocation under User Capacity Constraints

    Yonghe Yan ; El-Atawy, A. ; Al-Shaer, E.
    Network Operations and Management Symposium, 2006. NOMS 2006. 10th IEEE/IFIP

    DOI: 10.1109/NOMS.2006.1687546
    Publication Year: 2006 , Page(s): 138 - 149
    Cited by:  Papers (2)

    IEEE Conference Publications

    In this paper, we present a theoretical framework and a distributed mechanism for fair bandwidth allocation on a network with various bottleneck links. In our model, a user is guaranteed a minimum bandwidth and charged a price for a bandwidth capacity request. We defined a utility function that reflects user's bandwidth demand when the user requests the bandwidth capacity. We then present a non-cooperative game with social welfare function to resolve users' conflicting bandwidth capacity requests at bottleneck links. We also show that our proposed game-theoretic solution guarantees fair bandwidth allocation as defined in our residual capacity fairness. In order to guarantee the minimum bandwidth requirement, we integrate an admission control in our solution. However, global optimal admission conditions are not easy to implement for large networks. We therefore propose a distributed admission scheme. As a result, the paper presents fair and practical distributed algorithms for bandwidth allocation and admission control in enterprise networks. Our simulation and evaluation study show that the distributed approach is sufficiently close to the global optimal solution View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    A Coalitional Game Theoretical Model for Content Downloading in Multihop VANETs

    Liang Tong ; Lixiang Ma ; Longjiang Li ; Mao Li
    Dependable, Autonomic and Secure Computing (DASC), 2013 IEEE 11th International Conference on

    DOI: 10.1109/DASC.2013.137
    Publication Year: 2013 , Page(s): 627 - 632

    IEEE Conference Publications

    Vehicular ad hoc networks (VANETs) are viewed as an effective way to disseminate content among vehicles on the road. While most of the current research efforts in VANETs focus on improving the packet delivery performance, only limited work aims to provide cost-efficient solutions for content downloading. This paper proposes a novel approach for the vehicles to download a common content in a cost-efficient way. The basic idea is to stimulate the vehicles to download the content cooperatively in mutually disjoint coalitions. To study the cooperation among the vehicles, a coalitional game model is proposed. Moreover, a distributed coalition formation algorithm is designed to obtain a stable coalition structure and minimize the total communication cost. Numerical results show that the proposed content download approach can achieve a considerable communication cost reduction compared with the non-cooperative case. View full abstract»

  • Full text access may be available. Click article title to sign in or learn about subscription options.

    Generalized diffusion adaptation for energy-constrained distributed estimation

    Wuhua Hu ; Wee Peng Tay
    Information Fusion (FUSION), 2014 17th International Conference on

    Publication Year: 2014 , Page(s): 1 - 8

    IEEE Conference Publications

    We propose a generalized diffusion adaptation strategy for distributed estimation under local and network-wide energy constraints. In our generalized diffusion strategy, at each iteration, each node can optimally combine intermediate parameter estimates from nodes other than its physical neighbors. The nodes whose intermediate estimates are relayed via a multi-hop path to a particular node, and fused there, are called the information neighbors of that node. This generalizes the physical neighborhood of nodes used in traditional diffusion strategies. We propose a method to determine the optimal information neighborhood, and combination weights for the information neighbors, subject to each node's energy budget, and an overall energy budget on the whole network for each iteration. By varying the energy budgets, our strategy covers the whole spectrum of strategies ranging from the centralized estimation method where all information is available at a single node, to the non-cooperative approach where each node performs its own local estimation. Numerical results suggest that our proposed method is able to achieve the same mean-square deviation as the adapt-then-combine diffusion algorithm with a lower energy budget. View full abstract»

Skip to Results

SEARCH HISTORY

Search History is available using your personal IEEE account.