Two-Hop Routing with Traffic-Differentiation for QoS Guarantee in Wireless Sensor Networks

This paper proposes a Traffic-Differentiated Two-Hop Routing protocol for Quality of Service (QoS) in Wireless Sensor Networks (WSNs). It targets WSN applications having different types of data traffic with several priorities. The protocol achieves to increase Packet Reception Ratio (PRR) and reduce end-to-end delay while considering multi-queue priority policy, two-hop neighborhood information, link reliability and power efficiency. The protocol is modular and utilizes effective methods for estimating the link metrics. Numerical results show that the proposed protocol is a feasible solution to addresses QoS service differenti- ation for traffic with different priorities.Comment: 13 page

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

Coverage Protocols for Wireless Sensor Networks: Review and Future Directions

The coverage problem in wireless sensor networks (WSNs) can be generally defined as a measure of how effectively a network field is monitored by its sensor nodes. This problem has attracted a lot of interest over the years and as a result, many coverage protocols were proposed. In this survey, we first propose a taxonomy for classifying coverage protocols in WSNs. Then, we classify the coverage protocols into three categories (i.e. coverage aware deployment protocols, sleep scheduling protocols for flat networks, and cluster-based sleep scheduling protocols) based on the network stage where the coverage is optimized. For each category, relevant protocols are thoroughly reviewed and classified based on the adopted coverage techniques. Finally, we discuss open issues (and recommend future directions to resolve them) associated with the design of realistic coverage protocols. Issues such as realistic sensing models, realistic energy consumption models, realistic connectivity models and sensor localization are covered

A survey of localization in wireless sensor network

Localization is one of the key techniques in wireless sensor network. The location estimation methods can be classified into target/source localization and node self-localization. In target localization, we mainly introduce the energy-based method. Then we investigate the node self-localization methods. Since the widespread adoption of the wireless sensor network, the localization methods are different in various applications. And there are several challenges in some special scenarios. In this paper, we present a comprehensive survey of these challenges: localization in non-line-of-sight, node selection criteria for localization in energy-constrained network, scheduling the sensor node to optimize the tradeoff between localization performance and energy consumption, cooperative node localization, and localization algorithm in heterogeneous network. Finally, we introduce the evaluation criteria for localization in wireless sensor network

Analyzing Energy-efficiency and Route-selection of Multi-level Hierarchal Routing Protocols in WSNs

The advent and development in the field of Wireless Sensor Networks (WSNs) in recent years has seen the growth of extremely small and low-cost sensors that possess sensing, signal processing and wireless communication capabilities. These sensors can be expended at a much lower cost and are capable of detecting conditions such as temperature, sound, security or any other system. A good protocol design should be able to scale well both in energy heterogeneous and homogeneous environment, meet the demands of different application scenarios and guarantee reliability. On this basis, we have compared six different protocols of different scenarios which are presenting their own schemes of energy minimizing, clustering and route selection in order to have more effective communication. This research is motivated to have an insight that which of the under consideration protocols suit well in which application and can be a guide-line for the design of a more robust and efficient protocol. MATLAB simulations are performed to analyze and compare the performance of LEACH, multi-level hierarchal LEACH and multihop LEACH.Comment: NGWMN with 7th IEEE Inter- national Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA 2012), Victoria, Canada, 201

LIS: Localization based on an intelligent distributed fuzzy system applied to a WSN

The localization of the sensor nodes is a fundamental problem in wireless sensor networks. There are a lot of different kinds of solutions in the literature. Some of them use external devices like GPS, while others use special hardware or implicit parameters in wireless communications. In applications like wildlife localization in a natural environment, where the power available and the weight are big restrictions, the use of hungry energy devices like GPS or hardware that add extra weight like mobile directional antenna is not a good solution. Due to these reasons it would be better to use the localization’s implicit characteristics in communications, such as connectivity, number of hops or RSSI. The measurement related to these parameters are currently integrated in most radio devices. These measurement techniques are based on the beacons’ transmissions between the devices. In the current study, a novel tracking distributed method, called LIS, for localization of the sensor nodes using moving devices in a network of static nodes, which have no additional hardware requirements is proposed. The position is obtained with the combination of two algorithms; one based on a local node using a fuzzy system to obtain a partial solution and the other based on a centralized method which merges all the partial solutions. The centralized algorithm is based on the calculation of the centroid of the partial solutions. Advantages of using fuzzy system versus the classical Centroid Localization (CL) algorithm without fuzzy preprocessing are compared with an ad hoc simulator made for testing localization algorithms. With this simulator, it is demonstrated that the proposed method obtains less localization errors and better accuracy than the centroid algorithm.Junta de Andalucía P07-TIC-0247