The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2009 vol.20)
pp: 913-924
Mehmet Baysan , University of Toronto, Toronto
Kamil Sarac , The University of Texas at Dallas, Richardson
Ramaswamy Chandrasekaran , The University of Texas at Dallas, Richardson
Sergey Bereg , The University of Texas at Dallas, Richardson
ABSTRACT
Network-wide broadcast (simply broadcast) is a frequently used operation in wireless ad hoc networks (WANETs). One promising practical approach for energy-efficient broadcast is to use localized algorithms to minimize the number of nodes involved in the propagation of the broadcast messages. In this context, the minimum forwarding set problem (MFSP) (also known as multipoint relay (MPR) problem) has received a considerable attention in the research community. Even though the general form of the problem is shown to be NP-complete, the complexity of the problem has not been known under the practical application context of ad hoc networks. In this paper, we present a polynomial time algorithm to solve the MFSP for wireless network under unit disk coverage model. We prove the existence of some geometrical properties for the problem and then propose a polynomial time algorithm to build an optimal solution based on these properties. To the best of our knowledge, our algorithm is the first polynomial time solution to the MFSP under the unit disk coverage model. We believe that the work presented in this paper will have an impact on the design and development of new algorithms for several wireless network applications including energy-efficient multicast, broadcast, and topology control protocols for WANETs and sensor networks.
INDEX TERMS
Multipoint relays, minimum forwarding set problem, network-wide broadcast, unit disk graphs.
CITATION
Mehmet Baysan, Kamil Sarac, Ramaswamy Chandrasekaran, Sergey Bereg, "A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Networks under Unit Disk Coverage Model", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 7, pp. 913-924, July 2009, doi:10.1109/TPDS.2008.169
REFERENCES
[1] C. Perkins and E. Royer, “Ad Hoc On-Demand Distance Vector Routing,” Proc. Second IEEE Workshop Mobile Computing Systems and Applications (WMCSA '99), Feb. 1999.
[2] D. Johnson, D. Maltz, and J. Broch, Ad Hoc Networking, Chapter 5: DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks, pp. 139-172. Addison-Wesley, 2001.
[3] T. Clausen and P. Jacquet, “Optimized Link State Routing Protocol (OLSR),” Internet Eng. Task Force (IETF)-RFC 3561, July 2003.
[4] M. Thoppian and R. Prakash, “A Distributed Protocol for Dynamic Address Assignment in Mobile Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 5, no. 1, pp. 4-19, Jan. 2006.
[5] 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 '99, Aug. 1999.
[6] F. Ingelrest, D. Simplot-Ryl, and I. Stojmenovic, Resource Management in Wireless Networking. Kluwer Academic, 2004.
[7] A. Qayyum, L. Viennot, and A. Laouiti, “Multipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks,” Proc. 35th Hawaii Int'l Conf. System Sciences (HICSS '02), Jan. 2002.
[8] G. Calinescu, I. Mandoui, P.-J. Wan, and A. Zelikovsky, “Selecting Forwarding Neighbors in Wireless Ad Hoc Networks,” Mobile Networks and Applications, vol. 9, pp. 101-111, 2004.
[9] V. Chvatal, “A Greedy Heuristic for the Set-Covering Problem,” Math. of Operation Research, vol. 4, no. 3, pp. 233-235, 1979.
[10] A. Busson, N. Mitton, and E. Fleury, “An Analysis of the MPR Selection in OLSR and Consequences,” Proc. Mediterranean Ad Hoc Networking Workshop (MedHocNet '05), June 2005.
[11] B. Clark, C. Colbourn, and D. Johnson, “Unit Disk Graphs,” Discrete Math., vol. 86, pp. 165-177, 1990.
[12] J. Wu, W. Lou, and F. Dai, “Extended Multipoint Relays to Determine Connected Dominating Sets in MANETs,” IEEE Trans. Computers, vol. 55, no. 3, pp. 334-347, Mar. 2006.
[13] X.-Y. Li and I. Stojmenovic, Handbook of Algorithms for Mobile and Wireless Networking and Computing. CRC Press, Nov. 2005.
[14] J. Wu and W. Lou, “Forward-Node-Set-Based Broadcast in Clustered Mobile Ad Hoc Networks,” Wireless Comm. and Mobile Computing, vol. 3, no. 2, pp. 155-173, 2003.
[15] B. Williams and T. Camp, “Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks,” Proc. ACM MobiHoc '02, June 2002.
[16] D.S. Johnson, “Approximation Algorithms for Combinatorial Problems,” J. Computer and System Sciences, vol. 9, pp. 256-278, 1974.
[17] L. Lovasz, “On the Ratio of Optimal Integral and Fractional Covers,” Discrete Math., vol. 13, no. 4, pp. 383-390, 1975.
[18] D. Hochbaum, “Approximation Algorithms for the Set Covering and Vertex Cover Problems,” SIAM J. Computing, vol. 11, no. 3, pp.555-556, 1982.
[19] R. Bar-Yehuda and S. Even, “A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem,” J. Algorithms, vol. 2, no. 2, pp. 198-203, 1981.
[20] V. Paschos, “A Survey of Approximately Optimal Solutions to some Covering and Packing Problems,” ACM Computing Surveys (CSUR), vol. 29, no. 2, pp. 171-209, 1997.
[21] M. Marathe, H. Breu, H. Hunt, S. Ravi, and D. Rosenkrantz, “Simple Heuristics for Unit Disk Graphs,” Networks, vol. 25, pp.59-68, 1995.
[22] H. Hunt, M. Marathe, V. Radhakrishnan, S. Ravi, D. Rosenkrantz, and R. Stearns, “Nc-Approximation Schemes for NP-and PSPACE-Hard Problems for Geometric Graphs,” J. Algorithms, vol. 26, no. 2, pp. 238-274, 1998.
[23] X. Cheng, X. Huang, D. Li, W. Wu, and D. Du, “A Polynomial-Time Approximation Scheme for the Minimum-Connected Dominating Set in Ad Hoc Wireless Networks,” Networks, vol. 42, no. 4, pp. 202-208, 2003.
[24] C. Ambuhl, T. Erlebach, M. Mihalak, and M. Nunkesser, “Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs,” Proc. Ninth Int'l Workshop Approximation Algorithms for Combinatorial Optimization Problems (APPROX '06), Aug. 2006.
[25] D. Hochbaum and W. Maass, “Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI,” J. ACM, no. 1, pp. 130-136, 1985.
[26] H. Brönnimann and M.T. Goodrich, “Almost Optimal Set Covers in Finite vc-Dimension,” Discrete and Computational Geometry, vol. 14, no. 4, pp. 463-479, 1995.
[27] F. Ingelrest and D. Simplot-Ryl, “Localized Broadcast Incremental Power Protocol for Wireless Ad Hoc Networks,” Proc. 10th IEEE Symp. Computers and Comm. (ISCC '05), June 2005.
[28] X.-Y. Li, “Algorithmic, Geometric and Graphs Issues in Wireless Networks,” Wireless Comm. and Mobile Computing, vol. 3, pp. 119-140, Mar. 2003.
[29] L. Feeney, “An Energy-Consumption Model for Performance Analysis of Routing Protocols for Mobile Ad Hoc Networks,” ACM J. Mobile Networks and Applications, vol. 3, no. 6, pp. 239-249, 2001.
[30] G. Calinescu, “Computing 2-Hop Neighborhoods in Ad Hoc Wireless Networks,” Proc. Second Int'l Conf. Ad-Hoc, Mobile, and Wireless Networks (MASS '03), Oct. 2003.
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool