首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
链路可靠的无线传感器网络组播路由协议   总被引:2,自引:0,他引:2       下载免费PDF全文
宋震  周贤伟  林亮 《电子学报》2008,36(1):64-69
在无线传感器网络实际应用中,组播正在发挥着越来越重要的作用.但由于能量等多方面的因素,使得为无线传感器网络设计一个有效的组播路由是非常困难的.针对无线传感器网络中节点的能量限制,通过寻求节点间最短路径,提出一种能量有效的链路可靠组播路由协议(RLMR).该协议充分考虑到网络中节点的能耗因素和两节点间的链路可靠性等,通过对这两个因素的综合考虑,让能量较多并且以发送节点更靠近的节点承担更多传输任务的方式,为数据流优化路由选择,均衡无线传感器网络节点的能量消耗,以延长网络的生存时间.仿真结果证明了RLMR的有效性和可靠性.  相似文献   

2.
研究了AODV路由协议,分析了多路径路由实现机制,提出了一种可应用于无线多媒体传感器网络的能量均衡多路径AODV路由协议。该协议建立从源节点到目的节点的多条路径,在路径的选择上综合考虑了路径跳数和节点剩余能量,用以保证负载均衡,延长网络生存期,该算法使用了分流的方式避免拥塞。通过使用NS2仿真软件对EEMP-AODV路由协议进行仿真,结果显示其在拥塞避免、实时性、吞吐量和网络生存期方面的性能有明显提升。  相似文献   

3.
针对MSP算法需要借助额外的外部扫描设备,不适合应用于对野外大规模部署的传感器网络进行定位这一缺点,提出了一种HG-MSP算法。该算法通过锚节点发出扫描信息,不需要额外的外部设备进行辅助定位,提高了算法的可用性。仿真实验表明,在去掉辅助设备的情况下,算法的定位精度并无明显下降。  相似文献   

4.
针对无线传感器网络中存在的热区问题,采用非均匀部署方案,并在此基础上提出基于能量预测的无线传感器网络节点覆盖调度算法。并对算法进行了仿真实验和性能分析。结果表明该算法可以延长的网络生命周期并在较长的时间里保持较高的网络覆盖率,能够达到网络内大多数节点能耗均衡的设计目标。  相似文献   

5.
    
A wireless node of strain sensor was developed for structural health monitoring. Surface acoustic wave oscillators were used as sensor heads of the system, and can linearly detect the strain of 10−5 to 10−6 order. In the developed sensor node, a mixer chip and communicator were integrated on the board for temperature compensation and construction of sensor mesh network. We practically applied the developed sensor nodes to measurement of the static deformation in the metal plate, and successfully detected the deformation distribution. In this experiment, power consumption of each node was 190 μW in sleep mode and 50 mW in data transmission mode.  相似文献   

6.
通过分析无线传感器网络的电路模型和能量消耗情况,结合LEACH算法,提出一种基于最小能耗的无线传感器网络路由算法。网络运行时首先将其划分为若干个子区域,再进行簇首节点的选取,这样取代了传统LEACH算法对整片网络随机选取簇首节点的做法,使得簇首节点分布更加均匀。同时,在选取簇首节点之前对每个节点的剩余能量进行判断,低于阈值的采取休眠处理,这样保证了簇首节点选取的有效性。以上两点措施使区域内节点负载分配更加合理,有效地提升了整个网络的生存时间。  相似文献   

7.
    
Underwater Wireless Sensor Networks (UWSNs) are utilized to monitor underwater environments that pose many challenges to researchers. One of the key complications of UWSNs is the difficulty of changing node batteries after their energy is depleted. This study aims to diminish the issues related to battery replacement by improving node lifetime. For this goal, three energy harvesting devices (turbine harvester, piezoelectric harvester, and hydrophone harvester) are analyzed to quantitate their impacts on node lifetime. In addition, two different power management schemes (schedule‐driven and event‐driven power management schemes) are combined with energy harvesters for further lifetime improvement. Performance evaluations via simulations show that energy harvesting methods joined by power management schemes can improve node lifetime substantially when actual conditions of Istanbul Bosporus Strait are considered. In this respect, turbine harvester makes the biggest impact and provides lifetime beyond 2000 days for most cases, while piezoelectric harvester can perform the same only for low duty cycle or event arrival values at short transmission ranges.  相似文献   

8.
    
Wireless passive sensor networks play an important role in solving the energy limitation of nodes in the Internet of Things, and node scheduling is a significant method used to improve the energy utilization of nodes. In this work, an unused energy model based on analyzing the energy consumption characteristics of passive nodes is proposed because no unified model of passive sensor nodes is reported in previous studies. A rapid square partition clustering method is proposed according to the analysis of the relation between the sensing and communication radii of nodes, and the secondary grouping and node scheduling in each cluster are implemented to ensure the coverage rate of networks. Experimental results show that the state distribution of nodes in the proposed algorithm is favorable. The performance of the proposed algorithm is significantly affected by the P ratio between the working and charging powers of nodes. When the value of P is less than 100, the network coverage and connectivity rate are maintained at more than 95% and 90%, respectively, and are both higher than the existing algorithm.  相似文献   

9.
Improving Wireless Sensor Network Lifetime through Power Aware Organization   总被引:36,自引:0,他引:36  
A critical aspect of applications with wireless sensor networks is network lifetime. Battery-powered sensors are usable as long as they can communicate captured data to a processing node. Sensing and communications consume energy, therefore judicious power management and scheduling can effectively extend operational time. To monitor a set of targets with known locations when ground access in the monitored area is prohibited, one solution is to deploy the sensors remotely, from an aircraft. The loss of precise sensor placement would then be compensated by a large sensor population density in the drop zone, that would improve the probability of target coverage. The data collected from the sensors is sent to a central node for processing. In this paper we propose an efficient method to extend the sensor network operational time by organizing the sensors into a maximal number of disjoint set covers that are activated successively. Only the sensors from the current active set are responsible for monitoring all targets and for transmitting the collected data, while nodes from all other sets are in a low-energy sleep mode. In this paper we address the maximum disjoint set covers problem and we design a heuristic that computes the sets. Theoretical analysis and performance evaluation results are presented to verify our approach.Mihaela Cardei is an Assistant Professor in the Department of Computer Science and Engineering at the Florida Atlantic University. Her research interests are in the areas of wireless networking, wireless sensor networks, algorithm and protocol design in communication networks and resource management. Mihaela Cardei received her M.S. and Ph.D. in Computer Science from the University of Minnesota in 1999 and 2003 respectively. Her Ph.D. adviser was Dr. Ding-Zhu Du. During her graduate studies, she worked with Honeywell Laboratories on the Real Time Adaptive Resource Management DARPA project. She is also a recipient of the University of Minnesota Graduate School Doctoral Dissertation Fellowship for 2002–2003.Ding-Zhu Du received his M.S. degree in 1982 from Institute of Applied Mathematics, Chinese Academy of Sciences under the supervision of Minyi Yue, and his Ph.D. degree in 1985 from the University of California at Santa Barbara under the supervision of Ronald V. Book. He worked at Mathematical Sciences Research Institute, Berkeley in 1985–86, at MIT in 1986–87, and at Princeton University in 1990–91. Currently, he is a professor at Department of Computer Science, University of Minnesota and also a research professor at Institute of Applied Mathematics, Chinese Academy of Sciences. His research interests include combinatorial optimization, communication networks, and theory of computation. He has published more than 140 journal papers and 30 books. Currently, he is the editor-in-chief of Journal of Combinatorial Optimization and book series on Network Theory and Applications. He is also in editorial boards of eight journals.  相似文献   

10.
    
Wireless sensor networks (WSNs) have many micro devices that are easy to capture. In node capture attacks, the adversary physically captures sensors and extracts all information including key information from their memories, trying to compromise the system's security protection. However, the robust and random nature of many WSN security designs makes it difficult to compromise the system even with the capture of some sensors. In this paper, we approach WSN security from an adversarial point of view and investigate low‐cost and efficient algorithms to identify sensors in a WSN in the shortest time with the lowest cost. Instead of randomly capturing sensors, an intelligent attacker should choose the next target based on the known topology so far. Because the identification of such has been proven to be NP‐hard (non‐deterministic polynomial‐time hard), we propose to transform the problem into a set covering problem and develop a greedy minimum cost node capture attack algorithm (MCA) to lower cost of attack. Extensive simulations have been implemented to evaluate the performance of MCA and to compare it with several related schemes. It is shown that MCA lowers the cost of compromising WSNs by 16%. Copyright © 2015 John Wiley & Sons, Ltd.  相似文献   

11.
张琳  尹娜  王汝传 《通信学报》2015,36(Z1):53-59
随着无线传感器网络的不断发展,恶意节点对其安全造成了极大的威胁。传统的基于信誉阈值的模型无法准确的识别亚攻击性等恶意节点,而且会出现低识别率和高误判率等问题。为了解决这些问题,引入了基于DPAM-MD算法的新型恶意节点识别方法,在传统信誉阈值判断模型的基础上,通过结合曼哈顿度量和DPAM算法识别出亚攻击性节点。算法中提出一种新型的基于密度的聚类算法,并结合簇间和簇内距离均衡化的目标函数,将所有的节点进行分类。该算法可以提高聚类质量,有效缩短聚类时间,提高了恶意节点识别的效率。经仿真实验结果验证,改进后的算法对识别特征不明显的恶意节点效果十分显著。  相似文献   

12.
传感器网络中的节点定位问题与很多实际应用直接相关,主要有两类算法,即 rang-free和rang-based,这两类定位算法各有其优势和不足.为了研究算法的发展趋势,比较了几种典型的定位算法,指出了各自的优缺点.  相似文献   

