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
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
