MR-MC无线传感器网络基于森林的数据收集研究

传感器网络的部署环境以及节点自身的限制,导致传感器节点很容易出现故障并且难以维护。在基于树的数据收集过程中,节点故障或者链路拥塞会造成较高的通信时延,甚至数据丢失。针对该问题提出以森林作为路由结构进行数据收集的策略。首先提出一个建立森林的算法,然后以多棵树作为路由结构进行数据收集。理论分析和实验结果表明,提出的方法可以有效减少数据收集过程中的数据丢失,在有25个故障节点的情况下,3棵树的森林路由结构收集的数据量与基于连通支配集的路由树收集的数据量相比多55%,并且能降低数据收集的延迟。     

Capsule network‐based data pruning in wireless sensor networks

The development of the wireless sensor networks (WSN) being deployed among numerous application for its sensing capabilities is increasing at a very fast tread. Its distributed nature and ability to extend communication even to the inaccessible areas beyond communication range that lacks human intervention has made it even more attractive in a wide space of applications. Confined with numerous sensing nodes distributed over a wide area, the WSN incurs certain limitations as it is battery powered. Many developed routing enhancements with power and energy efficiency lacked in achieving the significant improvement in the performance. So, the paper proposes a machine learning system (capsule network) and technique (data pruning) for WSN involved in the real world observations to have knowledge‐based learning from the experience for an intelligent way of handling the dynamic and real environment without the intervention of the humans. The WSN cluster‐based routing aided with capsule network and data pruning proffered in paper enables the WSN to have a prolonged network lifetime, energy efficiency, minimized delay, and enhanced throughput by reducing the energy usage and extending communication within the limited battery availability. The proposed system is validated in the network simulator and compared with the WSN without ML to check for the performance enhancements of the WSN with ML inclusions in terms of quality of service enhancements, network lifetime, packet delivery ratio, and energy to evince the efficacy of the WSN with capsule network‐based data pruning.     

无线多媒体传感器网络中一种改进路由算法

随着网络负载增加,经典的TPGF( Two-Phase geographic Greedy Forwarding)算法难以找到节点分离路径,会导致网络吞吐量、投递率以及端到端时延性能下降。此外,当网络拓扑变动不大时, TPGF中每条路径所包含节点要消耗比其他节点更多的能量,会导致其过快死亡,从而影响网络性能。为此,将联合网络编码技术引入 TPGF,提出一种编码与能量感知的 TPGF 路由算法( NE-TPGF)。该算法综合考虑节点的地理位置、编码机会、剩余能量等因素,同时利用联合网络编码技术进一步扩展编码结构,充分利用网络编码优势来建立相对最优的传输路径。仿真结果表明, NE-TPGF能够增加编码机会,提高网络吞吐量和投递率,降低端到端时延,并且还有利于减少和平衡节点的能量消耗。     

Dynamic switching based real-time routing in low-duty-cycle wireless sensor networks

The dynamic switching based real-time(DSRT)routing protocol was proposed to handle the arbitrary end-to-end(E2E)real-time communication in the low-duty-cycle wireless sensor networks.Firstly,the concept of available speed was designed to compensate for the big sleep latency and facilitate discovering the routes with less latency based on two-hop neighbors’ information(at lease about 20% routing path with less latency was discovered by DRST in the experiments).Moreover,it was noticed that the congestion extent in the low-duty-cycle network was determined not only by the number of packets in the network output queue,but also the destination of the packets.However,the traditional method with one-hop neighbors’ information cannot differentiate this kind of congestion.Therefore,combined with the dynamic switching mechanism,the DSRT proposed a congestion avoiding algorithm by classifying the packets in the queue.Through comprehensive experiments,the efficiency of routing discovering and congestion avoiding of the DSRT protocol is demonstrated,and the E2E delay is decreased by at least 200% when the traffic was high.     

Clustering‐based power‐controlled routing for mobile wireless sensor networks

