Recouping the Modified Data in Intruder-Based Environment

Recouping the Modified Data in Intruder-Based Environment

Ambika Nagaraj (Dayananda Sagar College of Engineering, Bengaluru, India)
DOI: 10.4018/IJERTCS.2014070102
OnDemand PDF Download:
No Current Special Offers


Sensor networks are playing an important role in many applications. These networks mainly used as monitoring tool are deployed in harsh and unsupervised environment. Hence securing these nodes and the data which is being transmitted becomes a basic requirement. To adapt security to the network, the study uses cluster-based arrangement of nodes. The encryption key is generated based on location, which enhances security by incorporating authentication, reliability and confidentiality of data. The packets are being analysed for its fidelity by the nodes which fall in path of the base station. Compared to the previous contributions certain amount of energy is conserved. Addition to this procedure, the data can be retrieved if modified by the adversary. The scheme enhances the security against sinkhole, wormhole and Sybil attacks.
Article Preview

1. Introduction

New technologies are making a break through the previous ones reducing the human effort, amplifying speed of production and its productivity. Any technology is brought into reality to ease human effort and to provide better living style. The basic design of a sensor consists of transmitter, sensor and receiving components. Earlier these nodes were not used in some applications due to their limitations. Redefining the design made these devices usable in many applications discussed by many authors in their work (Pottie & Kaiser, 2000) (Chong & Kumar, 2003)(Hakala, Tikkakoski & Kivela, 2008) (Zhuang, Goh, & Zhang, 2007) (Gungor & Hancke, 2009), from simple to complex. Some of the applications where these sensors are one of the essential part includes military surveillance portrayed by the author in the work (Sang Hyuk Lee, Soobin Lee, Heecheol Song & Hwang Soo Lee, 2009), habitat monitoring discussed by authors (Alan, David & Joseph, 2002) (Robert, Eric, Joseph & Michael, year) (Naumowicz, Freeman, Kirk, Dean, Calsyn, Liers, Braendle, Guilford & Schiller, 2010), forest fire detection illustrated by the authors in their work (Hefeeda, Bagheri, Simon & Surrey, 2007) (Mal-Sarkar, Sikder & Konangi,2010) etc.

These tiny devices is mentioned by the author (Akyildiz, Su, Sankarasubramaniam, & Cayirci, 2002) are adding a better value to life by monitoring and tracking the object of interest. These nodes collaborate together to accomplish a defined task. The nodes can gather information without any human intervention and communicate to the required pre-defined destination. The adversary can take an advantage of this and access to the confidential data stored in the nodes. The intruders camouflage as a member of the cluster and falsify the visualization of the network. Hence these intruders have to be detected and detached from the network on time. To avail this facility, a better algorithm has to be devised.

The paper is modelled to enhance security to the data being transmitted. To do so, the proposed work uses static nodes to sense the environment. Mobile robots are utilized to provide the location details and they are involved in authenticating the cluster head. Four kinds of detectors are being positioned at different locations in the network to ensure reliability to the network. The proposed model provides integrity, reliability and confidentiality similar to the work proposed by other authors (Aysal & Barner, 2008) (Giruka, Singhal, Royalty, Varanasi, 2008) (Kundur, Luh, Okorafor, Zourntos, 2008) (Wang, Attebury, Ramamurthy, 2006).

The contributions of the paper are as follows:

Complete Article List

Search this Journal:
Open Access Articles
Volume 13: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 2 Issues (2018)
Volume 8: 2 Issues (2017)
Volume 7: 2 Issues (2016)
Volume 6: 2 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing