| 题名 | 面向大规模无线传感器网络的节能可靠分簇路由算法研究 |
| 作者 | 梁英 |
| 学位类别 | 博士 |
| 答辩日期 | 2007-02-09 |
| 授予单位 | 中国科学院沈阳自动化研究所 |
| 授予地点 | 沈阳自动化研究所 |
| 导师 | 于海斌 |
| 关键词 | 无线传感器网络 路由协议 分簇 节能性 可靠性 |
| 其他题名 | Cluster-based Routing Algorithms for Energy Efficiency and Transfer Reliability in Wireless Sensor Network |
| 学位专业 | 机械电子工程 |
| 中文摘要 | MEMS、无线通信、自动控制和人工智能等领域技术的发展，使得构造能够自主完成特定任务的大规模无线传感器网络成为可能。无线传感器网络的出现改变了人与自然的交互方式，是二十一世纪最具影响的IT技术之一，在军事、环境、医疗、家庭和其它的商用领域有很高的应用价值和广阔的应用前景。 在无线传感器网络中，路由协议作为通信的基础成为学术界研究的重要内容。无线传感器网络的路由协议设计与传统网络有很多不同，无线传感器网络路由协议设计的重要目标是降低节点能量损耗，提高网络生存时间；而传统网络路由协议设计的首要任务是避免网络拥塞、保持网络连通性和提供高质量服务。这些不同导致传统网络的路由协议不能直接用于无线传感器网络，需要对其进行改进以适合无线传感器网络。论文针对基于大规模无线传感器网络的路由特点和挑战展开研究工作，主要研究内容与成果包括以下几个方面。 论述无线传感器网络路由协议设计所面临的挑战性问题，系统地总结了前人的研究成果与不足。 分析了传感器网络系统在工作过程中的能量消耗和节能问题，论述了在大规模无线传感器网络中，分簇路由策略相对平面路由策略的节能优势，并指出现有分簇路由算法在实际应用中存在的缺陷和需要进一步解决的问题。 针对节点间能量差异显著的网络，提出了最大网络生存时间的分簇机制。通过构造基于节点剩余能量的簇首选择机制和基于综合代价函数的簇域划分机制，在有效保证节点能量损耗公平性的同时逐渐降低网络的能量差异，最大限度地延长了网络生存时间。 针对监控目标具有区域性变化的应用，提出了一种基于节点信息相似度的分簇机制。采用遗传算法将可能出现相似信息的节点区域尽量规划到相同的簇域内，通过簇首对簇内相似信息的融合，最大限度地降低网络冗余数据的传输。 针对节点随机部署的网络环境，提出了一种基于PSO的簇首优化策略。该方法利用PSO算法进一步优化簇首的选择，优化后的簇首能够降低簇内低能量节点的通信距离和能量开销，较好地解决了簇内节点间通信的不公平性问题。 提出了一种最小能量代价的节能路由策略。该方法采用中心式控制方式，由基站获取网络内所有簇首的拓扑信息，计算并形成簇首间具有方向权值的路由图，并发布到整个网络。该策略可以为多个移动或静止的基站服务，并实现全局优化的目标。 构建了一种基于虚拟簇首的可靠路由策略。该策略利用冗余的簇首集为网络节点提供多条备用的通信路径，并将整个簇首集用唯一的虚拟簇首标识。当活动簇首发生失效时，该策略能够在不影响分簇算法性能的同时保证簇间通信的可靠性。 |
| 索取号 | TP212/L49/2007 |
| 英文摘要 | Recent technological advances in MEMS, wireless communication, automatic control and artificial intelligence have enabled the realization of large-scale wireless sensor networks (WSN). The emergence of WSN is changing the way people interact with the physical environment and is considered to be one of the most important information technologies in the 21st century. As a novel mode of computing, WSN carries an enormous potential for a wide range of uses from military surveillance, environment monitoring, healthy caring, smart space and other commercial applications. Routing is vital and also fundamental in WSN’s research. It is very challenging due to the inherent characteristics of WSN that distinguish itself from the traditional networks. The main design goal of routing in WSN is to carry out data communication while trying to reduce the energy consumption of nodes and prolong the network lifetime. The primary task of routing in traditional networks, however, is to provide high quality-of-service while trying to prevent network congestion and connectivity degradation. Due to these differences, routing protocols which have been proposed for traditional networks do not fit WSNs well and new energy-efficient routing protocols should be proposed. According to the characteristics and challenges of routing in large WSN, the dissertation studies the design of cluster-based routing algorithms. The main contributions are summarized as follows. The research on WSN routing is surveyed, while the challenges and design issues that affect routing process in WSN are discussed. The power consumption and energy conservation of the whole network in the process of information gathering is analyzed. The superiority of cluster-based routing in energy conservation over the flat-based routing is discussed and the deficiencies of recent cluster-based routing methods are addressed when they are used in the actual application environments. Focusing on the network in which the nodes have different amount of energy, a clustering mechanism which maximizes the network lifetime is proposed. With the selection of cluster-heads based on the residual energy and cluster-members based on the synthetic cost function, the energy is consumed fairly and the energy difference among the nodes is reduced, and thus the network lifetime is prolonged. Focusing on the WSN in which the emergence of the monitored objects present regional characteristic, a clustering mechanism based on information similarity is proposed. It use genetic algorithm to partition the adjacent nodes which will sense similar data into one cluster. With similar data aggregation in the clusters, the amount of the data transmission in the network can be effectively reduced. Focusing on the WSN in which the nodes are deployed randomly, an optimal cluster-head selection mechanism is proposed. By using the PSO algorithm, clustering process is further optimized. Since the optimal cluster-heads can reduce energy consumption and communication distance of the cluster-members with lower energy level, the unfair communication cost in clusters is well solved. In order to reduce the energy expenditure of data transition from the cluster-heads to the base station, an energy-efficient routing strategy based on the minimum energy cost is proposed. It uses the centralized control mode and lets the base station calculate the minimum cost routing graph of cluster-heads. The strategy may serve for several mobile or fixed base stations and achieve the global optimization goal. In order to satisfy the reliability requirement in harsh environmental applications, a reliable routing strategy based on virtual cluster-heads is proposed. It provides multipaths for nodes in the network by using a redundancy set of cluster-heads which are marked with a unique virtual identification and it ensures the communication reliability between the cluster heads without decreasing the performance of the clustering algorithm. |
| 语种 | 中文 |
| 产权排序 | 1 |
| 公开日期 | 2010-11-29 |
| 页码 | 123 |
| 分类号 | TP212 |
| 内容类型 | 学位论文 |
| 源URL | [http://ir.sia.ac.cn//handle/173321/75]  |
| 专题 | 沈阳自动化研究所_工业信息学研究室_工业控制系统研究室 |
| 推荐引用方式 GB/T 7714 | 梁英. 面向大规模无线传感器网络的节能可靠分簇路由算法研究[D]. 沈阳自动化研究所. 中国科学院沈阳自动化研究所. 2007. |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论