Average and randomized communication complexity

The communication complexity of a two-variable function f(x,y) is the number of information bits two communicators need to exchange to compute f when, initially, each knows only one of the variables. There are several communication-complexity measures corresponding to whether (1) the worst case or average number of bits is considered, (2) computation errors are allowed and (3) randomization is allowed. Tight bounds are provided for the typical behavior of all bounded-error communication-complexity measures of Boolean functions. In the present work, the authors formally define the deterministic model. They describe randomized protocols and compare them to deterministic ones. They both survey previous work and describe original results     

Bounds on capacity and minimum energy-per-bit for AWGN relay channels

Upper and lower bounds on the capacity and minimum energy-per-bit for general additive white Gaussian noise (AWGN) and frequency-division AWGN (FD-AWGN) relay channel models are established. First, the max-flow min-cut bound and the generalized block-Markov coding scheme are used to derive upper and lower bounds on capacity. These bounds are never tight for the general AWGN model and are tight only under certain conditions for the FD-AWGN model. Two coding schemes that do not require the relay to decode any part of the message are then investigated. First, it is shown that the "side-information coding scheme" can outperform the block-Markov coding scheme. It is also shown that the achievable rate of the side-information coding scheme can be improved via time sharing. In the second scheme, the relaying functions are restricted to be linear. The problem is reduced to a "single-letter" nonconvex optimization problem for the FD-AWGN model. The paper also establishes a relationship between the minimum energy-per-bit and capacity of the AWGN relay channel. This relationship together with the lower and upper bounds on capacity are used to establish corresponding lower and upper bounds on the minimum energy-per-bit that do not differ by more than a factor of 1.45 for the FD-AWGN relay channel model and 1.7 for the general AWGN model.     

Context-Based Network and Application Management on Seamless Networking Platform

A context-based adaptive communication system is introduced for use in heterogeneous networks. Context includes the user's presence, location, available network interfaces, network availability, network priority, communication status, terminal features, and installed applications. An experimental system was developed to clarify the feasibility of using context information to flexibly control networks and applications. The system operates on a seamless networking platform we developed for heterogeneous networks. By using contexts, the system can inform the caller and callee of applications they can access, which are available through the network before communication occurs. Changes in contexts can switch an on-going application to another during actual communication. These functions provide unprecedented styles of communication. A business scenario for a seamless networking provider is also presented. Dr. Morikawa has also been in charge of NICT's Mobile Networking Group. Masugi Inoue received his B.E. from Kyoto University in 1992 and his M.E. and D.E. from the University of Tokyo in 1994 and 1997, all in the field of Electrical Engineering. He is currently a senior researcher at the Yokosuka Radio Communications Research Center under the National Institute of Information and Communications Technology (NICT), Japan, and has been engaged in R&D on ultrahigh-speed WLANs and mobile networking. He joined the Communications Research Laboratory (CRL) of the Ministry of Posts and Telecommunications, Japan, in 1997, which was reorganized as NICT in April 2004. He was a visiting researcher at Polytechnic University in Brooklyn, New York in 2000. Khaled Mahmud received his B.Sc. (Eng.) in Electrical and Electronics Engineering from the Bangladesh University of Engineering and Technology in Dhaka in 1991. He received his M.E. and Ph.D. in the same field from Shizuoka University in Japan, in 1997 and 2000, respectively. He was a research fellow at NICT, Japan, from 2000 to 2004. He is currently an Assistant Professor in the Department of Computer Science and Engineering at North South University, Bangladesh. His research interests include modulation-demodulation techniques, software radio, mobile communication systems, wireless Internet, and IP mobility technologies. Homare Murakami received his B.E. and M.E. in Electronic Engineering from Hokkaido University in 1997 and 1999. In 2004, he received the Young Investigators Award from IEICE. He is currently a researcher at NICT's Mobile Networking Group. He is also an industrial PhD student in Aalborg University since 2003. His interest areas are naming scheme, wireless TCP and new transport protocol, IP mobility, fast handover method, and location management. Mikio Hasegawa received his B. Eng, M. Eng., and Dr. Eng. in 1995, 1997, and 2000 from Science University of Tokyo. From 1997 to 2000, he was a Research Fellow of the Japan Society for the Promotion of Science (JSPS). He is currently a senior researcher in Mobile Networking Group, National Institute of Information and Communications Technology, and a technical advisor in ChaosWare Inc. His research interests include applications of chaotic dynamical theory, combinatorial optimization, mobile networks, and ubiquitous computing. Hiroyuki Morikawa received his B.E., M.E., and D.E. in Electrical Engineering from the University of Tokyo in 1987, 1989, and 1992. He is currently an Associate Professor in the Department of Frontier Informatics at the University of Tokyo and is in charge of NICT's Mobile Networking Group. His research interests are in the areas of computer networks, mobile computing/networks, ubiquitous computing, and network services. He serves as Editor of Transactions of the IEICE and has been on the technical program committees of IEEE/ACM conferences and workshops. He sits on numerous telecommunications advisory committees and frequently serves as a consultant to the government.     

Noncoherent space-time coding: An algebraic perspective

The design of space-time signals for noncoherent block-fading channels where the channel state information is not known a priori at the transmitter and the receiver is considered. In particular, a new algebraic formulation for the diversity advantage design criterion is developed. The new criterion encompasses, as a special case, the well-known diversity advantage for unitary space-time signals and, more importantly, applies to arbitrary signaling schemes and arbitrary channel distributions. This criterion is used to establish the optimal diversity-versus-rate tradeoff for training based schemes in block-fading channels. Our results are then specialized to the class of affine space-time signals which allows for a low complexity decoder. Within this class, space-time constellations based on the threaded algebraic space-time (TAST) architecture are considered. These constellations achieve the optimal diversity-versus-rate tradeoff over noncoherent block-fading channels and outperform previously proposed codes in the considered scenarios as demonstrated by the numerical results. Using the analytical and numerical results developed in this paper, nonunitary space-time codes are argued to offer certain advantages in block-fading channels where the appropriate use of coherent space-time codes is shown to offer a very efficient solution to the noncoherent space-time communication paradigm.     

