A Probabilistic Source Location Privacy Protection Scheme in Wireless Sensor Networks

A Probabilistic Source Location Privacy Protection Scheme in Wireless Sensor Networks

ABSTRACT:

With the recent developments of Wireless Sensor Networks (WSNs), computing and communication have experienced huge advancement. Meanwhile, security has not received the same attention to go along with such developments. In this paper, we focus on the source location privacy problem in WSNs, a hot research topic in security, and propose a probabilistic source location privacy protection scheme (PSLP) for WSNs. A more powerful adversary, which can use Hidden Markov Model (HMM) to estimate the state of the source, is considered in this study. To cope with this type of adversary, phantom nodes and fake sources, which are responsible to mimic the behavior of the source, are utilized to diversify the routing path. Then, the weight of each node is calculated as a criteria to select the next-hop candidate. In addition, two transmission modes are designed to transmit real packets. The simulation results demonstrate that the proposed PSLP scheme improves the safety time without compromising the energy consumption.

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS: 

  • System : Pentium Dual Core.
  • Hard Disk : 120 GB.
  • Monitor : 15’’ LED
  • Input Devices : Keyboard, Mouse
  • Ram :         1 GB

SOFTWARE REQUIREMENTS: 

  • Operating system : UBUNTU/Windows XP/7
  • Implementation : NS2
  • NS2 Version : 2.28
  • Front End : OTCL (Object Oriented Tool Command  Language)
  • Tool : Cygwin (To simulate in Windows OS)

REFERENCE:

Hao Wang, Guangjie Han, Senior Member, IEEE, Wenbo Zhang, Mohsen Guizani, Fellow, IEEE, and Sammy Chan, Member, IEEE, “A Probabilistic Source Location Privacy Protection Scheme in Wireless Sensor Networks”, IEEE Transactions on Vehicular Technology, Volume: 68 , Issue: 6 , June 2019.

PROVEST: Provenance-based Trust Model for Delay Tolerant Networks

PROVEST: Provenance-based Trust Model for Delay Tolerant Networks

ABSTRACT:

Delay tolerant networks (DTNs) are often encountered in military network environments where end-to-end connectivity is not guaranteed due to frequent disconnection or delay. This work proposes a provenance-based trust framework, namely PROVEST (PROVEnance-baSed Trust model) that aims to achieve accurate peer-to-peer trust assessment and maximize the delivery of correct messages received by destination nodes while minimizing message delay and communication cost under resource-constrained network environments. Provenance refers to the history of ownership of a valued object or information. We leverage the interdependency between trustworthiness of information source and information itself in PROVEST. PROVEST takes a data-driven approach to reduce resource consumption in the presence of selfish or malicious nodes while estimating a node’s trust dynamically in response to changes in the environmental and node conditions. This work adopts a model-based method to evaluate the performance of PROVEST (i.e., trust accuracy and routing performance) using Stochastic Petri Nets. We conduct a comparative performance analysis of PROVEST against existing trust-based and non-trust-based DTN routing protocols to analyze the benefits of PROVEST. We validate PROVEST using a real dataset of DTN mobility traces.

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS: 

  • System : Pentium Dual Core.
  • Hard Disk : 120 GB.
  • Monitor : 15’’ LED
  • Input Devices : Keyboard, Mouse
  • Ram : 1 GB

SOFTWARE REQUIREMENTS: 

  • Operating system : Windows XP/UBUNTU.
  • Implementation : NS2
  • NS2 Version : 2.28
  • Front End : OTCL (Object Oriented Tool Command  Language)
  • Tool : Cygwin (To simulate in Windows OS)

REFERENCE:

Jin-Hee Cho, Senior Member, IEEE, Ing-Ray Chen, Member, IEEE, “PROVEST: Provenance-based Trust Model for Delay Tolerant Networks”, IEEE Transactions on Dependable and Secure Computing, 2018.

 

Network Topology Effects on the Detectability of Crossfire Attacks

Network Topology Effects on the Detectability of Crossfire Attacks

ABSTRACT:

