http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Nakano, Keisuke,Yoshioka, Hiroshi,Sengoku, Masakazu,Shinoda, Shoji 대한전자공학회 1996 APCCAS:Asia Pacific Conference on Circuits And Sys Vol.1 No.1
Dynamic Channel Assignment (DCA), which improves the efficiency of channel use in cellular mobile communication systems, requires finding an available channel for a new call after the call origination. This causes the delay which is defined as the time elapsing between call origination and completion of the channel search. For system planning, it is important to evaluate the delay characteristic of DCA because the delay corresponds to the waiting time of a call and influences service quality. It is, however, difficult to theoretically analyze the delay characteristics except its worst case behavior. The objective of this paper is analyzing the distribution and the mean value of the delay theoretically. This analysis is based on the Clique Packing model for analyzing the blocking rate performance of DCA.
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.
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.