CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
Reseach Article

Hop-Count based Virtual Coordinate Assignment Scheme through Four Beacons for Wireless Sensor Network

Published on None 2010 by Alok Kumar, Shirshu Varma, Rajeev Sonkar
Mobile Ad-hoc Networks
Foundation of Computer Science USA
MANETS - Number 1
None 2010
Authors: Alok Kumar, Shirshu Varma, Rajeev Sonkar
1516ae4d-fa16-42f5-9158-bcb02326fb0d

Alok Kumar, Shirshu Varma, Rajeev Sonkar . Hop-Count based Virtual Coordinate Assignment Scheme through Four Beacons for Wireless Sensor Network. Mobile Ad-hoc Networks. MANETS, 1 (None 2010), 35-41.

@article{
author = { Alok Kumar, Shirshu Varma, Rajeev Sonkar },
title = { Hop-Count based Virtual Coordinate Assignment Scheme through Four Beacons for Wireless Sensor Network },
journal = { Mobile Ad-hoc Networks },
issue_date = { None 2010 },
volume = { MANETS },
number = { 1 },
month = { None },
year = { 2010 },
issn = 0975-8887,
pages = { 35-41 },
numpages = 7,
url = { /specialissues/manets/number1/1009-45/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Special Issue Article
%1 Mobile Ad-hoc Networks
%A Alok Kumar
%A Shirshu Varma
%A Rajeev Sonkar
%T Hop-Count based Virtual Coordinate Assignment Scheme through Four Beacons for Wireless Sensor Network
%J Mobile Ad-hoc Networks
%@ 0975-8887
%V MANETS
%N 1
%P 35-41
%D 2010
%I International Journal of Computer Applications
Abstract

In this paper, we propose a simple distributed protocol to construct a virtual coordinate scheme (VCA) based on hop count to four beacon (or reference) nodes. In this proposed protocol each node only maintains the hop count to these known location nodes (beacons) and do not require the physical or real location information. We put the assumption that all nodes are deployed in a rectangular shape area and the sink node (or base station) is located at one of the vertex of this rectangle. The sink node is also used as one of the milestone (beacon) nodes. Three other sensor nodes are chosen as beacon nodes placed close to the vertex of the rectangular area like sensor network in our designed protocol. A hop count to four beacon nodes is contained by the virtual coordinate vector, and by using this virtual coordinate vector; a node can make a decision for greedy routing. The simulation results for proposed protocol shows that the virtual coordinate system can support the standard geographic routing more efficiently than the real coordinate system.

References
  1. Bose, P., Morin, P., Stojmenovic, I., and Urrutia, J., ‘‘Routing with Guaranteed Delivery in Ad hoc Wireless Networks”. In Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M), Seattle, WA, August, 1999.
  2. Karp, B., and Kung, H. T., “GPSR: greedy perimeter Stateless Routing for wireless networks”. The Sixth Annual ACM/IEEE MobiCom, Boston, MA, August, 2000.
  3. Kuhn, F., Wattenhofer, R., Zhang, Y., and Zollinger, A., “Geometric ad-hoc routing: Of theory and practice”. 22nd ACM Symposium on Principles of Distributed Computing (PODC), Pp. 63-72, Boston, Massachusetts, USA, July 2003.
  4. Kuhn, F., Wattenhofer, R., and Zollinger, A. “Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing”. The 4th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), Pp. 267-278, Annapolis, MD, June 2003.
  5. Basagni, S., Chlamtac, I., Syrotiuk, V., and Woodward, B., “A distance routing effect algorithm for mobility (DREAM)”. The Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), Dallas, Texas, August 1998.
  6. Beijar, N., “Zone Routing Protocol (ZRP)”. Licentiate course on Telecommunications Technology, Ad Hoc Networking, April 2002.
  7. Bose, P., Morin, P., Stojmenovic, I., and Urrutia, J., “Routing with Guaranteed Delivery in Ad Hoc Wireless Networks”, The 3rd international workshop on Discrete algorithms and methods for mobile computing and communications Wireless Networks, Vol. 7, Pp 609-616, 2001.
  8. Gregory, G., Finn. “Routing and addressing problems in large metropolitan-scale intemetworks”. Technical Report, ISI/RR-87-180, ISI, March 1987.
  9. Gao, J., Guibas, L. J., Hershburger, J., Zhang, L., and Zhu, A., ”Geometric Spanner for Routing in Mobile Networks”, The 2nd ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 45–55, October 2001.
  10. Imielinski, T., and Navas, J., “GPS-Based Addressing and Routing”, RFC-2009, IETF, November 1996.
  11. Li, J., Jannotti, J., Douglas S. J. De Couto, Karger, D.R., and Morris R., “A Scalable Location Service for Geographic Ad Hoc Routing”, The 6th MobiCom, Boston, MA, August, 2000.
  12. Liao, W., and Sheu, J., and Tseng, Y., “GRID: A Fully Location-Aware Routing Protocol for Mobile Ad Hoc Networks”, In Telecommunication Systems, Volume 18, Pp 37–60, 2001.
  13. Kuhn, F., Wattenhofer, R., Zhang, Y., and Zollinger, A. “Geometric Ad-Hoc Routing: Of Theory and Practice”. The 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003), Boston, MA, July, 2003.
  14. Priyantha, N. B., Chakraborty, A., and Balakrishnan, H., “The cricket location support system’’, The 6th ACM/IEEE MobiCom, pp. 32-43. Boston, MA, August, 2000.
  15. Niculescu, D., and Nath, B., ‘‘Ad hoc positioning system (APS)’’, The IEEE Global Telecommunication Conference (GLOBECOM), San Antonio, TX, pp. 2926-31, November, 2001.
  16. Savvides, A., Han C., and Strivastave, M.B., ‘‘Dynamic fine-grained localization in ad-hoc networks of sensors’’, The 7th Annual ACM/IEEE MobiCom, pp. 166-79, Rome, July, 2001.
  17. Nasipuri, A., and Li K., ‘‘A directionality based location discovery scheme for wireless sensor networks’’, The First ACM International Workshop on Wireless Sensor Networks and Applications (WSNA), pp. 105-11, Atlanta, GA, September 2002.
  18. Bahl, P., and Padmanabhan, V.N., ‘‘RADAR: an in-building RF-based user location and tracking system’’, The 19th INFOCOMM, Vol. 2, pp. 775-84, Tel-Aviv, Israel, March, 2000.
  19. He, T., Huang, C., Blum, B., Stankovic, J.A., and Abdelzaher, T., ‘‘Range-free location schemes in large sensor networks’’, The Ninth Annual ACM/IEEE MobiCom, pp. 81-95, San Diego, CA, September 2003.
  20. Shang, Y., Rum, W., Zhang, Y. and Fromherz, M., ‘‘Localization from mere connectivity’’, The Fourth International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2003), pp. 201-12, Annapolis, MD, June, 2003.
  21. Filardi, N., Caruso, N., and Chessa, S., ‘‘Virtual Naming and Geographic Routing on Wireless Sensor Networks’’, The IEEE Symposium on Computers and Communications (ISCC'07), pp. 609-614, Aveiro, Portugal, July, 2007.
  22. Moscibroda, T., O’Dell, R., Wattenhofer, M., and Attenhofer, R., ‘‘Virtual coordinates for ad hoc and sensor networks’’, The ACM Joint Workshop on Foundations of Mobile Computing (DLALM-POMC), pp. 8-16, Philadelphia, PA, October 2004.
  23. Caruso, A., Chessa S., De S., and Urpi A., ‘‘GPS free coordinate assignment and routing in wireless sensor networks’’, The IEEE International Conference on Computer Communication (INFOCOM), pp. 150-160, Miami, FL, March, 2005.
  24. Doherty L., Ghaoui L. E., and Pister K., ‘‘Convex Position Estimation in Wireless Sensor Networks”. The 20th INFOCOM, pp. 1655-1663, Anchorage, AL, April, 2001.
  25. Rao A., Papadimitriou C., Shenker S., and Stoica I., ‘‘Geographic routing without location information’’, The Ninth Annual ACM/IEEE MobiCom, 96-108, San Diego, CA, September 2003.
  26. Madhulika, Kumar, A. and Varma, S., “Iterative and Distributed Range-free Localization Algorithm for Wireless Sensor Networks” In proceedings of IMPACT-2009, Aligarh, March 2009.
  27. Kumar, A. and Varma, S., “Geographic Node-Disjoint Path Routing for Wireless Sensor networks”, IEEE Sensors Journal, Vol. 10, no. 6, pp 1135-36, June 2010.
Index Terms

Computer Science
Information Sciences

Keywords

Security Wireless Sensor Networks (WSN) threats Denial of Service (DoS)