New strains of Distributed Denial-of-Service (DDoS) attacks have exhibited potential to disconnect communication networks, even cutting off entire countries from the Internet. The “Crossfire” is a new, indirect DDoS link flooding attack, which masks itself as natural congestion, making it very hard to counter. Several studies have proposed online attack detection schemes, whose efficiency has been shown to vary in different network topologies. However, the topology/detection relation has been studied qualitatively, without formal proof or quantification metric. The present study is motivated by the fact that network topology changes are generally expensive and slow. Therefore, network designers should be provided with means of evaluating the effects of topology modifications to the attack detection efficiency. The study fills this gap by contributing a formal proof for the topology-detection efficiency relation, as well as a novel offline metric that quantifies it. Full attack prototypes are implemented and evaluated in real Internet topologies, validating the analytical findings. It is shown that the novel metric expresses the topology detection relation efficiently, while existing and widely-used metrics do not constitute good choices for this task.

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS: 

  • System :         Pentium Dual Core.
  • Hard Disk : 120 GB.
  • Monitor : 15’’ LED
  • Input Devices : Keyboard, Mouse
  • Ram : 1 GB

SOFTWARE REQUIREMENTS: 

  • Operating system : Windows XP/UBUNTU.
  • Implementation : NS2
  • NS2 Version : 2.28
  • Front End : OTCL (Object Oriented Tool Command  Language)
  • Tool : Cygwin (To simulate in Windows OS)

REFERENCE:

Christos Liaskos, Sotiris Ioannidis, “Network Topology Effects on the Detectability of Crossfire Attacks”, IEEE Transactions on Information Forensics and Security, 2018.

Centralized Trust Based Secure Routing in Wireless Networks

Centralized Trust Based Secure Routing in Wireless Networks

ABSTRACT:

Wireless networks are vulnerable to various network attacks. To cope with these security issues, trust-based routing schemes have emerged. Typically, trust routing schemes are mainly focused on detection of packet drop attacks, because this type of an attack is simple and obviously a malicious behavior. However, there are more advanced attacks, such as, false trust reporting or compromised attacks, where trust-based routing to defend these attacks is more difficult because of their ambiguous behavior. In order to ensure data transmission reliability even against such attacks, in this letter a centralized trust based secure routing (CSR) scheme is proposed for wireless networks. Simulation results show that the CSR scheme provides a better performance compared to the ATR and SPR schemes.

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS: 

  • System : Pentium Dual Core.
  • Hard Disk : 120 GB.
  • Monitor : 15’’ LED
  • Input Devices : Keyboard, Mouse
  • Ram : 1 GB

SOFTWARE REQUIREMENTS: 

  • Operating system : Windows XP/UBUNTU.
  • Implementation : NS2
  • NS2 Version : 2.28
  • Front End : OTCL (Object Oriented Tool Command  Language)
  • Tool : Cygwin (To simulate in Windows OS)

REFERENCE:

Jusik Yun, Sunho Seo, and Jong-Moon Chung, Senior Member, IEEE, “Centralized Trust Based Secure Routing in Wireless Networks”, IEEE Wireless Communications Letters, 2018.

Traffic-Aware Efficient Mapping of Wireless Body Area Networks to Health Cloud Service Providers in Critical Emergency Situations

Traffic-Aware Efficient Mapping of Wireless Body Area Networks to Health Cloud Service Providers in Critical Emergency Situations

ABSTRACT:

