Replica Node Detection using Enhanced Single Hop Detection

5181 words (21 pages) Essay

29th Aug 2017 Computer Science Reference this


Disclaimer: This work has been submitted by a university student. This is not an example of the work produced by our Essay Writing Service. You can view samples of our professional work here.

Any opinions, findings, conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of



Sensor systems are being theme of enthusiasm among the scholarly community and industry because of those broad variety relevance in different system situations. WSNs comprise of an expansive number of little sensors, generally sent thickly in the objective territory to gather important information [1, 2]. Hubs pertaining to Sensors are asset obliged because of their little dimension plus it restricts the capacity of calculation and correspondence. The most widely recognized utilizations of WSNs incorporate living space checking, fringe watching in military, movement observing, and quiet observing in human services [3, 4]. In MWSNs [5, 6], hubs pertaining to sensor have extra portability capacity to meander inside an objective region. Versatile sensor hubs can give precise information contrasted with static hubs. The sensor quantity needed in MWSNs to cover an allocated region is extremely smaller than static WSNs. By and by, thick sending of portable hubs bolsters high unwavering quality and load adjusting. Regardless of all focal points, MWSNs have an exceptionally dynamic system topology because of versatility. Along these lines, the difficulties are duplicated contrasted with their static partners. The real difficulties incorporate correspondence, scope, distributive helpful manage, and safety [7, 8]. Safety has dependably been a basic issue of worry in WSNs [9]. WSN (Remote Sensor Network) contains a gathering of remote sensor hubs that forma correspondence arranges. These hubs gather the touchy data from the area in addition to propel those substance as an information to the foundation location at which it checks the information as well as ID transferred by the hubs pertaining to sensor. These sensor hubs are typically low valued equipment segments with imperatives on reminiscence dimension as well as calculation abilities. The transportable WSNs are like WSN aside from to facilitate the hubs pertaining to sensor are portable in character. The different utilizations of Mobile WSNs incorporate mechanical autonomy, transportation framework, reconnaissance, and following. Analysts center to incorporate Mobile WSNs into “the (Internet of Things) IoT” [10]. Nonetheless, an immense measure of safety problem emerges as assaults because of absence of equipment support and shaky sensor hubs. One such assault is the hub replication assault. In sensor systems, aggressors catch and trade off hubs to infuse fake information into the system that influence the system correspondence plus functions. Such kind of assault has been recognized as reproduction hub assault [11]. The foe catches mystery inputs as of the traded off hubs also distributes those in terms of reproductions in the system. Reproductions have been imitated as legit via the nearby hubs plus typical hubs don’t know about imitations send signals such as its nearby hubs. It likewise connives and goes about as honest to goodness hub that gives immovability to the system. The copy hubs have been managed by the foe. The issue is the reproduction hubs likewise hold the input which has been needed for safe correspondence in the system. Notwithstanding these issues, versatility of hubs, the plot of imitation, and sideway assaults are the principle trouble while distinguishing plus managing those copy hubs. At the point when the reproductions are not distinguished, then the system will be interested in aggressors and the system turns out to be more powerless. The recognition of copy hub in the Mobile WSNs has been a significant undertaking. In this way, just few location plans are being suggested [12]. Since the enemy appropriates imitation hubs wherever in the system, the versatility helped recognition plan has been needed to distinguish the copies in the system. In the prior works, versatility helped system, (Single Hop Detection) SHD, was proposed. In Single Hop Detection, every hub communicates its area maintain to its solitary jump neighbors and chooses the witness hub.[13] The chose witness hub recognizes reproductions by playing out the confirmation procedure. Subsequently, it lessens correspondence overhead. Notwithstanding, when the reproductions plot by means of every additional, they select imitation as an observer hub. Consequently, the recognition exactness has been less. The primary target pertaining to the suggested study has been to enhance the location exactness through the selection of the suitable witness hub with decreased overheads amid the discovery of copy hubs in the portable remote sensor systems. To congregate the goal, SHD is improved utilizing the AIS. Counterfeit Immune System (AIS) is a division of Artificial Intelligence in view of the standards of (HIS) Human Immune System. It gives different answers for this present reality issues because of its trademark highlights. The trademark highlights incorporate learning capacity to the novel circumstances, flexibility and dispersed personality to the various environment, restricted assets, as well as the ability to survive still in the brutal situations.[14] The upgrade of Single Hop Detection with AIS enhances the discovery precision. The commitment behind the research study tries to incorporate the upgrade of the SHD technique through application of the Clonal assortment calculation to select the observer hubs which has been a different commitment. Because of this, the discovery proportion is expanded through the selection of proper witness hubs and accordingly, the reproduction hub location handle causes least manage overheads.


Safety of Mobile WSNs is an indispensable test. One has been the hub replication assault, having a similar character of the caught hub, and the foe conveys an eccentric number of copies all through the system. Henceforth copy hub recognition is an imperative test With little exertion, a foe may catches, examinations, and repeats those of them as well as embed these copies at various areas inside the systems. Such assault may have a few results and may degenerate system information or critical divisions pertaining to the system. Existing strategies acquire manage overheads plus the discovery exactness has been little at which the copy is chosen in the form of an observer hub. The present study tries to suggest with regard to the improving of the SHD (Single Hop Detection) technique utilizing the Clonal assortment calculation to distinguish the duplicate through choosing the appropriate observer hubs. The benefits of the suggested strategy incorporate (i) increment in the identification proportion, (ii) Decline in the management overhead, plus (iii) increment in throughput. The discovery rate likelihood alludes to location of the threat assault in a constrained era. The likelihood of recognition periods demonstrates that proposed technique distinguished the imitations in brisk, compelling and productive way. Something else, there could be a plausibility that an aggressor can exploit the late recognition to catch the entire correspondence. Vitality is likewise an essential parameter in reproduction location in light of the fact that an aggressor needs high vitality to screen the entire system. So also, the vitality of the portable hub ought to be effective to play out the recognition and alleviation handle for replication assaults. The likelihood of vitality that portable hub devours in the distribution plus getting messages by versatile hubs. The correspondence cost for discovery imitations ought to be attractive and high. Each versatile hub needs to amass the data, check and direct the examination for clones’ assaults identification (i.e., if similar hub character has been found). The recognition system ought to have high genuine optimistic speed (replica hubs are identified effectively) as well as the less untrue optimistic speed (typical hub is blamed as a replica). The execution of pertaining to the suggested study is measured utilizing identification proportion, false recognition proportion, parcel conveyance proportion, normal postponement, management overheads as well as throughput. The execution is done utilizing ns-2 to display the reality of the suggested study.


