The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - Aug. (2013 vol.12)
pp: 1613-1624
Fu-Wen Chen , National Tsing Hua University, Hsinchu
Jung-Chun Kao , National Tsing Hua University, Hsinchu
ABSTRACT
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.
INDEX TERMS
Reliability, Ad hoc networks, Broadcasting, Wireless communication, Wireless sensor networks, Mixed integer linear programming, Mobile computing, game theory, Broadcast, wireless ad hoc networks, mixed integer linear programming
CITATION
Fu-Wen Chen, Jung-Chun Kao, "Game-Based Broadcast over Reliable and Unreliable Wireless Links in Wireless Multihop Networks", IEEE Transactions on Mobile Computing, vol.12, no. 8, pp. 1613-1624, Aug. 2013, doi:10.1109/TMC.2012.133
REFERENCES
[1] C.E. Perkins and E.M. Royer, "Ad-Hoc On-Demand Distance Vector Routing," Proc. Second IEEE Workshop Mobile Computing Systems and Applications (WMCSA), pp. 90-100, 1999.
[2] J. Hong, W. Li, S. Lu, J. Cao, and D. Chen, "Sleeping Schedule Aware Minimum Transmission Broadcast in Wireless Ad Hoc Networks," Proc. 14th IEEE Int'l Conf. Parallel and Distributed Systems (ICPADS), pp. 399-406, Dec. 2008.
[3] S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu, "The Broadcast Storm Problem in a Mobile Ad Hoc Network," Proc. ACM MobiCom, pp. 151-162, Aug. 1999.
[4] T. Fujie, "An Exact Algorithm for the Maximum Leaf Spanning Tree Problem," Computers Operations Research, vol. 30, pp. 1931-1944, Nov. 2003.
[5] M.R. Garey and D.S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness. Freeman, 1979.
[6] H.-I. Lu and R. Ravi, "Approximating Maximum Leaf Spanning Trees in almost Linear Time," J. Algorithms, vol. 29, pp. 132-141, Oct. 1998.
[7] P.-J. Wan, K.M. Alzoubi, and O. Frieder, "Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks," Proc. IEEE INFOCOM, pp. 1597-1604, June 2002.
[8] S. Funke, A. Kesselman, U. Meyer, and M. Segal, "A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs," ACM Trans. Sensor Networks, vol. 2, pp. 444-453, Aug. 2006.
[9] J. Wu and H. Li, "On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks," Proc. Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm., pp. 7-14, Aug. 1999.
[10] B. Bako, F. Kargl, E. Schoch, and M. Weber, "Advanced Adaptive Gossiping Using 2-Hop Neighborhood Information," Proc. IEEE Global Comm. Conf. (GlobeCom), pp. 1-6, 2008.
[11] Y. Cai, K.A. Hua, and A. Phillips, "Leveraging 1-Hop Neighborhood Knowledge for Efficient Flooding in Wireless Ad Hoc Networks," Proc. 24th IEEE Int'l Performance, Computing, and Comm. Conf., pp. 347-354, Apr. 2005.
[12] H. Liu, P. Wan, X. Jia, X. Liu, and F. Yao, "Efficient Flooding Scheme Based on 1-Hop Information in Mobile Ad Hoc Networks," Proc. IEEE INFOCOM, pp. 1-12, Apr. 2006.
[13] M. Khabbazian and V.K. Bhargava, "Efficient Broadcasting in Mobile Ad Hoc Networks," IEEE Trans. Mobile Computing, vol. 8, no. 2, pp. 231-245, Feb. 2009.
[14] E. Pagani, "Providing Reliable and Fault Tolerant Broadcast Delivery in Mobile Ad-Hoc Networks," Mobile Networks and Applications, vol. 4, pp. 175-192, Oct. 1999.
[15] M. Impett, M.S. Corson, and V. Park, "A Receiver-Oriented Approach to Reliable Broadcast in Ad Hoc Networks," Proc. IEEE Wireless Comm. Networking Conf., pp. 117-122, Sept. 2000.
[16] S.-T. Sheu, Y. Tsai, and J. Chen, "A Highly Reliable Broadcast Scheme for IEEE 802.11 Multi-Hop Ad Hoc Networks," Proc. IEEE Int'l Conf. Comm., pp. 610-615, Apr. 2002.
[17] S. Banerjee, A. Misra, J. Yeo, and A. Agrawala, "Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication," Proc. IEEE Wireless Comm. and Networking (WCNC), pp. 660-667, Mar. 2003.
[18] W. Lou and J. Wu, "A Reliable Broadcast Algorithm with Selected Acknowledgements in Mobile Ad Hoc Networks," Proc. IEEE Global Comm. Conf. (GlobeCom), pp. 3536-3541, Dec. 2003.
[19] W. Lou and J. Wu, "Toward Broadcast Reliability in Mobile Ad Hoc Networks with Double Coverage," IEEE Trans. Mobile Computing, vol. 6, no. 2, pp. 148-163, Feb. 2007.
[20] F.J. Ros, P.M. Ruiz, and I. Stojmenovic, "Acknowledgment-Based Broadcast Protocol for Reliable and Efficient Data Dissemination in Vehicular Ad Hoc Networks," IEEE Trans. Mobile Computing, vol. 11, no. 1, pp. 33-46, Jan. 2012.
[21] R. Gandhi, A. Mishra, and S. Parthasarathy, "Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks," IEEE/ACM Trans. Networking, vol. 16, no. 4, pp. 840-851, Aug. 2008.
[22] X. Zhang and K.G. Shin, "Chorus: Collision Resolution for Efficient Wireless Broadcast," Proc. IEEE INFOCOM, pp. 1-9, Mar. 2010.
[23] D. Halperin, T. Anderson, and D. Wetherall, "Taking the Sting Out of Carrier Sense: Interference Cancellation for Wireless LANs," Proc. ACM MobiCom, pp. 339-350, Sept. 2008.
[24] I. Stojmenovic, M. Seddigh, and J. Zunic, "Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks," IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 1, pp. 14-25, Jan. 2002.
[25] R. Kannan and S.S. Iyengar, "Game-Theoretic Models for Reliable Path-Length and Energy-Constrained Routing with Data Aggregation in Wireless Sensor Networks," IEEE J. Selected Areas in Comm., vol. 22, no. 6, pp. 1141-1150, Aug. 2004.
[26] X. Zhang and B. Li, "Dice: A Game Theoretic Framework for Wireless Multipath Network Coding," Proc. ACM MobiHoc, pp. 293-302, May 2008.
[27] X. Ai, V. Srinivasan, and C.-K. Tham, "Optimality and Complexity of Pure Nash Equilibria in the Coverage Game," IEEE J. Selected Areas in Comm., vol. 26, no. 7, pp. 1170-1182, Sept. 2008.
[28] Q. Yu, J. Chen, Y. Fan, X. Shen, and Y. Sun, "Multi-Channel Assignment in Wireless Sensor Networks: A Game Theoretic Approach," Proc. IEEE INFOCOM, pp. 1-9, Mar. 2010.
[29] V. Krishnamurthy, M. Maskery, and G. Yin, "Decentralized Adaptive Filtering Algorithms for Sensor Activation in an Unattended Ground Sensor Network," IEEE Trans. Signal Processing, vol. 56, no. 12, pp. 6086-6101, Dec. 2008.
[30] M. Kodialam and T.V. Lakshman, "Detecting Network Intrusions via Sampling: A Game Theoretic Approach," Proc. IEEE INFOCOM, pp. 1880-1889, Mar. 2003.
[31] CPLEX, http:/www.cplex.com, 2013.
[32] GLPK, http://www.gnu.org/softwareglpk, 2013.
[33] G. Song and O.W. Yang, "Minimum-Energy Multicast Routing in Static Wireless Ad Hoc Networks," Proc. IEEE Vehicular Technology Conf., vol. 6, pp. 3989-3993, Sept. 2004.
[34] N. Nisan, T. Roughgarden, E. Tardos, and V.V. Vazirani, Algorithmic Game Theory. Cambridge Univ., pp. 494-502, 2007.
[35] D. Monderer and L. Shapley, "Potential Games," Games and Economic Behavior, vol. 14, pp. 124-143, May 1996.
[36] R.W. Rosenthal, "A Class of Games Possessing Pure-Strategy Nash Equilibria," Int'l J. Game Theory, vol. 2, pp. 65-67, Jan. 1973.
9 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool