Delay aware reliable transport in wireless sensor networks

Wireless sensor networks (WSN) are event‐based systems that rely on the collective effort of several sensor nodes. Reliable event detection at the sink is based on collective information provided by the sensor nodes and not on any individual sensor data. Hence, conventional end‐to‐end reliability definitions and solutions are inapplicable in the WSN regime and would only lead to a waste of scarce sensor resources. Moreover, the reliability objective of WSN must be achieved within a certain real‐time delay bound posed by the application. Therefore, the WSN paradigm necessitates a collective delay‐constrained event‐to‐sink reliability notion rather than the traditional end‐to‐end reliability approaches. To the best of our knowledge, there is no transport protocol solution which addresses both reliability and real‐time delay bound requirements of WSN simultaneously. In this paper, the delay aware reliable transport (DART) protocol is presented for WSN. The objective of the DART protocol is to timely and reliably transport event features from the sensor field to the sink with minimum energy consumption. In this regard, the DART protocol simultaneously addresses congestion control and timely event transport reliability objectives in WSN. In addition to its efficient congestion detection and control algorithms, it incorporates the time critical event first (TCEF) scheduling mechanism to meet the application‐specific delay bounds at the sink node. Importantly, the algorithms of the DART protocol mainly run on resource rich sink node, with minimal functionality required at resource constrained sensor nodes. Furthermore, the DART protocol can accommodate multiple concurrent event occurrences in a wireless sensor field. Performance evaluation via simulation experiments show that the DART protocol achieves high performance in terms of real‐time communication requirements, reliable event detection and energy consumption in WSN. Copyright © 2007 John Wiley & Sons, Ltd.     

Wireless Sensor Network Path Optimization Using Sensor Node Coverage Area Calculation Approach

The proposed work is based on the path optimization approach for wireless sensor network (WSN). Path optimization is achieved by using the NSG 2.1 Tool, TCL Script file and NS2 simulator to improve the quality of service (QoS). Path optimization approach finds best suitable path between sensor nodes of WSN. The routing approach is not only the solution to improve the quality but also improves the WSN performance. The node cardinally is taken under consideration using the ad-hoc on demand distance vector routing protocol mechanism. Ad hoc approach emphasize on sensor nodes coverage area performance along with simulation time. NSG 2.1 Tool calculates the sensor node packet data delivery speed which can facilitate inter-node communication successfully. An experimental result verified that the proposed design is the best possible method which can escape from slow network response while covering maximum sensor nodes. It achieves coverage support in sensor node deployment. The result outcomes show best path for transferring packet from one sensor node to another node. The coverage area of sensor node gives the percentage of average coverage ratio of each node with respect to the simulation time.

     

基于云计算和动态贝叶斯博弈的WSN恶意程序传播优化抑制方法

为有效地应用入侵检测系统检测WSN（wireless sensor network,无线传感网络）恶意程序从而抑制WSN恶意程序传播,在考虑WSN节点资源有限和云计算平台资源几乎无限的现状基础上,借助云计算平台提出WSN入侵检测网络结构。依据传感节点和WSN入侵检测代理之间博弈过程的分析,使用动态贝叶斯博弈建立了考虑WSN入侵检测代理监控数据发送能耗和传感节点隐私保护需求的WSN恶意程序传播抑制博弈模型。依据建立的博弈类型,并基于精炼贝叶斯均衡提出抑制WSN恶意程序传播的优化策略,并给出具体的算法。实验分析了影响WSN入侵检测代理选择优化策略的因素,为具体应用提供了实验依据。     

Energy Efficient Clustering Scheme (EECS) for Wireless Sensor Network with Mobile Sink

The participants in the Wireless Sensor Network (WSN) are highly resource constraint in nature. The clustering approach in the WSN supports a large-scale monitoring with ease to the user. The node near the sink depletes the energy, forming energy holes in the network. The mobility of the sink creates a major challenge in reliable and energy efficient data communication towards the sink. Hence, a new energy efficient routing protocol is needed to serve the use of networks with a mobile sink. The primary objective of the proposed work is to enhance the lifetime of the network and to increase the packet delivered to mobile sink in the network. The residual energy of the node, distance, and the data overhead are taken into account for selection of cluster head in this proposed Energy Efficient Clustering Scheme (EECS). The waiting time of the mobile sink is estimated. Based on the mobility model, the role of the sensor node is realized as finite state machine and the state transition is realized through Markov model. The proposed EECS algorithm is also been compared with Modified-Low Energy Adaptive Clustering Hierarchy (MOD-LEACH) and Gateway-based Energy-Aware multi-hop Routing protocol algorithms (M-GEAR). The proposed EECS algorithm outperforms the MOD-LEACH algorithm by 1.78 times in terms of lifetime and 1.103 times in terms of throughput. The EECS algorithm promotes unequal clustering by avoiding the energy hole and the HOT SPOT issues.     

