ログイン
言語:

WEKO3

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

Field does not validate



インデックスリンク

インデックスツリー

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

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 030 理工学 Science & engineering
  2. 学術雑誌掲載論文

Performance Evaluation of Route Cost for Wireless Sensor Networks with a Mobile Sink

https://iwate-u.repo.nii.ac.jp/records/10238
https://iwate-u.repo.nii.ac.jp/records/10238
9552f217-593b-4de1-bec2-7c3354b5668c
名前 / ファイル ライセンス アクション
jc-v4i2p1-8.pdf jc-v4i2p1-8.pdf (1.4 MB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2013-01-28
タイトル
タイトル Performance Evaluation of Route Cost for Wireless Sensor Networks with a Mobile Sink
キーワード
主題Scheme Other
主題 Wireless Sensor Network (WSN)
キーワード
主題Scheme Other
主題 route cost
キーワード
主題Scheme Other
主題 mobile sink node
キーワード
主題Scheme Other
主題 cluster
キーワード
主題Scheme Other
主題 Traveling Salesman Problem (TSP)
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_6501
資源タイプ journal article
著者 Nizamudun, Yarmuhammat

× Nizamudun, Yarmuhammat

Nizamudun, Yarmuhammat

Search repository
Nakaya, Naoshi

× Nakaya, Naoshi

Nakaya, Naoshi

Search repository
Hagihara, Yukari

× Hagihara, Yukari

Hagihara, Yukari

Search repository
Koui, Yuji

× Koui, Yuji

Koui, Yuji

Search repository
著者(機関)
値 Graduate Institute of Engineering, Iwate University
登録日
日付 2013-01-28
書誌情報 Journal of Computing

巻 4, 号 2, p. 1-8, 発行日 2012-02-01
ISSN
収録物識別子タイプ ISSN
収録物識別子 2151-9617
Abstract
内容記述タイプ Other
内容記述 Recently Wireless Sensor Network (WSN) technology has been developing remarkably and it’s expected to be applied to many applications such as plant management, crime prevention, disaster prevention, medical treatment, traffic systems, and so on. In this article, we propose a Mobile Sink node control method for Wireless Sensor Networks. These WNS Networks are composed from two types of sensor node, one a “fixed node” which is immovable, and the other one a “mobile sink node” which is movable. The fixed nodes will form the clusters, and then the Mobile Sink node by using the Nearest Addition Method of TSP (Traveling Salesman Problem) which moves around the cluster center, decides the best rotation of the communication among the clusters, following which it decides the best fixed node to make the shortest distance of communication. The chosen best fixed node will transfer its data to the Mobile Sink node when it reaches them. Moreover the mobile Sink node is also capable to sense the possibility of communication of more than a few clusters in between, from then it would identify the best path for collecting the data. This method has proved its efficiency from the results of simulation and experiments that we have conducted and it would evaluate the performance of route cost for a mobile sink node.
出版者
出版者 Journal of Computing
著者版フラグ
出版タイプ VoR
出版タイプResource http://purl.org/coar/version/c_970fb48d4fbd8a85
戻る
0
views
See details
Views

Versions

Ver.1 2023-05-15 14:45:18.198213
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

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

Confirm


Powered by WEKO3


Powered by WEKO3