Showing papers by "NTT DoCoMo published in 2005"

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.

Self-organization in communication networks: principles and design paradigms

Abstract: The trend toward ubiquitous wireless communication demands for a higher level of self-organization in networks. This article gives an introduction and overview on this topic and investigates the fundamental question: What are design paradigms for developing a self-organized network function? We propose four paradigms and show how they are reflected in current protocols: design local interactions that achieve global properties, exploit implicit coordination, minimize the maintained state, and design protocols that adapt to changes. Finally, we suggest a general design process for self-organized network functions.

Network coding for efficient communication in extreme networks

Abstract: Some forms of ad-hoc networks need to operate in extremely performance-challenged environments where end-to-end connectivity is rare. Such environments can be found for example in very sparse mobile networks where nodes "meet" only occasionally and are able to exchange information, or in wireless sensor networks where nodes sleep most of the time to conserve energy. Forwarding mechanisms in such networks usually resort to some form of intelligent flooding, as for example in probabilistic routing.We propose a communication algorithm that significantly reduces the overhead of probabilistic routing algorithms, making it a suitable building block for a delay-tolerant network architecture. Our forwarding scheme is based on network coding. Nodes do not simply forward packets they overhear but may send out information that is coded over the contents of several packets they received. We show by simulation that this algorithm achieves the reliability and robustness of flooding at a small fraction of the overhead.

Connectivity of wireless multihop networks in a shadow fading environment

Abstract: This article analyzes the connectivity of multihop radio networks in a log-normal shadow fading environment. Assuming the nodes have equal transmission capabilities and are randomly distributed according to a homogeneous Poisson process, we give a tight lower bound for the minimum node density that is necessary to obtain an almost surely connected subnetwork on a bounded area of given size. We derive an explicit expression for this bound, compute it in a variety of scenarios, and verify its tightness by simulation. The numerical results can be used for the practical design and simulation of wireless sensor and ad hoc networks. In addition, they give insight into how fading affects the topology of multihop networks. It is explained why a high fading variance helps the network to become connected.

Single-database private information retrieval with constant communication rate

Abstract: We present a single-database private information retrieval (PIR) scheme with communication complexity ${\mathcal O}(k+d)$, where k ≥ log n is a security parameter that depends on the database size n and d is the bit-length of the retrieved database block. This communication complexity is better asymptotically than previous single-database PIR schemes. The scheme also gives improved performance for practical parameter settings whether the user is retrieving a single bit or very large blocks. For large blocks, our scheme achieves a constant “rate” (e.g., 0.2), even when the user-side communication is very low (e.g., two 1024-bit numbers). Our scheme and security analysis is presented using general groups with hidden smooth subgroups; the scheme can be instantiated using composite moduli, in which case the security of our scheme is based on a simple variant of the “Φ-hiding” assumption by Cachin, Micali and Stadler [2].

Challenges in software evolution

Abstract: Today's information technology society increasingly relies on software at all levels. Nevertheless, software quality generally continues to fall short of expectations, and software systems continue to suffer from symptoms of aging as they are adapted to changing requirements and environments. The only way to overcome or avoid the negative effects of software aging is by placing change and evolution in the center of the software development process. In this article we describe what we believe to be some of the most important research challenges in software evolution. The goal of this document is to provide novel research directions in the software evolution domain.

A semantic Web services architecture

Abstract: The semantic Web services initiative architecture (SWSA) committee has created a set of architectural and protocol abstractions that serve as a foundation for semantic Web service technologies. This article summarizes the committee's findings, emphasizing its review of requirements gathered from several different environments. We also identify the scope and potential requirements for a semantic Web services architecture.

Language constructs for context-oriented programming: an overview of ContextL

Abstract: ContextL is an extension to the Common Lisp Object System that allows for Context-oriented Programming. It provides means to associate partial class and method definitions with layers and to activate and deactivate such layers in the control flow of a running program. When a layer is activated, the partial definitions become part of the program until this layer is deactivated. This has the effect that the behavior of a program can be modified according to the context of its use without the need to mention such context dependencies in the affected base program. We illustrate these ideas by providing different UI views on the same object while, at the same time, keeping the conceptual simplicity of object-oriented programming that objects know by themselves how to behave, in our case how to display themselves. These seemingly contradictory goals can be achieved by separating class definitions into distinct layers instead of factoring out the display code into different classes.

