DTMSN中基于效用和网络编码的数据传输

基于SF数据传输策略和网络编码,提出了一种新的数据传输策略,即SF-NC。SF-NC的基本思想是把消息编码后转发给更有可能与数据汇聚节点通信的传感器节点。SF-NC有Spray和Focus这2个阶段组成,前者完成对冗余数据消息的分发,后者根据不同时刻各传感器节点效用值的大小进行编码数据消息的传输。仿真实验结果表明,SF-NC在提高网络的传输性能上比DTMSN中现有的几种数据传输策略要优越。     

基于运动状态的延迟容忍移动传感器网络数据传输策略

针对延迟容忍移动传感器网络(DTMSN, delay tolerant mobile sensor networks)提出一种基于节点运动状态的数据传输(MSD, motion state-based delivery)策略.MSD使用2个通信频率,传感器节点利用基站在频率f1上的广播信号完成自身运动状态和传输概率的计算,并以此作为利用频率f2进行消息转发的依据.为了提高性能,MSD中利用消息生存时间和自身消息优先传输机制来完成消息队列的管理.仿真结果表明,与现有的几种DTMSN数据传输策略相比,MSD能够以较低的通信开销和传输延迟达到较高的数据传输成功率.     

延迟容忍移动传感器网络中基于概率复制的数据传输策略及其性能研究

该文提出了一种基于概率复制的数据传输策略PRD(Probability Replication Delivery scheme)用于空间中间断连通的延迟容忍移动传感器网络(DTMSN)数据传输。PRD由选择复制策略和队列管理组成,前者根据节点将消息传递给汇聚点的可能性,选择下一跳进行复制传输;队列管理则利用引入传输概率及复制数的消息生存时间决定队列中消息丢弃原则。仿真分析表明,与现有的几种数据传输策略相比,PRD能以较低的数据复制数及传输延迟获得较高的数据传输成功率。     

链路可靠的无线传感器网络组播路由协议

在无线传感器网络实际应用中,组播正在发挥着越来越重要的作用.但由于能量等多方面的因素,使得为无线传感器网络设计一个有效的组播路由是非常困难的.针对无线传感器网络中节点的能量限制,通过寻求节点间最短路径,提出一种能量有效的链路可靠组播路由协议(RLMR).该协议充分考虑到网络中节点的能耗因素和两节点间的链路可靠性等,通过对这两个因素的综合考虑,让能量较多并且以发送节点更靠近的节点承担更多传输任务的方式,为数据流优化路由选择,均衡无线传感器网络节点的能量消耗,以延长网络的生存时间.仿真结果证明了RLMR的有效性和可靠性.     

一种能量感知无线传感器网络可靠协议研究

针对无线传感器网络协议中可靠性及能量有效性,提出能量感知的无线传感器网络可靠路由EARRP.EARRP通过本地节点选择、路径预留和路径延迟广播来减少由于路径不可达带来的重传,进而提供一个可依赖的传输环境.仿真实验表明EARRP优于在汇聚节点和感应节点之间建立有效路径的传统的方法可以有效利用节点的剩余能量和有限存储资源.同时可以均匀的分配传输路径,进而实现节能目的.     

无线传感器网络中数据的节能可靠传输

通常来讲无线传感器网络的节能与可靠性是矛盾的,节能与可靠性措施很难统一。该文明确了节能可靠传输面临的主要问题,分析了相关解决策略,总结了无线传感器网络中数据节能可靠传输的方案,说明了无线传感器网络应用场景对传输策略选择的影响,并进一步介绍了三种基于IEEE 802.15.4的网络标准。     

基于网络编码的水下传感器可靠传输技术

网络编码技术可以极大的提高网络的吞吐量，同时能提高网络的鲁棒性。为了提高水下传感器网络数据传输的可靠性，利用网络编码对消息的备份性进行能量收集。该方案节省了电池能量，提高水下传感器节点的生存周期。     

基于生成树的无线传感器网络分布式路由协议

在无线传感器网络中,节点具有有限的电池能量,为了延长网络的生存时间,提出了一种基于生成树的分布式路由协议STRP及其具有能量意识的改进版本STRP-PA.每个传感器节点根据相邻节点与基站的距离、剩余能量等信息寻找父节点,构造一棵以基站为根的近优最小生成树,节点采集的数据沿树传输,并在树杈节点进行聚合.仿真实验结果表明:STRP-PA协议能够节省网络能量,显著延长网络稳定工作的时间,性能明显好于LEACH协议.     

