Masafumi WATARI Thierry ERNST Ryuji WAKIKAWA Jun MURAI
Network Mobility (NEMO) Basic Support is the standard protocol to provide continuous network connectivity and movement transparency to a group of nodes moving together, as in a vehicle. However, the protocol suffers from sub-optimal routing and packet overhead caused by a bi-directional tunnel between the Mobile Router (MR) connecting the mobile network to the Internet and its Home Agent (HA). When a nested NEMO is formed, these inefficiencies become intolerable for real-time multimedia applications. To optimize the delivery of these packets, this study proposes Optimized NEMO (ONEMO) that is capable of providing an optimal path with minimum packet overhead in various scenarios with nested mobility. The protocol is designed to offer the path with minimum signaling overhead and functional requirements are limited to its MRs. Evaluation through measurements against NEMO Basic Support and comparison among other solutions showed effectiveness of the protocol.
Moonseong KIM Tae-Jin LEE Hyunseung CHOO
Mobile IP is a solution to support mobile nodes but it does not handle NEtwork MObility (NEMO). The NEMO Basic Support (NBS) [1] ensures session continuity for all the nodes in a MObile NETwork (MONET). Since the protocol is based on Mobile IP, it inherits from Mobile IP the same fundamental problem such as tunnel convergence, when it is used to support the multicast for NEMO. In this paper, we propose the multicast Route Optimization (RO) scheme in NEMO environments. We suppose that the Mobile Router (MR) has a multicast function and the Nested Mobile Router Information (NeMRI). The NeMRI is used to record a list of the CoAs of all the MRs located below. And it obtains information whether the MRs desire multicast services. Also, we adopt any RO scheme to handle pinball routing. Therefore, we achieve optimal routes for multicasting in NEMO. We also develop analytic models to evaluate the performance of our scheme. We show much lower multicast tree delay and cost in NEMO compared with other techniques such as Bi-directional Tunneling (BT), Remote Subscription (RS), and Mobile Multicast (MoM) based on the NBS protocol.
Yuji KIMURA Koji SHIBATA Takakazu SAKAI Atsushi NAKAGAKI
The decorrelating detector is one of the detecting methods in a direct sequence code division multiple access systems. We investigate the blind adaptive decorrelating detector (BADD) using only the signature of the desired user (DU) according to the assumption that the algorithm is used in downlink. When the BADD is constructed with an antenna array, both the spatial and temporal signature must be taken into consideration for signal detection. We propose the BADD incorporated with the blind estimation of spatial signature (SS) of the DU only from the received signals. As the estimation procedure of SS, the orthogonal projection approximation and subspace tracking algorithm is adopted. The proposed BADD presented the BER improvement with using antenna array. The BER performance has a lower limit with increasing the number of antenna array elements.
The default server strategy is commonly used to manage the location and state of mobile hosts in cellular networks. With this strategy, connections can be established after the client obtains the location information of the mobile host by querying the default server. Unfortunately, the communication cost increases if the query requests are frequent and the distance between the default server and the client is long. Still more, no connection to a mobile host can be established when the default server of the destination mobile host fails. These problems can be solved by replicating the default servers and by letting the nearest replicated default server process the query request which is sent from a client [9]. It is important to allocate replicated default servers efficiently in networks and determine the number of replicated default servers. In this paper, we suggest and evaluate a default server replication strategy to reduce communication costs and to improve service availabilities. We consider optimal replication degree as well as location for replicating the default servers in n-grid and tree networks.
Shinji MIKAMI Takafumi AONISHI Hironori YOSHINO Chikara OHTA Hiroshi KAWAGUCHI Masahiko YOSHIMOTO
In most research work for sensor network routings, perfect aggregation has been assumed. Such an assumption might limit the application of the wireless sensor networks. We address the impact of aggregation efficiency on energy consumption in the context of GIT routing. Our questions are how the most efficient aggregation point changes according to aggregation efficiency and the extent to which energy consumption can decrease compared to the original GIT routing and opportunistic routing. To answer these questions, we analyze a two-source model, which yields results that lend insight into the impact of aggregation efficiency. Based on analytical results, we propose an improved GIT: "aggregation efficiency-aware GIT," or AGIT. We also consider a suppression scheme for exploratory messages: "hop exploratory." Our simulation results show that the AGIT routing saves the energy consumption of the data transmission compared to the original GIT routing and opportunistic routing.
Hong YU Yasuaki INOUE Yuki MATSUYA Zhangcai HUANG
The pseudo-transient method is discussed in this paper as one of practical methods to find DC operating points of nonlinear circuits when the Newton-Raphson method fails. The mathematical description for this method is presented and an effective pseudo-transient algorithm utilizing compound pseudo-elements is proposed. Numerical examples are demonstrated to prove that our algorithm is able to avoid the oscillation problems effectively and also improve the simulation efficiency.
Yuuki FUNAHASHI Shogo USAMI Ichi TAKUMI Masayasu HATA
We have researched high dimensional parity-check (HDPC) codes that give good performance over a channel that has a very high error rate. HDPC code has a little coding overhead because of its simple structure. It has hard-in, maximum detected bit flipping (MDBF) decoding that has reasonable decoding performance and computational cost. In this paper, we propose a modified algorithm for MDBF decoding and compare the proposed MDBF decoding with conventional hard-in decoding.
Urara SHINMYO Minoru KURIBAYASHI Masakatu MORII Hatsukazu TANAKA
For the construction of a large fingerprinting system, conventional protocols need many computations to provide each fingerprinted contents to each user. In order to reduce the computational cost, we introduce a new concept of distributed providers in the fingerprinting protocol. Before a sale, our practical fingerprinting protocol using a concept of secure oblivious transfer is performed between a contents supplier and each provider. Then each provider obtains fingerprinted contents such that each bit of fingerprinting information is embedded in each segment of the contents. When a user orders some contents to the supplier, each segment of the contents is distributed from each provider specified by the supplier. The selection of providers who distribute the segments of contents is executed based on the user's identity so that the sequence of embedded bits in the collected segments may indicate the user's identity.
Dong-Hyun CHAE Kyu-Ho HAN Kyung-Soo LIM Sae-Young AHN Sun-Shin AN
In this paper, the problem of Redundant Duplicated RREQ Network-wide Flooding (RDRNF), induced by multiple sensor nodes during route discovery in event-driven wireless sensor networks, is described. In order to reduce the number of signaling messages during the route discovery phase, a novel extension, named the Localized Route Discovery Extension (LRDE), to the on-demand ad hoc routing protocol, is proposed. The LRDE reduces energy consumption during route discovery. The heuristically and temporarily selected Path Set-up Coordinator (PSC) plays the role of a route request broker that alleviates redundant route request flooding. The LRDE also sets a route path be aggregation-compatible. The PSC can effectively perform data aggregation through the routing path constructed by the LRDE. The simulation results reveal that significant energy is conserved by reducing signaling overhead and performing data aggregation when LRDE is applied to on-demand routing protocols.
For fitting an ellipse to a point sequence, ML (maximum likelihood) has been regarded as having the highest accuracy. In this paper, we demonstrate the existence of a "hyperaccurate" method which outperforms ML. This is made possible by error analysis of ML followed by subtraction of high-order bias terms. Since ML nearly achieves the theoretical accuracy bound (the KCR lower bound), the resulting improvement is very small. Nevertheless, our analysis has theoretical significance, illuminating the relationship between ML and the KCR lower bound.
Yasuto SUZUKI Keiichi KANEKO Mario NAKAMORI
In this paper, we give an algorithm for the node-to-set disjoint paths problem in a transposition graph. The algorithm is of polynomial order of n for an n-transposition graph. It is based on recursion and divided into two cases according to the distribution of destination nodes. The maximum length of each path and the time complexity of the algorithm are estimated theoretically to be O(n7) and 3n - 5, respectively, and the average performance is evaluated based on computer experiments.
Jianshu WENG Chunyan MIAO Angela GOH
How to mitigate the influence of unfair testimonies remains an open issue in the research of rating systems. Methods have been proposed to filter the unfair testimonies in order to mitigate the influence of unfair testimonies. However, existing methods depend on assumptions that ratings follow a particular distribution to carry out the testimony filtering. This constrains them in specific rating systems and hinders their applications in other reputation systems. Moreover, existing methods do not scale well with the increase of testimony number due to their iterative nature. In this paper, a novel entropy-based method is proposed to measure the testimony quality, based on which unfair testimonies are further filtered. The proposed method does not require the assumption regarding the rating distribution. Moreover, it scales linearly with the increase of the testimony number. Experimental results show that the proposed method is effective in mitigating the influence of various types of unfair testimonies.
We present a novel precomputed radiance transfer method for efficient relighting under all-frequency environment illumination. Environment illumination is represented as a set of environment lights. Each environment light comprises a direction and an intensity. In a preprocessing step, the environment lights are clustered into several clusters, taking into account only the light directions. By experiment, we confirmed that the environment lights can be clustered into a much smaller number of clusters than their original number. Given any environment illumination, sampled as an environment map, an efficient relighting is then achieved by computing the radiance using the precomputed clusters. The proposed method enables relighting under very high-resolution environment illumination. In addition, unlike previous approaches, the proposed method can efficiently perform relighting when some regions of the given environment illumination change.
DongWoo LEE Rudrapatna Subramanyam RAMAKRISHNA
Resource performance prediction is known to be useful in resource scheduling in the Grid. The disk I/O workload is another important factor that influences the performance of the CPU and the network which are commonly used in resource scheduling. In the case of disk I/O workload time-series, the adaptation of a prediction algorithm to new time-series should be rapid. Further, the prediction should ensure that the prediction error is minimum in the heterogeneous environment. The storage workload (i.e., the disk I/O load) is a dynamic variable. A prediction parameter based on the characteristics of the current workload must be prepared for prediction purposes. In this paper, we propose and implement the OPHB (On-Line Parameter History Bank). This is a method that stabilizes the incoming disk I/O workload time-series fairly quickly with the help of accurately determined ESM (Exponential Smoothing Method) parameters. The parameters are drawn from a history database. In the case of forecasting with ESM, a smoothing parameter must be specified in advance. If the parameter is statically estimated from observed data found in previous executions, the forecasts would be inaccurate because they do not capture the actual I/O behavior. The smoothing parameter has to be adjusted in accordance with the shape of the new disk I/O workload. The ESM algorithms utilise one of the accumulated parameter histories chronicled by OPHB's Deposit operation. When a new time-series is started, an appropriate parameter value is looked up in the Bank by OPHB's Lookup operation. This is used for the time-series. This process is fully adaptive. We evaluate the proposed method with SES (Single Exponential Smoothing) and ARRSES (Auto-Responsive SES) methods.
Kensuke MURAKI Yasuhiro KAWASAKI Yasuharu MIZUTANI Fumihiko INO Kenichi HAGIHARA
In this paper, we present a resource monitoring and selection method for rapid turnaround grid applications (for example, within 10 seconds). The novelty of our method is the distributed evaluation of resources for rapidly selecting the appropriate idle resources. We integrate our method with a widely used resource management system, namely the Monitoring and Discovery System 2 (MDS2), and compare our method with the original MDS2 in terms of the performance and the scalability. The performance is measured using a 64-node cluster of PCs and the scalability is analyzed using a theoretical model and the measured performance. The experimental results show that our method reduces the resource selection time by 82%, as compared with the original MDS2. The scalability analysis also indicates that our method can keep the resource selection time within 1 second, up to 500 nodes in local-area-network (LAN) environments. In addition, some simulation results are presented to estimate the impact of our method for wide-area-network (WAN) environments.
Norihito FUJITA Joseph D. TOUCH Venkata PINGALI Yu-Shun WANG
This paper describes an architecture for deploying virtual IP networks with P2P-like dynamic topology and routing management. Existing virtual IP network deployment mechanisms do not allow for dynamic topology adaptation and fault-tolerance because provisioning of IP tunnels is performed only once--when a virtual network is deployed. We propose a P2P-XBone, in which a P2P protocol such as DHT drives the topology and the routing table of a virtual IP network consistent with its neighbor node state. We describe how to extend both the existing X-Bone system and P2P mechanisms to achieve interworking between them. The P2P-XBone not only provides P2P's characteristics such as self-organization, fault-tolerance and content-based routing to virtual IP networks but also provides higher forwarding performance and simpler implementation to P2P systems due to the support for the use of existing network services. We also show several results on the evaluation of overhead of P2P-driven provisioning and on forwarding performance.
Takuji TACHIBANA Hiroaki HARAI
In this paper, we propose an end-to-end lightpath establishment method in multi-domain WDM networks. In this method, each domain contracts the provision of wavelength-state information and the number of wavelengths provided to neighbor domains. According to the contract, each source node selects the probed wavelengths, which are the candidates for backward wavelength reservation. In order to select wavelengths that are likely to be idle through the multi-domain network, the source node collects wavelength-state information from each destination node and ranks wavelengths for each destination node for giving priority. The source node selects the wavelengths with higher ranks. We propose two rank accounting methods for this purpose. Through simulation experiments, we show that the proposed rank accounting methods with the above contract provide better performance in terms of blocking probability with conventional methods, especially when intra-domain traffic is low. We present the effective number of contract wavelengths. Further, we also extend these rank accounting methods to methods that aggressively collect wavelength-state information from other destination nodes. We show further improvement of performance by the extended rank accounting methods.
Ayumu KUBOTA Yutaka MIYAKE Toshiaki TANAKA
In order to introduce new routing functionality without changing the Internet infrastructure, many routing overlays have been proposed in recent years. Although such overlays allow us to dynamically and flexibly form various types of networks, the current host name resolution mechanism used in the Internet, i.e. DNS, cannot provide us such flexibility in host name referencing because of its delegation-based administration scheme of domain names. And also, it cannot provide us security because of the lack of wide deployment of its security extension, DNSSEC. In this paper, we propose a generic framework for secure and flexible host name resolution infrastructure that can be shared among many routing overlays. In contrast to DNS with which users are forced to use the domain name space managed by IANA/ICANN, our framework separates the name resolution mechanism from the name spaces it handles, which allows users to choose whatever name space they think appropriate for the identity scheme of their overlay-networking community. This realizes decentralized management of domain names and gives users freedom in domain name acquisition. The basic idea to achieve this is to use a cryptographically generated identifier (i.e. a hash of a public key) as a reference to an administrative domain of overlay networking hosts and allow the owner of the domain to securely publish host information using the corresponding private key. We show that a referencing mechanism for such host information can be easily implemented by using distributed hash tables (DHTs), and then show how such "semantic-free" references to domains can be linked to existing identity scheme in order to allow "human-friendly" referencing.
Masato UCHIDA Satoshi KAMEI Ryoichi KAWAHARA Takeo ABE
A recent trend in routing research is the use of overlay routing to improve end-to-end QoS without changing the network-level architecture. The key of this technology is to find an alternative route that can avoid congested routes, using an overlay network. Developing cost-efficient overlay routing in terms of calculation cost and information distribution cost needed to find an alternative route is important for deploying QoS-aware overlay routing. Thus, this paper evaluates how effective overlay routing can be when the number of alternative route candidates is limited to reduce costs. Evaluation results using actual measurement data indicate that overlay routing is still effective even if alternative route candidates are limited to 1/4 of all possible alternative routes. We also discuss an overlay routing algorithm to enable us to find an appropriate route under the constraint that the number of alternative route candidates is limited.
Haibo ZHENG Xiang CHEN Shidong ZHOU Jing WANG Yongxing ZHOU James Sungjin KIM
In this letter, we propose an efficient user selection algorithm aiming to select users with less spatially correlation and meet the user number limit of zero-forcing beamforming in downlink multiuser MIMO systems. This algorithm yields a considerable complexity reduction with only a small loss in performance and it only needs partial users' CSI feedback. Coupled with the algorithm, a null space updating method in O(K2) time and a modified proportional fair scheduling algorithm are also proposed.