In a post-disaster situation, increased concentration of patients in an area increases the traffic load of the network significantly, which degrades its performance with respect to mapping cost and network throughput. Therefore, to manage the increased traffic load and to provide ubiquitous medical services, we propose a disease-centric health-care management system using wireless body area networks (WBAN) in the presence of multiple health-cloud service providers (H-CSP). The theory of Social Network Analysis (SNA) is adopted to optimize the computational complexity and the traffic load of the network in an area, considering different disease types and the criticality indices of the WBANs. In such a scenario, Disease-centric Patient Group (DPG) formation among coexisting WBANs ensures optimized traffic load and reduced computational complexity. However, the formation of DPG alone is not sufficient to provide Quality-of-Service (QoS) to each WBAN. Therefore, to address these issues, we formulate a pricing model for the efficient mapping of critical WBANs from a DPG to a H-CSP to optimize the expected packet delivery delay and the network throughput. Consequently, to identify the critical WBANs from a DPG, we design a decision parameter based on an assortment of selection parameters. The performance of the Efficient Healthcare Management (HCM) scheme is analyzed based on distinct measures such as cost effectiveness, service delay, and throughput. Simulation results exhibit significant improvement in the network performance over the existing schemes.

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS: 

  • System : Pentium Dual Core.
  • Hard Disk : 120 GB.
  • Monitor : 15’’ LED
  • Input Devices : Keyboard, Mouse
  • Ram : 1 GB

SOFTWARE REQUIREMENTS: 

  • Operating system : Windows XP/UBUNTU.
  • Implementation : NS2
  • NS2 Version : 2.28
  • Front End : OTCL (Object Oriented Tool Command  Language)
  • Tool : Cygwin (To simulate in Windows OS)

REFERENCE:

Sudip Misra, Senior Member, IEEE, and Amit Samanta, Student Member, IEEE, “Traffic-Aware Efficient Mapping of Wireless Body Area Networks to Health Cloud Service Providers in Critical Emergency Situations”, IEEE Transactions on Mobile Computing, 2018.

Dynamic Connectivity Establishment and Cooperative Scheduling for QoS-Aware Wireless Body Area Networks

Dynamic Connectivity Establishment and Cooperative Scheduling for QoS-Aware Wireless Body Area Networks

ABSTRACT:

In a hospital environment, the total number of Wireless Body Area Network (WBAN) equipped patients requesting ubiquitous healthcare services in an area increases significantly. Therefore, increased traffic load and group-based mobility of WBANs degrades the performance of each WBAN significantly, concerning service delay and network throughput. In addition, the mobility of WBANs affects connectivity between a WBAN and an Access Point (AP) dynamically, which affects the variation in link quality significantly. To address the connectivity problem and provide Quality of Services (QoS) in the network, we propose a dynamic connectivity establishment and cooperative scheduling scheme, which minimizes the packet delivery delay and maximizes the network throughput. First, to secure the reliable connectivity among WBANs and APs dynamically, we formulate a selection parameter using a price-based approach. Thereafter, we formulate a utility function for the WBANs to offer QoS using a coalition game-theoretic approach. We study the performance of the proposed approach holistically, based on different network parameters. We also compare the performance of the proposed scheme with the existing state-of-the-art.

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS: 

  • System : Pentium Dual Core.
  • Hard Disk : 120 GB.
  • Monitor : 15’’ LED
  • Input Devices : Keyboard, Mouse
  • Ram : 1 GB

SOFTWARE REQUIREMENTS: 

  • Operating system : Windows XP/UBUNTU.
  • Implementation : NS2
  • NS2 Version : 2.28
  • Front End : OTCL (Object Oriented Tool Command  Language)
  • Tool : Cygwin (To simulate in Windows OS)

REFERENCE:

Amit Samanta, Student Member, IEEE, and Sudip Misra, Senior Member, IEEE, “Dynamic Connectivity Establishment and Cooperative Scheduling for QoS-Aware Wireless Body Area Networks”, IEEE Transactions on Mobile Computing, 2018.

TDA-MAC: TDMA Without Clock Synchronization in Underwater Acoustic Networks

TDA-MAC: TDMA Without Clock Synchronization in Underwater Acoustic Networks

ABSTRACT:

