We consider the services of broadcasting short messages via forward signaling channels in wireless cellular networks. In the provision of such services, the negative effect of short messages on the delivery of delay-sensitive control messages must be restricted. On the other hand, it is desirable to accommodate the users' demands for service enhancements involving timeliness and informativeness. As a way to resolve such conflicting arguments, we present a generic scheme in which a short message may be rejected or removed according to the buffer occupancy at the base station and is split into a number of segments for the transmission across a forward signaling channel. However, the rejection, removal and segmentation exhibit a trade-off among several facets of service enhancements. Thus, for a quantitative evaluation of the scheme and efficient optimization of design parameters, we develop an analytical method to calculate the moments of delay times experienced by control and short messages at a base station. Using the analytical method, we investigate the delay and loss performance of control and short messages with respect to the message load and short message length.

We propose a set of Fabry-Perot etalons integrated in a planar lightwave circuit (PLC-FPE) designed for a unified system for broadcasting and communication. A PLC-FPE containing four etalons having different cavity lengths is fabricated and their loss and frequency characteristics are investigated. The total loss and the maximum finesse were found to be 8 dB and 34, respectively.

In this paper, we propose a method of unicast and broadcast packet sharing for the orthogonal frequency division multiplexing (OFDM) multi-base station (BS) indoor wireless communication system using an adaptive array antenna on mobile terminals. The adaptive array antenna placed on the mobile terminal allows quality improvement due to the diversity effect when the data transmitted from all BSs are the same, and provides capacity improvement by channel sharing when the data from each BS are different. In the proposed sharing method, unicast packets are transmitted independently from multiple BSs in order to increase the communication capacity, and broadcast packets are transmitted simultaneously with other BSs in order to enhance the communication quality without retransmission. Furthermore, by modifying the packet assignment procedure, we confirm that quality can be improved for unicast packets in a low traffic environment.

This work presents a novel channel assignment scheme for low earth-orbit (LEO) satellite-based mobile communication systems, in which any newly generated call will first be assigned an optimum channel and will no longer be reassigned even when it crosses the boundary of the cell. Thus, the compact reuse distance can be maintained and no handoff failure will occur owing to channel unavailability. Furthermore, a high quality service which guarantees successful handoff processes can be provided. The performance of the proposed strategy is analyzed and compared with the performances of the fixed channel assignment (FCA) scheme and dynamic channel assignment schemes.

Solutions based on error-correcting codes for the blacklisting problem of a broadcast distribution system have been proposed by Kumar, Rajagopalan and Sahai. In this paper, detailed analysis of the solutions is presented. By choosing parameters properly in their constructions, we show that the performance is improved significantly.

In the current digital mobile communication that is used in the micro cellular system, a Self-Organized Dynamic Channel Assignment (DCA) Method has been proposed to use frequencies effectively. However, its characteristics and operational matters have not been reported yet. This paper takes up the TDMA/TDD system used in the current PHS system and also evaluates the characteristics and operational matters of this method through the actual operational tests. In addition, this paper aims to propose a new DCA method in order to speed up the Channel Segregation and evaluates its effects through the actual operational tests.

This paper discusses the teletraffic characteristics of cellular systems using Dynamic Channel Assignment. In general, it is difficult to exactly and theoretically analyze the teletraffic characteristics of Dynamic Channel Assignment. Also, it is not easy to theoretically evaluate influence of mobility on the traffic characteristics. This paper proposes approximate techniques to analyze teletraffic characteristics of Dynamic Channel Assignment considering mobility. The proposed techniques are based on Clique Packing approximation.

Broadcast data delivery is attractive for large-size data distribution where a large user community is connected to a server through a network. It is important to consider a broadcast scheduling method which minimizes the average response time. The scheme should also guarantee the expected waiting time at the time of request. In this paper, we propose a method which divides all titles into several groups and assigns FIFO to each group. The proposed method can guarantee the waiting time for each user at his request, and is superior to FIFO (in high load) and a fixed allocation method (in low load).

