1-4hit |
Performance of network coded cooperation over the Gaussian channel in which multiple communication nodes send each one's message to a common destination is analyzed. The nodes first broadcast the message, and subsequently relay the XOR of subset of decoded messages to the destination. The received vector at the destination can be equivalently regarded as the output of a point-to-point channel, except that the underlying codes are drawn probabilistically and symbol errors may occur before transmission of a codeword. We analyze the error performance of this system from coding theoretic viewpoint.
Masayoshi SHIMAMURA Takeshi IKENAGA Masato TSURU
The explosive growth of Internet usage has caused problems for the current Internet in terms of traffic congestion within networks and performance degradation of end-to-end flows. Therefore, a reconsideration of the current Internet has begun and is being actively discussed worldwide with the goals of enabling efficient share of limited network resources (i.e., the link bandwidth) and improved performance. To directly address the inefficiency of TCP's congestion mitigation solely on the end-to-end basis, in this paper we propose an adaptive split connection scheme on advanced relay nodes; this scheme dynamically splits end-to-end TCP connections on the basis of congestion status in output links. Through simulation evaluations, we examine the effectiveness and potential of the proposed scheme.
Kazuhiro KONO Shinnosuke NAKANO Yoshimichi ITO Noboru BABAGUCHI
This paper aims at analyzing the performance of an anonymous communication system 3-Mode Net with respect to the number of relay nodes required for communication and sender anonymity. As for the number of relay nodes, we give explicit formulas of the probability distribution, the expectation, and the variance. Considering sender anonymity, we quantify the degree of sender anonymity under a situation where some relay nodes collude with each other. The above analyses use random walk theory, a probability generating function, and their properties. From obtained formulas, we show several conditions for avoiding a situation where the number of relay nodes becomes large, and for providing high sender anonymity. Furthermore, we investigate the relationship between the number of relay nodes and sender anonymity, and give a condition for providing a better performance of 3 MN.
Ping LI Mengtian RONG Yisheng XUE Dan YU Lan WANG Hongkui SHI
This paper investigates two issues of cellular engineering for cellular systems enhanced with two-hop fixed relay nodes (FRNs): spectrum partitioning and relay positioning, under the assumption of frequency reuse distance being equal to one. A channel-dependent spectrum partitioning scheme is proposed. According to this scheme, the ensemble mean of signal-to-interference-ratio on respective sets of links are taken into account to determine the bandwidths assigned to links connecting base station (BS) and FRNs, those connecting FRNs and mobile terminals (MTs) and those connecting BS and MTs. The proper FRN positioning is formulated as a constraint optimization problem, which tries to maximize the mean user data rate while at the same time ensures in probability 95% users being better served than in conventional cellular systems without relaying. It is demonstrated with computer simulations that FRN positioning has a strong impact on system performance. In addition, when FRNs can communicate with BS over line-of-sight channels the FRN enhanced cellular system with our proposed spectrum partitioning can remarkably outperform that with a known channel-borrowing based scheme and the conventional cellular systems without relaying. Simulation results also show that with proper FRN positioning the proposed spectrum partitioning scheme is robust against the unreliability of links connecting BS and FRNs.