• O. Vidhya
• K. Naveen Kumar

Because of constrained computational power and vitality assets, accumulation of information from different sensor hubs done at the conglomerating hub is generally refined by basic strategies, for example, averaging. Anyway such accumulation is known to be profoundly defenseless against hub bargaining assaults. As the execution of low power processors significantly enhances, future aggregator hubs will be equipped for performing more advanced information collection calculations, along these lines making WSN less helpless. Iterative sifting calculations hold awesome guarantee for such a reason. Such calculations at the same time total information from numerous sources and give trust evaluation of these sources, more often than not in a type of relating weight factors relegated to information given by each source. To address this security issue, we propose a change for iterative separating systems by giving an underlying estimate to such calculations which makes them intrigue hearty, as well as more precise and speedier joining.

collusion attacks, iterative algorithm, attacking model, WSN

"A NEW CHALLENGING FOR DETECTING AND ELIMINATING COLLUSION ATTACKS IN WIRELESS SENSOR NETWORKS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 9, page no.881-887, September-2018, Available :http://www.jetir.org/papers/JETIR1809639.pdf

"A NEW CHALLENGING FOR DETECTING AND ELIMINATING COLLUSION ATTACKS IN WIRELESS SENSOR NETWORKS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 9, page no. pp881-887, September-2018, Available at : http://www.jetir.org/papers/JETIR1809639.pdf