一种基于AODV协议的无线传感器网络多路径路由改进方案

本文分析了AODV协议在静态无线传感器网络中的传输过程,针对单路径路由机制存在的中间节点路由延迟较大、负载集中而导致的网络节点能耗不均、数据传输效率低的问题,提出了一种针对AODV协议的改进方案。此改进方案在AODV协议中引入了多路径路由机制,同时在路径选择时考虑了节点剩余能量,从而在无线传感器网络数据传输中能避免热点,较好的解决断链问题,同时减少了原AODV路由查找的次数和延时,降低了路由开销。     

基于位置信息的水声传感器网络路由协议

由于水下环境与地面环境不同,无线传感器网络中的协议不能直接应用于水下传感器网络中。针对水下环境的特点,提出了一种适用于水下传感器网络的路由协议。它是一种可扩展的、能量高效的路由协议。仿真结果显示:网络节点的移动速率不是很大时,该协议具有能量利用率高、数据传输成功率高和传输延时低等优点。     

无线传感器网络中基于信誉-投票机制的恶意节点检测

针对无线传感器网络节点易被捕获,导致网络中可能存在恶意节点等特点,提出了一种基于信誉-投票合作机制的恶意节点检测算法MNDRVM.该算法不同于以往的恶意节点检测方法,它利用基站广播控制信息给网内所有节点,邻居节点根据收到信息对被检测节点给出信誉评价后进行投票,最后依据有无嫌疑得票情况判断是否为恶意节点.该算法支持多种路由协议,通过仿真实验显示,该算法和WTE算法及多元分类检测算法相比,具有较好的检测率和较低的误检率.     

基于复杂网络理论的无线传感器网络地理路由和信息融合

无线传感器是由大量微型廉价的传感器节点,在监视区域通过无线通信技术自由组成的多跳网络结构,网络路由协议信息融合技术作为无线传感器实现信息传输和处理的重要途径,具有十分重要的作用和意义。本文详细阐述了复杂网络理论的相关概念,并针对无线传感器网络进行分析。在此基础上,笔者结合基于路由"空洞"问题与解决对策,归纳了基于复杂网络理论的无线传感器网络地理路由和信息融合技术的设计和优化问题。     

基于路由量的无线传感器网络路由协议

提出一种新颖的能量感知型无线传感器网络路由协议,并给出实现过程和仿真结果.从无线传感器网络实际的应用需求出发,综合WSN在能量高效、可扩展性、服务质量等方面的不同要求,基于重点关注节点路由量的策略,在对当前主流WSN路由协议深入研究的基础上设计出了基于路由量的动态WSN路由协议.仿真结果表明:设计的路由协议可以在传感器网络系统层面较好地改善能量消耗的有效性和均衡性,因而避免了网络中热点的过早出现,延长了整个网络的生存期.     

基于信誉评测机制的WSN安全路由协议研究

针对无线传感器网络(WSN)路由协议存在的安全问题,考虑到WSN节点能量低、资源有限的缺陷,提出了一种新型的WSN安全路由协议——VH-GEAR协议。VH-GEAR协议在地理位置能量感知路由(GEAR)协议的基础上引入了纵向(vertocal,V)和横向(horizontal,H)分析相结合的WSN节点信誉评测模型来提高路由协议的安全性,同时通过改进路由协议的信誉更新机制来减小能耗。基于NS2的仿真实验表明,VH-GEAR路由协议能有效识别网络中的恶意节点,减小对合法节点的误判,降低网络能耗,从而加强了网络的安全性,延长了网络的生命周期,提高了网络的整体性能。     

一种基于MPLS的Ad hoc无线移动网络解决方案

为改善目前Ad hoc网络在服务质量和流量工程支持上的不足,提出了一种节点独立多径的Ad hoc标签交换按需路由协议(AODLS)和基于多协议标签交换(MPLS)的Ad hoc无线移动网络模型.该协议通过将Ad hoc网络的路由技术与MPLS的标签快速交换技术相结合,使Ad hoc网络不仅能够支持传统的、无连接的IP服务,还能应用于移动MPLS网络,使其具备MPLS的服务质量(QoS)保证和流量工程的优点.仿真结果表明,AODLS在吞吐量、时延及路由发起频率上均比AODV路由协议有所改善,在节点移动情况下更加明显.     

