• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Luo Qing, Lin Yaping. Heuristic Traversal Path Algorithm Based on Linear Aggregation in Wireless Sensor Networks[J]. Journal of Computer Research and Development, 2010, 47(11): 1919-1927.
Citation: Luo Qing, Lin Yaping. Heuristic Traversal Path Algorithm Based on Linear Aggregation in Wireless Sensor Networks[J]. Journal of Computer Research and Development, 2010, 47(11): 1919-1927.

Heuristic Traversal Path Algorithm Based on Linear Aggregation in Wireless Sensor Networks

More Information
  • Published Date: November 14, 2010
  • Most wireless sensor networks (WSN) are deployed to monitor a region of interest for any intruding target. On the contrary, the intelligent target looks for the optimal path to traverse the enemy sensor networks for avoiding being detected. However, the target may be subject to traversal time constraint. It is difficult for most existing traversal algorithms based on breadth-first-search to satisfy a pre-determined time constraint value. Motivated by this reason, a traversal model is constructed and an approximately optimization algorithm is proposed in this paper. The algorithm makes the continuous path problem domain a discrete one by Voronoi diagram. Using exposure and traversal time as the path performance metric, the algorithm combines the linear aggregated routing mechanism to find the optimal path. It enables the intelligent target to traverse the enemy sensor networks field. And the traversal time from the source to the destination is less than a given threshold. Theoretically and experimentally, it is concluded that the proposed algorithm is able to solve the traversal path problem with time constraint. The k shortest path heuristic traversal path algorithm based on linear aggregation (kSP-LAHTP) is able to find a traversal path closer to the optimum with parameter k increasing.
  • Related Articles

    [1]Tang Kezong, Liu Bingxiang, Yang Jingyu, Sun Tingkai. Double Center Particle Swarm Optimization Algorithm[J]. Journal of Computer Research and Development, 2012, 49(5): 1086-1094.
    [2]Fan Xiaoqin, Jiang Changjun, Fang Xianwen, Ding Zhijun. Dynamic Web Service Selection Based on Discrete Particle Swarm Optimization[J]. Journal of Computer Research and Development, 2010, 47(1): 147-156.
    [3]Jie Jing, Zeng Jianchao, Han Chongzhao. Self-Organized Particle Swarm Optimization Based on Feedback Control of Diversity[J]. Journal of Computer Research and Development, 2008, 45(3): 464-471.
    [4]Ma Ming, Zhou Chunguang, Zhang Libiao, Ma Jie. Fuzzy Neural Network Optimization by a Multi-Objective Particle Swarm Optimization Algorithm[J]. Journal of Computer Research and Development, 2006, 43(12): 2104-2109.
    [5]Lei Kaiyou and Qiu Yuhui. A Study of Constrained Layout Optimization Using Adaptive Particle Swarm Optimizer[J]. Journal of Computer Research and Development, 2006, 43(10): 1724-1731.
    [6]Cui Zhihua and Zeng Jianchao. Modified Particle Swarm Optimization Based on Differential Model[J]. Journal of Computer Research and Development, 2006, 43(4): 646-653.
    [7]Dou Quansheng, Zhou Chunguang, Xu Zhongyu, Pan Guanyu. Swarm-Core Evolutionary Particle Swarm Optimization in Dynamic Optimization Environments[J]. Journal of Computer Research and Development, 2006, 43(1): 89-95.
    [8]Liu Yu, Qin Zheng, Lu Jiang, Shi Zhewen. Multimodal Particle Swarm Optimization for Neural Network Ensemble[J]. Journal of Computer Research and Development, 2005, 42(9): 1519-1526.
    [9]Chen Hongzhou, Gu Guochang, and Kang Wangxing. A Sentient Particle Swarm Optimization[J]. Journal of Computer Research and Development, 2005, 42(8): 1299-1305.
    [10]Dou Quansheng, Zhou Chunguang, and Ma Ming. Two Improvement Strategies for Particle Swarm Optimization[J]. Journal of Computer Research and Development, 2005, 42(5): 897-904.

Catalog

    Article views (564) PDF downloads (482) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return