NTT DoCoMo

About: NTT DoCoMo is a based out in . It is known for research contribution in the topics: Base station & Mobile station. The organization has 4032 authors who have published 8655 publications receiving 160533 citations.

Hierarchical ID-Based Cryptography

Abstract: We present hierarchical identity-based encryption schemes and signature schemes that have total collusion resistance on an arbitrary number of levels and that have chosen ciphertext security in the random oracle model assuming the difficulty of the Bilinear Diffie-Hellman problem.

Collusion resistant broadcast encryption with short ciphertexts and private keys

Abstract: We describe two new public key broadcast encryption systems for stateless receivers. Both systems are fully secure against any number of colluders. In our first construction both ciphertexts and private keys are of constant size (only two group elements), for any subset of receivers. The public key size in this system is linear in the total number of receivers. Our second system is a generalization of the first that provides a tradeoff between ciphertext size and public key size. For example, we achieve a collusion resistant broadcast system for n users where both ciphertexts and public keys are of size $O(\sqrt{N})$ for any subset of receivers. We discuss several applications of these systems.

A Survey on TOA Based Wireless Localization and NLOS Mitigation Techniques

Abstract: Localization of a wireless device using the time-of-arrivals (TOAs) from different base stations has been studied extensively in the literature. Numerous localization algorithms with different accuracies, computational complexities, a-priori knowledge requirements, and different levels of robustness against non-line-of-sight (NLOS) bias effects also have been reported. However, to our best knowledge, a detailed unified survey of different localization and NLOS mitigation algorithms is not available in the literature. This paper aims to give a comprehensive review of these different TOA-based localization algorithms and their technical challenges, and to point out possible future research directions. Firstly, fundamental lower bounds and some practical estimators that achieve close to these bounds are summarized for line-of-sight (LOS) scenarios. Then, after giving the fundamental lower bounds for NLOS systems, different NLOS mitigation techniques are classified and summarized. Simulation results are also provided in order to compare the performance of various techniques. Finally, a table that summarizes the key characteristics of the investigated techniques is provided to conclude the paper.

Enhanced intercell interference coordination challenges in heterogeneous networks

Abstract: 3GPP LTE-Advanced has recently been investigating heterogeneous network (HetNet) deployments as a cost effective way to deal with the unrelenting traffic demand. HetNets consist of a mix of macrocells, remote radio heads, and low-power nodes such as picocells, femtocells, and relays. Leveraging network topology, increasing the proximity between the access network and the end users, has the potential to provide the next significant performance leap in wireless networks, improving spatial spectrum reuse and enhancing indoor coverage. Nevertheless, deployment of a large number of small cells overlaying the macrocells is not without new technical challenges. In this article, we present the concept of heterogeneous networks and also describe the major technical challenges associated with such network architecture. We focus in particular on the standardization activities within the 3GPP related to enhanced intercell interference coordination.

Network coding: an instant primer

Abstract: Network coding is a new research area that may have interesting applications in practical networking systems. With network coding, intermediate nodes may send out packets that are linear combinations of previously received information. There are two main benefits of this approach: potential throughput improvements and a high degree of robustness. Robustness translates into loss resilience and facilitates the design of simple distributed algorithms that perform well, even if decisions are based only on partial information. This paper is an instant primer on network coding: we explain what network coding does and how it does it. We also discuss the implications of theoretical results on network coding for realistic settings and show how network coding can be used in practice