一种传感器网络的非均匀节能分簇模型

针对无线传感器网络中节点能耗不平衡导致系统生存时间缩短的问题,提出了一种无线传感器网络的非均匀节能分簇(UEEC)模型.UEEC通过自组织的方式和对簇头的动态选择,在靠近sink点(基站)的地方形成较小的簇,在远离sink点的地方形成较大的簇,从而使簇头能够对信息收集能耗与信息转发能耗进行平衡.同时,簇头的动态选举又能够把能耗平均分散在各个节点上.仿真结果表明,UEEC在减少与平衡无线传感器网络的节点能耗上有较好的性能,从而能够延长无线传感器网络的生存时间.     

基于非合作博弈功率控制的传感器网络并行传输MAC协议

针对传统的基于竞争或调度的MAC协议用于节点密集部署的无线传感器网络中,会出现较低的吞吐量和累计延迟等问题,利用节点密集部署的无线传感器网络中普遍存在的捕获效应对MAC协议性能的影响,提出了一种单信道模式下工作的并行传输的新型高效MAC协议——基于非合作博弈功率控制的并行传输MAC协议.该协议运用博弈理论中非合作不完全...     

GBER:一种基于簇间网关节点的节能路由协议

针对无线传感器网络现有分簇路由协议簇首节点向SINK节点传输数据时单跳传输距离较长、能量消耗严重的问题,提出了一种高效节能的基于簇间网关节点的路由(GBER)协议.GBER协议能够使簇首节点均匀地分布在网络中,并选择合适的节点成为转发簇间通信数据的网关节点,利用这些网关节点可以分担簇首节点的能量消耗,延长网络生存周期....     

Providing scalable location service in wireless sensor networks with mobile sinks

Location-based routing has been considered as an efficient routing paradigm for wireless sensor networks (WSNs). The performance of location-based routing highly depends on the way the position information of mobile sinks are updated and managed, which is the typical function of location service. Frequent location updating can improve the location accuracy at the expense of additional communication overhead. In this study, the authors propose a scalable location service for supporting efficient location-based routing in WSNs with mobile sinks. The proposed location service enables each sensor node to locate its closest (mobile) sink with low overhead. Analytical and simulation results show that it can significantly reduce the communication overhead for providing location service while maintaining high routing performance.     

An Energy-Efficient Protocol Using an Objective Function & Random Search with Jumps for WSN

Wireless Sensor Networks (WSNs) have hardware and software limitations and are deployed in hostile environments. The problem of energy consumption in WSNs has become a very important axis of research. To obtain good performance in terms of the network lifetime, several routing protocols have been proposed in the literature. Hierarchical routing is considered to be the most favorable approach in terms of energy efficiency. It is based on the concept parent-child hierarchy where the child nodes forward their messages to their parent, and then the parent node forwards them, directly or via other parent nodes, to the base station (sink). In this paper, we present a new Energy-Efficient clustering protocol for WSNs using an Objective Function and Random Search with Jumps (EEOFRSJ) in order to reduce sensor energy consumption. First, the objective function is used to find an optimal cluster formation taking into account the ratio of the mean Euclidean distance of the nodes to their associated cluster heads (CH) and their residual energy. Then, we find the best path to transmit data from the CHs nodes to the base station (BS) using a random search with jumps. We simulated our proposed approach compared with the Energy-Efficient in WSNs using Fuzzy C-Means clustering (EEFCM) protocol using Matlab Simulink. Simulation results have shown that our proposed protocol excels regarding energy consumption, resulting in network lifetime extension.     

Voronoi-based relay placement scheme for wireless sensor networks

