Game-Based Broadcast over Reliable and Unreliable Wireless Links in Wireless Multihop Networks

被引:18
作者
Chen, Fu-Wen [1 ]
Kao, Jung-Chun [1 ]
机构
[1] Natl Tsing Hua Univ, Dept Comp Sci, Hsinchu 30043, Taiwan
关键词
Broadcast; wireless ad hoc networks; mixed integer linear programming; game theory; HOC; ALGORITHM; TREES;
D O I
10.1109/TMC.2012.133
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper addresses the minimum transmission broadcast problem in wireless networks and presents efficient solutions, including an optimal broadcast scheme and a distributed game-based algorithm. Distinct from related work in the literature which typically assumes wireless links are reliable, we address the issue of broadcasting over both reliable wireless links and unreliable wireless links. Our main contributions are as follows: We first formulate the minimum transmission broadcast problems over reliable links and over unreliable links as two mixed integer linear programming (MILP) problems, respectively. This way, optimal broadcast schemes can be easily obtained using any existing MILP solver, for small-scale networks. For large-scale networks, we propose a distributed game-based algorithm and prove that the game-based algorithm achieves Nash Equilibrium. Using simulation, we confirm that compared with existing algorithms in the literature and optimal solutions obtained by our MILP techniques, the proposed game-based algorithm performs very well in terms of delivery ratio, the number of transmissions, and convergence speed.
引用
收藏
页码:1613 / 1624
页数:12
相关论文
共 34 条
[1]   Optimality and complexity of pure Nash equilibria in the coverage game [J].
Ai, Xin ;
Srinivasan, Vikram ;
Tham, Chen-Khong .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2008, 26 (07) :1170-1182
[2]  
[Anonymous], 1999, P 3 INT WORKSHOP DIS, DOI DOI 10.1145/313239.33261
[3]  
[Anonymous], IEEE IPCCC
[4]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[5]  
[Anonymous], 1973, International J. of Game Theory, DOI 10.1007/BF01737559
[6]  
Bako B., 2008, Global Telecommunications Conference, P1
[7]  
Banerjee S, 2003, IEEE WCNC, P660
[8]   An exact algorithm for the maximum leaf spanning tree problem [J].
Fujie, T .
COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (13) :1931-1944
[9]   A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs [J].
Funke, Stefan ;
Kesselman, Alexander ;
Meyer, Ulrich ;
Segal, Michael .
ACM TRANSACTIONS ON SENSOR NETWORKS, 2006, 2 (03) :444-453
[10]   Minimizing broadcast latency and redundancy in ad hoc networks [J].
Gandhi, Rajiv ;
Mishra, Arunesh ;
Parthasarathy, Srinivasan .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2008, 16 (04) :840-851