In mobile broadcasting environments, an information server periodically broadcasts a set of data items to a large mobile client population at every broadcast cycle and mobile clients retrieve the data items they need upon arrival at the broadcast channel. In such environments, the cost of data delivery is independent of the number of clients. Many applications such as auctions and stock quotes perform read-only transactions that require the clients to read consistent and current data for accurate result. Previous concurrency control mechanisms designed for such environments ensure that the clients read consistent data, but they cannot ensure latest-bound currency which allows the clients to read the latest or most up-to-date data. In this paper, we propose an efficient concurrency control mechanism that ensures latest-bound currency as well as update consistency, which is appropriate for the mobile broadcasting environments. To ensure latest-bound currency, the server computes control information using "virtual" broadcast cycles. This control information is also used for checking update consistency. Thus, the proposed mechanism allows all data committed in current broadcast cycle to be broadcast. We have performed simulation experiments to measure transaction aborts in order to evaluate the performance of the proposed mechanism. The result confirms that the proposed mechanism produces no stale reads and also shows that the proposed mechanism generates less transaction aborts than previous mechanisms, which implies that we can get higher data currency without increasing data inconsistency.

In this paper, we consider a mobile, multimedia, multihop (M3) ad hoc network. Key characteristics of this system are the mobility of users, energy constraints, and the need to operate without a fixed (wired or wireless) infrastructure. In this environment, with the advent of multimedia communications, the use of the cluster architecture has been revisited to support the resource reservation and Quality-of-Service routing. We proposed an access-based clustering protocol (ABCP) that allows the network to self-organize into a cluster architecture. Three advantages are claimed by ABCP. First, by the access-based criterion, it minimizes the overhead on cluster formation so that the protocol has short execution time and good scalability. Second, ABCP unifies the algorithms for cluster initialization and maintenance, i.e., the same set of clustering functions are used by a node regardless of whether it just becomes active or is in leaving its current cluster. Third, simulation results demonstrate that the cluster structure behaves stably amid topology changes compared with techniques previously proposed. Together with the access-based criterion, a multiple access scheme is also proposed for the broadcast of control messages.

The common packet channel (CPCH) adopted by 3GPP is used to carry small and medium sized packets, such as SMS (short message service) and web data. We analyze the system performance of the non-real time channel monitoring scheme when the periodic broadcast method is deployed. If user equipment (UE) can continuously monitor the CPCH status, the performance of the channel monitoring scheme is satisfactory. However, in practice, a CPCH status broadcast period exists and, therefore, an UE can request a CPCH channel based on incorrect CPCH status information. This incorrect CPCH status information results in performance degradation in the channel monitoring scheme. We analyze this performance degradation and show the relationship between system performance and the status broadcast period.

A passive branched optical network unified for broadcasting and communication utilizing a set of Fabry-Perot etalons with different cavity lengths is proposed and its basic operation including thermal stability of broadcasting channel is demonstrated. It is confirmed that a high transmission frequency in common for a pair of fiber Fabry-Perot etalons is always found however environmental temperature changes.

This paper proposes a group key distribution scheme with a user exclusion. The user exclusion is how to distribute an encryption key over a broadcast channel shared by n users so that all but d excluded users can get the group key. In the broadcast channel such as Pay-TV, Internet multicast and a mobile telecommunication for a group, a manager should exclude a dishonest user or an unauthorized terminal as soon as possible to protect the secrecy of the group communication. However, it takes a long time for the user exclusion on a large group, if the distributor distributes the group key to each user except the excluded one. We propose a scheme in which the amount of transmission and the key storage of each user do not depend on the number of users of the group. Moreover, our scheme does not require a fixed and privileged distributor.

A broadcast distribution system (BDS) is a system for the distribution of digital contents over broadcast channel where the data supplier broadcasts the contents in encrypted form and gives each subscriber a decoder containing a secret decryption key. A traitor is a subscriber who offers the information which allows to decrypt the broadcast. When a pirate decoder is captured, if at least one traitor can be identified from it, a BDS is said to be traitor-tracing. If the data supplier can prevent subscribers from obtaining the contents without recalling their decoders, a BDS is said to be subscriber-excluding. In this paper, we propose an efficient BDS which is both subscriber-excluding and traitor-tracing. We use similar mathematics to a threshold cryptosystem. In the proposed BDS, the maximum number of excluded subscribers reaches the maximum number of traitors in a coalition for which at least one traitor can be identified. We prove that the proposed BDS is secure against ciphertext-only attack if and only if ElGamal cryptosystem is secure against the attack and the discrete logarithm problem is hard. The proposed BDS is the first one which satisfies all the following features: Both subscriber-excluding and traitor-tracing, identifying all the traitors, black box tracing and public key system.