A Novel QoS Based Secure Unequal Clustering Protocol with Intrusion Detection System in Wireless Sensor Networks

Wireless sensor network (WSN) becomes a hot research topic owing to its application in different fields. Minimizing the energy dissipation, maximizing the network lifetime, and security are considered as the major quality of service (QoS) factors in the design of WSN. Clustering is a commonly employed energy-efficient technique; however, it results in a hot spot issue. This paper develops a novel secure unequal clustering protocol with intrusion detection technique to achieve QoS parameters like energy, lifetime, and security. Initially, the proposed model uses adaptive neuro fuzzy based clustering technique to select the tentative cluster heads (TCHs) using three input parameters such as residual energy, distance to base station (BS), and distance to neighbors. Then, the TCHs compete for final CHs and the optimal CHs are selected using the deer hunting optimization (DHO) algorithm. The DHO based clustering technique derives a fitness function using residual energy, distance to BS, node degree, node centrality, and link quality. To further improve the performance of the proposed method, the cluster maintenance phase is utilized for load balancing. Finally, to achieve security in cluster based WSN, an effective intrusion detection system using a deep belief network is executed on the CHs to identify the presence of intruders in the network. An extensive set of experiments were performed to ensure the superior performance of the proposed method interms of energy efficiency, network lifetime, packet delivery ratio, average delay, and intrusion detection rate.

     

Assimilation of fuzzy clustering approach and EHO‐Greedy algorithm for efficient routing in WSN

The problems related to energy consumption and improvement of the network lifetime of WSN (wireless sensor network) have been considered. The base station (BS) location is the main concern in WSN. BSs are fixed, yet, they have the ability to move in some situations to collect the information from sensor nodes (SNs). Recently, introducing mobile sinks to WSNs has been proved to be an efficient way to extend the lifespan of the network. This paper proposes the assimilation of the fuzzy clustering approach and the Elephant Herding Optimization (EHO)‐Greedy algorithm for efficient routing in WSN. This work considers the separate sink nodes of a fixed sink and movable sink to decrease the utilization of energy. A fixed node is deployed randomly across the network, and the movable sink node moves to different locations across the network for collecting the data. Initially, the number of nodes is formed into the multiple clusters using the enhanced expectation maximization algorithm. After that, the cluster head (CH) selection done through a fuzzy approach by taking the account of three factors of residual energy, node centrality, and neighborhood overlap. A suitable collection of CH can extremely reduce the utilization of energy and also enhancing the lifespan. Finally, the routing protocol of the hybrid EHO‐Greedy algorithm is used for efficient data transmission. Simulation results display that the proposed technique is better to other existing approaches in regard to energy utilization and the system lifetime.     

D3: distributed approach for the detection of dumb nodes in wireless sensor networks

In this work, we propose D3—a distributed approach for the detection of ‘dumb’ nodes in a wireless sensor network (WSN). A dumb node can sense its surroundings, but is unable to transmit these sensed data to any other node, due to the sudden onset of adverse environmental effects. However, such a node resumes its normal operations with the resumption of favorable environmental conditions. Due to the presence of dumb nodes, the network is unable to provide the expected services. Therefore, it is prudent to re‐establish connectivity between dumb and other nodes, so that sensed data can be reliably transmitted to the sink. Before the re‐establishment of connectivity, a node needs to confirm its actual state of being dumb. Dumb behavior is dynamic in nature, and is, thus, distinct from the traditional node isolation problem considered in stationary WSNs. Therefore, the existing schemes for the detection of other misbehaviors are not applicable for detecting a dumb node in a WSN. Considering this temporal behavior of a dumb node, we propose an approach, D3, for the detection of dumb nodes. In the propose scheme, we uses cumulative sum test, which helps in detecting the dumb behavior. The simulation results show that there is 56% degradation in detection percentage with the increment in the detection threshold, whereas energy consumption and the message overhead increase by 40% with the increment in detection threshold.     

