Institution
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.
Topics: Base station, Mobile station, Transmission (telecommunications), Base station identity code, Terminal (electronics)
Papers published on a yearly basis
Papers
More filters
•
24 May 2002TL;DR: In this paper, a measuring device, with a display mode able to display separately map elements specified by a user selected from a list of map elements existing within the error span of the measured distance of a location by the help of which, the user can determine his/her own location and correct the estimated distance of the location.
Abstract: A measuring device, with a display mode able to display separately map elements specified by a user selected from a list of map elements existing within the error span of the measured distance of a location by the help of which, the user can determine his/her own location and correct the measured distance of the location.
85 citations
•
02 Apr 2004TL;DR: In this article, a fast active scanning wireless network apparatus and method for quick determination of available access points is presented, and a candidate access point is identified from the candidate set and a mobile station queries the access point with a probe request.
Abstract: In a fast active scanning wireless network apparatus and method for quick determination of available access points (20), information about a candidate set of available access points (20) is obtained, and a candidate access point is identified from the candidate set. A mobile station (10) then queries the candidate access point with a probe request that designates the candidate access point as a sole responder. The probe request prevents other access points from contending for the medium of communication between the mobile station and the designated sole responder access point by excluding the attempt by other access points (20) to transmit probe responses. The apparatus and method thus increases the probability of a fast and successful probe request from the mobile station and subsequent response from the designated access point (20). The designated access point may also respond with a probe response of high priority, preventing intervention of communication.
85 citations
•
TL;DR: A novel technique to convert a large class of existing honest-verifier zero-knowledge protocols into ones with these stronger properties in the common reference string model, using a signature scheme existentially unforgeable against adaptive chosen-message attacks.
Abstract: Recently there has been an interest in zero-knowledge protocols with stronger properties, such as concurrency, unbounded simulation soundness, non-malleability, and universal composability. In this paper, we show a novel technique to convert a large class of existing honest-verifier zero-knowledge protocols into ones with these stronger properties in the common reference string model. More precisely, our technique utilizes a signature scheme existentially unforgeable against adaptive chosen-message attacks, and transforms any Σ-protocol (which is honest-verifier zero-knowledge) into an unbounded simulation sound concurrent zero-knowledge protocol. We also introduce Ω-protocols, a variant of Σ-protocols for which our technique further achieves the properties of non-malleability and/or universal composability. In addition to its conceptual simplicity, a main advantage of this new technique over previous ones is that it avoids the Cook-Levin theorem, which tends to be rather inefficient. Indeed, our technique allows for very efficient instantiation based on the security of some efficient signature schemes and standard number-theoretic assumptions. For instance, one instantiation of our technique yields a universally composable zero-knowledge protocol under thee Strong RSA assumption, incurring an overhead of a small constant number of exponentiations, plus the generation of two signatures.
85 citations
•
04 Dec 2002TL;DR: In this article, a network system includes a network edge point configured to provide a terminal with access to a network, which includes a security policy associated with the terminal, and controls communications between the network and the terminal according to the security policy.
Abstract: A network system includes a network edge point configured to provide a terminal with access to a network. The network edge point includes a security policy associated with the terminal, and controls communications between the network and the terminal according to the security policy. The security policy may include a personal filter downloaded from the terminal, a service filter downloaded from a service policy server, and/or a domain filter downloaded from a domain policy server. The terminal may access the network through a second network edge point. The second network edge point may download one or more of the filters from the first network edge point, and control communications between the network and the terminal according to the security policy.
85 citations
••
TL;DR: This paper presents a biologically inspired approach for distributed slot synchronization in wireless networks by modifying and extending a synchronization model based on the theory of pulse-coupled oscillators, which multiplexes synchronization words with data packets and adapts local clocks upon the reception of synchronization words from neighboring nodes.
Abstract: This paper presents a biologically inspired approach for distributed slot synchronization in wireless networks. This is facilitated by modifying and extending a synchronization model based on the theory of pulse-coupled oscillators. The proposed Meshed Emergent Firefly Synchronization (MEMFIS) multiplexes synchronization words with data packets and adapts local clocks upon the reception of synchronization words from neighboring nodes. In this way, a dedicated synchronization phase is mitigated, as a network-wide slot structure emerges seamlessly over time as nodes exchange data packets. Simulation results demonstrate that synchronization is accomplished regardless of the arbitrary initial situation. There is no need for the selection of master nodes, as all nodes cooperate in a completely self-organized manner to achieve slot synchrony. Moreover, the algorithm is shown to scale with the number of nodes, works in meshed networks, and is robust against interference and collisions in dense networks.
84 citations
Authors
Showing all 4032 results
Name | H-index | Papers | Citations |
---|---|---|---|
Amit P. Sheth | 101 | 753 | 42655 |
Harald Haas | 85 | 750 | 34927 |
Giuseppe Caire | 82 | 825 | 40344 |
Craig Gentry | 75 | 222 | 39327 |
Raj Jain | 64 | 424 | 30018 |
Karl Aberer | 63 | 554 | 17392 |
Fumiyuki Adachi | 54 | 1010 | 15344 |
Ismail Guvenc | 52 | 451 | 13893 |
Frank Piessens | 52 | 391 | 10381 |
Wolfgang Kellerer | 49 | 502 | 9383 |
Yoshihisa Kishiyama | 48 | 379 | 11831 |
Ravi Jain | 48 | 160 | 7467 |
Josef A. Nossek | 48 | 623 | 10377 |
Tadao Nagatsuma | 47 | 430 | 11117 |
Christian Bettstetter | 46 | 204 | 11051 |