scholarly journals Provenance Transmission through a Two-Dimensional Covert Timing Channel in WSNs

2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
Qinbao Xu ◽  
Li Liu ◽  
Rizwan Akhtar ◽  
Muhammad Asif Zahoor Raja ◽  
Changda Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Theoretical Analysis ◽  
Channel Capacity ◽  
Packet Transmission ◽  
Wireless Sensor ◽  
Two Dimensional ◽  
Timing Channel ◽  
Cantor Expansion ◽  
History Of ◽  
Covert Timing Channel

Provenances, which record the history of data acquisition and transmission, are hard to be transmitted in resource-tightened wireless sensor networks (WSNs) due to their drastic size expansion with the increase in packet transmission hops. To ease the burden caused by the provenance transmission, we first designed a two-dimensional covert timing channel (2dCTC) and then applied it to provenances transmission in WSNs. Based on Cantor Expansion, 2dCTC uses pseudo packet IDs permutation and packet sizes variation together to form a two-dimensional communication medium. Both theoretical analysis and experimental results show that 2dCTC not only has a much higher channel capacity than those of most of the known CTCs, but also conserves more energy for provenance transmission in WSNs. Furthermore, 2dCTC provides a new way to increase CTCs channel capacity and stealthiness through multi-dimensional approaches.

scholarly journals Failure Node Detection and Recovery in Wireless Sensor Networks

2019 ◽  
Vol 8 (12) ◽  
pp. 5226-5230
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Privacy ◽  
Conditional Random Field ◽  
Identification Problem ◽  
Packet Transmission ◽  
Wireless Sensor ◽  
Fault Recovery ◽  
Distributed Sensors ◽  
History Of

A Wireless Sensor Network may often consist of hundreds of distributed sensors. Our goal is to formulate wireless sensor networks (WSNs) fault identification problem in terms of pattern classification and to introduce a newly developed algorithm, neighbor node hidden conditional algorithm (NHCA) to determine the unknown path through which packets are transmitted from source to destination. We propose a concept of fault recovery in WSN using clustering. This includes the protocols of Dynamic Delegation based Efficient Broadcast and Neighborhood Hidden Conditional Random Field Algorithm. The history of transmission is classified according to the pattern, sorted and ranked along with the cluster information. The data privacy is maintained with in the cluster during the packet transmission apart from the destination which may present outside the cluster. The leader of the cluster is restricted only to view the transmission path in order to maintain the confidentiality of the data transmitted. Our simulation results strongly enforce fault recovery in quick time and also maintain the confidentiality of data.

scholarly journals How Should We Categorize Approaches to the History of Political Thought?

2020 ◽  
Vol 83 (1) ◽  
pp. 91-114
Author(s):  
Adrian Blau
Keyword(s):  
Theoretical Analysis ◽  
Political Theory ◽  
Political Thought ◽  
Two Dimensional ◽  
History Of Political Thought ◽  
One Dimensional ◽  
History Of ◽  
New Framework

AbstractThis paper proposes a new framework for categorizing approaches to the history of political thought. Previous categorizations exclude much research; political theory, if included, is often caricatured. And previous categorizations are one-dimensional, presenting different approaches as alternatives. My framework is two-dimensional, distinguishing six kinds of end (two empirical, four theoretical) and six kinds of means. Importantly, these choices are not alternatives: studies may have more than one end and typically use several means. Studies with different ends often use some of the same means. And all studies straddle the supposed empirical/theoretical “divide.” Quentin Skinner himself expertly combines empirical and theoretical analysis—yet the latter is often overlooked, not least because of Skinner's own methodological pronouncements. This highlights a curious disjuncture in methodological writings, between what they say we do, and what we should do. What we should do is much broader than existing categorizations imply.

scholarly journals Optimized Energy Efficient Trust Aware System in Wireless Sensor Networks

2017 ◽  
Vol 2 (1) ◽  
Author(s):  
Palak Aggarwal ◽  
Santosh Kumar ◽  
Neha Garg ◽  
Sumeshwar Singh
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
False Alarm ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Packet Transmission ◽  
Secure Routing ◽  
Wireless Sensor ◽  
Packet Drop

