The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2012 vol.11)
pp: 1102-1112
Ling Ding , The University of Texas at Dallas, Richardson
Weili Wu , The University of Texas at Dallas, Richardson
James Willson , The University of Texas at Dallas, Richardson
Hongjie Du , The University of Texas at Dallas, Richardson
Wonjun Lee , Korea University, Seoul
ABSTRACT
Directional antennas can divide the transmission range into several sectors. Thus, through switching off sectors in unnecessary directions in wireless networks, we can save bandwidth and energy consumption. In this paper, we will study a directional virtual backbone (VB) in the network where directional antennas are used. When constructing a VB, we will take routing and broadcasting into account since they are two common operations in wireless networks. Hence, we will study a VB with guaranteed routing costs, named \alpha Minimum rOuting Cost Directional VB (\alpha-MOC-DVB). Besides the properties of regular VBs, \alpha-MOC-DVB also has a special constraint—for any pair of nodes, there exists at least one path all intermediate directions on which must belong to \alpha-MOC-DVB and the number of intermediate directions on the path is smaller than \alpha times that on the shortest path. We prove that construction of a minimum \alpha-MOC-DVB is an NP-hard problem in a general directed graph. A heuristic algorithm is proposed and theoretical analysis is also discussed in the paper. Extensive simulations demonstrate that our \alpha-MOC-DVB is much more efficient in the sense of VB size and routing costs compared to other VBs.
INDEX TERMS
Directional antennas, connected dominating set, routing costs, wireless network, obstacle, general graph, NP-hard, virtual backbone.
CITATION
Ling Ding, Weili Wu, James Willson, Hongjie Du, Wonjun Lee, "Efficient Virtual Backbone Construction with Routing Cost Constraint in Wireless Networks Using Directional Antennas", IEEE Transactions on Mobile Computing, vol.11, no. 7, pp. 1102-1112, July 2012, doi:10.1109/TMC.2011.129
REFERENCES
[1] 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, 1999.
[2] F. Wang, M.T. Thai, and D.-Z. Du, "On the Construction of 2-Connected Virtual Backbone in Wireless Networks," IEEE Trans. Wireless Comm., vol. 8, no. 3, pp. 1230-1237, Mar. 2009.
[3] K. Mohammed, L. Gewali, and V. Muthukumar, "Generating Quality Dominating Sets for Sensor Network," Proc. IEEE Sixth Int'l Conf. Computational Intelligence and Multimedia Applications (ICCIMA), 2005.
[4] S. Yang, J. Wu, and F. Dai, "Efficient Backbone Construction Methods in Manets Using Directional Antennas," Proc. 27th Int'l Conf. Distributed Computing Systems (ICDCS), 2007.
[5] D. Kim, Y. Wu, Y. Li, F. Zou, and D.-Z. Du, "Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks," IEEE Trans. Parallel and Distributed Systems, vol. 20, no. 2, pp. 147-157, Feb. 2009.
[6] L. Ding, X. Gao, W. Wu, W. Lee, X. Zhu, and D.-Z. Du, "Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks," Proc. IEEE 30th Int'l Conf. Distributed Computing Systems (ICDCS), 2010.
[7] M.T. Thai, F. Wang, D. Liu, S. Zhu, and D.-Z. Du, "Connected Dominating Sets in Wireless Networks with Different Transmission Ranges," IEEE Trans. Mobile Computing, vol. 6, no. 7, pp. 721-730, July 2007.
[8] L. Barriére, P. Fraigniaud, and L. Narayanan, "Robust Position-Based Routing in Wireless Ad Hoc Networks with Unstable Transmission Ranges," Proc. ACM Fifth Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm., 2001.
[9] F. Kuhn and A. Zollinger, "Ad-Hoc Networks Beyond Unit Disk Graphs," Proc. ACM Joint Workshop Foundations of Mobile Computing (DIALM-POMC), 2003.
[10] F. Reichenbach, R. Salomon, and D. Timmermann, "Distributed Obstacle Localization in Large Wireless Sensor Networks," Proc. ACM Int'l Conf. Wireless Comm. and Mobile Computing, 2006.
[11] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1990.
[12] D. Lichtenstein, "Planar Formulae and Their Uses," SIAM J. Computing, vol. 11, no. 2, pp. 329-343, 1982.
[13] D.-Z. Du, B. Lu, H. Ngo, and P.M. Pardalos, "Steiner Tree Problems," Proc. Encyclopedia of Optimization, 2009.
[14] J. Wu, F. Dai, M. Gao, and I. Stojmenovic, "On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks," IEEE/KICS J. Comm. and Networks, vol. 4, pp. 59-70, 2002.
[15] S. Guha and S. Khuller, "Approximation Algorithms for Connected Dominating Sets," Algorithmica, vol. 20, no. 4, pp. 374-387, 1996.
[16] S. Butenko, X.Z. Cheng, D.-Z. Du, and P.M. Pardalos, "On the Construction of Virtual Backbone for Ad Hoc Wireless Network," Proc. IEEE Cooperative Control and Optimization (CCO), 2001.
[17] W. Wu, H. Du, X. Jia, Y. Li, and S.C.-H. Huang, "Minimum Connected Dominating Sets and Maximal Independent Sets in Unit Disk Graphs," Theoretical Computer Science, vol. 352, no. 1, pp. 1-7, 2006.
[18] D. Chen, D.-Z. Du, X.-D. Hu, G.-H. Lin, L. Wang, and G. Xue, "Approximations for Steiner Trees with Minimum Number of Steiner Points," J. Global Optimization, vol. 18, nos. 1-3, pp. 17-33, 2000.
[19] M. Min, H. Du, X. Jia, C.X. Huang, S.C.-H. Huang, and W. Wu, "Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks," J. Global Optimization, vol. 35, no. 1, pp. 111-119, 2006.
[20] L. Ruan, H. Du, X. Jia, W. Wu, Y. Li, and K.-I. Ko, "A Greedy Approximation for Minimum Connected Dominating Sets," Theoretical Computer Science, vol. 329, nos. 1-3, pp. 325-330, 2004.
[21] L. Ding, W. Wu, J. Willson, H. Du, W. Lee, and D.-Z. Du, "Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks," IEEE Trans. Parallel and Distributed Systems, vol. 22, no. 10, pp. 1601-1609, Oct. 2011.
[22] W. Di, Q. Yan, and T. Ning, "Connected Dominating Set Based Hybrid Routing Algorithm in Ad Hoc Networks with Obstacles," Proc. IEEE Int'l Conf. Comm. (ICC), 2006.
[23] L. Ding, Y. Shao, and M. Li, "On Reducing Broadcast Transmission Cost and Redundancy in Ad Hoc Wireless Networks Using Directional Antennas," Proc. IEEE Wireless Comm. and Networking Conf. (WCNC), 2008.
[24] B. Deb, S. Bhatnagar, and B. Nath, "Multi-Resolution State Retrieval in Sensor Networks," Proc. IEEE Int'l Workshop Sensor Network Protocols and Applications, 2003.
[25] R. Ramanathan, "On the Performance of Ad Hoc Networks with Beamforming Antennas," Proc. ACM MobiHoc, 2001.
[26] U. Feige, "A Threshold of ln n for Approximating Set Cover," J. ACM, vol. 45, no. 4, pp. 634-652, 1998.
[27] 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, no. 3, pp. 444-453, 2006.
[28] Y. Zeng, X. Jia, and Y. He, "Energy Efficient Distributed Connected Dominating Sets Construction in Wireless Sensor Networks," Proc. ACM Int'l Conf. Wireless Comm. and Mobile Computing, 2006.
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool