http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Analysis of Relaying Probability in Wireless Multi-hop Networks with QoS Routing
Kazuyuki Miyakita,Keisuke Nakano,Tetsuya Hasegawa,Masakazu Sengoku,Shoji Shinoda 대한전자공학회 2009 ITC-CSCC :International Technical Conference on Ci Vol.2009 No.7
In wireless multi-hop networks, source and destination nodes usually have some candidate paths between them, and communication quality depends on selection of a multi-hop path from these candidates. We theoretically analyzed ETX which is a measure of communication quality, for three routing algorithms in one-dimensional multi-hop networks. In this paper, we theoretically analyze relaying probability of each relay node in a one-dimensional multi-hop network with QoS routing, which minimizes ETX and propose an algorithm that makes relaying probability of each node as uniform as possible.
Evaluation of Information Floating Considering Change of Mobility of Nodes
Yuta MIFUNE,Kazuyuki MIYAKITA,Keisuke NAKANO 대한전자공학회 2015 ITC-CSCC :International Technical Conference on Ci Vol.2015 No.6
In this paper, we consider Information Floating (IF), which is a virtual infrastructure for information distribution based on epidemic communication, which spreads information by movement of mobile nodes and direct exchange of the information between mobile nodes in a specific area. In the specific area of IF, information is as if floated, and a mobile node that enters the area can receive information from other nodes. In this paper, we consider to use IF to guide people to a commercial place. We evaluate performance of IF to attract customers by computer simulation. In performance evaluation, effects of the change of directions of mobile nodes after receiving the advertisement and location of target places are considered.
A Consideration on Information Floating by Probe Data
Naoyuki KARASAWA,Keisuke NAKANO,Kazuyuki MIYAKITA,Kyosuke KASAGI,Hiroshi TAMURA 대한전자공학회 2015 ITC-CSCC :International Technical Conference on Ci Vol.2015 No.6
In this paper, we consider how to decide places where a message is virtually floated to guide mobile nodes to a certain place in Delay Tolerant Networks. We propose a method to decide the places for Information Floating using probe data. In the proposed method, we estimate the number of visiting nodes by inducement in each place using the volume of traffic between target places. We evaluate the proposed method by computer simulation in a lattice street mobility model.
Analysis of Mean Waiting Time for Message Delivery in Street Ad Hoc Networks
Keisuke Nakano,Akira Otsuka,Kazuyuki Miyakita,Masakazu Sengoku,Shoji Shinoda 대한전자공학회 2009 ITC-CSCC :International Technical Conference on Ci Vol.2009 No.7
In ad hoc networks, it is an important issue to analyze connectivity performance. In this paper, we analyze waiting time to deliver a message M from a source S to a destination D as a measure of connectivity. So far, we proposed approximate methods to compute the mean waiting time in ad hoc networks that consist of mobile nodes moving along a street considering effects of shadowing and change of direction of mobile nodes at intersections in a simple network model. In this paper, we extend these methods to analysis of the mean waiting time in street networks with lattice structure with various types of flows of mobile nodes. We show that the approximate methods can compute the mean waiting time in such complicated street networks successfully, and discuss how the mean waiting time is affected by characteristics of flows of mobile nodes.