Farruh Ishmanov

Energy consumption balancing (ECB) issues and mechanisms in wireless sensor networks (WSNs): a comprehensive overview

Wireless sensor networks comprise of a large number of low cost sensor nodes that have strictly restricted sensing, computation and communication capabilities. In addition to this, sensor nodes have limited battery life which is not rechargeable in many applications. Due to resource limitations for the sensor nodes, it is important to use energy efficiently for each sensor node. This will result in prolonged network lifetime and functionality. Energy consumption balancing (ECB) property ensures that the average energy dissipation per sensor is equal for all sensors in the network. ECB can be considered as energy efficiency property that optimally manages energy consumption of sensors to prolong network lifetime. This paper investigates the ECB theory and ECB related mechanisms. A classification of ECB mechanism is given by surveying the current and state of the art research in this area. In addition, comparison and main constraints of the mechanisms are presented. Copyright

Trust management system in wireless sensor networks: design considerations and research challenges

Trust is an important factor in wireless sensor networks WSNs in terms of security enhancement and successful collaboration. Trust management TM can ensure that all communicating nodes are trustworthy during authentication, authorisation, or key management, which makes traditional security services more robust and reliable. Moreover, by helping to find reliable nodes, TM improves cooperation among nodes, which is vital for improvement of system performance. Trust estimations and management are highly challenging issues because of the unique features and susceptibility of WSNs to different attacks. These factors prevent direct application of schemes suited to other networks and require careful design in a TM system. Hence, our objective is to discuss and present the concept and design factors of TM in WSNs in detail. Moreover, we explore the current state of research as well as open research issues by reviewing proposed trust computation and management schemes in WSNs. Copyright

A Robust Trust Establishment Scheme for Wireless Sensor Networks

Trust establishment is an important tool to improve cooperation and enhance security in wireless sensor networks. The core of trust establishment is trust estimation. If a trust estimation method is not robust against attack and misbehavior, the trust values produced will be meaningless, and system performance will be degraded. We present a novel trust estimation method that is robust against on-off attacks and persistent malicious behavior. Moreover, in order to aggregate recommendations securely, we propose using a modified one-step M-estimator scheme. The novelty of the proposed scheme arises from combining past misbehavior with current status in a comprehensive way. Specifically, we introduce an aggregated misbehavior component in trust estimation, which assists in detecting an on-off attack and persistent malicious behavior. In order to determine the current status of the node, we employ previous trust values and current measured misbehavior components. These components are combined to obtain a robust trust value. Theoretical analyses and evaluation results show that our scheme performs better than other trust schemes in terms of detecting an on-off attack and persistent misbehavior.

Distributed Clustering Algorithm with Load Balancing in Wireless Sensor Network

Clustering is a promising technique for prolonging network lifetime and improving functionality of a wireless sensor network. It achieves high energy efficiency by utilizing multihop mode communication among clusters.However, relay clusters die much earlier than other cluster, because of unequal burden. As a consequence,network lifetime is significantly decreased. To mitigate this problem, rotation and unequal clustering schemes are proposed. However, rotation schemes are not much energy efficient. Unequal clustering schemes consider only distance and rarely consider overlapping clusters which can seriously affect load balancing. We propose load balancing and energy efficient clustering algorithm to efficiently distribute distance among clusters considering data volume and set up targeted clusters. In each step of clustering, algorithm estimates load on current cluster, forms next level clusters, and adjusts it with network width. As comparisons showed, our algorithm outperforms other algorithms in terms of network lifetime and load balancing.

A Novel Trust Establishment Method for Wireless Sensor Networks

Establishment of trust is important in wireless sensor networks for security enhancement and successful collaboration. Basically, a node establishes trust with other nodes by estimating a trust value based on monitored behavior of the other nodes. Since a malicious/misbehaving node might launch different attack strategies and might demonstrate random misbehavior, a trust estimation method should be robust against such attacks and misbehavior. Otherwise, the operation of trust establishment will be meaningless, and performance of an application that runs on top of trust establishment will degrade. In this paper, we propose a robust and novel trust estimation method. Unlike traditional trust estimation methods, we consider not only the weight of misbehavior but also the frequency of misbehavior. The frequency-of-misbehavior component explicitly demonstrates how frequently a node misbehaves during a certain observed time period, and it tracks the behavior of nodes more efficiently, which is a main factor in deriving an accurate trust value. In addition, the weight of misbehavior is comprehensively measured to mitigate the effect of an on-off attack. Frequency and weight of misbehavior are comprehensively combined to obtain the trust value. Evaluation results show that the proposed method outperforms other trust estimation methods under different attacks and types of misbehavior.

A survey on routing protocols supported by the Contiki Internet of things operating system

