• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Chen Liangyin, Li Zhanghua, Wang Chaolong, Zhang Jingyu, Yan Bingshu, Liu Yan, Yin Feng, Chen Pengpeng. RBSA: Repeatedly-Woken Based Scanning Algorithm for Road Network Surveillance[J]. Journal of Computer Research and Development, 2014, 51(5): 974-983.
Citation: Chen Liangyin, Li Zhanghua, Wang Chaolong, Zhang Jingyu, Yan Bingshu, Liu Yan, Yin Feng, Chen Pengpeng. RBSA: Repeatedly-Woken Based Scanning Algorithm for Road Network Surveillance[J]. Journal of Computer Research and Development, 2014, 51(5): 974-983.

RBSA: Repeatedly-Woken Based Scanning Algorithm for Road Network Surveillance

More Information
  • Published Date: May 14, 2014
  • This paper proposes a repeatedly-woken based scanning algorithm (RBSA), which is tailored and optimized for the road network surveillance within low duty-cycle WSNs. Our design is mainly based on the facts that the movement of targets (e.g., vehicles) is always confined in roadways with limited speed and the road network maps are normally easy to obtain from the map services provider or from the Internet. The main idea is that each sensor node along the roadway successively wakes up and sleeps for k times in one round or sleeps with sufficient use of the overlapped sense area between two adjacent nodes, while the detection of moving targets is guaranteed before they reach specific protection points such as temporary base camps. The duty cycle of each node is consequently minimized, resulting in obvious extension of the network lifetime. We provide complete theoretical analysis on the performance of RBSA in terms of network lifetime and average detection delay. Extensive simulation shows that RBSA extends network lifetime by 80% in typical configuration parameters compared with the original classic scanning algorithm, while only small average detection delay is extended.
  • Related Articles

    [1]Shen Guohua, Zhang Wei, Huang Zhiqiu, Zhang Yulong, Jin Lantao, He Wenmin, Jia Zhe, Zhao Ziyue. Description-Logic-Based Feature Modeling and Verification[J]. Journal of Computer Research and Development, 2013, 50(7): 1501-1512.
    [2]Jia Cunxin, Hu Wei, Bai Wenyang, and Qu Yuzhong. SMap: Semantically Mapping Relational Database Schemas to OWL Ontologies[J]. Journal of Computer Research and Development, 2012, 49(10): 2241-2250.
    [3]Zhou Liping, Huang Houkuan, Qi Guilin, Qu Youli, Ji Qiu. An Algorithm for Calculating Minimal Unsatisfiability-Preserving Subsets of Ontology in DL-Lite[J]. Journal of Computer Research and Development, 2011, 48(12): 2334-2342.
    [4]Wang Zhuxiao, Hu Hong, Chen Limin, Shi Zhongzhi. Parallel Computation Techniques for Dynamic Description Logics Reasoning[J]. Journal of Computer Research and Development, 2011, 48(12): 2317-2325.
    [5]Wan Changlin, Shi Zhongzhi, Hu Hong, Zhang Dapeng. QoS-Aware Semantic Web Service Modeling and Discovery[J]. Journal of Computer Research and Development, 2011, 48(6): 1059-1066.
    [6]Liu Sipei, Liu Dayou, Qi Hong, and Guan Jinghua. Composing Semantic Web Service with Description Logic Rules[J]. Journal of Computer Research and Development, 2011, 48(5): 831-840.
    [7]Jiang Yuncheng, Tang Suqin, Wang Ju, Zhou Shengming. Computing Most Specific Concept in Description Logic with Transitive Roles and Existential Restrictions[J]. Journal of Computer Research and Development, 2009, 46(6): 979-987.
    [8]Jiang Yuncheng, Wang Ju, Zhou Shengming, Tang Yong. Hybrid Reasoning of Terminological Cycles in Description Logic εL[J]. Journal of Computer Research and Development, 2009, 46(1): 15-22.
    [9]Jiang Yuncheng, Tang Yong, Wang Ju, Shen Yuming. A Tableaux Decision Procedure for Fuzzy Description Logic FALNUI[J]. Journal of Computer Research and Development, 2007, 44(8): 1309-1316.
    [10]Jiang Yuncheng, Shi Zhongzhi, Tang Yong, Wang Ju. A Distributed Dynamic Description Logic[J]. Journal of Computer Research and Development, 2006, 43(9): 1603-1608.

Catalog

    Article views (934) PDF downloads (542) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return