ログイン
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "13002aaa-edf6-4505-87b0-389977266372"}, "_deposit": {"id": "1939", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "1939"}, "status": "published"}, "_oai": {"id": "oai:niigata-u.repo.nii.ac.jp:00001939", "sets": ["454", "425"]}, "item_5_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "1991-10", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "10", "bibliographicPageEnd": "2989", "bibliographicPageStart": "2983", "bibliographicVolumeNumber": "E74-A", "bibliographic_titles": [{"bibliographic_title": "IEICE transactions on fundamentals of electronics, communications and computer sciences"}, {"bibliographic_title": "IEICE transactions on fundamentals of electronics, communications and computer sciences", "bibliographic_titleLang": "en"}]}]}, "item_5_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "In a cellular mobile system, assigning a channel for a call in a cell so as to achieve high spectral efficiency is an important problem. In usual channel assignment for a cellular mobile system, a channel can be simultaneously assigned to some cells with a constant separation distance. This usual model of a cellular mobile system has been formulated using a graph and it is known that the channel assignment problem is equivalent to the coloring problem of graph theory. Recently, a new channel assignment scheme has been proposed. This scheme takes the degree of interference into consideration. In the scheme, a channel is simultaneously assigned if the CIR (carrier-to-interference ratio) is more than the desired value. In this paper, we formulate this new model using a network and a new coloring problem of networks. The new coloring problem of networks is a generalization of the usual coloring problem of graphs. One of the merits of this formulation is that the degree of cochannel interference between cells can be represented. In the usual formulation using a graph, the degree of cochannel interference between cells can not be represented. Therefore, spectral efficiency in the formulation using a network is higher than spectral efficiency in the formulation using a graph. In this paper, we show that the new coloring problem is an NP-hard problem. Subsequently, we rewrite the new coloring problem of networks to a coloring problem of graphs on some assumptions and consider the relation between the results on the new coloring and the results on the usual coloring.", "subitem_description_type": "Abstract"}]}, "item_5_full_name_3": {"attribute_name": "著者別名", "attribute_value_mlt": [{"nameIdentifiers": [{"nameIdentifier": "6327", "nameIdentifierScheme": "WEKO"}], "names": [{"name": "仙石, 正和"}]}]}, "item_5_publisher_7": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "The Institute of Electronics, Information and Communication Engineers"}]}, "item_5_relation_31": {"attribute_name": "異版である", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "http://www.ieice.org/jpn/trans_online/", "subitem_relation_type_select": "URI"}}]}, "item_5_rights_15": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "copyright©1991 IEICE"}]}, "item_5_select_19": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_5_source_id_11": {"attribute_name": "書誌レコードID", "attribute_value_mlt": [{"subitem_source_identifier": "AA10826239", "subitem_source_identifier_type": "NCID"}]}, "item_5_source_id_9": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "09168508", "subitem_source_identifier_type": "ISSN"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Tamura, Hiroshi"}], "nameIdentifiers": [{"nameIdentifier": "6323", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sengoku, Masakazu"}], "nameIdentifiers": [{"nameIdentifier": "6324", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Shinoda, Shoji"}], "nameIdentifiers": [{"nameIdentifier": "5445", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Abe, Takeo"}], "nameIdentifiers": [{"nameIdentifier": "6326", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2019-07-29"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "e74-a_10_2983.pdf", "filesize": [{"value": "534.0 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 534000.0, "url": {"label": "e74-a_10_2983.pdf", "url": "https://niigata-u.repo.nii.ac.jp/record/1939/files/e74-a_10_2983.pdf"}, "version_id": "54e03174-acf5-4d0b-9a04-1ceb56bf7e90"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Channel Assignment Problem in a Cellular Mobile System and a New Coloring Problem of Networks", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Channel Assignment Problem in a Cellular Mobile System and a New Coloring Problem of Networks"}, {"subitem_title": "Channel Assignment Problem in a Cellular Mobile System and a New Coloring Problem of Networks", "subitem_title_language": "en"}]}, "item_type_id": "5", "owner": "1", "path": ["454", "425"], "permalink_uri": "http://hdl.handle.net/10191/6509", "pubdate": {"attribute_name": "公開日", "attribute_value": "2008-07-25"}, "publish_date": "2008-07-25", "publish_status": "0", "recid": "1939", "relation": {}, "relation_version_is_last": true, "title": ["Channel Assignment Problem in a Cellular Mobile System and a New Coloring Problem of Networks"], "weko_shared_id": null}
  1. 060 工学部
  2. 10 学術雑誌論文
  3. 10 査読済論文
  1. 0 資料タイプ別
  2. 01 学術雑誌論文

Channel Assignment Problem in a Cellular Mobile System and a New Coloring Problem of Networks

http://hdl.handle.net/10191/6509
http://hdl.handle.net/10191/6509
bc76aaad-f1f0-4726-a83f-fcd1e2faced3
名前 / ファイル ライセンス アクション
e74-a_10_2983.pdf e74-a_10_2983.pdf (534.0 kB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2008-07-25
タイトル
タイトル Channel Assignment Problem in a Cellular Mobile System and a New Coloring Problem of Networks
タイトル
言語 en
タイトル Channel Assignment Problem in a Cellular Mobile System and a New Coloring Problem of Networks
言語
言語 eng
資源タイプ
資源 http://purl.org/coar/resource_type/c_6501
タイプ journal article
著者 Tamura, Hiroshi

× Tamura, Hiroshi

WEKO 6323

Tamura, Hiroshi

Search repository
Sengoku, Masakazu

× Sengoku, Masakazu

WEKO 6324

Sengoku, Masakazu

Search repository
Shinoda, Shoji

× Shinoda, Shoji

WEKO 5445

Shinoda, Shoji

Search repository
Abe, Takeo

× Abe, Takeo

WEKO 6326

Abe, Takeo

Search repository
著者別名
識別子 6327
識別子Scheme WEKO
姓名 仙石, 正和
抄録
内容記述タイプ Abstract
内容記述 In a cellular mobile system, assigning a channel for a call in a cell so as to achieve high spectral efficiency is an important problem. In usual channel assignment for a cellular mobile system, a channel can be simultaneously assigned to some cells with a constant separation distance. This usual model of a cellular mobile system has been formulated using a graph and it is known that the channel assignment problem is equivalent to the coloring problem of graph theory. Recently, a new channel assignment scheme has been proposed. This scheme takes the degree of interference into consideration. In the scheme, a channel is simultaneously assigned if the CIR (carrier-to-interference ratio) is more than the desired value. In this paper, we formulate this new model using a network and a new coloring problem of networks. The new coloring problem of networks is a generalization of the usual coloring problem of graphs. One of the merits of this formulation is that the degree of cochannel interference between cells can be represented. In the usual formulation using a graph, the degree of cochannel interference between cells can not be represented. Therefore, spectral efficiency in the formulation using a network is higher than spectral efficiency in the formulation using a graph. In this paper, we show that the new coloring problem is an NP-hard problem. Subsequently, we rewrite the new coloring problem of networks to a coloring problem of graphs on some assumptions and consider the relation between the results on the new coloring and the results on the usual coloring.
書誌情報 IEICE transactions on fundamentals of electronics, communications and computer sciences
en : IEICE transactions on fundamentals of electronics, communications and computer sciences

巻 E74-A, 号 10, p. 2983-2989, 発行日 1991-10
出版者
出版者 The Institute of Electronics, Information and Communication Engineers
ISSN
収録物識別子タイプ ISSN
収録物識別子 09168508
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AA10826239
権利
権利情報 copyright©1991 IEICE
著者版フラグ
値 publisher
異版である
関連タイプ isVersionOf
識別子タイプ URI
関連識別子 http://www.ieice.org/jpn/trans_online/
戻る
0
views
See details
Views

Versions

Ver.1 2021-03-01 20:49:53.955901
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3