Modeling face routing in unit disk graphs

Authors

  • В. П. Гамаюн Національний авіаційний університет
  • Х. А. Мацуєва Національний авіаційний університет

DOI:

https://doi.org/10.18372/2073-4751.3.10304

Abstract

The features of using unit disk graphs in modeling face routing are described. The basic geometricalproperties of the interaction of nodes in the unit disk graphs are defined in this article. An algorithmfor calculating the path of packet delivery, which is based on the method of calculating the virtualpath in the virtual plane graphs is proposed

Author Biography

В. П. Гамаюн, Національний авіаційний університет

д. т. н.

References

Brent N. Clark, Charles J. Colbourn, David S. Johnson Unit disk graphs // Discrete Mathematics. – 1990. – В. 1-3. – Т. 86. – С. 165–177.

Mark L. Huson, Arunabha Sen Military Communications Conference, IEEE MILCOM '95. – 1995. – Т. 2. – С. 647-651.

F. Kuhn, R. Wattenhofer, A. Zollinger. Asymptotically optimal geometric mobile ad- oc routing // In DIALM '02: Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications. – New York, ACM Press, 2002. – Р. 24-33.

E. Kranakis, H. Singh, J. Urrutia. Compass routing on geometric networks // In Proc. 11th Canadian Conference on Computational Geometry. - Vancouver, August 1999. – Р. 51-54.

P. Bose, P. Morin, I. Stojmenovic, J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks // Wireless Networks, №7(6). – 2001. – Р. 609–616.

B. Karp, H. T. Kung. GPSR: greedy perimeter stateless routing for wireless networks // In MobiCom '00: Proceedings of

the 6th annual international conference on Mobile computing and networking. – 2000. – Р. 243–254.

Гамаюн В.П., Мацуєва Х.А. Моделювання маршрутизації гранями у бездротових динамічних мережах за допомогою віртуальних графів // Проблеми інформатизації та управління, №2(46). – К: Видавництво НАУ, 2014. – С. 14–19.

Downloads

How to Cite

Гамаюн, В. П., & Мацуєва, Х. А. (2015). Modeling face routing in unit disk graphs. Problems of Informatization and Control, 3(51), 19–24. https://doi.org/10.18372/2073-4751.3.10304

Issue

Vol. 3 No. 51 (2015)

Section

Статті

License

The scientific journal adheres to the principles of Open Access and provides free, immediate, and permanent access to all published materials without financial, technical, or legal barriers for readers.

All articles are published in Open Access under the Creative Commons Attribution 4.0 International (CC BY 4.0) license.

Copyright

Authors who publish their works in the journal:

  • retain the copyright to their publications;

  • grant the journal the right of first publication of the article;

  • agree to the distribution of their materials under the CC BY 4.0 license;

  • have the right to reuse, archive, and distribute their works (including in institutional and subject repositories), provided that proper reference is made to the original publication in the journal.