Abstract Standardization and technology advancements have helped the realization of the Internet of things (IoT). The availability of low-cost IoT devices has also played a key role in furthering IoT research, development, and deployment. IoT operating systems (OSs) provide integration of software and hardware components. The availability of standard protocols, heterogeneous hardware support, ease of development, and simulation or emulation support are desirable features of IoT OSs. Contiki OS is one of the contenders for future IoT OSs. It was proposed in 2003, and since then, it has been continually under development and upgraded by professionals, academia, and researchers. Contiki OS supports open source, Internet standards, power awareness, dynamic module loading, and many hardware platforms. The diverse applications of IoT, including smart homes, smart health, smart cities, require efficient network connectivity and demand intelligent routing protocols that can handle heterogeneous, mobile, and diverse networks. Subsequently, designing routing protocols for memory- and central processing unit (CPU)-constrained IoT devices is a very challenging task. Therefore, this paper surveys the state-of-the-art routing protocols of Contiki OS. To the best of the authors’ knowledge, this is the first study to classify the Contiki OS routing protocol literature and list the potential challenges and future work.

Trust Mechanisms to Secure Routing in Wireless Sensor Networks: Current State of the Research and Open Research Issues

Routing is one of the most important operations in wireless sensor networks (WSNs) as it deals with data delivery to base stations. Routing attacks can cripple it easily and degrade the operation of WSNs significantly. Traditional security mechanisms such as cryptography and authentication alone cannot cope with some of the routing attacks as they come from compromised nodes mostly. Recently, trust mechanism is introduced to enhance security and improve cooperation among nodes. In routing, trust mechanism avoids/includes nodes in routing operation based on the estimated trust value. Many trust-based routing protocols are proposed to secure routing, in which they consider different routing attacks. In this research work, our goal is to explore the current research state and identify open research issues by surveying proposed schemes. To achieve our goal we extensively analyze and discuss proposed schemes based on the proposed framework. Moreover, we evaluate proposed schemes based on two important factors, which are energy consumption and attack resiliency. We discuss and present open research issues in the proposed schemes and research field.

Opportunistic Hybrid Transport Protocol (OHTP) for Cognitive Radio Ad Hoc Sensor Networks

The inefficient assignment of spectrum for different communications purposes, plus technology enhancements and ever-increasing usage of wireless technology is causing spectrum scarcity. To address this issue, one of the proposed solutions in the literature is to access the spectrum dynamically or opportunistically. Therefore, the concept of cognitive radio appeared, which opens up a new research paradigm. There is extensive research on the physical, medium access control and network layers. The impact of the transport layer on the performance of cognitive radio ad hoc sensor networks is still unknown/unexplored. The Internet’s de facto transport protocol is not well suited to wireless networks because of its congestion control mechanism. We propose an opportunistic hybrid transport protocol for cognitive radio ad hoc sensor networks. We developed a new congestion control mechanism to differentiate true congestion from interruption loss. After such detection and differentiation, we propose methods to handle them opportunistically. There are several benefits to window- and rate-based protocols. To exploit the benefits of both in order to enhance overall system performance, we propose a hybrid transport protocol. We empirically calculate the optimal threshold value to switch between window- and rate-based mechanisms. We then compare our proposed transport protocol to Transmission Control Protocol (TCP)-friendly rate control, TCP-friendly rate control for cognitive radio, and TCP-friendly window-based control. We ran an extensive set of simulations in Network Simulator 2. The results indicate that the proposed transport protocol performs better than all the others.

A secure trust establishment in wireless sensor networks

A functionality of wireless sensor networks depends on the cooperation of the sensor nodes in the network. A trust is major driving force to cooperate among sensors. Hence, trust establishment can be promising technique to improve network functionality. Moreover, trust establishment has been recognized as powerful tool to provide security. We propose a secure trust estimation method which does not allow malicious node to increase its trust value asrtificially. Unlike traditional trust estimation approaches, proposed scheme calculates trust on nodes based on only a bad behavior. Misbehavior of a node is weighted and based on the weighted misbehavior trust value is decreased. Since trust is dynamic nature, a node can increase its trust value if it does not misbehave. Numerical results demonstrate the effectiveness of the proposed trust estimation method.

An optimized hybrid algorithm in term of energy and performance for mapping real time workloads on 2d based on-chip networks

In this paper, we propose an optimized, search based near-optimal mapping heuristic, named as ONMAP for mapping real time embedded application workloads on 2D based on-chip interconnection network platforms. ONMAP exploits NMAP, a well-known and fast nearest neighbor heuristic algorithm by using the modular exact optimization method. The proposed hybrid algorithm minimizes the on-chip inter-processor communication energy consumption and optimizes the interconnection network performance parameters. The algorithm inherits the constructive search based heuristic nature of the NMAP algorithm, as well as the property of exact optimization for mapping embedded applications on the target communication architecture. To verify the efficiency and effectiveness of the algorithm, we have compared the proposed algorithm with NMAP and random mapping algorithm under similar simulation environments and traffic conditions. The mapping results of the exemplary real world applications such as VOPD, PIP, MPEG4, MWD, MMS and WiFi-80211arx indicate that ONMAP algorithm is more efficient than its competitors for most of the performance parameters of the on-chip network designs. The algorithm successfully optimized the energy consumption, up to 20 % and 26% in comparison to NMAP and random algorithms, respectively. Similarly, the cost is optimized up to 10% and 60% as compared to NMAP and random mapping algorithms, respectively.