Niigata Insitute of Technology >
10 学術雑誌論文 = Journal Article >
10 査読済論文 = Postprint >
|Title ||:||On applications of graph/network theory to problems in communication systems|
|Authors ||:||Tamura, Hiroshi|
|Issue Date ||:||May-2011 |
|Journal Title ||:||ECTI TRANSACTIONS ON COMPUTER AND INFORMATION TECHNOLOGY|
|Start Page ||:||8|
|End Page ||:||14|
|Abstract ||:||Graph/network theory results are applicable to problems in communications. As a representative example, the node coloring problem in graph theory is applicable to the channel assignment problem in cellular mobile communication systems. The node coloring problem is NP-complete, meaning that optimally solving it is very difficult. Therefore, we use heuristic algorithms for the channel assignment problem. In this case, the graph theory results show the legitimacy of using heuristic techniques. On the other hand, we can directly apply graph theory to communication problems. For example, on contents delivery services in the Internet, we place mirror servers that provide the same contents on the network. Location problems on flow networks are applicable to mirror server allocation problems. In a simple case, we can efficiently solve the problem. In this paper, we concentrate on multi-hop wireless networks and consider the relationship between their problems and the results of graph/network theory.|
|Keywords ||:||Graph Theory|
Multi-hop Wireless Networks
|Type Local ||:||Journal Article|
|Appears in Collections||:||10 査読済論文 = Postprint|
Please use this identifier to cite or link to this item:
・The copyright of the materials in this repository belongs to the authors or the publishers (academic societies).
・In the case of journal articles, this repository's version might be slightly different in layout and words from the published version.
・Displayed or downloaded materials can only be used for personal use, quotation, etc. as is prescribed in Copyright Act.