About: NTT DoCoMo is a(n) based out in . It is known for research contribution in the topic(s): Base station & Mobile station. The organization has 4032 authors who have published 8655 publication(s) receiving 160533 citation(s).
Topics: Base station, Mobile station, Transmission (telecommunications), Base station identity code, Terminal (electronics)
Papers published on a yearly basis
••02 Jun 2013
TL;DR: It is shown that the downlink NOMA with SIC improves both the capacity and cell-edge user throughput performance irrespective of the availability of the frequency-selective channel quality indicator (CQI) on the base station side.
Abstract: This paper presents a non-orthogonal multiple access (NOMA) concept for cellular future radio access (FRA) towards the 2020s information society. Different from the current LTE radio access scheme (until Release 11), NOMA superposes multiple users in the power domain although its basic signal waveform could be based on the orthogonal frequency division multiple access (OFDMA) or the discrete Fourier transform (DFT)-spread OFDM the same as LTE baseline. In our concept, NOMA adopts a successive interference cancellation (SIC) receiver as the baseline receiver scheme for robust multiple access, considering the expected evolution of device processing capabilities in the future. Based on system-level evaluations, we show that the downlink NOMA with SIC improves both the capacity and cell-edge user throughput performance irrespective of the availability of the frequency-selective channel quality indicator (CQI) on the base station side. Furthermore, we discuss possible extensions of NOMA by jointly applying multi-antenna/site technologies with a proposed NOMA/MIMO scheme using SIC and an interference rejection combining (IRC) receiver to achieve further capacity gains, e.g., a three-fold gain in the spectrum efficiency representing a challenging target for FRA.
••04 May 2003
TL;DR: In this article, Boneh, Lynn, and Shacham introduced the concept of an aggregate signature, presented security models for such signatures, and gave several applications for aggregate signatures.
Abstract: An aggregate signature scheme is a digital signature that supports aggregation: Given n signatures on n distinct messages from n distinct users, it is possible to aggregate all these signatures into a single short signature. This single signature (and the n original messages) will convince the verifier that the n users did indeed sign the n original messages (i.e., user i signed message Mi for i = 1, . . . , n). In this paper we introduce the concept of an aggregate signature, present security models for such signatures, and give several applications for aggregate signatures. We construct an efficient aggregate signature from a recent short signature scheme based on bilinear maps due to Boneh, Lynn, and Shacham. Aggregate signatures are useful for reducing the size of certificate chains (by aggregating all signatures in the chain) and for reducing message size in secure routing protocols such as SBGP. We also show that aggregate signatures give rise to verifiably encrypted signatures. Such signatures enable the verifier to test that a given ciphertext C is the encryption of a signature on a given message M. Verifiably encrypted signatures are used in contract-signing protocols. Finally, we show that similar ideas can be used to extend the short signature scheme to give simple ring signatures.
••20 Oct 2010
TL;DR: The greatest value of Mininet will be supporting collaborative network research, by enabling self-contained SDN prototypes which anyone with a PC can download, run, evaluate, explore, tweak, and build upon.
Abstract: Mininet is a system for rapidly prototyping large networks on the constrained resources of a single laptop The lightweight approach of using OS-level virtualization features, including processes and network namespaces, allows it to scale to hundreds of nodes Experiences with our initial implementation suggest that the ability to run, poke, and debug in real time represents a qualitative change in workflow We share supporting case studies culled from over 100 users, at 18 institutions, who have developed Software-Defined Networks (SDN) Ultimately, we think the greatest value of Mininet will be supporting collaborative network research, by enabling self-contained SDN prototypes which anyone with a PC can download, run, evaluate, explore, tweak, and build upon
24 Oct 2011-IEEE Wireless Communications
TL;DR: The most important addenda of the proposed E3F are a sophisticated power model for various base station types, as well as large-scale long-term traffic models, which are applied to quantify the energy efficiency of the downlink of a 3GPP LTE radio access network.
Abstract: In order to quantify the energy efficiency of a wireless network, the power consumption of the entire system needs to be captured. In this article, the necessary extensions with respect to existing performance evaluation frameworks are discussed. The most important addenda of the proposed energy efficiency evaluation framework (E3F) are a sophisticated power model for various base station types, as well as large-scale long-term traffic models. The BS power model maps the RF output power radiated at the antenna elements to the total supply power of a BS site. The proposed traffic model emulates the spatial distribution of the traffic demands over large geographical regions, including urban and rural areas, as well as temporal variations between peak and off-peak hours. Finally, the E3F is applied to quantify the energy efficiency of the downlink of a 3GPP LTE radio access network.
••01 Dec 2002
TL;DR: In this article, the authors presented 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.
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.
Showing all 4032 results
|Amit P. Sheth||101||753||42655|
|Josef A. Nossek||48||623||10377|
Related Institutions (5)
35.3K papers, 584.5K citations
28.3K papers, 695.7K citations
38.4K papers, 804.6K citations
Cisco Systems, Inc.
18.9K papers, 471.2K citations
Nippon Telegraph and Telephone
22.3K papers, 430.4K citations