Contact : 9561854529 Email : submitpaper@ijaea.com editorinchief.ijaea@gmail.com Working Hours: 9am to 9PM

International Journal of Advanced Engineering Application

ISSN: 3048-6807

Submit Paper Apply for Reviewer

Visual Target Tracking Techniques for Autonomous Vehicle Navigation Visual Target Tracking Techniques for Autonomous Vehicle Navigation

Author(s):Chanda L. Mwansa1, Mukuka N. Bwalya2, and Thandiwe P. Zulu3

Affiliation: 1Department of Electrical Engineering, University of Zambia, Lusaka, Zambia, 2Department of Computer Science, Copperbelt University, Kitwe, Zambia, 3Department of Civil Engineering, Mulungushi University, Kabwe, Zambia

Page No: 1-8

Volume issue & Publishing Year: Volume 2 Issue 1 ,Jan-2025

Journal: International Journal of Advanced Engineering Application (IJAEA)

ISSN NO: 3048-6807

DOI: https://doi.org/10.5281/zenodo.17672314

Download PDF

Article Indexing:

Abstract:
Recent years have witnessed a significant surge of interest in the design and development of local algorithms for solving various network tasks, particularly due to their critical importance in the study and application of wireless networks. These local algorithms, characterized by their reliance on limited and localized information, are essential for ensuring efficient and scalable network operations. In this work, we specifically focus on the behavior and performance of algorithms operating under very low locality constraints, where each node has access to minimal information about its immediate neighborhood. Despite the inherent limitations imposed by such restricted locality, we successfully propose local constant-ratio approximation algorithms for solving several fundamental problems in location-aware Unit Disk Graphs (UDGs). These problems include the Minimum Dominating Set (MDS), Connected Dominating Set (CDS), Maximum Independent Set (MIS), and Minimum Vertex Cover (MVC). The proposed algorithms demonstrate that even with constrained locality, it is possible to achieve effective approximations for these challenging combinatorial problems in the context of wireless networks. Furthermore, this study contributes to the theoretical understanding of local algorithms by establishing the first-ever lower bounds on their performance for the aforementioned problems within a location-aware UDG setting. These bounds provide valuable insights into the trade-offs between locality and the achievable solution quality, offering a deeper understanding of the limitations and potential of local algorithms in practical scenarios. By addressing both algorithmic solutions and theoretical limits, this work not only advances the state of the art in local algorithm design for wireless networks but also lays a foundation for future research aimed at further exploring and optimizing locality-aware approaches in distributed systems.

Keywords: Unit Disk Graphs; Location Awareness; Local Algorithms; Approximation Al-gorithms; Lower Bounds

Reference:

  • [1] M. Manasse, L. A. McGeoch, and D. Sleator, “Competitive algorithms for server problems,” Journal of Algorithms, vol. 11, pp. 208–230, 1990.
  • [2] E. Koutsoupias and C. Papadimitriou, “On the k-server conjecture,” Journal of the ACM, vol. 42, pp. 971–983, 1995.
  • [3] M. Chrobak, H. Karloff, T. H. Payne, and S. Vishwanathan, “New results on server problems,” SIAM Journal on Discrete Mathematics, vol. 4, pp. 172–181, 1991.
  • [4] Y. Bartal, B. Bollobas, and M. Mendel, “A Ramsey-type theorem for metric spaces and its applications,” in Proc. 42nd FOCS, pp. 396–405, 2001.
  • [5] D. Coppersmith, P. G. Doyle, P. Raghavan, and M. Snir, “Random walks on weighted graphs,” Journal of the ACM, vol. 40, pp. 421–453, 1993.
  • [6] A. R. Karlin, C. Kenyon, and D. Randall, “Dynamic TCP acknowledgement and other stories,” in Proc. 33rd STOC, pp. 502–509, 2001.
  • [7] N. Reingold, J. Westbrook, and D. D. Sleator, “Randomized competitive algorithms for the list update problem,” Algorithmica, vol. 11, pp. 15–32, 1994.
  • [8] A. Fiat, R. Karp, M. Luby, L. A. McGeoch, D. Sleator, and N. E. Young, “Competitive paging algorithms,” Journal of Algorithms, vol. 12, pp. 685–699, 1991.
  • [9] K. Appel and W. Haken, “Every planar map is four colorable,” Illinois Journal of Mathematics, vol. 21, pp. 429–597, 1977.
  • [10] U. Feige and M. X. Goemans, “Approximating the value of two-prover proof systems,” in Proc. 3rd ISTCS, pp. 182–189, 1995.
  • [11] M. X. Goemans and D. P. Williamson, “Improved approximation algorithms for satisfiability problems,” Journal of the ACM, vol. 42, pp. 1115–1145, 1995.
  • [12] H. Karloff and U. Zwick, “A 7/8-approximation algorithm for max 3SAT,” in Proc. 38th FOCS, pp. 406–417, 1997.
  • [13] L. Trevisan, G. B. Sorkin, M. Sudan, and D. P. Williamson, “Gadgets, approximation, and linear programming,” SIAM Journal on Computing, vol. 29, pp. 2074–2097, 2000.
  • [14] S. S. Seiden, “On the online bin packing problem,” Journal of the ACM, vol. 49, pp. 640–671, 2002.
  • [15] M. Chrobak and L. Larmore, “The server problem and on-line games,” DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 7, pp. 11–64, 1992.
  • [16] J. Suomela, “Survey of local algorithms,” ACM Computing Surveys, vol. 45, pp. 24:1–24:40, 2013.
  • [17] F. Kuhn, T. Moscibroda, and R. Wattenhofer, “What cannot be computed locally,” in Proc. 23rd PODC, pp. 300–309, 2004.
  • [18] N. Linial, “Locality in distributed graph algorithms,” SIAM Journal on Computing, vol. 21, pp. 193–201, 1992.
  • [19] L. Lovász, “On the Shannon capacity of a graph,” IEEE Transactions on Information Theory, vol. 25, pp. 1–7, 1979.
  • [20] B. Awerbuch and D. Peleg, “Sparse partitions,” in Proc. 31st FOCS, pp. 503–513, 1990.
  • [21] F. Kuhn and R. Wattenhofer, “On the complexity of distributed graph coloring,” in Proc. 25th PODC, pp. 7–15, 2006.
  • [22] J. Suomela, “Locality and distributed computing,” Encyclopedia of Algorithms, pp. 1–5, 2008.
  • [23] N. Alon and J. H. Spencer, The Probabilistic Method. Wiley, Hoboken, NJ, USA, 2000.
  • [24] S. Har-Peled, Geometric Approximation Algorithms. AMS, Providence, RI, USA, 2011.
  • [25] N. Clarke and C. J. Colbourn, “Unit disk graphs: Domination and independent sets,” Discrete Mathematics, vol. 213, pp. 55–72, 1998.
  • [26] F. Kuhn, T. Moscibroda, and R. Wattenhofer, “Fault-tolerant clustering in wireless ad hoc networks,” in Proc. 26th IEEE INFOCOM, pp. 1–10, 2007.
  • [27] M. D. Penrose, “On k-connectivity for a geometric random graph,” Random Structures & Algorithms, vol. 15, pp. 145–164, 1999.
  • [28] D. S. Hochbaum, “Approximation algorithms for the set covering and vertex cover problems,” SIAM Journal on Computing, vol. 11, pp. 555–556, 1982.
  • [29] H. Shachnai and G. Tamir, “On two class-constrained versions of the minimum spanning tree problem,” Theoretical Computer Science, vol. 295, pp. 339–357, 2001.
  • [30] R. Johari and D. Tse, “Distributed optimization in ad hoc networks,” IEEE/ACM Transactions on Networking, vol. 13, pp. 279–290, 2005.
  • [31] N. Alon, A. Bar-Noy, N. Linial, and D. Peleg, “A lower bound for radio broadcast,” Journal of Computer and System Sciences, vol. 43, pp. 290–298, 1991.
  • [32] S. R. Gandham, M. Dawande, and R. Prakash, “Energy-efficient schemes for wireless sensor networks,” IEEE Computer, vol. 38, pp. 54–60, 2005.
  • [33] P. Gupta and P. R. Kumar, “The capacity of wireless networks,” IEEE Transactions on Information Theory, vol. 46, pp. 388–404, 2000.
  • [34] A. Boukerche, Algorithms and Protocols for Wireless Sensor Networks. Wiley Series on Parallel and Distributed Computing, 2008.
  • [35] D.-Z. Du and P.-J. Wan, Connected Dominating Sets in Wireless Ad Hoc Networks. Springer, New York, NY, USA, 2012.
  • [36] D. Estrin, R. Govindan, J. Heidemann, and S. Kumar, “Next century challenges,” in Proc. MobiCom, pp. 263–270, 1999.
  • [37] D. B. Johnson and D. A. Maltz, “Dynamic source routing in ad hoc wireless networks,” Mobile Computing, vol. 5, pp. 153–181, 1996.
  • [38] R. Ramanathan and R. Rosales-Hain, “Topology control of multihop wireless networks,” in Proc. 22nd INFOCOM, pp. 404–413, 2000.
  • [39] J. M. Kleinberg and R. Rubinfeld, “Short paths in expander graphs,” in Proc. 31st STOC, pp. 62–70, 1999.
  • [40] F. Kuhn, R. Wattenhofer, and A. Zollinger, “Ad-hoc networks beyond unit disk graphs,” in Proc. 1st DIALM-POMC, pp. 69–78, 2003.
  • [41] J. Schneider and R. Wattenhofer, “Distributed coloring depending on the chromatic number,” in Proc. 24th PODC, pp. 237–246, 2005.
  • [42] P.-J. Wan, K. M. Alzoubi, and O. Frieder, “Distributed construction of connected dominating sets,” in Proc. 21st INFOCOM, pp. 1597–1604, 2002.
  • [43] D. Dubhashi and A. Panconesi, Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, Cambridge, UK, 2009.
  • [44] G. L. Nemhauser and L. E. Trotter, “Properties of vertex packing and covering,” Mathematical Programming, vol. 8, pp. 232–248, 1975.
  • [45] A. Bar-Noy and D. Peleg, “Distributed priority scheduling and guaranteed end-to-end packet delays,” in Proc. 14th PODC, pp. 235–246, 1995.
  • [46] P. Raghavan and C. D. Thompson, “Randomized rounding,” Combinatorica, vol. 7, pp. 365–374, 1987.
  • [47] R. Kumar, R. Rajaraman, and R. Sundaram, “A polylogarithmic approximation for the group Steiner tree problem,” in Proc. 30th STOC, pp. 568–578, 1998.