The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (2011 vol.10)
pp: 1187-1199
Chuan Han , Virginia Polytechnic Institute and State University, Blacksburg
Yaling Yang , Virginia Polytechnic Institute and State University, Blacksburg
ABSTRACT
Broadcast routing is a critical component in the routing design. While there are plenty of routing metrics and broadcast routing schemes in current literature, it remains an unsolved problem as to which metrics are compatible with a specific broadcast routing scheme. In particular, in the wireless broadcast routing context where transmission has an inherent broadcast property, there is a potential danger of incompatible combination of broadcast routing algorithms and metrics. This paper shows that different broadcast routing algorithms have different requirements on the properties of broadcast routing metrics. The metric properties for broadcast routing algorithms in both undirected network topologies and directed network topologies are developed and proved. They are successfully used to verify the compatibility between broadcast routing metrics and broadcast routing algorithms.
INDEX TERMS
Broadcast routing, routing protocols, routing metric design.
CITATION
Chuan Han, Yaling Yang, "Compatibility between Three Well-Known Broadcast Tree Construction Algorithms and Various Metrics", IEEE Transactions on Mobile Computing, vol.10, no. 8, pp. 1187-1199, August 2011, doi:10.1109/TMC.2010.228
REFERENCES
[1] I. Papadimitriou and L. Georgiadis, "Minimum-Energy Broadcasting in Multi-Hop Wireless Networks Using a Single Broadcast Tree," Mobile Networks and Applications, vol. 11, pp. 361-375, 2006.
[2] D. Yuan, J. Bauer, and D. Haugland, "Minimum-Energy Broadcast and Multicast in Wireless Networks: An Integer Programming Approach and Improved Heuristic Algorithms," Ad Hoc Networks, vol. 6, pp. 696-717, 2008.
[3] A. Navarra, I. Caragiannis, M. Flammini, C. Kaklamanis, and R. Klasing, "Energy Consumption Minimization in Ad Hoc Wireless and Multi-Interface Networks," Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks, pp. 335-355, Springer, 2010.
[4] I. Kang and R. Poovendran, "Maximizing Network Lifetime of Broadcasting over Wireless Stationary Ad Hoc Networks," Mobile Networks and Applications, vol. 10, no. 6, pp. 879-896, 2005.
[5] S. Guo and O.W. Yang, "Energy-Aware Multicasting in Wireless Ad Hoc Networks: A Survey and Discussion," Computer Comm., vol. 30, pp. 2129-2148, 2007.
[6] H. Haanpää, A. Schumacher, and P. Orponen, "Distributed Algorithms for Lifetime Maximization in Sensor Networks via Min-Max Spanning Subgraphs," Wireless Networks, vol. 16, pp. 875-887, 2010.
[7] J. Qadir, C.T. Chou, A. Misra, and J.G. Lim, "Minimum Latency Broadcasting in Multiradio, Multichannel, Multirate Wireless Meshes," IEEE Trans. Mobile Computing, vol. 8, no. 11, pp. 1510-1523, Nov. 2009.
[8] Q. Gu, P. Liu, W.-C. Lee, and C.-H. Chu, "KTR: An Efficient Key Management Scheme for Secure Data Access Control in Wireless Broadcast Services," IEEE Trans. Dependable and Secure Computing, vol. 6, no. 3, pp. 188-201, July-Sept. 2009.
[9] I.F. Akyildiz, X. Wang, and W. Wang, "Wireless Mesh Networks: A Survey," Computer Networks ISDN Systems, vol. 47, no. 4, pp. 445-487, 2005.
[10] R. Baumann, S. Heimlicher, M. Strasser, and A. Weibel, "A Survey on Routing Metrics," Technical Report TIK Report 262, ETH Zürich, 2007.
[11] G. Parissidis, M. Karaliopoulos, R. Baumann, T. Spyropoulos, and B. Plattner, "Routing Metrics for Wireless Mesh Networks," Guide to Wireless Mesh Networks, pp. 199-230, Springer, 2009.
[12] J.E. Wieselthier, G.D. Nguyen, and A. Ephremides, "On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks," Proc. IEEE INFOCOM, 2000.
[13] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms. MIT, 2001.
[14] J.L. Sobrinho, "Algebra and Algorithms for QoS Path Computation and Hop-by-Hop Routing in the Internet," Proc. IEEE INFOCOM, 2001.
[15] J.L. Sobrinho, "Network Routing with Path Vector Protocols: Theory and Applications," Proc. ACM SIGCOMM, 2003.
[16] Y. Yang and J. Wang, "Design Guidelines for Routing Metrics in Multihop Wireless Networks," Proc. IEEE INFOCOM, 2008.
[17] M. Lu and J. Wu, "Opportunistic Routing Algebra and Its Applications," Proc. IEEE INFOCOM, 2009.
[18] D. Jungnickel, Graphs, Networks and Algorithms. Springer, 2008.
[19] A. Gibbons, Algorithmic Graph Theory. Cambridge Univ., 1985.
[20] J. Kleinberg and V. Tardos, Algorithm Design. Addison Wesley, 2005.
[21] R.G. Gallager, P.A. Humblet, and P.M. Spira, "A Distributed Algorithm for Minimum-Weight Spanning Trees," ACM Trans. Programming Languages and Systems, vol. 5, pp. 66-77, 1983.
[22] J. Bondy and U. Murty, Graph Theory. Springer, 2008.
[23] P. Helman, B.M.E. Moret, and H.D. Shapiro, "An Exact Characterization of Greedy Structures," SIAM J. Discrete Math., vol. 6, pp. 274-283, 1993.
[24] C. Han and Y. Yang, "Compatibility Study for Optimal Tree-Based Broadcast Routing," technical report, Virginia Tech, http://www.ece.vt.edu/yyang8papers.html, 2009.
[25] J. Moy, "OSPF Version 2," RFC 2328, Apr. 1998.
34 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool