首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
介质访问控制(MAC)协议是无线传感器网络研究领域的基础协议和支撑技术.因此,一种能量高效的MAC协议是提高整个无线传感器网络能量效率的基础.针对无线网络中能量储备有限的特点,在分析了现有无线传感器网络节能协议的基础上,提出了一种能量高效的MAC协议.通过动态调整占空比和消除边界节点等方式,提高了无线传感器网络的能量效率,延长了网络的生命周期.  相似文献   

2.
无线传感器网络动态数据管理——GUI编程及实现   总被引:3,自引:0,他引:3  
无线传感器网络作为分布式网络典型代表,是计算、通信和传感器三项技术相结合的产物。是一种全新的信息获取和处理技术。文中重点讲述了利用VC和微软基础类库实现的动态数据管理图形用户界面的功能、特点、设计思想。它具有拓扑显示,波形显示及温度显示功能,允许用户在图形界面上通过可视化方式实时监测从传感器网络传来的数据。  相似文献   

3.
介绍了可移动基站的特点和优势,可移动基站的基本配置。采用不用固定方式的机房和天线支撑杆,可移动基站应用于城市中心区、城中村改造、城市特殊区域、景区、重大活动、突发事件等多种场合。  相似文献   

4.
无线传感器网络的重要应用特性是具有感测信息的传感节点形成一个自适应本地网络,由中心节点执行不同的协作信息处理任务。该文基于互信息量分析了不同中心节点选择机制的开销性能,证明了基于扩散计算的选择机制的开销有效性;提出一种自适应协同通信路由协议(ACCRP):节点以分布式的方式选择中心节点并建立传输路径;分析讨论了ACCRP的性能参数;并通过实验验证了ACCRP是能源有效的、可扩展的自适应路由协议。  相似文献   

5.
唐伟  郭伟 《通信学报》2010,31(11):65-72
结合节能路由算法,研究以最小化网络总能耗为目标的基站位置选择问题.将基站位置候选集为有限集的情形化归为整数线性规划问题,并将候选集为全空间的情形化归为非线性规划问题.由于问题的NP-完全性质,分别针对2种情形设计了相应的启发式算法.通过仿真实验对所提出算法的性能进行验证,结果表明所提算法性能接近最优解.  相似文献   

6.
刘学 《电子世界》2013,(12):141
本文根据井下作业的复杂环境及其对QoS的要求,设计了相应的无线传感器网络路由协议。该协议法求出了每个节点到Sink节点的最少跳数,并存储在每个节点中,在能量有效性、能量均衡性、减小延迟性和投递率方面均都具有很好的性能。  相似文献   

7.
无线传感器网络路由协议   总被引:1,自引:0,他引:1  
本文在简要地介绍了无线传感器网络体系结构的基础上,研究了当前主要的几种无线传感器网络路由协议模型,并进行了比较分析.  相似文献   

8.
本文提出了一种基于分簇结构的无线传感器网络MAC协议.在基于层次式路由协议的分簇网络结构中,通过综合基于竞争和基于时分复用协议的优缺点,将时间划分为交替的随机访问和调度访问两个阶段,在随机访问阶段簇内节点采用CSMA/CA实现无线信道共享.在调度访问阶段,节点根据簇首分配的时隙实现数据无冲突通信.在簇与簇之间采用FDMA避免信道干扰实现网络的扩展.分析和仿真结果表明本协议在能量效率、时间同步和网络扩展上都有所改进.  相似文献   

9.
唐伟  郭伟 《通信学报》2010,31(10):221-228
将地理位置路由应用于多基站数据聚合无线传感器网络以最大化网络生命期.为减少传输开销并避免路由环路,提出了归属基站集合降势法,采用线性规划方法优化网络生命期.提出了基于地理位置的多基站剖分法,采用次梯度方法设计了分布式算法.通过仿真实验验证了所提算法的性能.  相似文献   

10.
文章提出一种新的无线传感器网络MAC协议AMAC.AMAC是对S-MAC的扩展,克服了S-MAC采用固定竞争窗,无法适应网络负载变化的缺点.为不影响协议休眠激活周期的建立,文章提出固定竞争窗加p坚持的退避算法,当退避计数器减为零时,节点不是立即发送数据,而是以最优概率p发送.为确定p值,又推导出使平均发送能耗最小的p与活动节点数的关系,同时提出了活动节点数估计算法.最后通过仿真验证了AMAC协议的自适应性和能量有效性.  相似文献   

11.
    
Unattended wireless sensor networks operating in hostile environments face the risk of compromise. Given the unattended nature, sensors must safeguard their sensed data of high value temporarily. However, saving data inside a network creates security problems due to the lack of tamper‐resistance of sensors and the unattended nature of the network. In some occasions, a network controller may periodically dispatch mobile sinks to collect data. If a mobile sink is given too many privileges, it will become very attractive for attack. Thus, the privilege of mobile sinks should be restricted. Additionally, secret keys should be used to achieve data confidentiality, integrity, and authentication between communicating parties. To address these security issues, we present mAKPS, an asymmetric key predistribution scheme with mobile sinks, to facilitate the key distribution and privilege restriction of mobile sinks, and schemes for sensors to protect their collected data in unattended wireless sensor networks. Copyright © 2011 John Wiley & Sons, Ltd.  相似文献   

12.
This paper reviews the state-of-the-art features introduced by sink mobility into wireless sensor networks (WSN), and introduces the architecture of mobile enabled Wireless Sensor Network (mWSN) to realize large-scale information gathering via networked wireless sensors and mobile sinks. After introducing the mobile sensing scenarios, some fundamental design parameters in mWSN have been investigated, such as cluster size, sink velocity, transmission range, and packet length. Our contributions include: (1) A cluster formation method has been proposed via multihop forwarding to form a cluster around the expected position of a mobile sink, in order to guarantee packet delay and minimize energy consumption. (2) Analysis of the performance influence by sink mobility leads to the conclusion that the optimal sink velocity must make a compromise between sink-sensor meeting delay and message delivery delay. (3) Finding that large transmission range and short packet length are both of benefit to lower the outage probability of packet transmission. Extensive simulations have been designed to evaluate the performance of mWSN in terms of packet delay, energy consumption and outage probability of packet transmission.
Jyri P. SalomaaEmail: URL: http://research.nokia.com
  相似文献   

13.
    
Network performance can be improved by using a mobile sink (MS) to collect sensed data in a wireless sensor network. In this paper, we design an efficient trajectory for MS, collecting data from sensor nodes in a multihop fashion, with the aim of prolonging the network lifetime. Considering event‐driven applications, we present an approach to jointly determine the optimal trajectory for MS and data paths and transmission rates from source nodes to MS, without considering any rendezvous points. In these applications, an MS is supposed to harvest the data from source nodes in a given time‐slot. We first show that this problem is in form of a mixed integer nonlinear programming model, which is NP‐hard. Then, to achieve an approximate solution, we divide the mentioned problem into 2 simple subproblems. In fact, after determining an approximate zone for the trajectory of MS, the optimal data paths and transmission rates from source nodes to the MS are obtained through a mathematical optimization model. Finally, to illustrate the efficiency of the proposed approach, we compare the performance of our algorithm to an rendezvous point–based and also the state‐of‐the‐art approach in different scenarios.  相似文献   

14.
    
Introduction of mobile sinks into a wireless sensor network can largely improve the network performance. However, sink mobility can cause unexpected changes of network topology, which may bring excessive protocol overhead for route maintenance and may offset the benefit from using mobile sinks. In this paper, we propose an efficient data‐driven routing protocol (DDRP) to address this problem. The design objective is to effectively reduce the protocol overhead for data gathering in wireless sensor networks with mobile sinks. DDRP exploits the broadcast feature of wireless medium for route learning. Specifically, each data packet carries an additional option recording the known distance from the sender of the packet to target mobile sink. The overhearing of transmission of such a data packet will gratuitously provide each listener a route to a mobile sink. Continuous such route‐learning among nodes will provide fresh route information to more and more nodes in the network. When no route to mobile sink is known, random walk routing simply is adopted for data packet forwarding. Simulation results show that DDRP can achieve much lower protocol overhead and longer network lifetime as compared with existing work while preserving high packet delivery ratio. Copyright © 2012 John Wiley & Sons, Ltd.  相似文献   

15.
    
In wireless sensor networks (WSNs), a mobile sink can help eliminate the hotspot effect in the vicinity of the sink, which can balance the traffic load in the network and thus improve the network performance. Location‐based routing is an effective routing paradigm for supporting sink mobility in WSNs with mobile sinks (mWSNs). To support efficient location‐based routing, scalable location service must be provided to advertise the location information of mobile sinks in an mWSN. In this paper, we propose a new hierarchical location service for supporting location‐based routing in mWSNs. The proposed location service divides an mWSN into a grid structure and exploits the characteristics of static sensors and mobile sinks in selecting location servers. It can build, maintain, and update the grid‐spaced network structure via a simple hashing function. To reduce the location update cost, a hierarchy structure is built by choosing a subset of location servers in the network to store the location information of mobile sinks. The simulation results show that the proposed location service can significantly reduce the communication overhead caused by sink mobility while maintaining high routing performance, and scales well in terms of network size and sink number. Copyright © 2009 John Wiley & Sons, Ltd.  相似文献   

16.
    
Introducing mobile sinks into a wireless sensor network can effectively improve the network performance. However, sink mobility can bring excessive protocol overhead for route maintenance and may offset the benefit from using mobile sinks. In this paper, we propose a dynamic layered routing protocol to address this problem. The proposed protocol integrates dynamic layered Voronoi scoping and dynamic anchor selection to effectively reduce the dissemination scopes and frequencies of routing updates as the sinks move in the network. Simulation results show that the proposed protocol can effectively reduce the protocol overhead while ensuring high packet delivery ratio as compared with existing work. Copyright © 2014 John Wiley & Sons, Ltd.  相似文献   

17.
刘丹谱  张铠麟  丁杰 《中国通信》2013,10(3):114-123
Energy conservation in Wireless Sensor Networks (WSNs) has always been a crucial issue and has received increased attention in the recent years. A transmission scheme for energy-constrained WSNs is proposed in this paper. The scheme, called MIHOP (MIMO and Multi-hop), combines cluster-based virtual MIMO and multi-hop technologies. The multi- hop mode is employed in transmitting data when the related sensors are located within a specific number of hops from the sink, and the virtual MIMO mode is used in transmitting data from the remaining sensor nodes. We compare the energy consumption of different transmission schemes and propose an algorithm for determining the optimal hop count in MIHOP. A controllable mobile sink that reduces the energy consumed in sensor transmission is also adopted for data collection. The theoretical analysis and the Monte Carlo simulation demonstrate that the proposed scheme significantly outperforms individual virtual MIMO, multi-hop technologies, and double-string networks in terms of energy conservation. The energy consumption levels under the MIHOP scheme are approximately 12.98%, 47.55% and 48.30% less than that under virtual MIMO schemes, multi-hop networks and double- string networks, respectively.  相似文献   

18.
随着无线网络技术的日益成熟及其对小型、微型移动设备的支持,无线移动传感器网络已经逐渐成为一个研究的热点。主要讨论了为无线移动传感器网络设计的一个自适应的体系结构。在该体系结构中,使用了一个区域和核心路由节点相结合的多层结构的方法来增加无线移动网络的信息传输能力、可扩充性和可靠性,并降低网络的能耗,这样就可以适应无线移动网络的高度动态性和移动性。  相似文献   

19.
郭江  冯斌 《微纳电子技术》2007,44(7):480-482
随着无线网络技术的日益成熟及其对小型、微型移动设备的支持,无线移动传感器网络已经逐渐成为一个研究的热点。主要讨论了为无线移动传感器网络设计的一个自适应的体系结构。在该体系结构中,使用了一个区域和核心路由节点相结合的多层结构的方法来增加无线移动网络的信息传输能力、可扩充性和可靠性,并降低网络的能耗,这样就可以适应无线移动网络的高度动态性和移动性。  相似文献   

20.
    
The reduction of energy consumption in order to increase network lifetime is one of the most major challenges in the design of wireless sensor networks. During data dissemination, the sensors that are located in the sink's neighborhood are responsible to relay data to the other nodes; hence, their energy is exhausted expeditiously. Therefore, the idea of utilizing mobile sinks can be so advantageous to decrease energy consumption during data dissemination process. In this paper, we propose self‐managed grid‐based data disseminating protocol for mobile sink in wireless sensor networks by using the idea of constructing a virtual grid. In self‐managed grid‐based data disseminating protocol, sink and nodes map their geographical position to a virtual location. In order to increase the performance, we have employed a cell head for each grid cell. Cell heads are selected based on two parameters, centralization and residual energy. Our data dissemination protocol is simple and has low overhead to construct and maintain. Also, we have presented a new method for sink location update, which leads to the least cost in data transfer. Simulation results illustrate that by utilizing hierarchical functionality and determining an optimal size for grid cells, energy consumption is decreased, which leads to increasing network lifetime. Copyright © 2015 John Wiley & Sons, Ltd.  相似文献   

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

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