The identification plans intended for still WSNs have not been material to MWSNs because of element system topology. An identification component in MWSNs should consider the portability of a hub with a specific end goal to distinguish copy [15]. The reproduction discovery instruments in MWSNs likewise stated in the writing are depicted underneath. The identification plans UTLSE (Unary-Time-Location Storage and Exchange) and MTLSD (Multi-Time-Location Storage and Diffusion) suggested [16] receive time-area guarantee approach. Every hub in Unary-Time-Location Storage and Exchange and Multi-Time-Location Storage and Diffusion saves various occurrences of time-area maintain of the followed hubs. With the gathering, of the time-area plans are traded flanked by two trackers to confirm the possibility of area cases. At the point when a contention emerges in the time-area confirmation procedure of a hub, it is distinguished as reproduction. A location conspire utilizing hub’s pace has been suggested [17]. The plan utilizes SPRT (Sequential Probability Ratio Test) to register hub’s speed. At the point when a hub touches base at another area, it communicates now is the ideal time area state to the nearby hubs. Neighbors forward the got maintain to BS following effectively confirming the realness of the communication. The BS is in charge of social event time-area cases of the hubs plus evaluates their speed. A hub possessing the pace that is greater when compared to it has already defined with a pace cutoff is identified as reproduction through the BS. A pair wise key foundation procedure to recognize presence of reproduction is displayed [18]. The aggregate quantity pertaining to the pairwise keys set up by a hub is put away utilizing Counting Bloom channel. The tally of total keys in numbers built up is intermittently transferred to the BS viaevery hub. The got Counting Bloom channels are redesigned at BS for every hub in the system. At the point when the quantity of keys built up for a hub surpasses the predefined edge esteem, the hub is distinguished as copy by the BS. A solitary bounce based reproduction location plan has been suggested [19]. In the present work of the researchers, the observershub determination strategy for single-bounce imitation discovery is enhanced by utilizing clonal choice calculation. The best reasonable observer for a hub in its single-bounce neighbor is chosen utilizing the clonal choice calculation. The area unique finger impression sharing and confirmation strategy is utilized to recognize reproduction. The (Extremely Efficient Detection) XED plus EDD (Efficient Distributed Detection) plans have been suggested [20]. The recognition of copy in XED is based upon the trading of an irregular number between every combine of hubs, which is additionally called a test. At the point when a similar match of hubs gets together at a later purpose pertaining to the time, the test check has been executed. A hub that comes up short the test check process is recognized as a reproduction. In the Efficient Distributed Detection, a reproduction is identified in light of the tally pertaining to the quantity of gatherings between a couple of hubs. In the event that the quantity of gatherings of a hub over a period interim surpasses the predefined edge, after that it is recognized as copy. In the identification plans, the imitations are recognized through the BS. In these plans, BS is overloaded with calculation and reproduction discovery undertakings. There is likewise an extra in the clouds within the system for imparting between every one of the hubs and the BS. The XED component is not versatile to taking of test from a caught hub. In EDD plot, the execution of identification component relies on upon the quantity of gatherings edge, which is hard to assess in MWSNs. This has been on the grounds that the quantity of gatherings with a hub over a period interim relies on upon the system measure, the range of organization, hub’s pace, plus the versatility replica of the hubs. It alters with the variety of some of these constraints in the system. For instance, if the system size is expanded, then the quantity of gatherings with a specific hub diminishes, as prob ” 1/arrange measure. Assessing an edge upon the quantity of gatherings with a hub in the absence of taking into consideration the variety of the previously mentioned parameters may bring about false recognition. In the plan suggested [21], the imitation is recognized exclusively in light of a solitary instance of contention with the deliberate pace. The pace is registered utilizing the Euclidean separation between reported areas of a hub over a period interim. This might not register the real pace of a hub in the system with irregular waypoint portability demonstrate. At the point when a hub moves quicker by altering the course as often as possible, it never takes after a straight way. In addition, since the areas of copy and the first hub are utilized to gauge the straying velocity, the enemy may convey the reproductions to draw inside nearer buildings of the first hub to maintain the deliberate speed inside the acknowledged assortment. In the plan suggested , the area unique mark system is not reasonable for MWSN, because of the lively topography of the system. Also, choice of a solitary witness hub may prompt to low imitation recognition likelihood, at which the nearby hubs are every now and again changing after some time. The copy discovery process ought not choose in light of one time clashing conduct of a hub and its imitation while utilizing the parameters, for example, pace as well as the quantity of gatherings, yet rather conduct ought to be seen over various time interims display the (XED) eXtremely Efficienty Detection technique. This is an appropriated recognition calculation for versatile systems where the discovery depends upon the information traded between the hubs in the system. It recognizes the reproduction in view of the arbitrary number traded among one another pertaining to the two hubs. The recognition capacity is debased when the copies trade the correct arbitrary esteem. [22] Suggested SHD (Single Hop Detection) technique. It is a versatility helped based ispersed recognition technique. In SHD technique, when a hub shows up at various neighborhood group, imitation is identified. This strategy enhances the correspondence overhead.