Composite Fault Diagnosis in Wireless Sensor Networks Using Neural Networks

Wireless sensor networks (WSNs) are spatially distributed devices to support various applications. The undesirable behavior of the sensor node affects the computational efficiency and quality of service. Fault detection, identification, and isolation in WSNs will increase assurance of quality, reliability, and safety. In this paper, a novel neural network based fault diagnosis algorithm is proposed for WSNs to handle the composite fault environment. Composite fault includes hard, soft, intermittent, and transient faults. The proposed fault diagnosis protocol is based on gradient descent and evolutionary approach. It detects, diagnose, and isolate the faulty nodes in the network. The proposed protocol works in four phases such as clustering phase, communication phase, fault detection and classification phase, and isolation phase. Simulation results show that the proposed protocol performs better than the existing protocols in terms of detection accuracy, false alarm rate, false positive rate, and detection latency.

     

Rule‐Based Anomaly Detection Technique Using Roaming Honeypots for Wireless Sensor Networks

Because the nodes in a wireless sensor network (WSN) are mobile and the network is highly dynamic, monitoring every node at all times is impractical. As a result, an intruder can attack the network easily, thus impairing the system. Hence, detecting anomalies in the network is very essential for handling efficient and safe communication. To overcome these issues, in this paper, we propose a rule‐based anomaly detection technique using roaming honeypots. Initially, the honeypots are deployed in such a way that all nodes in the network are covered by at least one honeypot. Honeypots check every new connection by letting the centralized administrator collect the information regarding the new connection by slowing down the communication with the new node. Certain pre‐defined rules are applied on the new node to make a decision regarding the anomality of the node. When the timer value of each honeypot expires, other sensor nodes are appointed as honeypots. Owing to this honeypot rotation, the intruder will not be able to track a honeypot to impair the network. Simulation results show that this technique can efficiently handle the anomaly detection in a WSN.     

A novel residual energy‐based distributed clustering and routing approach for performance study of wireless sensor network

Non‐uniform energy consumption during operation of a cluster‐based routing protocol for large‐scale wireless sensor networks (WSN) is major area of concern. Unbalanced energy consumption in the wireless network results in early node death and reduces the network lifetime. This is because nodes near the sink are overloaded in terms of data traffic compared with the far away nodes resulting in node deaths. In this work, a novel residual energy–based distributed clustering and routing (REDCR) protocol has been proposed, which allows multi‐hop communication based on cuckoo‐search (CS) algorithm and low‐energy adaptive‐clustering–hierarchy (LEACH) protocol. LEACH protocol allows choice of possible cluster heads by rotation at every round of data transmission by a newly developed objective function based on residual energy of the nodes. The information about the location and energy of the nodes is forwarded to the sink node where CS algorithm is implemented to choose optimal number of cluster heads and their positions in the network. This approach helps in uniform distribution of the cluster heads throughout the network and enhances the network stability. Several case studies have been performed by varying the position of the base stations and by changing the number of nodes in the area of application. The proposed REDCR protocol shows significant improvement by an average of 15% for network throughput, 25% for network scalability, 30% for network stability, 33% for residual energy conservation, and 60% for network lifetime proving this approach to be more acceptable one in near future.     

Cluster-Head Restricted Energy Efficient Protocol (CREEP) for Routing in Heterogeneous Wireless Sensor Networks

A magnanimous number of collaborative sensor nodes make up a Wireless Sensor Network (WSN). These sensor nodes are outfitted with low-cost and low-power sensors. The routing protocols are responsible for ensuring communications while considering the energy constraints of the system. Achieving a higher network lifetime is the need of the hour in WSNs. Currently, many network layer protocols are considering a heterogeneous WSN, wherein a certain number of the sensors are rendered higher energy as compared to the rest of the nodes. In this paper, we have critically analysed the various stationary heterogeneous clustering algorithms and assessed their lifetime and throughput performance in mobile node settings also. Although many newer variants of Distributed Energy-Efficiency Clustering (DEEC) scheme execute proficiently in terms of energy efficiency, they suffer from high system complexity due to computation and selection of large number of Cluster Heads (CHs). A protocol in form of Cluster-head Restricted Energy Efficient Protocol (CREEP) has been proposed to overcome this limitation and to further improve the network lifetime by modifying the CH selection thresholds in a two-level heterogeneous WSN. Simulation results establish that proposed solution ameliorates in terms of network lifetime as compared to others in stationary as well as mobile WSN scenarios.     

Fault‐tolerance in wireless ad hoc networks: bi‐connectivity through movement of removable nodes

For a wireless ad hoc network to achieve fault‐tolerance, it is desired that the network is bi‐connected. This means that each pair of nodes in the network have at least two node‐disjoint paths between them, and thus, failure at any single node does not partition the network. In other words, in a bi‐connected network, there is no cut‐node (defined as a node such that the removal of it partitions the network). To make a connected but not bi‐connected network become bi‐connected, actions should be taken such that all cut‐nodes become non‐cut‐nodes. In this research, we propose to deal with cut‐nodes from a new perspective. Specifically, we first introduce a new concept of removable node, defined as a non‐cut‐node such that the removal of it does not generate any new cut‐node in the network. Then, we propose to move a removable node to a new location around a cut‐node. In this way, the cut‐node becomes a non‐cut‐node, that is, the failure of it does not partition the network anymore. Algorithms are provided (i) to identify removable nodes; (ii) to match cut‐nodes with a feasible set of removable nodes, in which all nodes can be simultaneously removed from the network without generating any new cut‐node in the network; and (iii) to derive the final location of a removable node such that its movement distance is the shortest and the associated cut‐node becomes a non‐cut‐node. The proposed algorithms do not guarantee the final bi‐connectivity but have the merits of a large success rate (almost 100% in the simulation), a small number of moved nodes, and a short total movement distance. In addition, the proposed algorithms are shown to be effective even when there are a large portion of fixed nodes in the network. Copyright © 2011 John Wiley & Sons, Ltd.     

无线传感器网络UDHR协议的设计与实现

针对无线传感器网络(WSN)数据流的特点,提出一种WSN上下行路由异构的协议(UDHR),上下行路由可采用不同的算法,适合于时间驱动、事件驱动以及查询的数据收集模式.利用OMNeT++平台对UDHR协议进行建模仿真,结果表明该协议开销小、扩展性好、健壮稳定.并且在自主开发的Testbed平台上实现了该路由协议,利用该平台可实时观察整个WSN网络拓扑变化、网络开销、监测每个节点能量消耗以及数据收集等情况.     

无线传感器网络模糊逻辑分簇路由协议

在无线传感器网络（Wireless Sensor Network,WSN）中,LEACH协议通过概率模型来选举簇头,由于没有考虑到传感器节点的分布情况和能量剩余等信息,可能会使得部分节点过早死亡.针对这一问题,提出基于模糊逻辑的分簇路由协议（DFLCP）.在预选簇头阶段,根据节点剩余能量等信息利用模糊逻辑计算出节点的竞争半径,使得簇头分布相对均匀;在簇头选举阶段,通过模糊逻辑确定节点成为簇头的概率.仿真结果表明：DFLCP协议可有效控制簇头节点的分布密度和簇的半径,均衡网络负载,延长节点平均生存时间.     

无线传感器网络复件攻击的移动检测方法

无线传感器网络无人值守的特性使得它易于遭受复件攻击从而造成严重的安全隐患。提出了一个移动检测复件攻击的方法,通过检测节点的移动使得网络内的每个节点都能直接与检测节点通信,从而使得检测节点与一跳范围内的传感器节点能够直接通信,从而全局地检测到网络中的复件攻击节点,并采用更新网络对称密钥的方法防御逃避检测的节点。实验表明该方法能够检测到网络内的所有复件攻击节点,和其他方法相比,本方法不需要检测消息的转发,检测开销小并且实现了开销在网络中的均衡。     

Secured routing in wireless sensor networks using fault‐free and trusted nodes

Wireless sensor network (WSN) should be designed such that it is able to identify the faulty nodes, rectify the faults, identify compromised nodes from various security threats, and transmit the sensed data securely to the sink node under faulty conditions. In this paper, we propose an idea of integrating fault tolerance and secured routing mechanism in WSN named as fault tolerant secured routing: an integrated approach (FASRI) that establishes secured routes from source to sink node even under faulty node conditions. Faulty nodes are identified using battery power and interference models. Trustworthy nodes (non‐compromised) among fault‐free nodes are identified by using agent‐based trust model. Finally, the data are securely routed through fault‐free non‐compromised nodes to sink. Performance evaluation through simulation is carried out for packet delivery ratio, hit rate, computation overhead, communication overhead, compromised node detection ratio, end‐to‐end delay, memory overhead, and agent overhead. We compared simulation results of FASRI with three schemes, namely multi‐version multi‐path (MVMP), intrusion/fault tolerant routing protocol (IFRP) in WSN, and active node‐based fault tolerance using battery power and interference model (AFTBI) for various measures and found that there is a performance improvement in FASRI compared with MVMP, IFRP, and AFTBI. Copyright © 2014 John Wiley & Sons, Ltd.     

