论文标题:传感器网络中基于位置信息的路由算法研究
The Research on Routing Algorithms Based on Position Information in Sensor Networks
论文作者 张锦
论文导师 林亚平,论文学位 硕士,论文专业 计算机应用技术
论文单位 湖南大学,点击次数 89,论文页数 77页File Size3216k
2004-10-01论文网 http://www.lw23.com/lunwen_813690327/ 传感器网络;路由;受限洪泛;曲线路由;密度控制;安全;多路径
Sensor Networks; Routing; Limited Flooding; Curve-Based routing;Density Control; Security; Multipath
集数据采集、处理及通信于一体的无线集成传感器网络以其低廉的价格、便利的展开方式正得到越来越广泛的使用，对传感器网络各个方面的研究也成为目前学术界非常活跃的课题。而路由算法问题是传感器网络的关键问题之一，本文着重研究传感器网络中基于位置信息的路由算法。 本文提出了“关键点”的概念，在此基础上，将路由算法分为两类(基于主动式选取的和基于被动式选取的路由算法)，通过定义合适的衡量尺度，分析比较了这些路由算法所具有的特点。洪泛算法的复杂度很低，但缺点是能耗过大，针对这个问题，本文提出了基于受限洪泛的路由算法，算法根据源节点和目的节点的位置信息构造一个有限的区域，限制洪泛只能在受限域内进行，从而降低算法的能耗，实验结果表明，新算法能够较好地平衡算法复杂度和能耗。本文提出了一种基于曲线的路由算法，算法结合源路由思想和贪婪选取策略实现报文转发，并利用改进B样条曲线实现节点能耗平衡，理论分析表明算法具有分布式的特点，有较低的复杂度。模拟实验也验证了算法所给出的贪婪策略的有效性。针对传感器网络节点分布稠密，容易造成数据冗余和能量浪费的问题，本文提出了一种结合密度控制和网格结构的节能路由算法，算法选择一部分节点使其工作而其他节点休眠，并在合适的时刻唤醒其代替能量耗尽的节点，模拟实验结果表明，算法提出的节点选取方法是有效的，并能够有效减少工作节点的数目。此外，针对特定传感器网络在安全方面的要求，本文研究了传感器网络所面临的安全威胁和可以采取的防御措施，在此基础上，提出了一种基于多路径的安全路由算法，算法综合已有的安全机制实现数据的加密、认证和完整性验证，并利用多路径的方式提供进一步的安全性，理论分析表明，算法能够防御一定的安全攻击，模拟结果也表明多路径的构造可以保证即便有部分节点被攻破的情况下，仍然可以有较高的概率保证至少有一份数据可以安全到达目的节点。
Wireless integrated sensor networks, which include collecting, managing data and communication, are used more and more widely for its low cost and convenient deployment. Nowadays the research concenrning each aspect of sensor networks is fairly active. Routing algorithm is one of key problems in sensor networks and this thesis have researched routing algorithm emphatically based on position.This thesis puts forward the concept of key nodes and divides different routing algorithms into two kinds, active and passive selection. Through suitable measures, we compare and analyze those characters. Flooding has low complexity, but its energy expenditure is too high. In order to resolve this problem, this thesis proposes a new algorithm based on limited flooding. Theoretic analysis and simulation results show that new algorithm can balance the complexity and energy expenditure effectively. Since the aim of forwarding the packets isn"t too clear in the above algorithms, this thesis proposes another algorithm, curve-based routing algorithm (CBR), combining source-based routing and greedy forwarding strategy. Theoretic analysis indecates CBR is distributed and has low complexity. Furthmore, simulation results prove the validity of greedy forwarding strategy and the character of balancing energy expenditure of nodes. In order to resolve the problem of data redundancy and energy waste when all nodes, whose density is too large, work together, this thesis proposes an energy-saved algorithm which combines density control and the structure of grid. The new algorithm only selects some nodes to work and others to sleep which will be wakened to replace dead nodes at approprate time. Simulation results show the method of selecting working nodes is effective and can reduce the number of working nodes. Aiming at the requirement of security, this thesis researches the attack to sensor networks and protecting measures and then proposes a secure routing algorithm based on multipath. The new algorithm synthesizes those proposed method of encryption, authentication and integrality-validation and provides additional security using multipah. Theoretic analysis and simulation results show that new algorithm can provide security to some degree and high probability to ensure at least a correct copy to the destination when part of nodes have been attacked and invalidated.
|