On the Optimality of the ARQ-DDF Protocol

In this correspondence, the performance of the automatic repeat request-dynamic decode and forward (ARQ-DDF) cooperation protocol is analyzed in two distinct scenarios. The first scenario is the multiple access relay channel where a single relay is dedicated to simultaneously help two multiple access users. For this setup, it is shown that the ARQ-DDF protocol achieves the channel's optimal diversity multiplexing tradeoff (DMT). The second scenario is the cooperative vector multiple access channel where two users cooperate in delivering their messages to a destination equipped with two receiving antennas. For this setup, a new variant of the ARQ-DDF protocol is developed where the two users are purposefully instructed not to cooperate in the first round of transmission. Lower and upper bounds on the achievable DMT are then derived. These bounds are shown to converge to the optimal tradeoff as the number of transmission rounds increases.     

Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks

Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the literature for minimum CDS. In this paper, we first reinvestigate their performances. None of these algorithms have constant approximation factors. Thus these algorithms cannot guarantee to generate a CDS of small size. Their message complexities can be as high as O(n ²), and their time complexities may also be as large as O(n ²) and O(n ³). We then present our own distributed algorithm that outperforms the existing algorithms. This algorithm has an approximation factor of at most 8, O(n) time complexity and O(nlogn) message complexity. By establishing the (nlogn) lower bound on the message complexity of any distributed algorithm for nontrivial CDS, our algorithm is thus message-optimal.     

Iterative multiuser detection for coded CDMA signals in AWGN andfading channels

A new iterative receiver for joint detection and decoding of code division multiple access (CDMA) signals is presented. The new scheme is based on a combination of the minimum mean square error (MMSE) criterion and the turbo processing principle by Hagenauer (see Proc. Int. Symp. Turbo Codes and Related Topics, Brest, France, p.1-9, 1997). The complexity of the new scheme is of polynomial order in the number of users. The new scheme is applicable to two situations: (a) when the receiver is capable of decoding the signals from all users and (b) when the receiver is only capable of decoding the signals from a subset of users. In the first scenario, we establish that the proposed receiver achieves superior performance to the iterative soft interference cancellation technique under certain conditions. On the other hand, in the second scenario, we argue that the proposed receiver outperforms both the iterative soft interference canceler and the iterative maximum a posteriori (MAP) receiver because of its superior near-far resistance. For operation over fading channels, the estimation of the complex fading parameters for all users becomes an important ingredient in any multiuser detector. In our scheme, the soft information provided by the decoders is used to enhance this estimation process. Two iterative soft-input channel estimation algorithms are presented: the first is based on the MMSE criterion, and the second is a lower-complexity approximation of the first. The proposed multiuser detection algorithm(s) are suitable for both terrestrial and satellite applications of CDMA     

Advanced Bioresponsive Multitasking Hydrogels in the New Era of Biomedicine

Advanced forms of hydrogels have many inherently desirable properties and can be designed with different structures and functions. In particular, bioresponsive multifunctional hydrogels can carry out sophisticated biological functions. These include in situ single-cell approaches, capturing, analysis, and release of living cells, biomimetics of cell, tissue, and tumor-specific niches. They can allow in vivo cell manipulation and act as novel drug delivery systems, allowing diagnostic, therapeutic, vaccination, and immunotherapy methods. In the present review of multitasking hydrogels, new approaches and devices classified into point-of-care testing (POCT), microarrays, single-cell/rare cell approaches, artificial membranes, biomimetic modeling systems, nanodoctors, and microneedle patches are summarized. The potentials and application of each format are critically discussed, and some limitations are highlighted. Finally, how hydrogels can enable an “all-in-one platform” to play a key role in cancer therapy, regenerative medicine, and the treatment of inflammatory, degenerative, genetic, and metabolic diseases is being looked forward to.     

3D information extraction using Region-based Deformable Net for monocular robot navigation

This paper extends the Region-based Deformable Net (RbDN) technique described in [1] to extract the 3D information of all the objects in the scene from a single moving camera. The technique is used for segmenting real-time video sequences captured from a single moving camera. The deformation process tracks the changes in the location and the shape of the segments across the frames. These changes along with the camera displacement are used to estimate the 3D information. The algorithm is completely autonomous and does not require pre-knowledge, training, or assumption about the contents of the sequence. It can handle the difficult case where the motion of the camera is parallel to its optical axis. It can also estimate the distances to objects that are more than 100 m away as long as the camera displacement is over 10% of the expected distance to the objects.     

Quantum‐Tunneling Metal‐Insulator‐Metal Diodes Made by Rapid Atmospheric Pressure Chemical Vapor Deposition

A quantum‐tunneling metal‐insulator‐metal (MIM) diode is fabricated by atmospheric pressure chemical vapor deposition (AP‐CVD) for the first time. This scalable method is used to produce MIM diodes with high‐quality, pinhole‐free Al₂O₃ films more rapidly than by conventional vacuum‐based approaches. This work demonstrates that clean room fabrication is not a prerequisite for quantum‐enabled devices. In fact, the MIM diodes fabricated by AP‐CVD show a lower effective barrier height (2.20 eV) at the electrode–insulator interface than those fabricated by conventional plasma‐enhanced atomic layer deposition (2.80 eV), resulting in a lower turn on voltage of 1.4 V, lower zero‐bias resistance, and better asymmetry of 107.