Finding Path Errors in Wireless Sensor Networks

Authors

  • P. Divya  MCA Sri Padmavathi College of Computer Sciences And Technology Tiruchanoor, Andhra Pradesh, India

Keywords:

Wireless sensor network , VANETs, sentinel sets

Abstract

Wireless sensor arrange (WSN) alludes to a gathering of spatially scattered and devoted sensors for observing and recording the physical states of the earth and sorting out the gathered information at a focal area. In Existing, VANETs that can distinguish and adapt to noxious assaults and furthermore assess the reliability of the two information and portable hubs in VANETs. Extraordinarily, information trust is assessed in view of the information detected and gathered from numerous vehicles; hub trust is surveyed in two measurements, i.e., utilitarian trust and proposal trust, which show how likely a hub can satisfy its usefulness and how dependable the suggestions from a hub for different hubs will be, separately. We propose a low overhead plan for recognizing a system parcel or cut in a sensor organize. Consider a system S of n sensors, displayed as focuses in a two-dimensional plane. A ?-cut, for any 0 < ? < 1, is a straight partition of ?n hubs in S from a recognized hub, the base station. We demonstrate that the base station can distinguish at whatever point a ?-cut happens by checking the status of just O( 1/? ) hubs in the system. Our plan is deterministic and it is free of false positives: no revealed cut has estimate littler than 1/2?n. Other than this combinatorial outcome, we likewise propose productive calculations for finding the O( 1/? ) hubs that should go about as sentinels, and investigate our reproduction comes about, contrasting the sentinel calculation and two common plans in view of examining.

References

  1. Jason Hill, Robert Szewczyk, Alec Woo, Seth Hollar, David Culler, Kristofer Pister. “System architecture directions for network sensors,” in Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-IX) Cambridge, MA, Nov. 2000.
  2. Chalermek Intanagonwiwat, Ramesh Govindan, and Deborah Estrin, “Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks,” In Proceedings of the Sixth Annual International Conference on Mobile Computing and Networks (MobiCOM 2000), August 2000, Boston, Massachusetts.
  3. J. O'Rourke, Computational Geometry in C, 2nd Ed. Cambridge University Press, 1998
  4. Eynat Rafalin, Diane Souvaine, and Ileana Streinu, “Topological sweep in degenerate cases,” in Proceedings of the 4th Workshop on Algorithm Engineering and Experiments (ALENEX’02), San Francisco, CA, January, 2002. 5 Air delivered sensor network by UC Berkeley at 29 Palms, March 2001. http://robotics.eecs.berkeley.edu/~pister/29Palms0103, 8Workshop on Collaborative Signal and Information Processing, http://www.parc.xerox.com/cosense/csp.html, Xerox Palo Alto Research Center, January 2001. 6 IEEE Signal Processing Magazine special issue on Collaborative Signal and Information Processing for Microsensor Networks, S. Kumar, F. Zhao, D. Shepherd (eds.), vol. 19, no. 2, March 2002.
  5. S. Madden, M.J. Franklin, J. Hellerstein and W. Hong. TAG: a Tiny AGgregation Service for Ad-Hoc Sensor Networks, In Proc of 5th Annual Symposium on Operating Systems Design and Implementation (OSDI), 2002
  6. S. Madden, S. Szewczyk, M.J. Franklin and D. Culler. Supporting Aggregate Queries Over Ad-Hoc Sensor Networks, Workshop on Mobile Computing and Systems Application, 2002
  7. G. Manku and R. Motwani. Approximate frequency counts over data streams. In Proc. 28th Conf. on Very Large Data Bases (VLDB), 2002
  8. G. Piatetsky-Shapiro and C. Connell. Accurate Estimation of the Number of Tuples Satisfying a Condition, In Proc. of ACM SIGMOD Intl. Conf. on Management of Data (SIGMOD), 1984.
  9. B. Przydatek, D. Song, and A. Perrig. Secure Information Aggregation in Sensor Networks, In Proc. of the First ACM Conf. on Embedded Networked Systems (SenSys), 2003
  10. Y. Yao and J. Gehrke, The Cougar Approach to In-Network Query Processing, ACM SIGMOD Record, vol. 31, pp 9, 2002
  11. J. Zhao, R. Govindan and D. Estrin. Computing Aggregates for Monitoring Wireless Sensor Networks, The First IEEE Intl. Workshop on Sensor Network Protocols and Applications (SNPA), 2003
  12. M. de Berg, M. van Kreveld, M. Overmars and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, 2000.
  13. H. Bronnimann, B. Chazelle, and J. Matou sek. Product range spaces, ˇ sensitive sampling, and derandomization. SIAM J. Comput. 28, 1552-1575, 1999.
  14. A. Cerpa and D. Estrin. ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies. IEEE Transactions on Mobile Computing, 3, 2004.
  15. C-Y. Chong and S. P. Kumar. Sensor Networks: Evolution, opportunities and challenges. Proc. of the IEEE, 91, 1247–1256, 2003.
  16. D. Culler, D. Estrin and M. Srivastava. Overview of Sensor Networks. IEEE Computer, 41–49, 2004.
  17. T. K. Dey. Improved bounds for planar k-sets and related problems. Discrete & Computational Geometry, 373–382, 1998.
  18. N. Sadagopan and B. Krishnamachari. Maximizing data extraction in energy-lmited sensor networks. Proc. IEEE INFOCOM, 2004.

IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology

Downloads

Published

2018-04-30

Issue

Volume 3, Issue 4, March-April-2018

Section

Research Articles

License

Copyright (c) IJSRCSEIT

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
P. Divya, " Finding Path Errors in Wireless Sensor Networks, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 4, pp.547-550, March-April-2018.