A rack-mounted prototype packet switch that makes use of wavelength-division-multiplexing (WDM) interconnect techniques has been developed. The switch has a maximum throughput of 320 Gbit/s. It features a WDM star-based switch architecture, an electrical control circuit layer and a broad-bandwidth optical WDM layer. The basic characteristics of the broad bandwidth WDM layer, such as level diagram, transmission characteristics, 32-wavelength-channel switching, and high-speed optical gating within a 1.6-ns guard time, are described. Experimental results demonstrated that the switch can perform practical self-routing switch operations, such as address-extraction, optical buffering, and filtering for packet speeds of up to 10 Gbit/s. The switch is promising for such applications as a terabit-per-second switching node in future WDM transport networks.

The arrangement graph An,k is not only a generalization of star graph (n-k=1), but also more flexible. Designing efficient broadcasting algorithm on a regular interconnection network is a fundamental issue for the parallel processing techniques. Two contributions are proposed in this paper. Initially, we elucidate a first result to construct n-k edge-disjoint spanning trees in an An,k. Second, we present efficient (one/all)-to-all broadcasting algorithms by using constructed n-k spanning trees, where height of each spanning tree is 2k-1. The arrangement graph is assumed to use one-port and all-port communication models and packet-switching (or store-and-forward) technique. Using n-k spanning trees allows us to present efficient broadcasting algorithm in the arrangement graphs and outperforms previous results. This is justified by our performance analysis.

In this paper, we present simulation algorithms among enhanced mesh models. The enhanced mesh models here include reconfigurable mesh and mesh with multiple broadcasting. A reconfigurable mesh (RM) is a processor array that consists of processors arranged to a 2-dimensional grid with a reconfigurable bus system. The bus system can be used to dynamically obtain various interconnection patterns among the processors during the execution of programs. A horizontal-vertical RM (HV-RM) is obtained from the general RM model, by restricting the network topology it can take to the ones in which each bus segment must be along row or column. A mesh with multiple broadcasting (MWMB) is an enhanced mesh, which has additional broadcasting buses endowed to every row and column. We present two algorithms:1) an algorithm that simulates a HV-RM of size nn time-optimally in θ(n) time on a MWMB of size nn, and 2) an algorithm that simulates a RM of size nn in θ(log2 n) time on a HV-RM of size nn. Both algorithms use a constant number of storage in each processor. Furthermore, we show that a RM of size nn can be simulated in θ((n/m)2 log n log m) time on a HV-RM of size mm, in θ ((n/m)2 m log n log m) time on a MWMB of size mm (m < n). These simulations use θ((n/m)2) storage in each processor, which is optimal.

To realize S-band mobile satellite communications and broadcasting systems, the onboard mission system and equipment were designed for the Japanese Engineering Test Satellite VIII. The system performs voice communications using handheld terminals, high-speed data communications, and multimedia broadcasting through a geostationary satellite. To enhance system efficiency and flexibility, the onboard mission system features phased-array-fed reflector antennas with large antenna diameter and baseband switching through onboard processors. Configurations and performance of the subsystems and key onboard equipment, large deployable reflectors, feed arrays, beam forming networks and onboard processors, are presented. The S-band mobile systems and onboard equipment will be verified through in-orbit experiments scheduled for 2002.

In this paper, performance degradation of satellite broadcasting receiving antenna systems due to weather conditions is examined by measuring their G/T continuously. We show that an offset parabolic reflector antenna of smaller aperture tends to be less affected by weather conditions.

Multicasting functionality is an important criterion in judging the powerfulness and extendibility of ATM switches. Recently many multicast ATM switches have been proposed. They are mostly modified from unicasting switches. For such switches to support multicasting, they often need some additional components, e. g. , copy network, and numerous modifications on the original unicasting network. Although the multicasting is supported, the method is often inefficient and the architecture is complicated and costly. In this paper, we propose a new multicast ATM switch. In the proposed architecture, the nonblocking unicast network will not be modified. All that need is a simple external nonblocking multicast module. The external nonblocking multicast module will not delay the original nonblocking unicast network module, and the cost in hardware complexity for the external nonblocking multicasting module will be O(NK log K), where N is the switch size and K is the number of broadcast buses used in the multicast module.