
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
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 and Distributed Systems, vol. 20, no. 7, pp. 913924, July, 2009.  
BibTex  x  
@article{ 10.1109/TPDS.2008.169, author = {Mehmet Baysan and Kamil Sarac and Ramaswamy Chandrasekaran and Sergey Bereg}, title = {A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Networks under Unit Disk Coverage Model}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {20}, number = {7}, issn = {10459219}, year = {2009}, pages = {913924}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.169}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Networks under Unit Disk Coverage Model IS  7 SN  10459219 SP913 EP924 EPD  913924 A1  Mehmet Baysan, A1  Kamil Sarac, A1  Ramaswamy Chandrasekaran, A1  Sergey Bereg, PY  2009 KW  Multipoint relays KW  minimum forwarding set problem KW  networkwide broadcast KW  unit disk graphs. VL  20 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] C. Perkins and E. Royer, “Ad Hoc OnDemand 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 MultiHop Wireless Ad Hoc Networks, pp. 139172. AddisonWesley, 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. 419, 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. SimplotRyl, 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. 101111, 2004.
[9] V. Chvatal, “A Greedy Heuristic for the SetCovering Problem,” Math. of Operation Research, vol. 4, no. 3, pp. 233235, 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. 165177, 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. 334347, 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, “ForwardNodeSetBased Broadcast in Clustered Mobile Ad Hoc Networks,” Wireless Comm. and Mobile Computing, vol. 3, no. 2, pp. 155173, 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. 256278, 1974.
[17] L. Lovasz, “On the Ratio of Optimal Integral and Fractional Covers,” Discrete Math., vol. 13, no. 4, pp. 383390, 1975.
[18] D. Hochbaum, “Approximation Algorithms for the Set Covering and Vertex Cover Problems,” SIAM J. Computing, vol. 11, no. 3, pp.555556, 1982.
[19] R. BarYehuda and S. Even, “A LinearTime Approximation Algorithm for the Weighted Vertex Cover Problem,” J. Algorithms, vol. 2, no. 2, pp. 198203, 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. 171209, 1997.
[21] M. Marathe, H. Breu, H. Hunt, S. Ravi, and D. Rosenkrantz, “Simple Heuristics for Unit Disk Graphs,” Networks, vol. 25, pp.5968, 1995.
[22] H. Hunt, M. Marathe, V. Radhakrishnan, S. Ravi, D. Rosenkrantz, and R. Stearns, “NcApproximation Schemes for NPand PSPACEHard Problems for Geometric Graphs,” J. Algorithms, vol. 26, no. 2, pp. 238274, 1998.
[23] X. Cheng, X. Huang, D. Li, W. Wu, and D. Du, “A PolynomialTime Approximation Scheme for the MinimumConnected Dominating Set in Ad Hoc Wireless Networks,” Networks, vol. 42, no. 4, pp. 202208, 2003.
[24] C. Ambuhl, T. Erlebach, M. Mihalak, and M. Nunkesser, “ConstantFactor Approximation for MinimumWeight (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. 130136, 1985.
[26] H. Brönnimann and M.T. Goodrich, “Almost Optimal Set Covers in Finite vcDimension,” Discrete and Computational Geometry, vol. 14, no. 4, pp. 463479, 1995.
[27] F. Ingelrest and D. SimplotRyl, “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. 119140, Mar. 2003.
[29] L. Feeney, “An EnergyConsumption Model for Performance Analysis of Routing Protocols for Mobile Ad Hoc Networks,” ACM J. Mobile Networks and Applications, vol. 3, no. 6, pp. 239249, 2001.
[30] G. Calinescu, “Computing 2Hop Neighborhoods in Ad Hoc Wireless Networks,” Proc. Second Int'l Conf. AdHoc, Mobile, and Wireless Networks (MASS '03), Oct. 2003.