• Title/Summary/Keyword: Nash bargaining solution

Search Result 28, Processing Time 0.019 seconds

Channel assignment for 802.11p-based multi-radio multi-channel networks considering beacon message dissemination using Nash bargaining solution (802.11p 기반 다중 라디오 다중채널 네트워크 환경에서 안전 메시지 전송을 위한 내쉬 협상 해법을 이용한 채널할당)

  • Kwon, Yong-Ho;Rhee, Byung-Ho
    • Journal of Internet Computing and Services
    • /
    • v.15 no.3
    • /
    • pp.63-69
    • /
    • 2014
  • For the safety messages in IEEE 802.11p vehicles network environment(WAVE), strict periodic beacon broadcasting requires status advertisement to assist the driver for safety. WAVE standards apply multiple radios and multiple channels to provide open public road safety services and improve the comfort and efficiency of driving. Although WAVE standards have been proposed multi-channel multi-radio, the standards neither consider the WAVE multi-radio environment nor its effect on the beacon broadcasting. Most of beacon broadcasting is designed to be delivered on only one physical device and one control channel by the WAVE standard. also conflict-free channel assignment of the fewest channels to a given set of radio nodes without causing collision is NP-hard, even with the knowledge of the network topology and all nodes have the same transmission radio. Based on the latest standard IEEE 802.11p and IEEE 1609.4, this paper proposes an interference aware-based channel assignment algorithm with Nash bargaining solution that minimizes interference and increases throughput with wireless mesh network, which is deigned for multi-radio multi-cahnnel structure of WAVE. The proposed algorithm is validated against numerical simulation results and results show that our proposed algorithm is improvements on 8 channels with 3 radios compared to Tabu and random channel allocation algorithm.

A Nash Bargaining Solution of Electric Power Transactions Embedding Transmission Pricing in the Competitive Electricity Market

  • Kang, Dong-Joo;Kim, Balho H.;Chung, Koo-Hyung;Moon, Young-Hwan
    • KIEE International Transactions on Power Engineering
    • /
    • v.3A no.1
    • /
    • pp.42-46
    • /
    • 2003
  • The economic operation of a utility in a deregulated environment brings about optimization problems different from those in vertically integrated one[1]. While each utility operates its own generation capacity to maximize profit, the market operator (or system operator) manages and allocates all the system resources and facilities to achieve the maximum social welfare. This paper presents a sequential application of non-cooperative and cooperative game theories in analyzing the entire power transaction process.

Cognitive Radio Anti-Jamming Scheme for Security Provisioning IoT Communications

  • Kim, Sungwook
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.4177-4190
    • /
    • 2015
  • Current research on Internet of Things (IoT) has primarily addressed the means to enhancing smart resource allocation, automatic network operation, and secure service provisioning. In particular, providing satisfactory security service in IoT systems is indispensable to its mission critical applications. However, limited resources prevent full security coverage at all times. Therefore, these limited resources must be deployed intelligently by considering differences in priorities of targets that require security coverage. In this study, we have developed a new application of Cognitive Radio (CR) technology for IoT systems and provide an appropriate security solution that will enable IoT to be more affordable and applicable than it is currently. To resolve the security-related resource allocation problem, game theory is a suitable and effective tool. Based on the Blotto game model, we propose a new strategic power allocation scheme to ensure secure CR communications. A simulation shows that our proposed scheme can effectively respond to current system conditions and perform more effectively than other existing schemes in dynamically changeable IoT environments.

Combinatorial Auction-Based Two-Stage Matching Mechanism for Mobile Data Offloading

  • Wang, Gang;Yang, Zhao;Yuan, Cangzhou;Liu, Peizhen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.6
    • /
    • pp.2811-2830
    • /
    • 2017
  • In this paper, we study the problem of mobile data offloading for a network that contains multiple mobile network operators (MNOs), multiple WiFi or femtocell access points (APs) and multiple mobile users (MUs). MNOs offload their subscribed MUs' data traffic by leasing the unused Internet connection bandwidth of third party APs. We propose a combinatorial auction-based two-stage matching mechanism comprised of MU-AP matching and AP-MNO matching. The MU-AP matching is designed to match the MUs to APs in order to maximize the total offloading data traffic and achieve better MU satisfaction. Conversely, for AP-MNO matching, MNOs compete for APs' service using the Nash bargaining solution (NBS) and the Vickrey auction theories and, in turn, APs will receive monetary compensation. We demonstrated that the proposed mechanism converges to a distributed stable matching result. Numerical results demonstrate that the proposed algorithm well capture the tradeoff among the total data traffic, social welfare and the QoS of MUs compared to other schemes. Moreover, the proposed mechanism can considerably offload the total data traffic and improve the network social welfare with less computation complexity and communication overhead.

