共查询到20条相似文献,搜索用时 375 毫秒
1.
2.
针对水声传感器网络高能耗的特点,该文提出了基于空间唤醒的节能路由协议ERBSW (Energy-efficient Routing protocol Based on Spatial Wakeup),该协议将3维网络空间划分为唤醒层和睡眠层,每个节点根据当前的深度信息,动态地决定其处于唤醒或睡眠状态。另外,ERBSW通过定期地广播Hello包来建立唤醒邻节点集合,使得数据包由较高的唤醒层节点向较低的唤醒层节点传递,从而避免了冗余节点因空闲侦听以及不必要的数据接收所产生的能量浪费。仿真结果表明,在不同网络密度条件下,该协议相比VBF(Vector-Based Forwarding)能耗节省了约16%~48%。 相似文献
3.
4.
5.
6.
7.
8.
移动Ad hoc网络(MANET)是一种由无线移动主机/节点组成的动态自治网络.在MANET中进行有带宽保证的按需路由选择具有重要意义.本文提出一种新的按需路由算法LABGR(Location Aided Bandwidth Guaranteed Routing).LABGR以节点当前位置信息为基础,在路由选择过程中把路径稳定性和节点能量受限问题结合起来,采用受限扩散路由方法,利用多种机制避免在全网中进行扩散,限制路由请求过程中被影响的节点数目,有效提高了路由请求效率并且保证了链路带宽.本文还对LABGR算法特性进行了深入分析. 相似文献
9.
10.
ZigBee无线传感网络在家居、工业、医疗等领域应用的发展暗示着它已经成为一种新的技术趋势。本文提出一种基于ZigBee技术的无线传感器网络:为了快速构建自己的无线通信网络,以CC2530芯片为核心构建了一个无线传感网络;为了降低每个传感器节点的功耗,同时延长传感器节点的寿命,提出传感器节点在低功率监测信道和定时周期性唤醒机制下工作,在满足网络应用的前提下尽可能地延长网络寿命,实现能源的智能供给的理念。该理念将各种节能技术在服务的层面上综合考虑,贯穿于应用解决方案的各个环节,为传感器网络节能需求发展和应用解决方案提供理论上的支持。 相似文献
11.
Topology control is one of the important techniques in wireless multi-hop networks to preserve connectivity and extend the network lifetime. This is more significant in ZigBee, since the address assignment scheme is tightly coupled with topology construction. For example, there can be orphan nodes that cannot receive the network address and isolated from the network due to predefined network configurations. In this paper, we propose a distributed topology construction algorithm that controls the association time of each node in order to solve the orphan node problem in ZigBee as well as construct an efficient routing tree topology. The main idea of the distributed topology construction algorithm is to construct primary backbone nodes by propagating the invitation packets and controlling the association time based on the link quality. Since the dynamically selected primary nodes are spread throughout the network, they can provide backbone to accept the association requests from the remaining secondary nodes which are majority in a network. In the performance evaluation, we show that the proposed topology construction algorithm effectively solves the orphan node problem regardless of network density as well as provides efficient tree routing cost comparable to the approximation algorithm for degree constrained minimum routing cost tree (DC-MRCT) problem. 相似文献
12.
13.
Sandeep Kumar Binod Kumar Kanaujia Santanu Dwari Ganga Prasad Pandey Dinesh Kumar Singh Anil Kumar Gautam 《Wireless Personal Communications》2017,96(4):5185-5201
Now a days, the communication between different nodes in a Mobile Ad hoc Network (MANET) is not guarded. Various encryption mechanisms are used to protect the communication between nodes. Link failures and packet dropping due to unfaithful nodes are becoming one of the main opposition for the trusted detection of malicious nodes. A failure can occur either due to channel errors or harmful nodes in network. These attacks may have the intention of modifying the routing protocol so that the data transmission through a specific node controlled by the attacker disturbs the network topology. Thus it deteriorates the performance of network. Mutual association of dropped packets is capitalized for synthesizing the suspicious nodes in MANET. The algorithm proposed is using an efficient cryptosystem with cipher text list validator scheme and a communal auditing scheme for the validation of certificate received from individual nodes. For constructing the framework, the proposed algorithm with five phases has a network setup phase, data routing phase, communal auditing phase, error node detection phase and a data receiver phase. This framework makes the MANET node build a safe routing topology by effectively judging the harmful nodes as well as the unfaithful information accepted from supplementary nodes. 相似文献
14.
片上网络节点编码的设计和在路由方面的应用 总被引:2,自引:2,他引:0
网络拓扑选择和路由算法设计是片上网络设计的关键问题.在比较现有的三种网络拓扑结构的基础上,提出了一种隐含着相邻节点以及节点之间链路关系并适合二维Torus拓扑结构的节点编码方法.该编码和Torus结构的结合能拓扑结果够简化路由算法的设计和实现,改善了网络路由性能.实验结果表明,提出的编码方法与二维Torus拓扑结构的结合有效地提高了片上网络通信性能. 相似文献
15.
A distributed routing algorithm for multihop packet radio networkswith uni- and bi-directional links
Multihop packet radio networks require routing algorithms which are distributed in nature and which have the ability to timely detect changes in the network topology. These changes are mostly changes in connectivity caused by link or node failures and by the relative motion of the nodes. This paper describes and analyzes an adaptive decentralized routing algorithm for packet radio networks. The network connectivity, as perceived by each node, is translated into a graph representation of the network. The proposed routing mechanism then uses a breadth-first search algorithm along the inbound links of such a graph. Unlike most of the algorithms found in the open literature the one proposed here can be used in networks having both uni- and bi-directional radio links. Examples are shown to illustrate the methodology 相似文献
16.
本文提出了一种连接主从IP核的Octagon环型(Master-Slave IP Core connected Octagon Loop,MSOL)拓扑结构,该拓扑结构具有8m个节点,并且每个节点分别连接主从IP核,除外层环上各核连接3个相邻节点外,内层环上各节点均与4个相邻节点连接。MSOL是一种拓扑结构简单、平面的、对称的并且具有良好扩展性的互连网络,采用基于最短路径的路由算法,在仿真实验中,对MSOL,Mesh和Cluster-Mesh网络的平均通讯延迟和平均吞吐量进行了模拟分析,结果表明MSOL互连网络较好的平衡了网络性能和成本,是一种更为优化、高效的片上网络拓扑结构。 相似文献
17.
由于低功耗有损网络(LLN)中无线链路的不稳定性和有损性,外部环境的干扰极易导致网络出现故障,从而严重影响网络性能,而LLN网络中现有路由修复算法存在控制开销冗余和修复时延较大等问题。为此,提出了一种高能效低时延的LLN路由修复算法(EELDR-RPL)。该算法通过采用“零额外控制开销通告链路故障及邻居节点信息”机制,使得链路故障节点的子节点能够及时获知链路故障以及链路故障节点的邻居情况;通过采用“自适应调整节点网络深度值”机制,使得链路故障节点能够快速地重新接入网络;通过采用“链路故障节点子节点自适应切换”机制,能够达到优化网络拓扑的目的。仿真结果表明,与现有路由修复算法相比,EELDR-RPL算法能够有效地降低路由修复时延和减少控制开销。 相似文献
18.
编码感知路由可以发现路由中的网络编码机会,减少数据传输次数,提高网络吞吐量,是近年来路由算法研究的一个热点.当前编码感知路由存在编码条件失效、未考虑节点能量的问题,不适合直接应用于无线传感器网络.本文提出基于跨层网络编码感知的无线传感器网络节能路由算法CAER (Cross layer coding Aware Energy efficient Routing).提出并证明了修正后的网络编码条件,以解决编码条件失效问题.基于跨层思想,将网络编码感知机制与拓扑控制、覆盖控制结合,挖掘潜在编码机会.提出综合考虑节点编码机会、节点能量的跨层综合路由度量CCRM (Cross layer Coding aware Routing Metric).仿真结果表明,相比现有编码感知路由,CAER能够提高网络编码感知准确性,增加网络编码机会数量5%~15%,延长网络生存时间8%~12%. 相似文献
19.
ZigBee网络技术是一项新兴的低成本、低功耗的短距离无线通信技术,在智能家居中有广阔的应用前景。介绍了智能家居中ZigBee的通讯协议和网络地址分配方法,并针对传统的AODVjr路由算法在路由过程中RREQ分组过量洪泛问题和Cluster-Tree算法只按父子关系选择路由问题,提出了一种改进路由算法。改进算法将AODVjr和Cluster-Tree算法相结合,引入邻居表,适当控制RREQ转发方向,并考虑节点最小剩余能量。仿真结果表明,改进算法可以减少路由开销,延长节点的生存时间,均衡网络负荷。 相似文献