SECURE DATA AGGREGATION IN WIRELESS SENSOR NETWORKS: FILTERING OUT THE ATTACKERS IMPACT
DOI:
https://doi.org/10.61841/vakcg827Keywords:
Wireless sensor networks, computational power, aggregator centre pointsAbstract
At present, due to compelled computational power and imperativeness resources of sensor center points, aggregation of data from various sensor centers done at the gathering center is regularly polished by clear procedures, for instance, averaging. In any case, such an all-out has been known to be significantly feeble against center-point bartering ambushes. Since WSN are ordinarily unattended and without changing safe gear, they are uncommonly weak to such ambushes. In like manner, discovering trust-estimation of data and reputation of sensor center points has gotten fundamentally huge for WSN. As the show of particularly low-power processors essentially improves and their cost is fundamentally diminished, future aggregator center points will be fit for performing progressively refined data all-out computations, which will make WSN less vulnerable against the genuine impact of exchanged off-centers. Iterative counts hold unprecedented assurance for such an explanation. Such figuring simultaneously absolute data from various sources and giving trust assessment of these sources regularly in a kind of relating weight factors allotted to data given by each source. At this moment, show that different existing iterative counts, while basically more energetic against intrigue ambushes than the clear averaging procedures, are everything viewed as susceptive to a novel propelled understanding attack I present. To address this security issue, I propose an improvement for iterative frameworks by giving a basic estimation to such figuring, which makes them interest-worthy yet furthermore progressively precise and snappier combining. I acknowledge that so balanced iterative figuring has a remarkable potential for sending later on WSN.
Downloads
References
[1] S. Ozdemir and Y. Xiao, "Secure data assortment in remote sensor orchestrates: A broad chart," Comput.
Netw., vol. 53, no. 12, pp. 2022–2037, Aug. 2009.
[2] L. Wasserman, All of Bits of Knowledge: A Minimal Course in Truthful Deriving. New York: Springer.
[3] A. Jøsang and J. Golbeck, "Troubles for vivacious trust and reputation structures," in Procedures of the 5 th
Universal Workshop on Security and Trust The executives, Holy Person Malo, France, 2009.
[4] K. Hoffman, D. Zage, and C. Nita-Rotaru, "An investigation of ambush and protect strategies for reputation
systems," ACM Comput. Surv., vol. 42, no. 1, pp. 1:1–1:31, Dec. 2009.
[5] R. Roman, C. Fernandez-Gago, J. Lopez, and H. H. Chen, "Trust and reputation structures for remote sensor
frameworks," in Security and Protection in Versatile and Remote Systems Administration, S. Gritzalis, T.
Karygiannis, and C. Skianis, Eds. Troubador Distributing Ltd, 2009, pp. 105–128.
[6] H.- S. Lim, Y.- S. Moon, and E. Bertino, "Provenance-based trustworthiness assessment in sensor
frameworks," in Procedures of the Seventh Worldwide Workshop on Information The executives for
Sensor Systems, ser. DMSN '10, 2010, pp. 2-7.
[7] H.- L. Shi, K. M. Hou, H. ying Zhou, and X. Liu, "Essentiality successful and defect-tolerant multicore
remote sensor arrangement: E2MWSN," in Remote Interchanges, Systems administration and Portable
Registering (WiCOM), 2011 seventh Global Meeting on, 2011, pp. 1–4.
[8] C. de Kerchove and P. Van Dooren, "Iterative isolating in reputation structures," SIAM J. Structure Buttcentric. Appl., vol. 31, no. 4, pp. 1812–1834, Blemish. 2010.
[9] Y. Zhou, T. Lei, and T. Zhou, "A solid situating computation to spamming," CoRR, vol. abs/1012.3793, 2010.
[10] P. Laureti, L. Moret, Y.-C. Zhang, and Y.-K. Yu, "Information isolating by methods for Iterative Refinement," EPL (Europhysics Letters), vol. 75, pp. 1006–1012, Sep. 2006.
[11] Y.- K. Yu, Y.- C. Zhang, P. Laureti, and L. Moret, "Interpreting information from rowdy, overabundance,
and intentionally ruined sources," Physica A Measurable Mechanics and its Applications, vol. 371, pp.
732–744, Nov. 2006.
[12] R.- H. Li, J. X. Yu, X. Huang, and H. Cheng, "Solid reputation-based situating on bipartite rating
frameworks," in SDM'12, 2012, pp. 612–623.
[13] E. Ayday, H. Lee, and F. Fekri, "An iterative estimation for trust and reputation the officials," in Procedures
of the 2009 IEEE all-inclusive gathering on Symposium on Data Hypothesis, Volume 3, ser. ISIT'09,
2009, pp. 2051–2055.
[14] H. Liao, G. Cimini, and M. Medo, "Assessing quality, reputation, and trust in online systems," ArXiv eprints, Aug. 2012.
[15] B.- C. Chen, J. Guo, B. Tseng, and J. Yang, "Customer reputation in a comment rating condition," in
Procedures of the seventeenth ACM SIGKDD overall assembly on Information disclosure and data
mining, ser. KDD '11, 2011, pp. 159–167.
[16] C. T. Chou, A. Ignatovic, and W. Hu, "Successful computation of incredible typical of compressive
identifying data in remote sensor sorts out inside seeing sensor issues," Equal and Conveyed Frameworks,
IEEE Exchanges on, vol. 24, no. 8, pp. 1525–1534, Aug 2013.
[17] Y. Yu, K. Li, W. Zhou, and P. Li, "Trust frameworks in remote sensor frameworks: Assault examination
and countermeasures," Diary of System and PC Applications, vol. 35, no. 3, pp. 867 – 880, 2012,
¡ce:title¿Special Issue on Confided in Figuring and Communications¡/ce:title¿.
[18] H.- S. Lim, G. Ghinita, E. Bertino, and M. Kantarcioglu, "A game-theoretic technique for high-certification
of data trustworthiness in sensor frameworks," in Information Building (ICDE), 2012 IEEE 28th Universal
Meeting on April 2012, pp. 1192–1203.
[19] M. Rezvani, A. Ignjatovic, E. Bertino, and S. Jha, "Secure data gathering framework for remote sensor
masterminds inside seeing trick attacks." School of Software Engineering and Designing, UNSW, Tech.
Rep. UNSW-CSE-TR-201319, July 2013.
[20] D. Wagner, "Solid gathering in sensor frameworks," in Procedures of the second ACM workshop on
Security of uncommonly delegated and sensor frameworks, ser. SASN '04, 2004, pp. 78–87.
[21] "The Intel lab data," informational index available at: http://berkeley. intel-research.net/labdata/, 2004.
[22] B. Awerbuch, R. Curtmola, D. Holmer, C. Nita-rotaru, and H. Rubens, "Directing byzantine attacks in uncommonly delegated remote frameworks," Branch of Software Engineering, Johns Hopkins College, Tech, Tech. Rep., 2004.
[23] M. C. Vuran and I. F. Akyildiz, "Spatial relationship-based helpful medium access control in remote sensor frameworks," IEEE/ACM Trans. Netw., vol. 14, no. 2, pp. 316–329, Apr. 2006.
[24] S. Ganeriwal, L. K. Balzano, and M. B. Srivastava, "Reputationbased framework for high uprightness
sensor frameworks," ACM Trans. Sen. Netw., vol. 4, no. 3, pp. 15:1–15:37, Jun. 2008.
[25] X.- Y. Xiao, W.- C. Peng, C.- C. Hung, and W.- C. Lee, "Using SensorRanks for in-sort out distinguishing
proof of flawed readings in remote sensor frameworks," in Procedures of the 6th ACM all inclusive
workshop on Information working for remote and versatile access, ser. MobiDE '07, 2007, pp. 1–8.
[26] M. Li, D. Ganesan, and P. Shenoy, "Presto: input driven data the board in sensor frameworks," in
Procedures of the third gathering on Organized Frameworks Plan and Execution - Volume 3, ser. NSDI'06,
2006, pp. 23–23.
[27] Y. Sun, H. Luo, and S. K. Das, "A trust-based framework for insufficiency tolerant data aggregate in remote
sight and sound sensor frameworks," IEEE Trans. Dependable Secur. Comput., vol. 9, no. 6, pp. 785–797,
Nov. 2012.
[28] L.- A. Tang, X. Yu, S. Kim, J. Han, C.- C. Hung, and W.- C. Peng, "Tru-Alert: Dependability examination
of sensor sorts out in computerized physical structures," in Procedures of the 2010 IEEE Universal Meeting
on Information Mining, ser. ICDM '10, 2010, pp. 1079–1084.
[29] J.- W. Ho, M. Wright, and S. Das, "ZoneTrust: Quick zone-based centre point deal ID and denial in remote
sensor frameworks using progressive hypothesis testing," Reliable and Secure Processing, IEEE Exchanges
on, vol. 9, no. 4, pp. 494 – 511, july-aug. 2012.
[30] S. Ozdemir and H. C¸ am, "Coordination of false data revelation with data combination and private
transmission in remote sensor frameworks," IEEE/ACM Trans. Netw., vol. 18, no. 3, pp. 736–749, Jun.
2010.
[31] H. Chan, A. Perrig, and D. Tune, "Secure different leveled innetwork assortment in sensor frameworks," in
Procedures of the thirteenth ACM Gathering on PC and Correspondences Security, ser. CCS '06. New
York, NY, USA: ACM, 2006, pp. 278–287.
[32] Y. Yang, X. Wang, S. Zhu, and G. Cao, "SDAP: an ensured hopby-ricochet data combination show for sensor frameworks," in MobiHoc, 2006, pp. 356–367.
[33] S. Roy, M. Conti, S. Setia, , and S. Jajodia, "Secure data assortment in remote sensor frameworks," Data Crime scene investigation and Security, IEEE Exchanges on, vol. 7, no. 3, pp. 1040–1052, 2012.
Downloads
Published
Issue
Section
License
Copyright (c) 2020 AUTHOR
This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