Downlink transmission of broadband OFCDM Systems-part I: hybrid detection

Abstract: The broadband orthogonal frequency and code division multiplexing (OFCDM) system with two-dimensional spreading (time and frequency domain spreading) is becoming a very attractive technique for high-rate data transmission in future wireless communication systems. In this paper, a quasianalytical study is presented on the downlink performance of the OFCDM system with hybrid multi-code interference (MCI) cancellation and minimum mean square error (MMSE) detection. The weights of MMSE are derived and updated stage by stage of MCI cancellation. The effects of channel estimation errors and sub-carrier correlation are also studied. It is shown that the hybrid detection scheme performs much better than pure MMSE when good channel estimation is guaranteed. The power ratio between the pilot channel and all data channels should be set to 0.25, which is a near optimum value for the two-dimensional spreading system with time domain spreading factor (N/sub T/) of 4 and 8. On the other hand, in a slow fading channel, a large value of the channel estimation window size /spl gamma/N/sub T/, where /spl gamma/ is an odd integer, is expected. However, /spl gamma/=3 is large enough for the system with N/sub T/=8 while /spl gamma/=5 is more desirable for the system with N/sub T/=4. Although performance of the hybrid detection degrades in the presence of the sub-carrier correlation, the hybrid detection still works well even the correlation coefficient is as high as 0.7. Finally, given N/sub T/, although performance improves when the frequency domain spreading factor (N/sub F/) increases, the frequency diversity gain is almost saturated for a large value of N/sub F/ (i.e., N/sub F/ /spl ges/ 32).

Correlation matrix distance, a meaningful measure for evaluation of non-stationary MIMO channels

Abstract: The correlation matrix distance (CMD), an earlier introduced measure for characterization of non-stationary MIMO channels, is analyzed regarding its capability to predict performance degradation in MIMO transmission schemes. For that purpose we consider the performance reduction that a prefiltering MIMO transmission scheme faces due to non-stationary changes of the MIMO channel. We show that changes in the spatial structure of the channel corresponding to high values in the CMD also show up as a significant reduction in performance of the considered MIMO transmission scheme. Such significant changes in the spatial structure of the mobile radio channel are shown to appear also for small movements within an indoor environment. Stationarity can therefore not always be assumed for indoor MIMO radio channels.

Method and apparatus for loudspeaker equalization

Abstract: To compensate for the distortions of the electro-acoustic conversion in small loudspeakers, the signal is passed through a predistortion filter placed between the audio signal source and the loudspeaker. Volterra based predistortion filters are generally used to compensate for loudspeaker nonlinear distortions. At high playback levels, Volterra preinverse may not improve the perceptual quality. An adaptive precompensator based on the exact inverse of the Volterra model is presented. The technique adjusts the precompensator parameters to minimize the instantaneous error between the input and the compensated output of the loudspeaker. The exact inverse has superior performance at high playback levels resulting in higher perceptual quality.

Advances in Wireless Video Delivery

Abstract: This paper reviews practical video delivery technologies, examining existing mobile networks, commercialized or standardized transport, and coding technologies. Compression efficiency, power dissipation, and error control are intrinsic issues in wireless video delivery. Among these issues, error control technologies are evaluated at four layers: 1) layer-1/2 transport; 2) end-to-end transport layer such as TCP/IP or RTP/UDP/IP; 3) error-resilience tool and network adaptation layer) and 4) source coder layer. Layer-1/2 transport tends to provide two distinct conditions: one quasi-error-free, in which upper layer error control technologies show a limited improvement, and one with a burst of errors during the fading period, in which the adaptability of error control is essential. Emerging mobile network quality of service will have a large variation of bandwidth and delay. Thus, adaptive rate control and error recovery are identified as more crucial issues for future research.

Packet Transmission Control Device and Packet Transmission Control Method

