1-15hit |
Speeded up robust features (SURF) can detect/describe scale- and rotation-invariant features at high speed by relying on integral images for image convolutions. However, the time taken for matching SURF descriptors is still long, and this has been an obstacle for use in real-time applications. In addition, the matching time further increases in proportion to the number of features and the dimensionality of the descriptor. Therefore, we propose a fast matching method that rearranges the elements of SURF descriptors based on their entropies, divides SURF descriptors into sub-descriptors, and sequentially and analytically matches them to each other. Our results show that the matching time could be reduced by about 75% at the expense of a small drop in accuracy.
In this paper, we investigate the resource and power allocation schemes of partial block multi-carrier code division multiple access (PB/MC-CDMA) systems. In our proposed scheme, we manage transmit power depending on each user's channel state information (CSI). The objective is to maximize the average bit error ratio (BER) performance with minimal influence from the received signal-to-interference ratio (SIR), both of which are closely related to transmit power. To obtain additional performance improvement, our frequency band rearrangement scheme follows the transmit power control (TPC) process. We evaluate the performance of the proposed scheme using simulations. The results show that the proposed system provides superior performance compared to those of conventional systems.
In UMTS (universal mobile telecommunications system) networks upgraded with HSPA (high speed packet access) technology, the high access bandwidth and advanced mobile devices make it applicable to share large files among mobile users by peer-to-peer applications. To receive files quickly is essential for mobile users in file sharing applications, mainly because they are subject to unstable signal strength and battery failures. While many researches present peer-to-peer file sharing architectures in mobile environments, few works focus on decreasing the time spent in disseminating files among users. In this paper, we present an efficient peer-to-peer file sharing design for HSPA networks called AFAM -- Adaptive efficient File shAring for uMts networks. AFAM can decrease the dissemination time by efficiently utilizing the upload-bandwidth of mobile nodes. It uses an adaptive rearrangement of a node's concurrent uploads, which causes the count of the node's concurrent uploads to lower while ensuring that the node's upload-bandwidth can be efficiently utilized. AFAM also uses URF -- Upload Rarest First policy for the block selection and receiver selection, which achieves real rarest-first for the spread of blocks and effectively avoids the "last-block" problem in file sharing applications. Our simulations show that, AFAM achieves much less dissemination time than other protocols including BulletPrime and a direct implementation of BitTorrent for mobile environments.
Xuesong TAN Shuo-Yen Robert LI
The cascade of two baseline networks in tandem is a rearrangeable network. The cascade of two omega networks appended with a certain interconnection pattern is also rearrangeable. These belong to the general problem: for what banyan-type network (i.e., bit-permuting unique-routing network) is the tandem cascade a rearrangeable network? We relate the problem to the trace and guide of banyan-type networks. Let τ denote the trace permutation of a 2n2n banyan-type network and γ the guide permutation of it. This paper proves that rearrangeability of the tandem cascade of the network is solely determined by the transposition τγ-1. Such a permutation is said to be tandem rearrangeable when the tandem cascade is indeed rearrangeable. We identify a few tandem rearrangeable permutations, each implying the rearrangeability of the tandem cascade of a wide class of banyan-type networks.
Xiaohong JIANG Pin-Han HO Hong SHEN Susumu HORIGUCHI
Vertical stacking is a novel technique for creating nonblocking (crosstalk-free) optical multistage interconnection networks (MINs). In this paper, we propose a new class of optical MINs, the vertically stacked Benes (VSB) networks, for crosstalk-free realization of permutations in a single pass. An NN VSB network requires at most O(Nlog N) switching elements, which is the same as the Benes network, and much lower overall hardware cost than that of the existing optical MINs built on the combination of horizontal expansion and vertical stacking of banyan networks, to provide the same crosstalk-free permutation capability. Furthermore, the structure of VSB networks provides a more flexible way for constructing optical MINs because they give more choices in terms of the number of stages used in an optical MIN. We also present efficient algorithms to realize crosstalk-free permutations in an NN VSB network in time O(Nlog N), which matches the same bound as required by the reported schemes.
Xiaohong JIANG Hong SHEN Md. Mamun-ur-Rashid KHANDKER Susumu HORIGUCHI
Crosstalk in optical switch is an intrinsic drawback of optical networks, and avoiding crosstalk is important for making optical network work properly. Horizontal expansion and vertical stacking are two basic techniques for creating nonblocking multistage interconnection networks (MINs). Rearrangeable (nonblocking) optical MINs are feasible since they have lower complexity than their strictly nonblocking counterparts. In this paper, we study the crosstalk-free permutations in rearrangeable optical MINs built on a combination of horizontal expansion and vertical stacking of banyan networks, and provide a scheme for realizing crosstalk-free permutations in this kind of optical MINs. The basic idea of this scheme is to first decompose a permutation into multiple partial permutations by using Euler Split technique, then route and realize each of these partial permutations crosstalk-free in one plane (stacked copy) of a MIN based on both the Euler Split technique and self-routing property of a banyan network. The tradeoff between the overall time complexity and hardware cost of this class of MINs is also explored in this paper.
Hiroyuki ATARASHI Masao NAKAGAWA
An efficient ARQ scheme based on the packet combining technique is investigated for multi-carrier modulation systems. In multi-carrier modulation systems, several sub-carriers are used for high data rate transmission and their individual received signal quality becomes different from one sub-carrier to others in a frequency selective fading channel. Therefore by changing the assignment of data to the sub-carriers in the retransmission packets, the distortion between the previous transmitted packet and the newly retransmitted one will be different. This is the principle of the proposed adaptive data order rearrangement for a packet combining ARQ scheme, which can achieve more diversity gain in packet combining and improve the ARQ performance. From the results of the theoretical analysis and the computer simulation, it is confirmed that the proposed packet combining ARQ with the proposed operation can achieve the better performance in terms of the average packet transmission success probability. In addition, this proposed scheme is also compared with the conventional multi-carrier modulation ARQ scheme based on the partial retransmission of a packet. The computer simulation results demonstrate that the proposed scheme has also advantage against the latter one, and it is considered to be as a more efficient ARQ scheme for multi-carrier modulation systems.
Ayano YAMASHITA Ryutaro KAWAMURA Hisaya HADAMA
In this paper, we introduce a VP rearrangement scheme to realize the dynamic control of ATM network. We demonstrate its effectiveness for the transport of B-ISDN traffic which is both fluctuous and hard to predict. First, we present a strategy for the ATM network provisioning, used to manage both the logical VP network and the underlying physical transport network. We then propose a VP rearrangement scheme and discuss its performance. Lastly, we analyze the proposed scheme by simulations, and confirm that its performance, in comparison to the conventional, dynamic VP bandwidth control scheme, is superior.
Tazuko TOMIOKA Shigeru OHSHIMA
We have proposed a connection-based optical wavelength division multiplexing network architecture. For the networks such as inter-office LANs, the guarantee of the bandwidths of connection-oriented calls is necessary. Notable features of the network are that multicast can be executed without copying the same data, and that time slots are rearrangeable to increase the throughput. The topology is passive star and a network controller (NWC) is connected to manage the time slot assignment. Each station's transmitting wavelength is fixed and is different from that of other stations. Each receiver changes the receiving wavelength slot by slot. Stations reserve time slots with permission of the NWC. Once a time slot is reserved the station can use the slot in every frame until the reservation is cancelled. This feature guarantees the bandwidths of connection-oriented calls. Upon receiving a time slot request, the NWC searches for a not-in-use slot common to the source station's transmitter (Tx) and the destination station's receiver (Rx). If there is no common empty slot and both the Tx and the Rx have empty slots, the NWC rearranges the already allocated time slots to create a new common empty slot. Simulations were performed to estimate the blocking rates for various cases of call bandwidth including multi-bitrate (the case in which various bandwidth calls are generated in a network) and multicast call, the calculation load of the NWC when it assigns a time slot including rearrangement, and the success rate of rearrangement. It was found that the blocking rate with the rearrangement is greatly reduced (1/10) compared with the case without rearrangement of the same throughput when the number of slots in a frame is more than 120, the number of stations in the network is 60 and the blocking rate without the rearrangement is less than 10-2. Over 100 Gbps throughput can be achieved when the number of slots in a frame is 120-240, the number of stations is 60, the bitrate of a transmitter is 2.5Gbps and the blocking rate is about 10-2. The rearrangement is especially effective in the case of multi-bitrate in which the blocking rate can be reduced to 1/100 that of the case without rearrangement at some point. It is also shown that a slot assignment including rearrangement can be executed sufficiently quickly (5s). These results indicate that practical realization of this access control architecture is possible.
Kazuhiko SHIMADA Takeshi WATANABE Masakazu SENGOKU Takeo ABE
The applicability of Dynamic Channel Assignment methods to a Reuse Partitioning system in cellular radio systems is investigated in this paper. The investigations indicate that such a system has a tendency to increase the difference between blocking probability for the partitioning two coverage areas in comparison with the conventional Reuse Partitioning system employing Fixed Channel Assignment method. Two schemes using new Channel Rearrangement algorithms are also proposed in order to alleviate the difference as a disadvantage which gives unequal service to the system. The simulation results show that the proposed schemes are able to reduce the difference significantly while increasing the carried traffic by 10% as compared with the conventional system.
Masayuki KASHIMA Ryouichi WATANABE Ryouhei KONUMA Hiroshi INOUE Yoshikatsu SHIRAISHI
Various approaches on optical network systems using wavelength-division multiplexing (WDM) technique have been proposed. It is difficult to make a scale of WDM network larger since a number of the optical wavelength which can be used is limited. In order to make easily larger scale of network, multi-hop WDM network have been proposed. We have studied 2-hop network: RookNet which has simple routing algorithm and high network throughput. Nodes in RookNet are divided into row groups and column groups and are placed in a mesh form. Packets are transferred between nodes over 1-hop or 2-hops. The 2-hop transfer means that a source node sends packets to a destination node via a relay node. When 2-hop traffic increases, relay processing time in a relay node is increasing. This is the reason that network throughput becomes low. To solve this problem is very important. In this paper, we show RookNet rearrangement algorithm which replaces location of node within group so as to decrease the 2-hop traffic and to maintain high network throughput. Proposed rearrangement algorithm can achieve improvement of 10 percent in terms of throughput. We also propose RookNet configuration which discriminates optical wavelength and subcarrier effectively in order to decrease the relay processing time.
Throughout the paper, the nearest-neighbour (NN) interconnection of switches within a multistage interconnection network (MIN) is analysed. Three main results are obtained: (1) The switch preserving transformation of a 2-D MIN into the 1-D MIN (and vice versa) (2) The rearrangeability of the MIN and (3) The number of stages (NS) for the rearrangeable nonblocking interconnection. The analysis is extended to any dimension of the interconnected data set. The topological equivalence between 1-D MINs with NN interconnections (NN-MINs) and 1-D cellular arrays is shown.
Kazuhiko SHIMADA Keisuke NAKANO Masakazu SENGOKU Takeo ABE
In cellular mobile systems, an alternative approach for a Dynamic Channel Assignment problem is presented. It adaptively assigns the channels considering the cochannel interference level. The Dynamic Channel Assignment problem is modeled on the different cellular system from the conventional one. In this paper, we formulate the rearrangement problem in the Dynamic Channel Assignment and propose a novel strategy for the problem. The proposed algorithm is based on an artificial neural network as a specific dynamical system, and is successfully applied to the cellular system models. The computer simulation results show that the algorithm utilized for the rearrangement is an effective strategy to improve the traffic characteristics.
Keisuke NAKANO Masakazu SENGOKU Toshihiko TAKAHASHI Yoshio YAMAGUCHI Shoji SHINODA Takeo ABE
In mobile communication systems using Dynamic Channel Assignment, channels are possible to be rearranged so that blocking probability can be made low. The smaller the number of cells where channels are rearranged, the smaller the load on the base stations in the cells. Also, we can reduce the deterioration of communication quality caused by reassingning a new channel to a call instead of the channel already assigned. In this paper, we consider not only how to rearrange channels but also which channel should be rearranged and assigned to a new call in rearrangement, and propose very simple but effective methods for rearrangement. The ways to select a candidate channel to be rearranged and assigned to a new call in the new methods make the number of cells where a channel is rearranged smaller. We also examine the relations between characteristics and the number of cells where a channel is rearranged. Using computer simulation results, the properties of the new rearrangement methods are compared with those of the traditional methods.
Keisuke NAKANO Masaharu YOKONO Masakazu SENGOKU Yoshio YAMAGUCHI Shoji SHINODA Seiichi MOTOOKA Takeo ABE
In general, dynamic channel assignment has a better performance than fixed channel assignment in a cellular mobile communication system. However, it is complex to control the system and a lot of equipments are required in each cell when dynamic channel assignment is applied to a large service area. Therefore, it is effective to limit the size of the service area in order to correct the defects of dynamic channel assignment. So, we propose an application of dynamic channel assignment to a part of a service area when fixed channel assignment is applied to the remaining part of the area. In the system, the efficiency of channel usage in some cells sometimes becomes terribly low. The system has such a problem to be improved. We show that the rearrangement of the channel allocation is effective on the problem.