基于隐藏问题的汇聚节点移动策略  

Moving strategy of mobile sink based on hiding problem

作　　者：沙舟[1] 陆佳亮[1] 伍民友[1] 

机构地区：[1]上海交通大学计算机科学与工程系,上海200240

出　　处：《计算机工程与设计》2010年第18期3943-3945,3949,共4页Computer Engineering and Design

基　　金：国家自然科学基金项目(60773091);国家973重点基础研究发展计划基金项目(2006CB303000)

摘　　要：为研究传感器网络在敌对环境中的隐藏问题,防止恶意节点的跟踪和破坏,提出了一个移动汇聚节点的移动策略。对隐藏问题进行分析和建模,并对穿越行为进行定义。在此基础上,提出了一种基于局部贪婪算法的移动策略,使得汇聚节点通过这个策略收集数据时,区域中的静止节点发送消息的次数最少(包括中转的次数),以此来减少整个网络被发现的可能性。通过3种比较算法的仿真,表明了该移动策略的准确性和有效性。To solve the hiding problem of wireless sensor networks in hostile environment and prevent the tracking and destroy of malicious nodes, a moving strategy for mobile sink is presented. Firstly, the hiding problem is analyzed and modeled and the traverse behavior of mobile sink is also defined. Based on these assumptions and definitions, a moving strategy is proposed. Using this moving strategy, the number of the transmission happened in the field and the probability of being detected will be reduced while the mobile sink traverses through the field and collects data. Finally, a simulation composed of three comparative algorithms is presented to verify the feasibility of the moving strategy.

关 键 词：无线传感器网络 移动汇聚节点 移动策略 隐藏问题 反侦测 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]