Energy consumption is a crucially important issue in battery-driven wireless sensor networks (WSNs). In most sensor networks, the sensors near the data collector (i.e. the sink) become drained more quickly than those elsewhere in the network since they are required to relay all of the data collected in the network to the sink. Therefore more balanced data paths to the sink should be established in order to extend the lifetime of the sensor network. Accordingly, a novel relay deployment scheme for WSNs based on the Voronoi diagram is proposed. The proposed scheme is applicable to both two-dimensional and three-dimensional network topologies and establishes effective routing paths that balance the traffic load within the sensor network and alleviate the burden on the sensors around the sink. Simulation results indicate that the number of relays deployed in the proposed scheme is similar to that deployed in the predetermined location scheme and is significantly less than that deployed in the minimum set cover scheme. Furthermore, the lifetime of the sensor network containing relay nodes deployed using the current scheme is longer than that achieved using either the predetermined location scheme or the minimum set cover scheme.     

Controlled deployments for wireless sensor networks

In wireless sensor networks (WSNs), the operation of sensor nodes has to rely on a limited supply of energy (such as batteries). To support long lifetime operation of WSNs, an energy-efficient way of sensor deployment and operation of the WSNs is necessary. A new controlled layer deployment (CLD) protocol to guarantee coverage and energy efficiency for a sensor network is proposed. CLD outperforms previous similar protocols in that it can achieve the same performances and guarantee full area coverage and connection using a smaller number of sensors. It can also ameliorate the 'cascading problem' that reduces the whole network lifetime. Finally, analysis and simulation results show that CLD can use fewer sensor nodes for coverage and also increases the lifetime of the sensor network when compared with the probing environment and adapting sleeping (PEAS) protocol.     

Medium access control layer management for saving energy in wireless sensor networks routing algorithms

Wireless sensor networks (WSNs) consist of small nodes that are capable of sensing, computing, and communication. One of the greatest challenges in WSNs is the limitation of energy resources in nodes. This limitation applies to all of the protocols and algorithms that are used in these networks. Routing protocols in these networks should be designed considering this limitation. Many papers have been published examining low energy consumption networks. One of the techniques that has been used in this context is cross-layering. In this technique, to reduce the energy consumption, layers are not independent but they are related to each other and exchange information with each other. In this paper, a cross-layer design is presented to reduce the energy consumption in WSNs. In this design, the communication between the network layer and medium access layer has been established to help the control of efforts to access the line to reduce the number of failed attempts. In order to evaluate our proposed design, we used the NS2 software for simulation. Then, we compared our method with a cross-layer design based on an Ad-hoc On-demand Distance Vector routing algorithm. Simulation results show that our proposed idea reduces energy consumption and it also improves the packet delivery ratio and decreases the end-to-end delay in WSNs.     

Network lifetime-aware data collection in Underwater Sensor Networks for delay-tolerant applications

Development of energy-efficient data collection and routing schemes for Underwater Wireless Sensor Networks (UWSNs) is a challenging issue due to the peculiarities of the underlying physical layer technology. Since the recharging or replacement of sensor nodes is almost impossible after deployment, the critical issue of network lifetime maximization must be considered right from the beginning of designing the routing schemes. We propose a mobile sink (MS)-based data collection scheme that can extend network lifetime, taking into account power-constrained sensor nodes, partitioned networks with geographically distant data collection points and periodic monitoring applications with delay-tolerance. Lifetime extension is achieved by mitigating the ‘sink neighbourhood problem’ and by deferring the data transmissions until the MS is at the most favourable location for data transfer. Unlike the models available for terrestrial WSNs, we consider non-zero travel time of the MS between data collection points, thus making our model more realistic for UWSNs, both connected and partitioned. The performance of the proposed mobility-assisted data collection scheme is thoroughly investigated using both analytical and simulation models. The analytical results are compared to those of existing models to assess their effectiveness and to investigate the trade-offs. Results show that, with a network size of 60 nodes, the network lifetime achieved by the proposed model is 188% higher than that of static sink model and 91% higher than that of mobile sink model (MSM). The proposed maximum lifetime routing scheme is implemented in the network simulation platform OMNET++, for validating the analytical results as well as for evaluating other performance metrics that are not tractable via analytical methods. Both analytical and simulation results demonstrate the superiority of the proposed model in capturing realistic network conditions and providing useful performance indicators prior to network deployment.     

