Abstract

The demand for communication services is rapidly increasing, because the mobile communication service is synonymous with an ideal communication style realizing communication anytime, anywhere and with anyone. There exist various problems to which graph and network theory is applicable in mobile communication services. For example, it is well known that coloring algorithms of graphs are applicable in channel assignment algorithms in cellular systems. We introduce a graph theoretical approach for an information delivery problem in ad-hoc networks.

Full Text
Paper version not known

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 call

Disclaimer: 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.