The suggested upgraded SHD technique makes utilization of the Clonal determination calculation for the improvement. The improved SHD is like SHD with the exception of that the choice of witness hubs is finished through the Clonal assortment calculation. The suggested CSSHD like SHD comprises of unique mark claim and unique finger impression check stages. In the unique mark assert stage, the unique finger impression of the hub’s neighbors is traded between the one-jump neighborhoods. The determination of witness hub is based upon the choice of lymphocytes at large in the Clonal collection calculation. The hub which has been most extreme capacity to forward information is chosen as witness hub. The greatest capacity of the observer hub is dictated by its sending ability. The sending capacity is controlled through the faith estimation of the hub. The trust esteem is ascertained in view of the information bundle sending proportion (DFR) as well as the manage parcel sending proportion (PFR). The suggested CSSHD strategy aids in choosing the suitable witness hub. Consequently, the recognition exactness can be enhanced by distinguishing the copies with least control overheads. Amid experimentation, the attributes of every hub in the system and its execution are investigated utilizing the suggested CSSHD technique. The proposed philosophy is tried utilizing NS-2 test system, which is basic and surely understood system test system apparatus. The adaptation pertaining to NS-2 has been ns-This device is for the most part utilized as a part of the recreation region of MANET, remote sensor system, VANET, et cetera. Amid the reproduction time, the insights are gathered. The insights incorporates information parcels got, control bundles created, sent parcels, aggregate of all parcels delay, add up to number of got bundles, add up to number of reproduction hubs accurately discovered, add up to bytes got every second and aggregate quantity of kilobytes. Utilizing the above measurements, the accompanying measurements are characterized: (i) Packet conveyance proportion, (ii) Control overhead, (iii) Standard postponement, (iv) Communication fall (v) Throughput, (vi) Discovery proportion, (vii) False caution rate, The execution pertaining to the suggested strategy is assessed as far as the given factors. The suggested study tries to improve its execution in every one of the measurements; especially, the discovery proportion is enhanced much superior to the current technique.