This paper presents two new routing protocols for mobile sensor networks, viz. power‐controlled routing (PCR) and its enhanced version, i.e. Enhanced Power‐Controlled Routing (EPCR). In both the protocols, fixed transmission power is employed in the clustering phase but when ordinary nodes are about to send their data to their respective cluster‐heads, they change their transmission power according to their distance from their cluster‐head. While in PCR, the nodes are associated with the cluster‐head on the basis of weight, in EPCR it is done on the basis of distance. In addition to the protocols, we are suggesting a packet loss recovery mechanism for the PCR and EPCR. Both protocols work well for both mobile and static networks and are designed to achieve high network lifetime, high packet delivery ratio, and high network throughput. These protocols are extensively simulated using mass mobility model, with different speeds and different number of nodes to evaluate their performance. Simulation results show that both PCR and EPCR are successful in achieving their objectives by using variable transmission powers and smart clustering. Copyright © 2011 John Wiley & Sons, Ltd.     

A fragment‐based retransmission scheme with quality‐of‐service considerations for wireless networks

In order to satisfy quality‐of‐service requirements for real‐time multimedia applications over wireless networks, IEEE 802.11e has been proposed to enhance wireless‐access functionalities. In IEEE 802.11e, collisions occur frequently as the system load becomes heavy, and then, the latency for successfully transmitting data is lengthened seriously because of contention, handshaking, and backoff overheads for collision avoidance. In this paper, we propose a fragment‐based retransmission (FBR) scheme with quality‐of‐service considerations for IEEE 802.11e‐based wireless local area networks. Our FBR can be used in all proposed fragmentation‐based schemes and greatly decrease redundant transmission overheads. By utilizing FBR, the retransmission delay will be significantly improved to conform strict time requirements for real‐time multimedia applications. We develop an analytical model and a simulation model to investigate the performance of FBR. The capability of the proposed scheme is evaluated by a series of simulations, for which we have encouraging results. Copyright © 2011 John Wiley & Sons, Ltd.     

基于蚁群优化的无线多媒体传感器网络区分服务路由

无线多媒体传感器网络中存在多种类型的数据,而且这些数据的服务质量需求并不相同。针对这种情况,提出一种基于蚁群优化的区分服务路由协议（DSACO, differentiated service and ant colony optimization based routing protocol）。DSACO在网络分层的基础上通过限制蚂蚁的搜索范围以减少建立路由的时间和能量消耗,对不同服务质量需求的数据采用区分服务路由以满足不同类型数据的服务质量需求。仿真结果表明,新协议能够为多媒体数据的传输提供更好的QoS保障,在数据传输的平均时延、分组丢失率和能量消耗上优于已有路由协议。     

Power control based cooperative opportunistic routing in wireless sensor networks

This paper proposes an approach called PC-CORP (Power Control based Cooperative Opportunistic Routing Protocol) for WSN (Wireless Sensor Networks), providing robustness to the random variations in network connectivity while ensuring better data forwarding efficiency in an energy efficient manner. Based on the realistic radio model, we combine the region-based routing, rendezvous scheme, sleep discipline and cooperative communication together to model data forwarding by cross layer design in WSN. At the same time, a lightweight transmission power control algorithm called PC-AIMD (Power Control Additive Increase Multiplicative Decrease) is introduced to utilize the cooperation of relay nodes to improve the forwarding efficiency performance and increase the robustness of the routing protocol. In the simulation, the performance of PC-COPR is investigated in terms of the adaptation of variations in network connectivity and satisfying the QoS requirements of application.     

A cluster‐based fault‐tolerant routing protocol for wireless sensor networks

Energy conservation and fault tolerance are two critical issues in the deployment of wireless sensor networks (WSNs). Many cluster‐based fault‐tolerant routing protocols have been proposed for energy conservation and network lifetime maximization in WSNs. However, these protocols suffer from high frequency of re‐clustering as well as extra energy consumption to tolerate failures and consider only some very normal parameters to form clusters without any verification of the energy sufficiency for data routing. Therefore, this paper proposes a cluster‐based fault‐tolerant routing protocol referred as CFTR. This protocol allows higher energy nodes to become Cluster Heads (CHs) and operate multiple rounds to diminish the frequency of re‐clustering. Additionally, for the sake to get better energy efficiency and balancing, we introduce a cost function that considers during cluster formation energy cost from sensor node to CH, energy cost from CH to sink, and another significant parameter, namely, number of cluster members in previous round. Further, the proposed CFTR takes care of nodes, which have no CH in their communication range. Also, it introduces a routing algorithm in which the decision of next hop CH selection is based on a cost function conceived to select routes with sufficient energy for data transfer and distribute uniformly the overall data‐relaying load among the CHs. As well, a low‐overhead algorithm to tolerate the sudden failure of CHs is proposed. We perform extensive simulations on CFTR and compare their results with those of two recent existing protocols to demonstrate its superiority in terms of different metrics.     