Abstract: The present invention relates to a packet transmission control device which controls transmission of packets to a plurality of mobile stations. A scheduling unit of the packet transmission control device according to the present invention is configured to schedule the packets to each of the plurality of mobile stations, based on an average transmission rate, a minimum guaranteed transmission rate, a scheduling frequency and capability information.

Quickly finding near-optimal storage designs

Abstract: Despite the importance of storage in enterprise computer systems, there are few adequate tools to design and configure a storage system to meet application data requirements efficiently. Storage system design involves choosing the disk arrays to use, setting the configuration options on those arrays, and determining an efficient mapping of application data onto the configured system. This is a complex process because of the multitude of disk array configuration options, and the need to take into account both capacity and potentially contending I/O performance demands when placing the data. Thus, both existing tools and administrators using rules of thumb often generate designs that are of poor quality.This article presents the Disk Array Designer (DAD), which is a tool that can be used both to guide administrators in their design decisions and to automate the design process. DAD uses a generalized best-fit bin packing heuristic with randomization and backtracking to search efficiently through the huge number of possible design choices. It makes decisions using device models that estimate storage system performance. We evaluate DAD's designs based on traces from a variety of database, filesystem, and e-mail workloads. We show that DAD can handle the difficult task of configuring midrange and high-end disk arrays, even with complex real-world workloads. We also show that DAD quickly generates near-optimal storage system designs, improving in both speed and quality over previous tools.

Multiband mobile communication system and transmitter used therein

Abstract: A transmitter used in the multiband environment includes a frequency allocation unit (106) configured to select and allocate a frequency band that satisfies a user QoS from among multiple separate frequency bands currently available for the user, a parameter determination unit (111) configured to determine a transmission parameter required for signal transmission based on the allocated frequency band, and a multi-user scheduling control unit (110) configured to determine a transmission schedule for multiple users taking into account the frequency bands allocated to the multiple users.

Wireless base station apparatus and wireless communication control method

Abstract: A wireless base station apparatus (100) used in a wireless communications system includes a statistical processing unit (140) that performs statistical processing on downlink radio quality information reported from a wireless communications terminal device; a radio quality information offsetting unit (160) that adjusts the statistically processed downlink radio quality information based on a downlink transmission confirmation (ACK/NACK/DTX) message transmitted from the wireless communications terminal device and a required downlink quality; a transport format determination unit (170) that determines a downlink transport format based on the statistically processed radio quality information or the offset-adjusted radio quality information; and a transmitting unit (111) that transmits a downlink channel with the determined downlink transport format.

Two-Server password-only authenticated key exchange