无线可充电传感网络的多车动态路径规划

因构成无线传感器网络的传感器节点采用容量有限的电池供电,其生存时间有限,限制了网络的适用范围和发展.利用充电小车给传感器充电是解决传感器网络能量不足的一种重要方法.现有研究未考虑节点能量消耗值的随机动态变化,而这是传感器节点能耗的重要特征.本文综合考虑传感器节点的距离、覆盖面积和剩余生存时间,提出了一种能使小车实现自动...     

ARDCH：适于多媒体传感器网络的自适应周期分簇机制

分析了多媒体传感器网络节点部署特点以及多媒体信息位置相关性特点,提出了一种基于剩余能量与传输距离的自适应周期簇头竞争机制(ARDCH,adaptive round distributed cluster head),综合考虑通信代价及剩余能量选取簇头,同时根据剩余能量来动态调节簇头的工作周期,以此均衡网络中节点的能量消耗.此外采用多信道簇间通信,避免簇间干扰,与已有的几个分簇协议相比,显著地延长了网络的生存周期,更适于多媒体传感器网络.     

Balance energy-efficient and real-time with reliable communication protocol for wireless sensor network

In many wireless sensor network applications, it should be considered that how to trade off the inherent conflict between energy efficient communication and desired quality of service such as real-time and reliability of transportation. In this paper, a novel routing protocols named balance energy-efficient and real-time with reliable communication (BERR) for wireless sensor networks (WSNs) are proposed, which considers the joint performances of real-time, energy efficiency and reliability. In BERR, a node, which is preparing to transmit data packets to sink node, estimates the energy cost, hop count value to sink node and reliability using local information gained from neighbor nodes. BERR considers not only each sender’ energy level but also that of its neighbor nodes, so that the better energy conditions a node has, the more probability it will be to be chosen as the next relay node. To enhance real-time delivery, it will choose the node with smaller hop count value to sink node as the possible relay candidate. To improve reliability, it adopts retransmission mechanism. Simulation results show that BERR has better performances in term of energy consumption, network lifetime, reliability and small transmitting delay.     

An Energy-Efficient Routing Algorithm Based on Relative Identification and Direction for Wireless Sensor Networks

In studies of wireless sensor networks (WSNs), routing protocols in network layer is an important topic. To date, many routing algorithms of WSNs have been developed such as relative direction-based sensor routing (RDSR). The WSNs in such algorithm are divided into many sectors for routing. RDSR could simply reduce the number of routes as compared to the convention routing algorithm, but it has routing loop problem. In this paper, a less complex, more efficient routing algorithm named as relative identification and direction-based sensor routing (RIDSR) algorithm is proposed. RIDSR makes sensor nodes establish more reliable and energy-efficient routing path for data transmission. This algorithm not only solves the routing loop problem within the RDSR algorithm but also facilitates the direct selection of a shorter distance for routing by the sensor node. Furthermore, it saves energy and extends the lifetime of the sensor nodes. We also propose a new energy-efficient algorithm named as enhanced relative identification and direction-based sensor routing (ERIDSR) algorithm. ERISDR combines triangle routing algorithm with RIDSR. Triangle routing algorithm exploits a simple triangle rule to determine a sensor node that can save more energy while relaying data between the transmitter and the receiver. This algorithm could effectively economize the use of energy in near-sensor nodes to further extend the lifetime of the sensor nodes. Simulation results show that ERIDSR get better performance than RDSR, and RIDSR algorithms. In addition, ERIDSR algorithm could save the total energy in near-sensor nodes more effectively.     

EOMR: An Energy-Efficient Optimal Multi-path Routing Protocol to Improve QoS in Wireless Sensor Network for IoT Applications