Sink selection and clustering using fuzzy‐based controller for wireless sensor networks

Applying multiple sink nodes in a large‐scale wireless sensor networks (WSN) can increase the scalability and lifetime of the network. The current sink selection mechanisms assume an unlimited amount of buffer and bandwidth for the sink nodes. This can be problematic in real‐world applications, especially when many cluster heads select a specific sink node and send their data to the sink at the same time. In this situation, the sink node may not have enough buffer to receive and process data; consequently, some packets are dropped. To mitigate these occasions, a fuzzy‐based controller with reduced rules is proposed for sink selection by considering the capacity of the sink nodes. The capacity of the sink nodes is estimated using the long short‐term memory (LSTM) technique. Then another fuzzy‐based controller with reduced rules is designed to select the cluster head. The fuzzy rules are reduced by employing R‐implications method. Reducing the number of fuzzy rules decreases the complexity of the fuzzy controllers. The results show the efficiency of the proposed sink selection and clustering techniques in terms of consumed energy, remaining energy, first node dead (FND), half nodes dead (HND), last node dead (LND), packet loss, and delay.     

无线传感器网络中基于链路质量的路径延时分析

基于链路质量给出了路径满足实时性概率的上界,并证明了计算其上界的时间复杂度为指数级。另外在考虑链路质量的基础上,提出了一种在给定的延迟阈值下最大化端到端数据分组发送成功概率的贪心算法(RROP)。根据给定的延迟阈值和链路质量,RROP算法通过设置每跳链路的最大重传次数来优化端到端数据分组发送成功的概率。证明该算法能够在多项式时间内找到最优解并且通过该最优解获得路径满足实时性概率的一个近似最优的下界。实验结果表明给出的路径延迟分析上界和下界是准确的,并且提出的RROP算法在节省能量和满足实时性上比传统的方法能够获得高出10%以上的性能。     

A lightweight IoT‐based security framework for inventory automation using wireless sensor network

Internet of things (IoT) has evolved as an innovation of next generation in this world of smart devices. IoT tends to provide services for data collection, data management, and data and device security required for application development. Things or devices in IoT communicate and compute to make our lives comfortable and safe. In inventory automation, real‐time check on items, their information management, and status management, monitoring can be carried out using IoT. The huge amount of data that flows among the devices in the network demands for a security framework that ensures authentication, authorization, integrity, and confidentiality of data. The existing security solutions like SIMON or SPECK offer lightweight security solutions but are vulnerable to differential attack because of their simplicity. Moreover, existing solutions do not offer inbuilt authentication. Therefore, this research work contributes a secure and lightweight IoT‐based framework using wireless sensor network (WSN) as a technology. The existing security solutions SPECK and SIMON are compared with the proposed security approach using COOJA simulator. The results show that proposed approach outstands others by 2% reduction in number of CPU cycles, 10% less execution time, 4% less memory requirements of security approach, and with minimum 10% more security impact.     

一种能耗均衡的无线传感器网络路由算法

为了延长采用电池供电的无线传感器网络的生命周期,提出了一种综合考虑单个节点能耗和节点传输信息至汇集节点所需总能耗的路由算法.该算法首先根据网络中节点到汇集节点从小到大的距离顺序选择待规划节点,然后计算各对应候选节点的评价参数,该参数由单节点能耗和节点传输信息至汇集节点所需总能耗加权得到,最后选择评价参数最小的候选节点作为待规划节点的中继节点.仿真结果表明,该算法的生命周期明显长于LEACH(Low Energy Adaptive Clustering Hier-archy)算法.     

Time‐aware and energy‐efficient opportunistic routing with residual energy collection in wireless sensor networks

In 1‐dimensional queue wireless sensor networks, how to balance end‐to‐end latency and energy consumption is a challenging problem. However, traditional best path routing and existing opportunistic routing protocols do not address them well because relay hop counts are usually much more, and the link appears more unreliable compared with general mesh topology. In this work, we formulate these 2 problems as a multiobjective optimization problem. Specifically, we first classify network packets into types of time tolerant and time critical and introduce a residual energy collection mechanism of neighboring nodes for forwarder set selection. We then propose a time‐aware and energy‐efficient opportunistic routing protocol (TE‐OR) to optimize energy consumption and to reduce latency for time‐critical packets. We evaluate TE‐OR by different parameters and compare it with existing protocols. The performance results show that TE‐OR achieves a trade‐off between energy consumption and time delay and balances energy consumption among nodes while guaranteeing the latency of time‐critical packets is minimized.     