In versatile WSN, hub replication assault is an essential one. The different reproduction recognition techniques are data traded based identification, hub meeting based location, and the portability based discovery. Of all the above mentioned three copy recognition techniques, the suggested study focuses on the versatility helped based location strategy.. The planned study upgrades the SHD strategy utilizing Clonal Selection calculation of AIS to enhance the recognition proportion through the choice of the good eyewitness hub. The suggested CSSHD strategy is utilized as a part of a completely appropriated environment where correspondence happens among single jump neighbors, exceedingly solid against hub plot and effective in securing against different copy hubs. The test is directed utilizing the ns-2 test system. The proposed technique is being great throughput, little above head and less untrue caution rate. The aftereffects pertaining to the suggested approach are contrasted and existing technique which demonstrates that the normal deferral, manage in the clouds, and communication drop have been minimized with higher bundle conveyance ortion esteem and higher recognition proportion. This demonstrates the proposed technique is proficient towards identifying duplicates which have been not flexible against deceitful reproductions with least control


  1. M. Carlos-Mancilla, E. L´opez-Mellado, and M. Siller (2016) , “Wireless sensor networks formation: approaches and techniques,” Journal of Sensors, vol. 2016,Article ID 2081902, 18 pages.
  1. S. Tanwar, N. Kumar, and J. J. P. C. Rodrigues (2015.) , “A systematic review on heterogeneous routing protocols for wireless sensor network,” Journal of Network and Computer Applications, vol. 53, pp. 39-56.
  1. A. Hadjidj, M. Souil, A. Bouabdallah, Y. Challal, and H. Owen (2013) , “Wireless sensor networks for rehabilitation applications: challenges and opportunities,” Journal of Network and Computer Applications, vol. 36, no. 1, pp. 1-15.
  1. K. Sohraby, D. Minoli, and T. Znati (2007) , Wireless Sensor Networks Technology, Protocols, and Applications , John Wiley & Sons ,New York, NY, USA.
  1. J. Rezazadeh, M. Moradi, and S. A. Ismail (2012) , “Mobile wireless sensor networks overview,” International Journal of Computer Communications and Networks, vol. 2, no. 1, pp. 17-22.
  1. I. Amundson and X. D. Koutsoukos (2009) , “A survey on localization for mobile wireless sensor networks,” in Mobile Entity Localization and Tracking in GPS-less Environnments: Second International Workshop, MELT , Orlando, FL, USA, September 30, 2009. Proceedings, vol. 5801 of Lecture Notes in Computer Science, pp. 235-254, Springer, Berlin, Germany.
  1. Y. Yu, K. Li, W. Zhou, and P. Li (2012) , “Trust mechanisms in wireless sensor networks: attack analysis and countermeasures,” Journal of Network and Computer Applications, vol. 35, no. 3, pp. 867-880.
  1. C. Zhu, L. Shu, T. Hara, L.Wang, S. Nishio, and L. T. Yang (2011) , “A survey on communication and data management issues in mobile sensor networks,” Wireless Communications and Mobile Computing, vol. 12, no. 16, pp. 1-18.
  1. S. Md Zin, N. Badrul Anuar, M. Laiha Mat Kiah, and A.-S. Khan Pathan (2014), “Routing protocol design for secureWSN: review and open research issues,” Journal of Network and Computer Applications, vol. 41, no. 1, pp. 517-530.
  1. C. P. Mayer (2009) , “Security and privacy challenges in the internet of things,” Electronic Communications of the EASST, vol. 17, pp. 1- 12.
  1. B. Parno, A. Perrig, and V. D. Gligor (2005) , “Distributed detection of node replication attacks in sensor networks,” in Proceedings of the IEEE Symposium on Security and Privacy, pp. 49-63, IEEE, May.
  1. J.-W.Ho, D. Liu, M. Wright, and S. K. Das (2009), “Distributed detection of replica node attacks with group deployment knowledge in wireless sensor networks,” Ad Hoc Networks, vol. 7, no. 8, pp. 1476-1488.
  1. C.-M. Yu, Y.-T. Tsou, C.-S. Lu, and S.-Y. Kuo (2013) , “Localized algorithms for detection of node replication attacks in mobile sensor networks,” IEEE Transactions on Information Forensics and Security, vol. 8, no. 5, pp. 754-768.
  1. B. Zhu, V. G. K. Addada, S. Setia, S. Jajodia, and S. Roy (2007) , “Efficient distributed detection of node replication attacks in sensor networks,” in Proceedings of the 23rd Annual Computer Security Applications Conference (ACSAC ’07), pp. 257-266, IEEE, Miami Beach, Fla, USA, December.
  1. J.-W. Ho, M. Wright, and S. K. Das (2011) , “Fast detection of mobile replica node attacks in wireless sensor networks using sequential hypothesis testing,” IEEE Transactions on Mobile Computing, vol. 10, no. 6, pp. 767-782.
  1. X. Deng, Y. Xiong, and D. Chen (2010) , “Mobility-assisted detection of the replication attacks in mobile wireless sensor networks,” in Proceedings of the 6th Annual IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob ’10), pp. 225-232, October.
  1. H. R. Shaukat, F. Hashim, A. Sali, and M. F. Abdul Rasid (2014) , “Node replication attacks in mobile wireless sensor network: a survey,” International Journal of Distributed Sensor Networks, vol. 10, no. 12, Article ID 402541, pp. 1-15.
  1. X.-M. Deng and Y. Xiong (2011), “A new protocol for the detection of node replication attacks in mobile wireless sensor networks,” Journal of Computer Science and Technology, vol. 26, no. 4, pp. 732-743.
  1. L. S. Sindhuja and G. Padmavathi (2016) , “Replica node detection using enhanced single hop detection with clonal selection algorithm in mobile wireless sensor networks,” Journal of Computer Networks and Communications, vol. 2016,Article ID 1620343, 13 pages.
  1. C.-M. Yu, C.-S. Lu, and S.-Y. Kuo (2008), “Mobile sensor network resilient against node replication attacks,” in Proceedings of the 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON ’08), pp. 597-599, San Francisco, Calif, USA, June.
  1. C.-M. Yu, Y.-T. Tsou, C.-S. Lu, and S.-Y. Kuo (2013) , “Localized algorithms for detection of node replication attacks in mobile sensor networks,” IEEE Transactions on Information Forensics and Security, vol. 8, no. 5, pp. 754-768.
  1. Y. Lou, Y. Zhang, and S. Liu (2012) , “Single hop detection of node clone attacks inmobilewireless sensor networks,” in Proceedings of the International Workshop on Information and Electronics Engineering (IWIEE ’12), pp. 2798-2803, Harbin, China, March.

Cite This Work

To export a reference to this article please select a referencing stye below:

Reference Copied to Clipboard.
Reference Copied to Clipboard.
Reference Copied to Clipboard.
Reference Copied to Clipboard.
Reference Copied to Clipboard.
Reference Copied to Clipboard.
Reference Copied to Clipboard.

Related Services

View all

DMCA / Removal Request

If you are the original writer of this essay and no longer wish to have your work published on the website then please:

Related Lectures

Study for free with our range of university lectures!