Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey

Wireless sensor networks (WSNs) consist of autonomous and resource-limited devices. The devices cooperate to monitor one or more physical phenomena within an area of interest. WSNs operate as stochastic systems because of randomness in the monitored environments. For long service time and low maintenance cost, WSNs require adaptive and robust methods to address data exchange, topology formulation, resource and power optimization, sensing coverage and object detection, and security challenges. In these problems, sensor nodes are to make optimized decisions from a set of accessible strategies to achieve design goals. This survey reviews numerous applications of the Markov decision process (MDP) framework, a powerful decision-making tool to develop adaptive algorithms and protocols for WSNs. Furthermore, various solution methods are discussed and compared to serve as a guide for using MDPs in WSNs

On Maximizing the Efficiency of Multipurpose WSNs Through Avoidance of Over- or Under-Provisioning of Information

A wireless sensor network (WSN) is a distributed collection of sensor nodes, which are resource constrained and capable of operating with minimal user attendance. The core function of a WSN is to sample physical phenomena and their environment and transport the information of interest, such as current status or events, as required by the application. Furthermore, the operating conditions and/or user requirements of WSNs are often desired to be evolvable, either driven by changes of the monitored phenomena or by the properties of the WSN itself. Consequently, a key objective for setting up/configuring WSNs is to provide the desired information subject to user defined quality requirements (accuracy, reliability, timeliness etc.), while considering their evolvability at the same time. The current state of the art only addresses the functional blocks of sampling and information transport in isolation. The approaches indeed assume the respective other block to be perfect in maintaining the highest possible information contribution. In addition, some of the approaches just concentrate on a few information attributes such as accuracy and ignore other attributes (e.g., reliability, timeliness, etc.). The existing research targeting these blocks usually tries to enhance the information quality requirements (accuracy, reliability, timeliness etc.), regardless of user requirements and use more resources, leading to faster energy depletion. However, we argue that it is not always necessary to provide the highest possible information quality. In fact, it is essential to avoid under or over provision of information in order to save valuable resources such as energy while just satisfying user evolvable requirements. More precisely, we show the interdependence of the different user requirements and how to co-design them in order to tune the level of provisioning. To discern the fundamental issues dictating the tunable co-design in WSNs, this thesis models and co-designs the sampling accuracy, information transport reliability and timeliness, and compares existing techniques. We highlight the key problems of existing techniques and provide solutions to achieve desired application requirements without under or over provisioning of information. Our first research direction is to provide tunable information transport. We show that it is possible to drastically improve efficiency, while satisfying the user evolvable requirements on reliability and timeliness. In this regard, we provide a novel timeliness model and show the tradeoff between the reliability and timeliness. In addition, we show that the reliability and timeliness can work in composition for maximizing efficiency in information transport. Second, we consider the sampling and information transport co-design by just considering the attributes spatial accuracy and transport reliability. We provide a mathematical model in this regard and then show the optimization of sampling and information transport co-design. The approach is based on optimally choosing the number of samples in order to minimize the number of retransmission in the information transport while maintaining the required reliability. Third, we consider representing the physical phenomena accurately and optimize the network performance. Therefore, we jointly model accuracy, reliability and timeliness, and then derive the optimal combination of sampling and information transport. We provide an optimized model to choose the right representative sensor nodes to describe the phenomena and highlight the tunable co-design of sampling and information transport by avoiding over or under provision of information. Our simulation and experimental results show that the proposed tunable co-design supports evolving user requirements, copes with dynamic network properties and outperforms the state of the art solutions

OELB - IH Algorithm for Secure Data Routing to Improve the Network Location Advisory Privacy Performance in WSN

Wireless network performance greatly depends on the number of factors such as output, delay packet delivery rate, packet drop rate, and many others. Each quality of service parameter greatly depends on other parameters also. However, the only obstacle which stops the performance achievement is security issues. In most cases, the adversary involves learning the network data to identify the routing strategy, data transmission strategy, and so on. When the adversary is capable of identifying the traffic and routing strategy, the adversary can perform different network. To improve the network performance and safeguard the network transmission using an Iterative heuristic algorithm, an efficient neighbor discovery-based security enhancement algorithm with Optimized Elastic Load Balancing (OELB) protocol is applied. In this Optimized Elastic Load Balancing Routing with Iterative Heuristic (OELB-IH) algorithm to provide secure communication in the sensor network. In this work, the Receiving Signal Strength Indication (RSSI) value to estimate the transmission support and transmitting signal range estimate to identify the nearest coverage nodes. The iterative heuristic algorithm performs tracking and seeking to achieve the node location and transmission error. In this OELB protocol, to identify the lower transmission path with lower energy consumption, it helps to multipath communication over the network. In this proposed has produced efficient results on security performance and throughput performance compared to other existing methods (SPAC, CPSLP, RRA)

Byzantine Attack and Defense in Cognitive Radio Networks: A Survey

The Byzantine attack in cooperative spectrum sensing (CSS), also known as the spectrum sensing data falsification (SSDF) attack in the literature, is one of the key adversaries to the success of cognitive radio networks (CRNs). In the past couple of years, the research on the Byzantine attack and defense strategies has gained worldwide increasing attention. In this paper, we provide a comprehensive survey and tutorial on the recent advances in the Byzantine attack and defense for CSS in CRNs. Specifically, we first briefly present the preliminaries of CSS for general readers, including signal detection techniques, hypothesis testing, and data fusion. Second, we analyze the spear and shield relation between Byzantine attack and defense from three aspects: the vulnerability of CSS to attack, the obstacles in CSS to defense, and the games between attack and defense. Then, we propose a taxonomy of the existing Byzantine attack behaviors and elaborate on the corresponding attack parameters, which determine where, who, how, and when to launch attacks. Next, from the perspectives of homogeneous or heterogeneous scenarios, we classify the existing defense algorithms, and provide an in-depth tutorial on the state-of-the-art Byzantine defense schemes, commonly known as robust or secure CSS in the literature. Furthermore, we highlight the unsolved research challenges and depict the future research directions.Comment: Accepted by IEEE Communications Surveys and Tutoiral

A survey on energy efficient techniques in wireless sensor networks

International audienceThe myriad of potential applications supported by wireless sensor networks (WSNs) has generated much interest from the research community. Various applications range from small size low industrial monitoring to large scale energy constrained environmental monitoring. In all cases, an operational network is required to fulfill the application missions. In addition, energy consumption of nodes is a great challenge in order to maximize network lifetime. Unlike other networks, it can be hazardous, very expensive or even impossible to charge or replace exhausted batteries due to the hostile nature of environment. Researchers are invited to design energy efficient protocols while achieving the desired network operations. This paper focuses on different techniques to reduce the consumption of the limited energy budget of sensor nodes. After having identified the reasons of energy waste in WSNs, we classify energy efficient techniques into five classes, namely data reduction, control reduction, energy efficient routing, duty cycling and topology control. We then detail each of them, presenting subdivisions and giving many examples. We conclude by a recapitulative table