This paper investigates the application of underwater acoustic sensor networks for large scale monitoring of the ocean environment. The low propagation speed of acoustic signals presents a fundamental challenge in coordinating the access to the shared communication medium in such networks. In this paper, we propose two Medium Access Control (MAC) protocols, namely Transmit Delay Allocation MAC (TDA-MAC) and Accelerated TDA-MAC, that are capable of providing Time Division Multiple Access (TDMA) to sensor nodes without the need for centralized clock synchronization. A comprehensive simulation study of a network deployed on the sea bed shows that the proposed protocols are capable of closely matching the throughput and packet delay performance of ideal synchronized TDMA. The TDA-MAC protocols also significantly outperform T-Lohi, a classical contention-based MAC protocol for underwater acoustic networks, in terms of network throughput and, in many cases, end-to-end packet delay. Furthermore, the assumption of no clock synchronization among different devices in the network is a major advantage of TDA-MAC over other TDMA-based MAC protocols in the literature. Therefore, it is a feasible networking solution for real-world underwater sensor network deployments.

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS: 

  • System : Pentium Dual Core.
  • Hard Disk : 120 GB.
  • Monitor : 15’’ LED
  • Input Devices : Keyboard, Mouse
  • Ram : 1 GB

SOFTWARE REQUIREMENTS: 

  • Operating system : Windows XP/UBUNTU.
  • Implementation : NS2
  • NS2 Version : 2.28
  • Front End : OTCL (Object Oriented Tool Command  Language)
  • Tool : Cygwin (To simulate in Windows OS)

REFERENCE:

Nils Morozs, Member, IEEE, Paul Mitchell, Senior Member, IEEE and Yuriy Zakharov, Senior Member, IEEE, “TDA-MAC: TDMA Without Clock Synchronization in Underwater Acoustic Networks”, IEEE Access, 2018.

Path Finding for Maximum Value of Information in Multi-modal Underwater Wireless Sensor Networks

Path Finding for Maximum Value of Information in Multi-modal Underwater Wireless Sensor Networks

ABSTRACT:

We consider underwater multi-modal wireless sensor networks (UWSNs) suitable for applications on submarine surveillance and monitoring, where nodes offload data to a mobile autonomous underwater vehicle (AUV) via optical technology, and coordinate using acoustic communication. Sensed data are associated with a value, decaying in time. In this scenario, we address the problem of finding the path of the AUV so that the Value of Information (VoI) of the data delivered to a sink on the surface is maximized. We define a Greedy and Adaptive AUV Path-finding (GAAP) heuristic that drives the AUV to collect data from nodes depending on the VoI of their data. For benchmarking the performance of AUV path-finding heuristics, we define an integer linear programming (ILP) formulation that accurately models the considered scenario, deriving a path that drives the AUV to collect and deliver data with the maximum VoI. In our experiments GAAP consistently delivers more than 80% of the theoretical maximum VoI determined by the ILP model. We also compare the performance of GAAP with that of other strategies for driving the AUV among sensing nodes, namely, random paths, TSP-based paths and a “lawn mower”-like strategy. Our results show that GAAP always outperforms every other heuristic in terms of delivered VoI, also obtaining higher energy efficiency.

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS: 

  • System : Pentium Dual Core.
  • Hard Disk : 120 GB.
  • Monitor : 15’’ LED
  • Input Devices : Keyboard, Mouse
  • Ram : 1 GB

SOFTWARE REQUIREMENTS: 

  • Operating system : Windows XP/UBUNTU.
  • Implementation : NS2
  • NS2 Version : 2.28
  • Front End : OTCL (Object Oriented Tool Command  Language)
  • Tool : Cygwin (To simulate in Windows OS)

REFERENCE:

Petrika Gjanci, Chiara Petrioli, Stefano Basagni, Cynthia A. Phillips, Ladislau Bölöni and Damla Turgut, “Path Finding for Maximum Value of Information in Multi-modal Underwater Wireless Sensor Networks”, IEEE Transactions on Mobile Computing, 2018.

Co-EEORS: Cooperative Energy Efficient Optimal Relay Selection Protocol for Underwater Wireless Sensor Networks

Co-EEORS: Cooperative Energy Efficient Optimal Relay Selection Protocol for Underwater Wireless Sensor Networks

ABSTRACT:

