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

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Parabola based Geographic Forwarding in Wireless Sensor Networks

by Jianjun Yang, Mingyuan Yan, Abi Salimi, Bryson Payne, Jason Porter, Janet Morales
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 185 - Number 30
Year of Publication: 2023
Authors: Jianjun Yang, Mingyuan Yan, Abi Salimi, Bryson Payne, Jason Porter, Janet Morales
10.5120/ijca2023923054

Jianjun Yang, Mingyuan Yan, Abi Salimi, Bryson Payne, Jason Porter, Janet Morales . Parabola based Geographic Forwarding in Wireless Sensor Networks. International Journal of Computer Applications. 185, 30 ( Aug 2023), 1-8. DOI=10.5120/ijca2023923054

@article{ 10.5120/ijca2023923054,
author = { Jianjun Yang, Mingyuan Yan, Abi Salimi, Bryson Payne, Jason Porter, Janet Morales },
title = { Parabola based Geographic Forwarding in Wireless Sensor Networks },
journal = { International Journal of Computer Applications },
issue_date = { Aug 2023 },
volume = { 185 },
number = { 30 },
month = { Aug },
year = { 2023 },
issn = { 0975-8887 },
pages = { 1-8 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume185/number30/32881-2023923054/ },
doi = { 10.5120/ijca2023923054 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T01:27:26.657939+05:30
%A Jianjun Yang
%A Mingyuan Yan
%A Abi Salimi
%A Bryson Payne
%A Jason Porter
%A Janet Morales
%T Parabola based Geographic Forwarding in Wireless Sensor Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 185
%N 30
%P 1-8
%D 2023
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Due to power and communication capability limitations, communication between a source node and a destination node in a Wireless Sensor Network (WSN) that are not within each other’s direct communication range needs to rely on the forwarding of other nodes.When it comes to the routing problem inWSNs with a void area (which is a hole that lacks of active nodes), researchers have proposed a variety of mechanisms. One of the solutions is to create a path along the perimeter of a geometric shape. However, it often results in long detour path although some nodes that can create a much short path exist. A improved solution is to find a landmark node. This method first finds a routing path from the source to the landmark, and then develops a routing path from the landmark to the destination. This method avoids long detour paths during forwarding. However, the selected forwarding nodes are mechanically fixed. These nodes suffer from a much higher traffic load, which results in a shorter lifetime and thus creates a larger void area. This article presents a mechanism based on virtual parabola generated using the locations of the source, the landmark, and the destination prior to the routing. During the forwarding process, more nodes will be evenly chosen based on the virtual parabola. Because of that, the new proposed scheme finds short routing path while maintaining more balanced energy consumption. The performance of the new proposed method is evaluated through simulations. The results demonstrate that the approach made improvement compared with both existingmethods.

References
  1. Chen, M., Leung, V.C., Mao, S. and Yuan, Y., 2007. Directional geographical routing for real-time video communications in wireless sensor networks. Computer Communications, 30(17), pp.3368-3383.
  2. Hurni, P. and Braun, T., 2008. Energy-efficient multipath routing in wireless sensor networks. In Ad-hoc, Mobile and Wireless Networks: 7th International Conference, ADHOC-NOW 2008 Sophia-Antipolis, France, September 10-12, 2008 Proceedings 7 (pp. 72-85). Springer Berlin Heidelberg.
  3. Young-Gwan, K. and Jae-Hong, Y., 2012, May. Position coodinate-based energy efficient routing protocol for Wireless Sensor Networks. In 2012 9th International Conference on Fuzzy Systems and Knowledge Discovery (pp. 2193-2197). IEEE.
  4. Aboud, A., Touati, H. and Hnich, B., 2019. Efficient forwarding strategy in a NDN-based internet of things. Cluster Computing, 22, pp.805-818.
  5. Gao, S., Zhang, H. and Zhang, B., 2016. Energy efficient interest forwarding in NDN-based wireless sensor networks. Mobile Information Systems, 2016.
  6. Yang, J., Fei, Z. and Shen, J., 2015. Hole detection and shape-free representation and double landmarks based geographic routing in wireless sensor networks. Digital Communications and Networks, 1(1), pp.75-83. Fascista, A., 2022. Toward integrated largescale environmental monitoring using WSN/UAV/Crowdsensing: A review of applications, signal processing, and future perspectives. Sensors, 22(5), p.1824.
  7. Fei, Z., Yang, J. and Lu, H., 2015. Improving routing efficiency through intermediate target based geographic routing.Digital Communications andNetworks, 1(3), pp.204-212.
  8. Yang, J., Guo, J., Shen, J. and Yan, M., 2020, May. Landmark based circle routing in wireless sensor networks. In 2020 5th International Conference on Computer and Communication Systems (ICCCS) (pp. 733-737). IEEE.
  9. Yang, J., 2022. An ellipse-guided routing algorithm in wireless sensor networks. Digital Communications and Networks, 8(5), pp.770-777.
  10. Ogier, R., Templin, F. and Lewis, M., 2004. Topology dissemination based on reverse-path forwarding (TBRPF) (No. rfc3684).
  11. Royer, E.M. and Perkins, C.E., 1999, August. Multicast operation of the ad-hoc on-demand distance vector routing protocol. In Proceedings of the 5th annual ACM/IEEE international conference onMobile computing and networking (pp. 207-218).
  12. Johnson, D., Hu, Y.C. and Maltz, D., 2007. The dynamic source routing protocol (DSR) for mobile ad hoc networks for IPv4 (No. rfc4728).
  13. Park, V.D. and Corson, M.S., 1997, April. A highly adaptive distributed routing algorithm for mobile wireless networks. In Proceedings of INFOCOM’97 (Vol. 3, pp. 1405-1413). IEEE.
  14. Haas, Z.J. and Pearlman, M.R., 1998. The performance of query control schemes for the zone routing protocol. ACM SIGCOMM Computer Communication Review, 28(4), pp.167-177.
  15. Nikaein, N., Bonnet, C. and Nikaein, N., 2001, September. Harp-hybrid ad hoc routing protocol. In Proceedings of international symposium on telecommunications (IST) (pp. 56-67).
  16. Joa-Ng, M. and Lu, I.T., 1999. A peer-to-peer zonebased two-level link state routing for mobile ad hoc networks. IEEE Journal on selected areas incommunications, 17(8), pp.1415-1425.
  17. Basagni, S., Chlamtac, I., Syrotiuk, V.R. and Woodward, B.A., 1998, October. A distance routing effect algorithm for mobility (DREAM). In Proceedings of the 4th annual ACM/IEEE international conference onMobile computing and networking (pp. 76-84).
  18. Ko, Y.B. and Vaidya, N.H., 1998, October. Locationaided routing (LAR) in mobile ad hoc networks. In Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking (pp. 66-75).
  19. Li, J., Jannotti, J., De Couto, D.S., Karger, D.R. and Morris, R., 2000, August. A scalable location service for geographic ad hoc routing. In Proceedings of the 6th annual international conference on Mobile computing and networking (pp. 120-130).
  20. B. Karp and H. Kung, GPSR: Greedy perimeter stateless routing for wireless networks, ACM/IEEE International Conf. on Mobile Computing and Networking, 2000.
  21. Karp, B. and Kung, H.T., 2000, August. GPSR: Greedy perimeter stateless routing for wireless networks. In Proceedings of the 6th annual international conference on Mobile computing and networking (pp. 243-254).
  22. Aboud, A., Touati, H. and Hnich, B., 2019. Efficient forwarding strategy in a NDN-based internet of things. Cluster Computing, 22, pp.805-818.
  23. Gao, S., Zhang, H. and Zhang, B., 2016. Energy efficient interest forwarding in NDN-based wireless sensor networks. Mobile Information Systems, 2016.
  24. Liu, X., João Nicolau, M., Costa, A., Macedo, J. and Santos, A., 2016. A geographic opportunistic forwarding strategy for vehicular named data networking. In Intelligent Distributed Computing IX: Proceedings of the 9th International Symposium on Intelligent Distributed Computing–IDC’2015, Guimarães, Portugal, October 2015 (pp. 509-521). Springer International Publishing.
  25. Basiri, A., Amirian, P. and Winstanley, A., 2014. The Use of Quick Response (QR) Codes in Landmark- Based Pedestrian Navigation. International Journal of Navigation and Observation.
  26. Shawahna, A., Haque, M.E. and Tozal, M.E., 2017, April. Energy harvesting in wireless sensor network with efficient landmark selection using mobile actuator. In 2017 Annual IEEE International Systems Conference (SysCon) (pp. 1-8). IEEE.
  27. Zivkovic, M., Zivkovic, T., Venkatachalam, K. and Bacanin, N., 2021. Enhanced dragonfly algorithm adapted for wireless sensor network lifetime optimization. In Data Intelligence and Cognitive Informatics: Proceedings of ICDICI 2020 (pp. 803-817). Singapore: Springer Singapore.
  28. Zivkovic, M., Bacanin, N., Tuba, E., Strumberger, I., Bezdan, T. and Tuba, M., 2020, June. Wireless sensor networks life time optimization based on the improved firefly algorithm. In 2020 International Wireless Communications and Mobile Computing (IWCMC) (pp. 1176-1181). IEEE.
  29. Brinza, D. and Zelikovsky, A., 2006, June. Deeps: Deterministic energy-efficient protocol for sensor networks. In Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD’06) (pp. 261-266). IEEE.
  30. Zhang, H. and Shen, H., 2009. Energy-efficient beaconless geographic routing in wireless sensor networks. IEEE transactions on parallel and distributed systems, 21(6), pp.881-896.
  31. Jiang, B., Huang, G., Wang, T., Gui, J. and Zhu, X., 2022. Trust based energy efficient data collection with unmanned aerial vehicle in edge network. Transactions on Emerging Telecommunications Technologies, 33(6), p.e3942.
  32. Al Aghbari, Z., Khedr, A.M., Osamy, W., Arif, I. and Agrawal, D.P., 2020. Routing in wireless sensor networks using optimization techniques: A survey. Wireless Personal Communications, 111, pp.2407- 2434.
  33. Guleria, K. and Verma, A.K., 2019. Meta-heuristic ant colony optimization based unequal clustering for wireless sensor network.Wireless Personal Communications, 105, pp.891-911.
  34. Nguyen, A., Milosavljevic, N., Fang, Q., Gao, J. and Guibas, L.J., 2007, May. Landmark selection and greedy landmark-descent routing for sensor networks. In IEEE INFOCOM 2007-26th IEEE International Conference on Computer Communications (pp. 661-669). IEEE.
  35. Xing, F., Xu, Y., Zhao,M. and Harfoush, K., 2007, October. HAGR:Hole aware greedy routing for geometric ad hoc networks. InMILCOM2007-IEEEMilitary Communications Conference (pp. 1-7). IEEE.
  36. Fang, Q., Gao, J. and Guibas, L.J., 2006. Locating and bypassing holes in sensor networks.Mobile networks and Applications, 11, pp.187-200.
Index Terms

Computer Science
Information Sciences

Keywords

Wireless Sensor Networks

Powered by PhDFocusTM