An integrated framework for wireless sensor network management

Wireless sensor networks (WSNs) have significant potential in many application domains, ranging from precision agriculture and animal welfare to home and office automation. Although sensor network deployments have only begun to appear, the industry still awaits the maturing of this technology to realize its full benefits. The main constraints to large‐scale commercial adoption of WSN have been the lack of available network management and control tools, such as for determining the degree of data aggregation prior to transforming it into useful information, localizing the sensors accurately so that timely emergency actions can be taken at an exact location, routing data by reducing sensor energy consumption, and scheduling data packets so that data are sent according to their priority and fairness. Moreover, to the best of our knowledge, no integrated network management solution comprising efficient localization, data scheduling, routing, and data aggregation approaches exists in the literature for a large‐scale WSN. Thus, we introduce an integrated network management framework comprising sensor localization, routing, data scheduling, and data aggregation for a large‐scale WSN. Experimental results show that the proposed framework outperforms an existing approach that comprises only localization and routing protocols in terms of localization energy consumption, localization error, end‐to‐end delay, packet loss ratio, and network energy consumption. Moreover, the proposed WSN management framework has potential in building a future “Internet of Things”. Copyright © 2012 John Wiley & Sons, Ltd.     

A Zone-Based Node Replica Detection Scheme for Wireless Sensor Networks

Wireless sensor networks (WSN) are susceptible to various kinds of attack, and node replication attack is one of them. It is considered to be one of the most serious attacks in WSN. In this type of attack, an adversary deploys clones of a legitimate node. These clones participate in all network activities and behave identically same as the legitimate node. Therefore, detection of clones in the network is a challenging task. Most of the work reported in the literature for clone detection is location dependent. In this paper, we have proposed a location independent zone-based node replica detection technique. In the proposed scheme, the network is dynamically divided into a number of zones. Each zone has a zone-leader, and they share their membership list among themselves. It is the responsibility of the zone-leader to detect the clone. The proposed technique is a deterministic one. We have compared our scheme with LSM, RED, and P-MPC and observed that it has a higher clone detection probability and a lower communication cost.     

Securing Wireless Sensor Networks Against Denial‐of‐Sleep Attacks Using RSA Cryptography Algorithm and Interlock Protocol

Wireless sensor networks (WSNs) have been vastly employed in the collection and transmission of data via wireless networks. This type of network is nowadays used in many applications for surveillance activities in various environments due to its low cost and easy communications. In these networks, the sensors use a limited power source which after its depletion, since it is non‐renewable, network lifetime ends. Due to the weaknesses in sensor nodes, they are vulnerable to many threats. One notable attack threating WSN is Denial of Sleep (DoS). DoS attacks denotes the loss of energy in these sensors by keeping the nodes from going into sleep and energy‐saving mode. In this paper, the Abnormal Sensor Detection Accuracy (ASDA‐RSA) method is utilized to counteract DoS attacks to reducing the amount of energy consumed. The ASDA‐RSA schema in this paper consists of two phases to enhancement security in the WSNs. In the first phase, a clustering approach based on energy and distance is used to select the proper cluster head and in the second phase, the RSA cryptography algorithm and interlock protocol are used here along with an authentication method, to prevent DoS attacks. Moreover, ASDA‐RSA method is evaluated here via extensive simulations carried out in NS‐2. The simulation results indicate that the WSN network performance metrics are improved in terms of average throughput, Packet Delivery Ratio (PDR), network lifetime, detection ratio, and average residual energy.     

基于LEACH协议的Sybil攻击入侵检测机制

LEACH协议有效地解决了无线传感器网络(WSN)能耗性问题,但是在安全性方面存在较大的隐患。因此提出了一种改进LEACH协议安全性能的LEACH-S机制,采用接收信号强度值(RSSI)的Sybil攻击入侵检测策略,通过设定合理的阈值启动该机制,即只有在判定可能遭遇Sybil攻击时才启动,实验表明该机制能以较少的能耗代价来有效检测出Sybil攻击。