scispace - formally typeset
Search or ask a question
Author

Kathryn Ploskina

Bio: Kathryn Ploskina is an academic researcher from Temple University. The author has contributed to research in topics: Mobile computing & Redundancy (engineering). The author has an hindex of 1, co-authored 1 publications receiving 22 citations.

Papers
More filters
Proceedings ArticleDOI
20 Jul 2009
TL;DR: A reliability model which can be used to analyze the performance and power consumption in resource constrained, data rate scarce, mobile agent-based wireless sensor network (WSN) systems is described and a method to determine an optimal power management scheme by computing an efficient duty cycle in mobileAgent-based multisensory WSN systems is developed.
Abstract: In this paper, we describe a reliability model which can be used to analyze the performance and power consumption in resource constrained, data rate scarce, mobile agent-based wireless sensor network (WSN) systems. The primary model is referred to as a generalize access structure congestion (GGC) system [3] which is an extended model from a circular sequential k-out-of-n congestion (CSknC) [2]. There are many other reliability models which can be used to study WSN systems, but they are not suitable to analyze and address mobile agent-based multisensory WSN systems. These systems are not based on a centralized architecture because they use mobile agent technologies to distribute decision tasks at local nodes. By employing mobile agent technologies, the systems can make accurate decisions quickly and reduce data rate and data redundancy problems. An important research problem is to determine how to maintain efficient duty cycle by using multiple types of sensors without centralized architecture and with mobile agent technologies. From the GGC model, we can develop a method to determine an optimal power management scheme by computing an efficient duty cycle in mobile agent-based multisensory WSN systems.

22 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: TARF, a robust trust-aware routing framework for dynamic WSNs, is designed and implemented and proves effective against those harmful attacks developed out of identity deception; the resilience of TARF is verified through extensive evaluation with both simulation and empirical experiments.
Abstract: The multihop routing in wireless sensor networks (WSNs) offers little protection against identity deception through replaying routing information. An adversary can exploit this defect to launch various harmful or even devastating attacks against the routing protocols, including sinkhole attacks, wormhole attacks, and Sybil attacks. The situation is further aggravated by mobile and harsh network conditions. Traditional cryptographic techniques or efforts at developing trust-aware routing protocols do not effectively address this severe problem. To secure the WSNs against adversaries misdirecting the multihop routing, we have designed and implemented TARF, a robust trust-aware routing framework for dynamic WSNs. Without tight time synchronization or known geographic information, TARF provides trustworthy and energy-efficient route. Most importantly, TARF proves effective against those harmful attacks developed out of identity deception; the resilience of TARF is verified through extensive evaluation with both simulation and empirical experiments on large-scale WSNs under various scenarios including mobile and RF-shielding network conditions. Further, we have implemented a low-overhead TARF module in TinyOS; as demonstrated, this implementation can be incorporated into existing routing protocols with the least effort. Based on TARF, we also demonstrated a proof-of-concept mobile target detection application that functions well against an antidetection mechanism.

208 citations

Journal ArticleDOI
TL;DR: In this paper, the complete sets of nodes are differentiated into three different types based on their functionality as Inspector Node (IN), Cluster Head (CH), and Member Nodes (MN).
Abstract: Selective forwarding attacks in WSN can damage many mission-critical applications, like military surveillance and forest fire censoring. In such attacks, malicious nodes most of the time functions like regular nodes, but sometimes drop sensitive packets selectively, like a packet recording the dissimilar power' activity, making it more difficult to identify their malicious intent. The current selective forwarding attack detection schemes, randomly select checkpoint nodes, available in-between nodes within a forwarding route, which are responsible for producing acknowledgments for each received packet. In this paper, the complete sets of nodes are differentiated into three different types based on their functionality as Inspector Node (IN), Cluster Head (CH), and Member Nodes (MN). The newly considered node as IN is considered to overhear all of the activities of the Cluster head, as CH is the most compromising node in the complete cluster, and in the case, if the CH is attacked then the complete cluster stops working in the network. The IN is trained based on certain rules and predefined parameters which analyses if the CH or MN is malicious or not and considers the required action. NS2 is considered for the simulation of the proposed methodology and also for the validation of the proposed work. In the proposed methodology, two different stages are considered as detection and correction, which works to tackle the attacks and also considering the system efficiency almost. As in the proposed methodology, the effect of the attack is minimized which increases the QOS and also better data transmission.