13.
节点定位技术是无线传感器网络中的关键技术之一。为了提高节点定位精度,在DV-HOP算法的基础上提出两种改进措施:锚节点规划部署和加权算法,改进后的算法统称为加权DV-HOP。在新算法的基础上建立Matlab仿真模型。仿真结果表明加权DV-HOP算法,在相同的锚节点数量和锚节点无线覆盖范围下,节点定位精度约提高10%。  相似文献   

14.
无线传感器网络中节点自定位一直是一个具有挑战性的研究课题。全球定位系统(GPS)是一种传统的定位技术,但是定位的准确性低且网络花费较大。通过分析现有的节点自定位算法,认为六边形节点自定位算法是比较优秀的非GPS算法,该算法基于蜂窝交叠的思想,节点仅使用简单的连接矩阵和信标帧中的定位数据就能自定位,且定位准确性高,最后提出了今后要做的工作。  相似文献   

15.
振动频率检测在旋转机械运行状态监测和大型建筑物结构健康监测等领域具有重要应用,为了实现振动频率检测节点的自供能,该文设计了基于压电振动能采集器的无线振动频率检测节点,该节点由两个压电振动能采集器、电源管理电路和无线测频电路组成。利用LTC3588-1和LT3009芯片组成的电源管理电路,将采集器一输出的交流电压整流稳压转换为直流电压为节点供电,采用低功耗微控制器MSP430F149对采集器二的输出电压进行处理得到环境振动频率,进一步利用无线收发芯片nRF24L01实现信号的发送。振动台实验表明,在加速度幅值为1 g(g=9.8m/s2),振动频率为53Hz时,该节点可每隔120s无线发送环境的振动频率。  相似文献   

16.
无线网络中节点重要性的研究   总被引:1,自引:0,他引:1  
张品  陈磊  姜亚光 《电子器件》2011,34(4):395-397
提出了一种判断无线网络中节点重要性的新方法——节点插入法,并给出了归一化表达式,认为最重要的节点是在 其相关链路上插入一个新节点后,使图的生成树增加最多.该方法可以判断全网范围内节点的重要性,并比较任意两个节点 的相对重要性,理论分析和仿真结果表明,该方法对新加入节点的位置评估要优于其它算法.  相似文献   

17.
无线传感器网络是将传感器通过无线通信的方式,对网络信息进行处理及传递.网络综合了传感器技术、嵌入式计算技术、分布式信息处理技术和通信技术,可以实时监测、感知和采集网络分布区域内的各种对象的信息,并对这些信息进行处理,传送给所需用户.LEACH算法是一种典型的层次路由算法,该算法提出了低功耗持续运行的模型.但LEACH算...  相似文献   

18.
    
In this paper, a weighted node selection technique in wireless sensor networks is proposed. It is an energy‐efficient cooperative technique where a selected number of sensors at the transmitting end are connected with a selected number of sensors at the receiving end to form a virtual multi‐input multi‐output. The proposed technique is based on a weighted selection function that combines geographical location, inter‐sensor distance in a cluster, channel estimate energy, power circuit, channel loss, mobility factor, and residual energy of each sensor. The weight of each of these parameters in the selection function depends on the degree that this parameter affects the energy consumption. Then, the cluster head selects the sensors with better selection parameters that reduce the overall energy consumption. The numerical results show that the proposed weighted node selection technique achieves a significant improvement in the energy consumption, delay, and network lifetime than the conventional techniques with and without the selected number of sensors. Its improvement reaches 15% in the energy consumption that leads to an increase in the network lifetime by four times the network lifetime of other techniques. Copyright © 2012 John Wiley & Sons, Ltd.  相似文献   

19.
基于RSSI的传感器网络节点安全定位机制   总被引:1,自引:0,他引:1  
叶阿勇  许力  林晖 《通信学报》2012,33(7):135-142
针对RSSI测距存在的脆弱性问题,提出了一种基于完整性编码和不间断占用信道的安全RSSI测距协议,该协议不仅可以抵抗伪造插入、重放/虫洞等常规攻击,而且可以防止信标信号被恶意干扰而削弱,即可抵抗虚增测距的外部攻击。在此基础上,设计了一种基于RSSI的传感器网络节点安全定位机制,该机制采用可校验的多边测量法来过滤虚减测距的外部攻击,实现安全定位,并对测距协议和定位机制的安全性进行了理论分析。  相似文献   

20.
文中提出一种基于超节点和能量优先的无线传感器网络的高效查询算法.该算法包括传感器节点的层次聚类算法及基于能量代价模型等支撑技术,主要解决了以下两个问题:(1)数据如何从传感器节点传送到汇聚节点;(2)通过对传感器节点进行聚类,形成超节点,使得在查询过程中减少对无关节点的访问.实验表明该算法在提高无线传感器网络查询效率的情况下,延长网络的使用寿命.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号