Energy and security are very important issues in Wireless Sensor Networks (WSN) which need to be handled. These issues are interrelated because of limited energy there are some restrictions on implementation of security. Insider packet drop attack is one of the dangerous attacks for wireless sensor network that causes a heavy damage to WSN functionalities by dropping packets. It becomes necessary to identify such attack for secure routing of data in WSN. To detect this attack, trust mechanism has been proven as a successful technique. In this mechanism, each node verifies the trustworthiness of its neighbor node before packet transmission so that packets can only be transmitted to trustworthy nodes. But there is a problem of False Alarm with such trust-aware scheme. False alarm occurs when a good node’s trust value goes down due to natural packet dropping and being eliminated from the routing paths. This wastes network’s resources that further shortens network lifetime. In this paper, we have proposed a system for identification and recovery of false alarms (IRFA) which is the optimization of existing trust based system. But security solution needs to be energy efficient due to scarcity of energy resources in WSN. To provide energy efficiency, we have implemented proposed IRFA system in cluster based environment which detects insider packet drop attackers in an energy efficient manner. We have conducted OMNET++ simulation and results demonstrate that the proposed system performance is better than existing trust-based system in terms of packet delivery rate and energy efficiency which improves network lifetime.

Sensor Data Geographic Forwarding in Two-Dimensional and Three-Dimensional Spaces

2017 ◽  
pp. 317-352
Author(s):  
Habib M. Ammari ◽  
Amer Ahmed
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Three Dimensional ◽  
Geographic Routing ◽  
Sensor Nodes ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Two Dimensional ◽  
Geographic Forwarding ◽  
Limited Power

A wireless sensor network is a collection of sensor nodes that have the ability to sense phenomena in a given environment and collect data, perform computation on the gathered data, and transmit (or forward) it to their destination. Unfortunately, these sensor nodes have limited power, computational, and storage capabilities. These factors have an influence on the design of wireless sensor networks and make it more challenging. In order to overcome these limitations, various power management techniques and energy-efficient protocols have been designed. Among such techniques and protocols, geographic routing is one of the most efficient ways to solve some of the design issues. Geographic routing in wireless sensor networks uses location information of the sensor nodes to define a path from source to destination without having to build a network topology. In this paper, we present a survey of the existing geographic routing techniques both in two-dimensional (2D) and three-dimensional (3D) spaces. Furthermore, we will study the advantages of each routing technique and provide a discussion based on their practical possibility of deployment.

scholarly journals A Fuzzy-Decision Based Approach for Composite Event Detection in Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-20 ◽  
Author(s):  
Shukui Zhang ◽  
Hao Chen ◽  
Qiaoming Zhu ◽  
Juncheng Jia
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Event Detection ◽  
Dominating Set ◽  
Wireless Sensor ◽  
Rule Base ◽  
Detection Accuracy ◽  
Two Dimensional ◽  
Fuzzy Decision ◽  
Composite Event

The event detection is one of the fundamental researches in wireless sensor networks (WSNs). Due to the consideration of various properties that reflect events status, the Composite event is more consistent with the objective world. Thus, the research of the Composite event becomes more realistic. In this paper, we analyze the characteristics of the Composite event; then we propose a criterion to determine the area of the Composite event and put forward a dominating set based network topology construction algorithm under random deployment. For the unreliability of partial data in detection process and fuzziness of the event definitions in nature, we propose a cluster-based two-dimensionalτ-GAS algorithm and fuzzy-decision based composite event decision mechanism. In the case that the sensory data of most nodes are normal, the two-dimensionalτ-GAS algorithm can filter the fault node data effectively and reduce the influence of erroneous data on the event determination. The Composite event judgment mechanism which is based on fuzzy-decision holds the superiority of the fuzzy-logic based algorithm; moreover, it does not need the support of a huge rule base and its computational complexity is small. Compared to CollECT algorithm and CDS algorithm, this algorithm improves the detection accuracy and reduces the traffic.

scholarly journals A novel energy-aware routing protocol in intermittently connected delay-tolerant wireless sensor networks

2017 ◽  
Vol 13 (7) ◽  
pp. 155014771771738 ◽  
Author(s):  
Min Wook Kang ◽  
Yun Won Chung
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Probabilistic Routing ◽  
History Of ◽  
Delay Tolerant ◽  
Overhead Ratio ◽  
Intermittently Connected

In delay-tolerant wireless sensor networks, messages for sensor data are delivered using opportunistic contacts between intermittently connected nodes. Since there is no stable end-to-end routing path like the Internet and mobile nodes operate on battery, an energy-efficient routing protocol is needed. In this article, we consider the probabilistic routing protocol using history of encounters and transitivity protocol as the base protocol. Then, we propose an energy-aware routing protocol in intermittently connected delay-tolerant wireless sensor networks, where messages are forwarded based on the node’s remaining battery, delivery predictability, and type of nodes. The performance of the proposed protocol is compared with that of probabilistic routing protocol using history of encounters and transitivity and probabilistic routing protocol using history of encounters and transitivity with periodic sleep in detail, from the aspects of delivery ratio, overhead ratio, delivery latency, and ratio of alive nodes. Simulation results show that the proposed protocol has better delivery probability, overhead ratio, and ratio of alive nodes, in most of the considered parameter settings, in spite of a small increase in delivery latency.

Sign in / Sign up

Export Citation Format

Share Document