Toru IMAI Shoei SATO Shinichi HOMMA Kazuo ONOE Akio KOBAYASHI
This paper describes a new method to detect speech segments online with identifying gender attributes for efficient dual gender-dependent speech recognition and broadcast news captioning. The proposed online speech detection performs dual-gender phoneme recognition and detects a start-point and an end-point based on the ratio between the cumulative phoneme likelihood and the cumulative non-speech likelihood with a very small delay from the audio input. Obtaining the speech segments, the phoneme recognizer also identifies gender attributes with high discrimination in order to guide the subsequent dual-gender continuous speech recognizer efficiently. As soon as the start-point is detected, the continuous speech recognizer with paralleled gender-dependent acoustic models starts a search and allows search transitions between male and female in a speech segment based on the gender attributes. Speech recognition experiments on conversational commentaries and field reporting from Japanese broadcast news showed that the proposed speech detection method was effective in reducing the false rejection rate from 4.6% to 0.53% and also recognition errors in comparison with a conventional method using adaptive energy thresholds. It was also effective in identifying the gender attributes, whose correct rate was 99.7% of words. With the new speech detection and the gender identification, the proposed dual-gender speech recognition significantly reduced the word error rate by 11.2% relative to a conventional gender-independent system, while keeping the computational cost feasible for real-time operation.
Miodrag J. MIHALJEVI Marc P.C. FOSSORIER Hideki IMAI
This letter yields a security evaluation of certain broadcast encryption (BE) schemes regarding the generic vulnerability of the textbook BE schemes. The considered vulnerability can be effectively explored assuming known plaintext attacks which in a realistic scenario, corresponding to a legitimate user being the attacker, appears as a ciphertext only attack. Employing the birthday paradox, a dedicated time-data trade-off based algorithm for cryptanalysis is proposed. The developed algorithm is applied to cryptanalysis of particular recently reported class of BE schemes, implying additional insights regarding motivations for their security improvements.
Jigang QIU Yi LONG Xiang CHEN Xiaokang LIN
In this paper a multi-channel MAC protocol with dynamic channel allocation (MMAC-DCA) in CDMA Ad Hoc networks is proposed. Under MMAC-DCA, the service sub-channels are dynamically allocated by the RTS/CTS dialogue on the common sub-channel, only when a node has a packet to transmit. In addition, a Markov mode is presented to analyze the performance of MMAC-DCA.
TheinLai WONG Tatsuhiro TSUCHIYA Tohru KIKUNO
This letter proposes a broadcast scheme for use in ad hoc networks using variable-range transmission power. Preserving energy and ensuring a high delivery ratio of broadcast packets are crucial tasks for broadcasting in ad hoc networks. Using individual broadcast relaying nodes to dynamically vary the transmission range can help saving power and reduce interference during communication. We analyzed the performance of the proposed scheme and compared it to other prevalent broadcast schemes for wireless ad hoc networks based on common-range transmission power.
Katsutoshi OHTSUKI Long NGUYEN
In this paper, we address the task of incremental language modeling for automatic transcription of broadcast news speech. Daily broadcast news naturally contains new words that are not in the lexicon of the speech recognition system but are important for downstream applications such as information retrieval or machine translation. To recognize those new words, the lexicon and the language model of the speech recognition system need to be updated periodically. We propose a method of estimating a list of words to be added to the lexicon based on some time-series text data. The experimental results on the RT04 Broadcast News data and other TV audio data showed that this method provided an impressive and stable reduction in both out-of-vocabulary rates and speech recognition word error rates.
Wei ZHANG Jun SUN Jing LIU Haibin ZHANG
This letter presents a clear and more accurate analytical model to evaluate the IEEE 802.11e enhanced distributed channel access (EDCA) protocol. The proposed model distinguishes internal collision from external collision. It also differentiates the two cases when the backoff counter decreases, i.e. an arbitration interframe space (AIFS) period after a busy duration and a time slot after the AIFS period. The analytical model is validated through simulation.
Nuttapong ATTRAPADUNG Hideki IMAI
We present generic frameworks for constructing efficient broadcast encryption schemes in the subset-cover paradigm, introduced by Naor et al., based on various key derivation techniques. Our frameworks characterize any instantiation completely to its underlying graph decompositions, which are purely combinatorial in nature. These abstract away the security of each instantiated scheme to be guaranteed by the generic one of the frameworks; thus, give flexibilities in designing schemes. Behind these, we present new techniques based on (trapdoor) RSA accumulators utilized to obtain practical performances. We then give some efficient instantiations from the frameworks, via a new structure called subset-incremental-chain. Our first construction improves the currently best schemes, including the one proposed by Goodrich et al., without any further assumptions (only pseudo-random generators are used) by some factors. The second instantiation, which is the most efficient, is instantiated based on RSA and directly improves the first scheme. Its ciphertext length is of order O(r), the key size is O(1), and its computational cost is O(n1/klog2 n) for any (arbitrary large) constant k; where r and n are the number of revoked users and all users respectively. To the best of our knowledge, this is the first explicit collusion-secure scheme in the literature that achieves both ciphertext size and key size independent of n simultaneously while keeping all other costs efficient, in particular, sub-linear in n. The third scheme improves Gentry and Ramzan's scheme, which itself is more efficient than the above schemes in the aspect of asymptotic computational cost.
Jenhui CHEN Chih-Chieh WANG Jiann-Der LEE
This letter proposes a novel geographic channel assignment (GCA) framework for dynamic channel allocation (DCA) in broadband wireless access networks (BWANs). The proposed GCA scheme is based on the characteristics of radio propagation, which focuses on the relationship between transmission distances and communication parameters, e.g., signal-to-noise ratio (SNR) etc., and uses a signal-aware distance estimation scheme to determinate an appropriate channel for communication. This method significantly increases the capacity of the BWA system. Simulation results show that the GCA framework can yield approximate two times throughput of the IEEE 802.16 standard specifications as well as obtain significantly lower call blocking probability compared with classical channel assignment methods.
Broadcast encryption technology enables a sender to send information securely to a group of receivers excluding specified receivers over a broadcast channel. In this paper, we propose a new key-tree structure based on Rabin cryptosystem, and an access control scheme using the structure. We show the security of the access control scheme and construct a new broadcast encryption scheme based on it. The proposed broadcast encryption scheme is a modification of the complete subtree method and it reduces the number of keys a receiver stores to one. There have been proposed some modifications of the complete subtree method which minimize the number of keys for a receiver to one, and the most efficient one among them with respect to the computational overhead at receivers is based on RSA cryptosystem. The computational overhead at receivers in our scheme is around log2e times smaller than the most efficient previously proposed one, where e is a public exponent of RSA, and the proposed scheme is the most efficient among tree based one-key schemes. This property is examined by experimental results. Our scheme achieves this reduction in the computational overhead in exchange for an increase in the size of nonsecret memory by [log n * few (e.g. eight)] bits, where n is the total number of receivers.
For hybrid Multimedia-on-Demand (MoD) systems which support broadcast, batch and interactive services, the charging scheme employed plays an important role in the delivery of good service quality to users, while also determining the revenue generated for the service provider. In this letter a new charging scheme is proposed. This scheme provides the same quality of service to the users as previous charging schemes while providing higher revenue. Numerical results are presented to evaluate the performance of the new charging scheme in comparison with previous schemes.
Eunsung OH Myeon-gyun CHO Seungyoup HAN Choongchae WOO Daesik HONG
Our investigation is presented into analysis of the co-channel interference (CCI) statistic in orthogonal frequency-division multiple access (OFDMA) uplink systems. The derived statistic is then used to analyze the performance of reuse partitioning (RP)-based dynamic channel allocation (DCA). Analysis and simulation results show that the performance of DCA in multi-cell environments is noticeably dependent on the CCI. Finally, the results of the analysis yield the optimum RP area for achieving the maximum spectral efficiency.
This letter describes experiments conducted to measure the interference effects of two kinds of UWB sources, which are OFDM UWB source and pulse radio UWB source, to broadcasting relay system and SDMB system. The received power degradation of a broadcasting system is presented. experimental results show that UWB system can coexist 35 m distance as close as to in-band broadcasting network and can also coexist 1.8 m as close as with the SDMB terminal without causing any dangerous interference.
I Gusti Bagus Baskara NUGRAHA Sumiya MARUGAMI Mikihiko NISHIARA Hiroyoshi MORITA
In this paper, we propose a protocol for multicast communication called Multicast Datagram Transfer Protocol (MDTP) to provide multicast for video broadcasting service on the Internet. MDTP is a one-to-many multicast communication protocol, which is constructed based on IPv4 unicast protocol by utilizing IP Router Alert Option, and it uses unicast addressing and unicast routing protocol. A mechanism is presented to allow a router to remove identical video stream, to duplicate a video stream, and to forward each copy of the duplicated video stream to its destinations. Ordinary IP routers that do not support MDTP will treat the MDTP packets as normal unicast packets. Hence, gradual deployment is possible without tunneling technique. With a delegation mechanism, MDTP router is also able to handle request from clients, and serve the requested video stream. The simulation results show that the average bandwidth usage of MDTP is close to the average bandwidth usage of IP multicast. MDTP also has greater efficiency than XCAST, and its efficiency becomes significant for a large number of clients.
Hideki TODE ZhengYu XIE Koso MURAKAMI
At present, a demand to the technology of contents distribution by which each user can request the desired content through network is increasing. There are some merits and demerits respectively with the existing on-demand systems for contents distribution, such as the methods based on broadcast and select transfer or multicast one. In this paper, we propose a hybrid scheduling method which adaptively uses both broadcasting and multicasting in order to improve the system efficiency. Adequate channel boundary to adopt two different transfer mechanisms is found through analytical consideration. Also, performance improvement of our proposal is verified in terms of response time and request blocking rate through computer simulation.
Shyue-Horng SHIAU Chang-Biau YANG
The generalized sorting problem is to find the first k largest elements among n input elements and to report them in a sorted order. In this paper, we propose a fast generalized sorting algorithm under the single hop wireless networks model with collision detection (WNCD). The algorithm is based on the maximum finding algorithm and the sorting algorithm. The key point of our algorithm is to use successful broadcasts to build broadcasting layers logically and then to distribute the data elements into those logic layers properly. Thus, the number of broadcast conflicts is reduced. We prove that the average time complexity required for our generalized sorting algorithm is Θ(k + log(n - k)). When k = 1, our generalized sorting algorithm does the work of finding maximum, and when k = n, it does the work of sorting. Thus, the analysis of our algorithm builds a connection between the two extremely special cases which are maximum finding and sorting.
Yoshinori ROKUGO Kazushi TAHARA Joji MAEDA Susumu ITOH
When digital broadcasting services are provided through cable television (CATV) networks, viewers watching interactive programs such as quizzes or auctions may respond to the program within a short period. If these responses are transmitted in the upstream channel of the CATV networks using TCP/IP, they will result in burst traffic. The numerous TCP connections will trigger congestion in the upstream transmission facilities and will cause a significant delay in conventional Internet services such as web-browsing. The present paper proposes a new method of controlling the CATV upstream channel to avoid such congestion. We introduce class-based queues at each cable TV station, in which each service class is related to a type of interactive service. The status of the queue is relayed to the cable modems of subscribers using a CATV-specific MAC protocol. This queue-status information is used to suspend further initiation of TCP connections at cable modems. As a result, the TCP connections will be arbitrated in the CATV network, while the delay of the response transmission is traded for smoothing of the burst traffic. We numerically evaluate the effect of the proposed method using the time distribution of responses to an actual quiz program. The results show that the proposed method successfully suppresses interference of the burst traffic with conventional best-effort services.
In wired networks, broadcast and multicast transmissions can be easily achieved by data link layer (layer 2). Nevertheless, it is a big challenge to safely transfer broadcast or multicast data frames over multihop mobile ad hoc networks (MANETs) due to the high bit error rate, the high collision probability and the lack of acknowledgment. Additionally, most of MANET's routing protocols rely on the broadcast function to exchange essential routing packets between mobile nodes and need the multicast function to make more efficient use of network bandwidth for some particular multimedia applications. From our observations, the efficiency of the unicast/multicast routing protocol of finding the path/tree is highly dependent on supported broadcast schemes of the underlying media access control (MAC) protocol. Therefore, in this paper, we illustrate the uncertain broadcast problem due to no replying acknowledgment from any recipients when mobile nodes deliver broadcast frames in wireless networks. We, then, propose a novel reliable broadcast scheme to solve this problem as well as a reliable multicast scheme to enhance the network utilization in data link layer. Simulation results show that the proposed scheme, which is still compatible with IEEE 802.11 standard, can efficiently minimize the bandwidth consumption as well as propagation delay.
Young-Ching DENG Ching-Chi HSU Ferng-Ching LIN
An ad hoc network is formed by a group of mobile hosts communicating over wireless channels. There is no any fixed network interaction and centralized administration. Because a routing protocol needs an efficient medium access control (MAC) protocol to support, to design an efficient MAC protocol is important and fundamental in ad hoc networks. So far, no other MAC protocol has stable broadcast performance in the dense mobile ad hoc network. In this paper, we address the issue of reliable broadcast and stable performance at the MAC layer. We present a reliable and adaptive broadcast MAC protocol RAMAC which is a TDMA-based distributed MAC protocol for the broadcast reservation in mobile ad hoc networks. We divide the area into many grid cells with the support of GPS. We use the properties of grid cells to design an efficient protocol. RAMAC is characterized by five important features: (i) A dynamic frame size is generated in every contention. This dynamic frame size can let RAMAC adapt to the network load. (ii) Our well-designed reservation protocol can avoid the deadlock problem. (iii) When the network is dense, RAMAC can still work stably; however, no other MAC protocols can work well in the dense network. (iv) We propose a reservation protocol that can efficiently and fast reserve data slots. (v) The well-designed grid architecture makes the senders of unicast in a grid cell transmit concurrently as many as possible, so RAMAC is highly parallel in unicast.
Seungjun KIM Jongeun CHA Jongphil KIM Jeha RYU Seongeun EOM Nitaigour P. MAHALIK Byungha AHN
In this paper, we demonstrate an immersive and interactive broadcasting production system with a new haptically enhanced multimedia broadcasting chain. The system adapts Augmented Reality (AR) techniques, which merges captured videos and virtual 3D media seamlessly through multimedia streaming technology, and haptic interaction technology in near real-time. In this system, viewers at the haptic multimedia client can interact with AR broadcasting production transmitted via communication network. We demonstrate two test applications, which show that the addition of AR- and haptic-interaction to the conventional audio-visual contents can improve immersiveness and interactivity of viewers with rich contents service.
Shyue-Horng SHIAU Chang-Biau YANG
Given a set of n stations, the initialization problem is to assign each station a unique identification number, from 1 to n. In the single-hop wireless Networks with collision detection, Nakano and Olariu proposed an algorithm to build a partition tree and solve the problem. In this paper, we shall classify the partition tree into four parts. By reviewing the classification, we find that three ideas can improve the algorithm. We show that it needs 2.88n time slots for solving the problem containing n stations. After applying our three ideas, the number of time slots will be improved to 2.46n.