21 citations

Proceedings ArticleDOI
20 Mar 2013
TL;DR: The comparison analysis based on normal TARF and Secured Fuzzy based trust aware routing framework (FBTARF) model is developed and the results show that the secured fuzzy model provides better results in terms of security, packet delivery ratio and energy conservation.
Abstract: Wireless sensor networks (WSN) are the ideal domain for applications involving critical security events like military surveillance and detection of forest fire. Wireless sensor networks involve multi-hop routing and it offer minor security against identity deception through replaying routing information. The trust factor in the routing environment plays an important role in the military surveillance and related applications. Secured data aggregation is an important criterion that attracts serious research work. The factors reasonable in such harsh WSN are increased complexity, high overhead and poor link quality in case of various cryptographic techniques. These problems need to be addressed and overcome with the help of appropriate framework mechanisms. The analysis is further enhanced by mobile and harsh network conditions. Current trust-aware routing protocols using traditional cryptographic techniques are not capable of effectively tackling this serious problem. To secure the WSN and to regularise the multi-hop routing techniques, the present work has been designed and implemented. A Fuzzy Based Trust-Aware Routing Framework (FBTARF) is the proposed method for security improvisation in dynamic WSN. FBTARF provides energy-efficient routing and reliable trust using fuzzification methods. Also, FBTARF provides the effective solution against harmful attacks due to identity deception. The dynamic nature of FBTARF is analysed by means of detailed evaluation using simulation and empirical experimental procedures. This has been studied for large-scale WSN under various environments including mobile and harsh network conditions. To improvise the security parameters, the proposed work is developed using a Fuzzy Based Trust Model which simultaneously considers multiple constraints and provides better security and energy conservation. The secured FBTARF model also provides effective and efficient routing in the dynamic wireless sensor network environment. Then, the comparison analysis based on normal TARF and Secured Fuzzy based trust aware routing framework (FBTARF) model is developed and the results show that the secured fuzzy model provides better results in terms of security, packet delivery ratio and energy conservation.

14 citations

Proceedings ArticleDOI
15 Jul 2010
TL;DR: The state of the art in data aggregation of WMSN is presented, which is essential for WMSN to be reusable and cost-efficient.
Abstract: The advance in CMOS camera and wireless sensor network (WSN) has promoted the development of wireless multimedia sensor network (WMSN), which can collect more abundant video data and image data. One important enabling technology for WMSN is data aggregation, which is essential for WMSN to be reusable and cost-efficient. The data aggregation technologies can be divided into three parts, namely, data acquisition, data transmission and data processing. This paper presents the state of the art in data aggregation of WMSN according to this category.

10 citations

Journal ArticleDOI
TL;DR: This protocol is designed by incorporating the trust aware routing frame work with adaptive periodic threshold sensitive energy efficient network protocol, which provides a better QOS with trustworthy and energy efficient route which leads to increase the network life time.
Abstract: A wireless sensor networks encompasses battery powered sensor nodes with extremely limited processing capabilities. One of the major challenges in WSN is to overcome the attacks like Sinkhole, Wormhole and Sybil, Dos attacks, Selective forwarding etc. which reduces the performance of the network, since the Cryptographic techniques are not much effective in solving this problem. So in order to protect wireless sensor networks from attacks and to perform improvement in some of the aspects we have implemented a low overhead trust aware routing with energy efficient network protocol. This protocol is designed by incorporating the trust aware routing frame work with adaptive periodic threshold sensitive energy efficient network protocol. By minimizing the attacks, the network provides a better QOS with trustworthy and energy efficient route which leads to increase the network life time.

7 citations