LWDSA: light-weight digital signature algorithm for wireless sensor networks

The essential security mechanism in wireless sensor networks (WSNs) is authentication, where nodes can authenticate each other before transmitting a valid data to a sink. There are a number of public key authentication procedures available for WSN in recent years. Due to constraints in WSN environment there is a need for light-weight authentication procedure that consumes less power during computation. This proposed work aims at developing a light-weight authentication protocol using MBLAKE2b with elliptic curve digital signature algorithm (ECDSA). The proposed protocol is also tested using the protocol verification tool Scyther and found to be secure in all claims and roles. This proposed algorithm increases the network life time and reduces the computation time, which is essential for the constrained environment like WSNs.     

Multi-level supply chain network design with routing

Recently, the multi-level and multi-facility industrial problem in supply chain management (SCM) has been widely investigated. One of the key issues, central to this problem in the current SCM research area is the interdependence among the location of facilities, the allocation of facilities, and the vehicle routing for the supply of raw materials and products. This paper studies the supply chain network design problem, which involves the location of facilities, allocation of facilities, and routing decisions. The proposed problem has some practical applications. For example, it is necessary for third party logistics (3PL) companies to manage the design of the network and to operate vehicle transportation. The purpose of this study is to determine the optimal location, allocation, and routing with minimum cost to the supply chain network. The study proposes two mixed integer programming models, one without routing and one with routing, and a heuristic algorithm based on LP-relaxation in order to solve the model with routing. The results show that a developed heuristic algorithm is able to find a good solution in a reasonable time.     

The QKD network: model and routing scheme

Quantum key distribution (QKD) technology can establish unconditional secure keys between two communicating parties. Although this technology has some inherent constraints, such as the distance and point-to-point mode limits, building a QKD network with multiple point-to-point QKD devices can overcome these constraints. Considering the development level of current technology, the trust relaying QKD network is the first choice to build a practical QKD network. However, the previous research didn’t address a routing method on the trust relaying QKD network in detail. This paper focuses on the routing issues, builds a model of the trust relaying QKD network for easily analysing and understanding this network, and proposes a dynamical routing scheme for this network. From the viewpoint of designing a dynamical routing scheme in classical network, the proposed scheme consists of three components: a Hello protocol helping share the network topology information, a routing algorithm to select a set of suitable paths and establish the routing table and a link state update mechanism helping keep the routing table newly. Experiments and evaluation demonstrates the validity and effectiveness of the proposed routing scheme.     

Energy Efficient Ambience Awake Routing with OpenFlow Approach

A major problem in networking has always been energy consumption. Battery life is one parameter which could help improve Energy Efficiency. Existing research on wireless networking stresses on reducing signaling messages or time required for data transfer for addressing energy consumption issues. Routing or Forwarding packets in a network between the network elements like routers, switches, wireless access points, etc., is complex in conventional networks. With the advent of Software Defined Networking (SDN) for 5G network architectures, the distributed networking has embarked onto centralized networking, wherein the SDN Controller is responsible for decision making. The controller pushes its decision onto the network elements with the help of a control plane protocol termed OpenFlow. Decentralized networks have been largely in use because of their ease in physical and logically setting the administrative hierarchies. The centralized controller deals with the policy funding and the protocols used for routing procedures are designated by the decentralized controller. Ambience Awake is a location centered routing protocol deployed in the 5G network architecture with OpenFlow model. The Ambience Awake mechanism relies on the power consumption of the network elements during the packet transmission for unicast and multicast scenarios. The signalling load and the routing overhead witnessed an improvement of 30% during the routing procedure. The proposed routing mechanism run on the top of the decentralized SDN controller proves to be 19.59% more efficient than the existing routing solutions.