Abstract: Typical protocols for password-based authentication assume a single server which stores all the information (e.g.), the password necessary to authenticate a user. Unfortunately, an inherent limitation of this approach (assuming low-entropy passwords are used) is that the user's password is exposed if this server is ever compromised. To address this issue, a number of schemes have been proposed in which a user's password information is shared among multiple servers, and these servers cooperate in a threshold manner when the user wants to authenticate. We show here a two-server protocol for this task assuming public parameters available to everyone in the system (as well as the adversary). Ours is the first provably-secure two-server protocol for the important password-only setting (in which the user need remember only a password, and not the servers' public keys), and is the first two-server protocol (in any setting) with a proof of security in the standard model.

Identity-Based hierarchical strongly key-insulated encryption and its application

Abstract: In this paper, we discuss non-interactive updating of decryption keys in identity-based encryption (IBE). In practice, key revocation is a necessary and inevitable process and IBE is no exception when it comes to having to manage revocation of decryption keys without losing its merits in efficiency. Our main contribution of this paper is to propose novel constructions of IBE where a decryption key can be renewed without having to make changes to its public key, i.e. user’s identity. We achieve this by extending the hierarchical IBE (HIBE). Regarding security, we address semantic security against adaptive chosen ciphertext attacks for a very strong attack environment that models all possible types of key exposures in the random oracle model. In addition to this, we show method of constructing a partially collusion resistant HIBE from arbitrary IBE in the random oracle model. By combining both results, we can construct an IBE with non-interactive key update from only an arbitrary IBE.

Efficient Tomlinson-Harashima precoding for spatial multiplexing on flat MIMO channel

Abstract: Nonlinear minimum mean square error Tomlinson-Harashima precoding considered in this paper is an attractive solution for a scenario where a transmitter serves spatially separated receivers and no cooperation among them is possible. Unfortunately, the large performance gain against linear precoding comes along with significantly higher complexity than linear filters in the case of a large number of receivers. We show that superior performance of the nonlinear minimum mean square error Tomlinson-Harashima precoding can be obtained with complexity equivalent to linear precoding. Our proposed algorithm reduces the complexity by a factor of N/sub R/ which is the number of receivers.

A frequency band allocation device and method

Abstract: A frequency band allocation device is disclosed. The frequency band allocation device comprises a frequency band selection unit for selecting usable frequency bands from a dedicated frequency band, a registered frequency band and an unlicensed frequency band; and a frequency band allocation unit for allocating a frequency band out of the selected usable frequency bands to a user, so as to satisfy user required QoS and maximize system frequency utilization factor.

Radio relay system, radio relay apparatus, and radio relay method

Abstract: A radio relay system is disclosed that is capable of preventing communication degradation in a case where radio signals are relayed using the same frequency band in a mobile communication environment. The radio relay system includes a first radio station, a second radio station, and a radio relay apparatus for relaying a radio signal that is exchanged between the first radio station and the second radio station. The radio relay apparatus includes a phase correction determining unit that determines a phase correction amount of the relayed signal based on channel information pertaining to channels established between the first radio station, the second radio station, and the radio relay apparatus, and a phase correction unit that corrects the relayed signal based on the phase correction amount determined by the phase correction determining unit.

Power mode aware packet communication method and apparatus

Abstract: Packet communication method and system in which a packet destined for a terminal is provided service according to a service table indexed by packet classification and the terminal's power mode. The service table may specify for a connection a predetermined quality of service or discarding the packet. For a power mode having an alerting mechanism, the service may include alerting the terminal. For a multicast or broadcast packet, as each terminal may be in a different power mode, the associated service in the service table may therefore be different for each terminal. In that case, the packet is provided with service so that any given terminal is provided with at least the quality of service specified in the service table. Thus, a multicast or broadcast packet is discarded when the service specified for all terminals is 'discard'. Each terminal is alerted, however, if the associated service includes alerting the terminal.

Joint Frame Synchronization and Frequency Offset Estimationin OFDM Systems

Abstract: A new joint frame synchronization and carrier frequency offset estimation scheme in orthogonal frequency division multiplexing (OFDM) systems is proposed in this paper, where both frame synchronization and carrier frequency offset estimation can be performed by using only ONE training symbol. Frame synchronization and carrier frequency offset acquisition are performed simultaneously in the proposed scheme. Reliable frame synchronization is obtained in the proposed scheme even in low SNR. The maximum carrier frequency offset acquisition range of the proposed scheme can be up to one half of the total signal bandwidth. The same training symbol can also be utilized to carrier frequency offset Fine Adjustment, which estimates the remaining carrier frequency offset after acquisition with higher accuracy. The performance comparison of the proposed Fine Adjustment algorithm and Schmidl's algorithm by using computer simulation illustrates and verify the superior performance of the proposed algorithm with regard to estimation accuracy.

How does randomized beamforming improve the connectivity of ad hoc networks

Abstract: This paper analyzes the impact of beamforming antennas on the topological connectivity of multihop wireless networks. As a metric for the connectivity of the network, we use the percentage P(path) of nodes that are connected via a multihop path. We show that simple randomized beamforming - i.e., each node adjusts its main beam into a randomly chosen direction for transmission and reception - significantly improves P(path) compared to networks with omnidirectional antennas employing the same power and sensitivity. The study is performed using accurate, analytical antenna models for uniform linear and circular antenna arrays. Already small arrays with four antenna elements give high gains of P(path). These gains are achieved although the nodes' average number of neighbors does not necessarily increase.

System and method for channel scanning in wireless networks

Abstract: Channel scanning for wireless networks, such as Wireless Local Area Networks (WLANs), generally provides a wireless station with the information on the available WLAN resources, such as the frequency band and the maximum transmission power The present invention provides safe and fast domain-aware channel scanning, enabling a wireless station to comply with applicable local regulations, in spite of the possibility of domain changes, with short channel-scanning time Fast channel scanning is accomplished by active channel scanning if valid domain information is available and there is no possibility of domain change Also, domain-independent channels, if any, are first scanned using active scan to get domain information faster

Multi-band lookup table type predistorter

Abstract: A lookup table type predistorter for reading out distortion compensation data by using a difference signal between a power amplifier input signal and an output signal as a reference signal; wherein N input side variable band signal extractors extract transmitting signals in N frequency bands from the input signal, N output side variable band signal extractors extract signals in N frequency bands from the output of power amplifier, and N difference detectors detect differences between N frequency band signals respectively detected at the input side and the output side as N reference signals, which are used to read out N compensation data from N lookup tables, the N compensation data are added to the transmitting signals in N frequency bands, and N results of addition are combined to produce an output of the predistorter.

Distributed wireless access method based on network allocation vector (NAV) table and apparatus of the same

Abstract: Embodiments of the present invention include a wireless access method based on a NAVT (Network allocation vector table), which is applied to a distributed wireless mobile communication system comprising a plurality of nodes, the NAVT comprises a packet type field and a duration field and is stored in the respective nodes of the communication system, comprising: on a transmitting side, determining whether only a RTS (request to send) item is contained in the NAVT when a packet arrives; sensing channel to judge whether the channel is busy after determining that only the RTS item is contained in the NAVT; sending a RTS packet based on the RTS item to the receiving side after determining that the channel is busy; and on a receiving side, determining whether the NAVT is empty or not when the RTS packet is received; sending a CTS (clear to send) packet back to the transmitting side after determining that the NAVT is empty.

Model T: an empirical model for user registration patterns in a campus wireless LAN

Abstract: We derive an empirical model for spatial registration patterns of mobile users as they move within a campus wireless local area network (WLAN) environment and register at different access points. Such a model can be very useful in a variety of simulation studies of the performance of mobile wireless systems, such as that of resource management and mobility management protocols. We base the model on extensive experimental data from a campus WiFi LAN installation, representing traces from about 6000 users over a period of about 2 years. We divide the empirical data available to us into training and test data sets, develop the model based on the training set, and evaluate it against the test set.The model shows that user registration patterns exhibit a distinct hierarchy, and that WLAN access points (APs) can be clustered based on registration patterns. Cluster size distributions are highly skewed, as are intra-cluster transition probabilities and trace lengths, which can all be modeled well by the heavy-tailed Weibull distribution. The fraction of popular APs in a cluster, as a function of cluster size, can be modeled by exponential distributions. There is general similarity across hierarchies, in that inter-cluster registration patterns tend to have the same characteristics and distributions as intra-cluster patterns.We generate synthetic traces for intra-cluster transitions, inter-cluster transitions, and complete traces, and compare them against the corresponding traces from the test set. We define a set of metrics that evaluate how well the model captures the empirical features it is trying to represent. We find that the synthetic traces agree very well with the test set in terms of the metrics. We also compare the model to a simple modified random waypoint model as a baseline, and show the latter is not at all representative of the real data.The user of the model has the opportunity to use it as is, or can modify model parameters, such as the degree of randomness in registration patterns. We close with a brief discussion of further work to refine and extend the model.

Frequency selection apparatus, a mobile communications system, and a multi-band frequency resource management method

Abstract: A frequency selection apparatus, a mobile communications system, and a multi-band resource management method are disclosed. The frequency selection apparatus includes an acquisition unit configured to collect environmental information about a mobile station for each frequency band according to system frequency bands that a mobile station can use, and a frequency selection unit configured to determine the frequency band to be used and the system to be connected to, based on the environmental information and information provided by the mobile station.

Wireless positioning approach using time delay estimates of multipath components

Abstract: A wireless positioning apparatus includes a multipath delay estimator configured to estimate multipath delay components from one or more received signals; a selector configured to select appropriate delay estimates from the estimated multipath delay components according to a predetermined criterion; a storage configured to store an NLOS delay function defining prior statistics of information about non-line-of-sight delays; and a position estimator configured to estimate a position of a mobile station based on the selected delay estimates and the NLOS delay function read out from the storage.