The wireless sensor network based IoT applications mainly suffers from end to end delay, loss of packets during transmission, reduced lifetime of sensor nodes due to loss of energy. To address these challenges, we need to design an efficient routing protocol that not only improves the network performance but also enhances the Quality of Service. In this paper, we design an energy-efficient routing protocol for wireless sensor network based IoT application having unfairness in the network with high traffic load. The proposed protocol considers three-factor to select the optimal path, i.e., lifetime, reliability, and the traffic intensity at the next-hop node. Rigorous simulation has been performed using NS-2. Also, the performance of the proposed protocol is compared with other contemporary protocols. The results show that the proposed protocol performs better concerning energy saving, packet delivery ratio, end-to-end delay, and network lifetime compared to other protocols.

     

An efficient cluster-based communication protocol for wireless sensor networks

A wireless sensor network is a network of large numbers of sensor nodes, where each sensor node is a tiny device that is equipped with a processing, sensing subsystem and a communication subsystem. The critical issue in wireless sensor networks is how to gather sensed data in an energy-efficient way, so that the network lifetime can be extended. The design of protocols for such wireless sensor networks has to be energy-aware in order to extend the lifetime of the network because it is difficult to recharge sensor node batteries. We propose a protocol to form clusters, select cluster heads, select cluster senders and determine appropriate routings in order to reduce overall energy consumption and enhance the network lifetime. Our clustering protocol is called an Efficient Cluster-Based Communication Protocol (ECOMP) for Wireless Sensor Networks. In ECOMP, each sensor node consumes a small amount of transmitting energy in order to reach the neighbour sensor node in the bidirectional ring, and the cluster heads do not need to receive any sensed data from member nodes. The simulation results show that ECOMP significantly minimises energy consumption of sensor nodes and extends the network lifetime, compared with existing clustering protocol.     

Energy Efficiency Routing with Node Compromised Resistance in Wireless Sensor Networks

For the energy limited wireless sensor networks, the critical problem is how to achieve the energy efficiency. Many attackers can consume the limited network energy, by the method of capturing some legal nodes then control them to start DoS and flooding attack, which is difficult to be detected by only the classic cryptography based techniques with common routing protocols in wireless sensor networks (WSNs). We argue that under the condition of attacking, existing routing schemes are low energy-efficient and vulnerable to inside attack due to their deterministic nature. To avoid the energy consumption caused by the inside attack initiated by the malicious nodes, this paper proposes a novel energy efficiency routing with node compromised resistance (EENC) based on Ant Colony Optimization. Under our design, each node computes the trust value of its 1-hop neighbors based on their multiple behavior attributes evaluation and builds a trust management by the trust value. By this way, sensor nodes act as router to achieve dynamic and adaptive routing, where the node can select much energy efficiency and faithful forwarding node from its neighbors according to their remaining energy and trust values in the next process of data collection. Simulation results indicate that the established routing can bypass most compromised nodes in the transmission path and EENC has high performance in energy efficiency, which can prolong the network lifetime.     

A New Method to Find a High Reliable Route in IoT by Using Reinforcement Learning and Fuzzy Logic

Recently, Internet is moving quickly toward the interaction of objects, computing devices, sensors, and which are usually indicated as the Internet of things (IoT). The main monitoring infrastructure of IoT systems main monitoring infrastructure of IoT systems is wireless sensor networks. A wireless sensor network is composed of a large number of sensor nodes. Each sensor node has sensing, computing, and wireless communication capability. The sensor nodes send the data to a sink or a base station by using wireless transmission techniques However, sensor network systems require suitable routing structure to optimizing the lifetime. For providing reasonable energy consumption and optimizing the lifetime of WSNs, novel, efficient and economical schemes should be developed. In this paper, for enhancing network lifetime, a novel energy-efficient mechanism is proposed based on fuzzy logic and reinforcement learning. The fuzzy logic system and reinforcement learning is based on the remained energies of the nodes on the routes, the available bandwidth and the distance to the sink. This study also compares the performance of the proposed method with the fuzzy logic method and IEEE 802.15.4 protocol. The simulations of the proposed method which were carried out by OPNET (Optimum Network performance) indicated that the proposed method performed better than other protocols such as fuzzy logic and IEEE802.15.4 in terms of power consumption and network lifetime.

     

A data transmission protocol for reliable and energy-efficient data transmission in a wireless sensor-actuator network