Optimal Operation for Green Supply Chain with Quality of Recyclable Parts and Contract for Recycling Activity

  • Kusukawa, Etsuko;Alozawa, Sho
    • Industrial Engineering and Management Systems
    • /
    • v.14 no.3
    • /
    • pp.248-274
    • /
    • 2015
  • This study discusses a contract to promote collection and recycling of used products in a green supply chain (GSC). A collection incentive contract is combined with a reward-penalty contract. The collection incentive contract for used products is made between a retailer and a manufacturer. The reward-penalty contract for recycling used products is made between a manufacturer and an external institution. A retailer pays an incentive for collecting used products from customers and delivers them to a manufacturer with a product order quantity under uncertainty in product demand. A manufacturer remanufactures products using recyclable parts with acceptable quality levels and covers a part of the retailer's incentive from the recycled parts by sharing the reward from an external institution. Product demand information is assumed as (i) the distribution is known (ii) mean and variance are known. Besides, the optimal decisions for product quantity, collection incentive of used products and lower limit of quality level for recyclable parts under decentralized integrated GSCs. The analysis numerically investigates how (1) contract for recycling activity, (ii) product demand information and (iii) quality of recyclable parts affect the optimal operation for each GSC. Supply chain coordination to shift IGSC is discussed by adopting Nash Bargaining solution.

Optimal Operation for Green Supply Chain Considering Demand Information, Collection Incentive and Quality of Recycling Parts

  • Watanabe, Takeshi;Kusukawa, Etsuko
    • Industrial Engineering and Management Systems
    • /
    • v.13 no.2
    • /
    • pp.129-147
    • /
    • 2014
  • This study proposes an optimal operational policy for a green supply chain (GSC) where a retailer pays an incentive for collection of used products from customers and determines the optimal order quantity of a single product under uncertainty in product demand. A manufacturer produces the optimal order quantity of product using recyclable parts with acceptable quality levels and covers a part of the retailer's incentive from the recycled parts. Here, two scenarios for the product demand are assumed as: the distribution of product demand is known, and only both mean and variance are known. This paper develops mathematical models to find how order quantity, collection incentive of used products and lower limit of quality level for recycling affect the expected profits of each member and the whole supply chain under both a decentralized GSC (DGSC) and an integrated GSC (IGSC). The analysis numerically compares the results under DGSC with those under IGSC for each scenario of product demand. Also, the effect of the quality of the recyclable parts on the optimal decisions is shown. Moreover, supply chain coordination to shift the optimal decisions of IGSC is discussed based on: I) profit ratio, II) Nash bargaining solution, and III) Combination of (I) and (II).

An Optimized Deployment Mechanism for Virtual Middleboxes in NFV- and SDN-Enabling Network

  • Xiong, Gang;Sun, Penghao;Hu, Yuxiang;Lan, Julong;Li, Kan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.8
    • /
    • pp.3474-3497
    • /
    • 2016
  • Network Function Virtualization (NFV) and Software Defined Networking (SDN) are recently considered as very promising drivers of the evolution of existing middlebox services, which play intrinsic and fundamental roles in today's networks. To address the virtual service deployment issues that caused by introducing NFV or SDN to networks, this paper proposes an optimal solution by combining quantum genetic algorithm with cooperative game theory. Specifically, we first state the concrete content of the service deployment problem and describe the system framework based on the architecture of SDN. Second, for the service location placement sub-problem, an integer linear programming model is built, which aims at minimizing the network transport delay by selecting suitable service locations, and then a heuristic solution is designed based on the improved quantum genetic algorithm. Third, for the service amount placement sub-problem, we apply the rigorous cooperative game-theoretic approach to build the mathematical model, and implement a distributed algorithm corresponding to Nash bargaining solution. Finally, experimental results show that our proposed method can calculate automatically the optimized placement locations, which reduces 30% of the average traffic delay compared to that of the random placement scheme. Meanwhile, the service amount placement approach can achieve the performance that the average metric values of satisfaction degree and fairness index reach above 90%. And evaluation results demonstrate that our proposed mechanism has a comprehensive advantage for network application.

Beamforming Games with Quantized CSI in Two-user MISO ICs (두 유저 MISO 간섭 채널에서 불완전한 채널 정보에 기반한 빔포밍 게임)

  • Lee, Jung Hoon;Lee, Jin;Ryu, Jong Yeol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.7
    • /
    • pp.1299-1305
    • /
    • 2017
  • In this paper, we consider a beamforming game between the transmitters in a two-user multiple-input single-output interference channel using limited feedback and investigate how each transmitter is able to find a modified strategy from the quantized channel state information (CSI). In the beamforming game, each of the transmitters (i.e., a player) tries to maximize the achievable rate (i.e., a payoff function) via a proper beamforming strategy. In our case, each transmitter's beamforming strategy is represented by a linear combining factor between the maximum ratio transmission (MRT) and the zero forcing (ZF) beamforming vectors, which is the Pareto optimal achieving strategy. With the quantized CSI, the transmitters' strategies may not be valid because of the quantization errors. We propose a modified solution, which takes into account the effects of the quantization errors.