A gradient‐based multiple‐path routing protocol for low duty‐cycled wireless sensor networks

Routing in a low duty‐cycled wireless sensor network (WSN) has attracted much attention recently because of the challenge that low duty‐cycled sleep scheduling brings to the design of efficient distributed routing protocols for such networks. In a low duty‐cycled WSN, a big problem is how to design an efficient distributed routing protocol, which uses only local network state information while achieving low end‐to‐end (E2E) packet delivery delay and also high packet delivery efficiency. In this paper, we study low duty‐cycled WSNs wherein sensor nodes adopt pseudorandom sleep scheduling for energy saving. The objective of this paper is to design an efficient distributed routing protocol with low overhead. For this purpose, we design a simple but efficient hop‐by‐hop routing protocol, which integrates the ideas of multipath routing and gradient‐based routing for improved routing performance. We conduct extensive simulations, and the results demonstrate the high performance of the proposed protocol in terms of E2E packet delivery latency and packet delivery efficiency as compared with existing protocols. Copyright © 2014 John Wiley & Sons, Ltd.     

LRP: Link quality‐aware queue‐based spectral clustering routing protocol for underwater acoustic sensor networks

Recently, underwater acoustic sensor networks (UASNs) have been considered as a promising approach for monitoring and exploring the oceans in lieu of traditional underwater wireline instruments. As a result, a broad range of applications exists ranging from oil industry to aquaculture and includes oceanographic data collection, disaster prevention, offshore exploration, assisted navigation, tactical surveillance, and pollution monitoring. However, the unique characteristics of underwater acoustic communication channels, such as high bit error rate, limited bandwidth, and variable delay, lead to a large number of packet drops, low throughput, and significant waste of energy because of packets retransmission in these applications. Hence, designing an efficient and reliable data communication protocol between sensor nodes and the sink is crucial for successful data transmission in underwater applications. Accordingly, this paper is intended to introduce a novel nature‐inspired evolutionary link quality‐aware queue‐based spectral clustering routing protocol for UASN‐based underwater applications. Because of its distributed nature, link quality‐aware queue‐based spectral clustering routing protocol successfully distributes network data traffic load evenly in harsh underwater environments and avoids hotspot problems that occur near the sink. In addition, because of its double check mechanism for signal to noise ratio and Euclidean distance, it adopts opportunistically and provides reliable dynamic cluster‐based routing architecture in the entire network. To sum up, the proposed approach successfully finds the best forwarding relay node for data transmission and avoids path loops and packet losses in both sparse and densely deployed UASNs. Our experimental results obtained in a set of extensive simulation studies verify that the proposed protocol performs better than the existing routing protocols in terms of data delivery ratio, overall network throughput, end‐to‐end delay, and energy efficiency.     

A lightweight intrusion detection framework for wireless sensor networks

In recent years, Wireless Sensor Networks (WSNs) have demonstrated successful applications for both civil and military tasks. However, sensor networks are susceptible to multiple types of attacks because they are randomly deployed in open and unprotected environments. It is necessary to utilize effective mechanisms to protect sensor networks against multiple types of attacks on routing protocols. In this paper, we propose a lightweight intrusion detection framework integrated for clustered sensor networks. Furthermore, we provide algorithms to minimize the triggered intrusion modules in clustered WSNs by using an over‐hearing mechanism to reduce the sending alert packets. Our scheme can prevent most routing attacks on sensor networks. In in‐depth simulation, the proposed scheme shows less energy consumption in intrusion detection than other schemes. Copyright © 2009 John Wiley & Sons, Ltd.     

仿血管路径的无线传感器网络故障容错路由算法

为提高无线传感器网络故障容错性和传输稳定性,实现网络负载均衡,提出了一种仿血管路径的无线传感器网络故障容错路由算法.研究了人体血管路径特性及属性关联,对网络节点分区域等级标定并以不同概率值进行静态分簇,运用改进的蚁群算法BWAS(最优最差蚂蚁系统)生成节点路径,以路径信息素值作为传输路径的选择概率建立仿血管拓扑结构路由...