Proposal of a addressing mechanism for ad-hoc network

アドホックネットワークは1990年代末以降活発に研究がなされてきた。現在、アドホックネットワークの課題として経路探索に伴うノード検索パケットによるネットワーク帯域の消費がある。この間題に対する一つの解決手法としてノードに位置情報としての意味を持たせ、それを基にルーティングを行うGreedyルーティングプロトコルと呼ばれるプロトコル群がある　Greedyルーティングプロトコルでは位置情報を基にルーティングを行うためルーティングアルゴリズムとは別にネットワーク内の端末にアドレスを割り当てる機構が組み込まれている場合があるが、既存手法では位置情報として地理的な情報を元にしているためノード間の接続状況を反映したものとはならない。そこで本報告ではノードの位置情報と接続情報を考慮ことで既存の割当手法に比べ破棄パケットの発生を低減する手法 を提案する。 Prom the end of 1990's, lots of researchers have discussed the ad-hoc networks. We consider that searching node packets to establish a path to a destination node in ad-hoc networks consume network bandwidth. Several Greedy forwarding protocols, which axe based on information of node location, have been proposed to solve this problem. Greedy forwarding protocol usually has addressing mechanism that assigns IP address according to location information of nodes. However, the information of existing techniques does not reflect link state. In this report, we propose a mechanism for addressing, which lowers rate of loss packets than existing mechanism with the position information reflection of link state

Proposal of clustering technique in P2P network

近年、ファイル共有やコミュニケーションツールなどにおいて、 P2Pネットワークアプリケーションが注目を集めている　P2Pネットワークでは効率的な検索や負荷分散などのため、クラスタリングと呼ばれるピアをグループ化する手法が使用されている。しかし、既存のクラスタリングは各ピアのクラスタ用パラメータが頻繁に変化した場合を想定しておらず、ユーザ同士の会話の内容によってグループ化を行うサービスなどには適さない。そこで本報告では、あえて明確なグループ化を行わないことによって柔軟なクラスタリングを行う手法を提案する.また、本手法の適応例としてオンラインゲームの多人数参加型テトリスを実装した。 In recent years, lots of file sharing applications and communication tools based on the P2P network system have been used. On the P2P network, grouping mechanism called clustering is used to increase efficiency of information search or load balancing. However, existing clustering mechanisms does not react to frequent move of peer. Therefore, these axe not suitable for network applications such as communication tools based on groups of peer which are organized according to content of communication. In this report, we proposed clustering mechanism which does not provide strict grouping but flexible grouping, by which a peer is allowed to belong to several groups. Furthermore, we implemented trial application, massively multiplayer online Tetris, as example of network application with proposal clustering mechanism

トクシマケン イシカイ トウニョウビョウ タイサクハン ダイ1ジ ダイ2ジ カツドウ ノ セイカ

Objective : The effectiveness of diabetes prevention programs for the general population in Tokushima Prefecture was investigated. The programs were designed by Tokushima Medical Association’ s（TMA’s）Steering Committee for Diabetes Prevention. Research design and methods : The committee promoted diabetes prevention by disseminating educational messages on diabetes to the general public and medical care providers, and establishing a referral system among public health centers and medical institutes throughout Tokushima Prefecture during the period from ２００４ to ２００９. The outcome of these activities were evaluated by analyzing data from the Prefectural Health and Nutrition Survey in Tokushima conducted in１９９７（n＝ ９９８）,２００３ （n＝１００８） and ２０１０ （n＝１１３０）, and then comparing these results with those of the national survey at the corresponding times. Results : The percentage of subjects with glucose intolerance at the time of initiation of the prevention program in Tokushima tended to increase from １９９７ to ２００３, but was slightly decreased in ２０１０, although the differences were not statistically significant. However, the percentage of subjects with glucose intolerance was significantly increased throughout Japan during the same period. Obesity parameters, physical activity evaluated by the number of steps and the average total energy intake changed favorably in parallel with changes in the prevalence of diabetes during the study period in Tokushima. Conclusion : The diabetes prevention programs initiated by the TMA’s committee may be useful in ameliorating the situation of diabetes in Tokushima Prefecture