Cooperative routing mitigates the adverse channel effects in the harsh underwater environment and ensures reliable delivery of packets from the bottom to the surface of water. Cooperative routing is analogous to sparse recovery in that faded copies of data packets are processed by the destination node to extract the desired informationCooperative routing mitigates the adverse channel effects in the harsh underwater environment and ensures reliable delivery of packets from the bottom to the surface of water. Cooperative routing is analogous to sparse recovery in that faded copies of data packets are processed by the destination node to extract the desired information. However, it usually requires information about the two or three position coordinates of the nodes. It also requires the synchronization of the source, relay and destination nodes. These features make the cooperative routing a challenging task as sensor nodes move with water currents. Moreover, the data packets are simply discarded if the acceptable threshold is not met at the destination. This threatens the reliable delivery of data to the final destination. To cope with these challenges, this paper proposes a cooperative energy efficient optimal relay selection (Co-EEORS) protocol for UWSNs. Unlike the existing routing protocols involving cooperation, the proposed scheme combines location and depth of the sensor nodes to select the destination nodes. Combination of these two parameters does not involve knowing the position coordinates of the nodes and results in selection of the destination nodes closest to the water surface. As a result, data packets are less affected by the channel properties. In addition, a source node chooses a relay node and a destination node. Data packets are sent to the destination node by the relay node as soon as the relay node receives them. This eliminates the need for synchronization among the source, relay and destination nodes. Moreover, the destination node acknowledges the source node about the successful reception or retransmission of the data packets. This overcomes packets drop. Based on simulation results, the proposed scheme is superior in delivering packets to the final destination than some existing techniques.

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS: 

  • System :         Pentium Dual Core.
  • Hard Disk : 120 GB.
  • Monitor : 15’’ LED
  • Input Devices : Keyboard, Mouse
  • Ram : 1 GB

SOFTWARE REQUIREMENTS: 

  • Operating system : Windows XP/UBUNTU.
  • Implementation : NS2
  • NS2 Version : 2.28
  • Front End : OTCL (Object Oriented Tool Command  Language)
  • Tool : Cygwin (To simulate in Windows OS)

REFERENCE:

Anwar Khan, Ihsan Ali, Atiq Ur Rahman, Muhammad Imran, Fazal-e-Amin and Hasan Mahmood, “Co-EEORS: Cooperative Energy Efficient Optimal Relay Selection Protocol for Underwater Wireless Sensor Networks”, IEEE Access, 2018.

An Energy-Aware and Void-Avoidable Routing Protocol for Underwater Sensor Networks

An Energy-Aware and Void-Avoidable Routing Protocol for Underwater Sensor Networks

ABSTRACT:

Underwater sensor networks (UWSNs) is facing a great challenge in designing a routing protocol with longer network lifetime and higher packet delivery rate (PDR) under the complex underwater environment. In this paper, we propose an energy-aware and void-avoidable routing protocol (EAVARP). EAVARP includes layering phase and data collection phase. During the layering phase, concentric shells are built around sink node, and sensor nodes are distributed on different shells. Sink node performs hierarchical tasks periodically to ensure the validity and real-time of the topology. It makes EAVARP apply to dynamic network environment. During the data collection phase, data packets are forwarded based on different concentric shells through opportunistic directional forwarding strategy (ODFS), even if there are voids. The ODFS takes into account the remaining energy and data transmission of nodes in the same shell, and avoids cyclic transmission, flooding, and voids. The verification and analysis of simulation results show that the effectiveness of our proposed EAVARP in terms of selecting performance matrics in comparison to existing routing protocols.

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS: 

  • System : Pentium Dual Core.
  • Hard Disk : 120 GB.
  • Monitor : 15’’ LED
  • Input Devices : Keyboard, Mouse
  • Ram : 1 GB

SOFTWARE REQUIREMENTS: 

  • Operating system : Windows XP/UBUNTU.
  • Implementation : NS2
  • NS2 Version : 2.28
  • Front End : OTCL (Object Oriented Tool Command  Language)
  • Tool : Cygwin (To simulate in Windows OS)

REFERENCE:

Zhuo Wang, Guangjie Han, Hongde Qin, Suping Zhang, Yancheng Sui, “An Energy-Aware and Void-Avoidable Routing Protocol for Underwater Sensor Networks”, IEEE Access, 2018.