In a wireless sensor-actuator network, sensor nodes gather information on the physical world and can deliver messages with sensed values to only nearby nodes due to weak radio. Thus, messages sent by nodes might be lost due to not only collision but also noise. Messages are forwarded by sensor nodes to an actuator node. In the redundant data transmission (RT) protocol, a sensor node sends a message with not only its sensed value but also sensed values received from other sensor nodes. Even if a message with a sensed value v is lost, an actuator node can receive the value v from a message sent by another sensor node. In addition, we have to reduce the energy consumption of a sensor node. A sensor node mainly consumes the energy to send and receive messages. Even if an event occurs, only some number of sensor nodes sensing the event send the sensed values to reduce the total energy consumption. We discuss an energy-efficient data transmission protocol. We evaluate the RT protocol compared with the CSMA protocol in terms of how much sensing data a node can receive in presence of messages loss. We evaluate the RT protocol in terms of how many number of sensed values an actuator node can receive in presence of message loss. We show that about 72% of sensed values can be delivered to an actuator node even if 95% of messages are lost due to noise and collision.     

Energy-Efficient Routing Algorithm Based on Unequal Clustering and Connected Graph in Wireless Sensor Networks

Clustering and multi-hop routing algorithms substantially prolong the lifetime of wireless sensor networks (WSNs). However, they also result in the energy hole and network partition problems. In order to balance the load between multiple cluster heads, save the energy consumption of the inter-cluster routing, in this paper, we propose an energy-efficient routing algorithm based on Unequal Clustering Theory and Connected Graph Theory for WSN. The new algorithm optimizes and innovates in two aspects: cluster head election and clusters routing. In cluster head election, we take into consideration the vote-based measure and the transmission power of sensor nodes when to sectionalize these nodes into different unequal clusters. Then we introduce the connected graph theory for inter-cluster data communication in clusters routing. Eventually, a connected graph is constituted by the based station and all cluster heads. Simulation results show that, this new algorithm balances the energy consumption among sensor nodes, relieves the influence of energy-hole problem, improve the link quality, achieves a substantial improvement on reliability and efficiency of data transmission, and significantly prolongs the network lifetime.     

LSAPSP: Load distribution‐based slot allocation and path establishment using optimized substance particle selection in sensor networks

Sensor node energy conservation is the primary design parameters in wireless sensor networks (WSNs). Energy efficiency in sensor networks directly prolongs the network lifetime. In the process of route discovery, each node cooperates to forward the data to the base station using multi‐hop routing. But, the nodes nearer to the base station are loaded more than the other nodes that lead to network portioning, packet loss and delay as a result nodes may completely loss its energy during the routing process. To rectify these issues, path establishment considers optimized substance particle selection, load distribution, and an efficient slot allocation scheme for data transmission between the sensor nodes in this paper. The selection of forwarders and conscious multi‐hop path is selected based on the route cost value that is derived directly by taking energy, node degree and distance as crucial metrics. Load distribution based slot allocation method ensures the balance of data traffic and residual energy of the node in areal‐time environment. The proposed LSAPSP simulation results show that our algorithm not only can balance the real‐time environment load and increase the network lifetime but also meet the needs of packet loss and delay.     

Design and Implementation of Routing Algorithm to Enhance Network Lifetime in WBAN

Today’s era is the era of smart and remote applications exploiting advancement in sensors, cloud, Internet of things etc. Major application is in healthcare monitoring and support using wireless body area network (WBAN) in which sensor nodes sense vital physiological parameters and send to server through sink i.e. smart phone nowadays for seamless monitoring. The most significant issue in such applications is energy efficiency which leads to enhanced network life time that ensures uninterrupted seamless services. From source to sink data transmission may occur considering three different scenarios: source to sink single hop direct data transmission irrespective of in-between node distance, source to sink multi hop data transmission in which transmission range of source node is fixed at a threshold to find next forwarder node and transmission range of source node is incremented by affixed value until data gets transmitted to sink. In this work WBAN having different network configurations based on fixed or random positions of nodes have been simulated. Different scenarios with fixed and varying number of nodes are framed and simulated using MATLAB 2020a for performance evaluation of proposed algorithm in terms of energy consumption, network lifetime, path loss etc. due to data transmission from source to sink. Experimental results show that incremental approach is better than direct one in terms of energy consumption, path loss and network lifetime. While selecting transmission range of a source node, it is considered to keep Specific Absorption Rate (SAR) lower to reduce impact on human tissue.