Efficient multi-constrained QoS path selection in wireless multimedia sensor networks

被引:0
|
作者
Liu L. [1 ]
Peng Y. [2 ]
Xu W. [1 ]
Jia H. [1 ]
Wu J. [1 ]
机构
[1] College of Informatics and Electronics, Zhejiang Sci-Tech University
[2] College of Computer and Communications Engineering, Changsha University of Science and Technology
关键词
Enhanced simulated annealing; Multi-constrained QoS path selection; Nondeterministic polynomial time complete problem; Polynomial time algorithm; Random generator;
D O I
10.3969/j.issn.1005-0930.2011.01.018
中图分类号
学科分类号
摘要
Wireless multimedia sensor networks(WMSN) are designed to meet the requirements of sensing surrounding environment with more fine granularity and more accurate information. In order to transmit multi-constrained QoS multimedia flows with large scale data and information, such as image, voice and video etc., multi-constrained QoS path selection is a big challenge and a key problem in WMSN where energy is limited and network topology may change dynamically. It has been proved that such a problem is NP-complete. Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this problem. However, existing solutions, most of which suffered from either excessive computational complexities or low performance and can not guarantee the quality of final configuration, were proposed only for wired networks and cannot be used directly in WMSN. In this paper a novel multi-constrained QoS path selection scheme based on enhanced simulated annealing is proposed and a more refined cooling schedule is constructed while two key factors, attenuation function of control parameter T and termination value of T were concerned. Furthermore, the influence of some classical random generators on the algorithms performance is investigated. Theoretical analysis and experiment results demonstrate that the proposed method, which can greatly enhance the quality of final configuration while not sacrificing the algorithm complexity, is an effective multi-constrained QoS path selection algorithm showing better performance than the other pertinent algorithms.
引用
收藏
页码:153 / 165
页数:12
相关论文
共 20 条
  • [1] Akyildiz I.F., Melodia T., Chowdury K.R., Wireless multimedia sensor networks: A survey, IEEE Wireless Communications, 14, 6, pp. 32-39, (2007)
  • [2] Ma H., Tao D., Multimedia sensor network and its research progresses, Journal of Software, 17, 9, pp. 2013-2028, (2006)
  • [3] Sun Y., Ma H., The QoS guarantee problem for wireless multimedia sensor networks, Acta Electronica Sinica, 36, 7, pp. 1412-1420, (2008)
  • [4] Liu L., Efficient QoS Routing in Wireless Multi-Hop Networks Based on Natural Computation, (2007)
  • [5] Kuipers F., Mieghem P.V., Korkmaz T., Et al., An overview of constraint-based path selection algorithms for QoS routing, IEEE Commmunications Magazine, 40, 12, pp. 50-55, (2002)
  • [6] Xin Y., Heuristic algorithms for multiconstrained quality-of-service routing, IEEE/ACM Transactions on Networking, 10, 2, pp. 244-256, (2002)
  • [7] Chen S., Routing support for providing guaranteed end-to-end quality-of-service, (1999)
  • [8] Korkmaz T., Krunz M., Multi-constrained optimal path selection, Proceedings of INFOCOM 2001, pp. 834-843, (2001)
  • [9] Jaffe J.M., Algorithms for finding paths with multiple constraints, Networks, 14, pp. 95-116, (1984)
  • [10] Chen S., Nahrstedt K., On finding multi-constrained paths, Proceedings of ICC 98, pp. 874-879, (1998)