Eun-Jun YOON Muhammad KHURRAM KHAN Kee-Young YOO
In 2009, Jeong et al. proposed a secure binding encryption scheme and an efficient secret broadcast scheme. This paper points out that the schemes have some errors and cannot operate correctly, contrary to their claims. In addition, this paper also proposes improvements of Jeong et al.'s scheme that can withstand the proposed attacks.
Ian Dexter GARCIA Kei SAKAGUCHI Kiyomichi ARAKI
A Gaussian MIMO broadcast channel (GMBC) models the MIMO transmission of Gaussian signals from a transmitter to one or more receivers. Its capacity region and different precoding schemes for it have been well investigated, especially for the case wherein there are only transmit power constraints. In this paper, a special case of GMBC is investigated, wherein receive power constraints are also included. By imposing receive power constraints, the model, called protected GMBC (PGMBC), can be applied to certain scenarios in spatial spectrum sharing, secretive communications, mesh networks and base station cooperation. The sum capacity, capacity region, and application examples for the PGMBC are discussed in this paper. Sub-optimum precoding algorithms are also proposed for the PGMBC, where standard user precoding techniques are performed over a BC with a modified channel, which we refer to as the "protection-implied BC." In the protection-implied BC, the receiver protection constraints have been implied in the channel, which means that by satisfying the transmit power constraints on the protection implied channel, receiver protection constraints are guaranteed to be met. Any standard single-user or multi-user MIMO precoding scheme may then be performed on the protection-implied channel. When SINR-matching duality-based precoding is applied on the protection-implied channel, sum-capacity under full protection constraints (zero receive power), and near-sum-capacity under partial protection constraints (limited non-zero receive power) are achieved, and were verified by simulations.
Kazuhide FUKUSHIMA Shinsaku KIYOMOTO Toshiaki TANAKA Kouichi SAKURAI
This paper proposes a ternary subset difference method (SD method) that is resistant to coalition attacks. In order to realize a secure ternary SD method, we design a new cover-finding algorithm, label assignment algorithm and encryption algorithm. These algorithms are required to revoke one or two subtrees simultaneously while maintaining resistance against coalition attacks. We realize this two-way revocation mechanism by creatively using labels and hashed labels. Then, we evaluate the efficiency and security of the ternary SD method. We show that the number of labels on each client device can be reduced by about 20.4 percent. The simulation results show that the proposed scheme reduces the average header length by up to 15.0 percent in case where the total number of devices is 65,536. On the other hand, the computational cost imposed on a client device stays within O(log n). Finally, we prove that the ternary SD method is secure against coalition attacks.
Yang LIU Hui ZHAO Yunchuan YANG Wenbo WANG Kan ZHENG
Recently, broadcast services are introduced in cellular networks and macro diversity is an effective way to combat fading. In this paper, we propose a kind of distributed space-time block codes (STBCs) for macro diversity which is constructed from the total antennas of multiple cooperating base stations, and all the antennas form an equivalent multiple input multiple output (MIMO) system. This code is termed High-Dimension-Full-Rate-Quasi-Orthogonal STBC (HDFR-QOSTBC) which can be characterized as: (1) It can be applied with any number of transmit antennas especially when the number of transmit antennas is large; (2) The code is with full transmit rate of one; (3) The Maximum Likelihood (ML) decoding complexity of this code is controllable and limited to Nt/2-symbol-decodable for total Nt transmit antennas. Then, we completely analyze the structure of the equivalent channel for the kind of codes and reveal a property that the eigenvectors of the equivalent channel are constant and independent from the channel realization, and this characteristic can be exploited for a new transmission structure with single-symbol linear decoder. Furthermore, we analyze different macro diversity schemes and give a performance comparison. The simulation results show that the proposed scheme is practical for the broadcast systems with significant performance improvement comparing with soft-combination and cyclic delay diversity (CDD) methods.
Multi-source broadcasting is one of the information dissemination problems on interconnection networks such that some (but not all) units disseminate distinct information to all other units. In this paper, we discuss multi-source broadcasting on the Kautz digraph which is one of the models of interconnection networks. We decompose the Kautz digraph K(d,n) into isomorphic cycle-rooted trees whose root-cycle has length 2, then we present an algorithm for multi-source broadcasting using these cycle-rooted trees. This algorithm is able to treat d(d+1) messages simultaneously and takes the same order for required times as lower bound.
Shinji KAMADA Naobumi MICHISHITA Yoshihide YAMADA
Broadband antennas have various applications in digital terrestrial television (DTV) services. Compact broadband antennas are required for arranging in long and narrow space along the rim of a laptop display. A leaky-wave antenna using the composite right/left-handed transmission line (CRLH-TL) is one of the candidates for achieving the broadband antenna. However, there are not enough to design guideline of small leaky wave antennas using the CRLH-TL for UHF band. In this paper, a CRLH-TL comprising a ladder network is proposed for broadband and simple structure. The paper also discusses the design of a leaky-wave antenna with the CRLH-TL operating in the DTV band. The relation between the operating bandwidth and attenuation constant of the CRLH-TL is discussed. An antenna that can be accommodated in the limited and narrow space available in mobile terminals has to be designed. Hence, the effects of the number of cells and a finite ground plane are discussed with the purpose of achieving the miniaturization of the antenna. In this study, the transmission and radiation characteristics of the fabricated antennas are measured. The gain of the fabricated antenna is confirmed to remain almost constant even when the operating frequency is varied. The maximum gain and operating band achieved in this study are approximately -0.6 dBi and about 54%, respectively.
Seongmin PYO Min-Jae LEE Young-Sik KIM
In this letter, a new design of a metamaterial-based microstrip antenna is presented using triangular slots embedded on the ground plane to enhance the impedance bandwidth. To improve the impedance bandwidth of the proposed antenna, two resonant mode frequencies are closely allocated using the slotted ground without changing the radiator element. The impedance bandwidth of VSWR < 2.5 is measured at 2.43 GHz (37.6%) centered on 6.46 GHz, from 5.24 GHz to 7.67 GHz in good agreements with the simulated results.
Yoshihisa KONDO Hiroyuki YOMO Shinji YAMAGUCHI Peter DAVIS Ryu MIURA Sadao OBANA Seiichi SAMPEI
This paper proposes multipoint-to-multipoint (MPtoMP) real-time broadcast transmission using network coding for ad-hoc networks like video game networks. We aim to achieve highly reliable MPtoMP broadcasting using IEEE 802.11 media access control (MAC) that does not include a retransmission mechanism. When each node detects packets from the other nodes in a sequence, the correctly detected packets are network-encoded, and the encoded packet is broadcasted in the next sequence as a piggy-back for its native packet. To prevent increase of overhead in each packet due to piggy-back packet transmission, network coding vector for each node is exchanged between all nodes in the negotiation phase. Each user keeps using the same coding vector generated in the negotiation phase, and only coding information that represents which user signal is included in the network coding process is transmitted along with the piggy-back packet. Our simulation results show that the proposed method can provide higher reliability than other schemes using multi point relay (MPR) or redundant transmissions such as forward error correction (FEC). We also implement the proposed method in a wireless testbed, and show that the proposed method achieves high reliability in a real-world environment with a practical degree of complexity when installed on current wireless devices.
This paper is concerned with the packet transmission scheduling problem for repeating all-to-all broadcasts in Underwater Sensor Networks (USN) in which there are n nodes in a transmission range. All-to-all communication is one of the most dense communication patterns. It is assumed that each node has the same size packet. Unlike the terrestrial scenarios, the propagation time in underwater communications is not negligible. We define all-to-all broadcast as the one where every node transmits packets to all the other nodes in the network except itself. So, there are in total n(n - 1) packets to be transmitted for an all-to-all broadcast. The optimal transmission scheduling is to schedule in a way that all packets can be transmitted within the minimum time. In this paper, we propose an efficient packet transmission scheduling algorithm for underwater acoustic communications using the property of long propagation delay.
Dong-Sik WOO Young-Gon KIM Young-Ki CHO Kang Wook KIM
A new design and experimental results of a microstrip-fed ultra-wideband Fermi antenna at millimeter-wave frequencies are presented. By utilizing a new microstrip-to-CPS balun (or transition), which provides wider bandwidth than conventional planar balun, the design of microstrip-fed Fermi antenna is greatly simplified. The proposed Fermi antenna demonstrates ultra-wideband performance for the frequency range of 23 to over 58 GHz with the antenna gain of 12 to 14 dBi and low sidelobe levels. This design yields highly effective solutions to various millimeter-wave phased-arrays and imaging systems.
Yutaka ARAYASHIKI Yukio OHKUBO Taisuke MATSUMOTO Yoshiaki AMANO Akio TAKAGI Yutaka MATSUOKA
We fabricated a 2:1 multiplexer IC (MUX) with a retiming function by using 1-µm self-aligned InP/InGaAs/InP double-heterojunction bipolar transistors (DHBTs) with emitter mesa passivation ledges. The MUX operated at 120 Gbit/s with a power dissipation of 1.27 W and output amplitude of 520 mV when measured on the wafer. When assembled in a module using V-connectors, the MUX operated at 113 Gbit/s with a 514-mV output amplitude and a power dissipation of 1.4 W.
Lv DING Wei XU Bin JIANG Xiqi GAO
This paper considers an optimized limited feedback design for a multi-antenna system serving multiple users under different types of channels: Rayleigh distributed and line-of-sight distributed channels. Since the users are asymmetric, we propose an optimized feedback bandwidth allocation scheme for users under a total feedback rate constraint. The allocation scheme is designed according to the long-term channel type information of users, and thus it can be efficiently implemented. Numerical results verify the effectiveness of our proposed scheme.
This research addresses a high-speed computation method for the Kleene star of the weighted adjacency matrix in a max-plus algebraic system. We focus on systems whose precedence constraints are represented by a directed acyclic graph and implement it on a Cell Broadband EngineTM (CBE) processor. Since the resulting matrix gives the longest travel times between two adjacent nodes, it is often utilized in scheduling problem solvers for a class of discrete event systems. This research, in particular, attempts to achieve a speedup by using two approaches: parallelization and SIMDization (Single Instruction, Multiple Data), both of which can be accomplished by a CBE processor. The former refers to a parallel computation using multiple cores, while the latter is a method whereby multiple elements are computed by a single instruction. Using the implementation on a Sony PlayStation 3TM equipped with a CBE processor, we found that the SIMDization is effective regardless of the system's size and the number of processor cores used. We also found that the scalability of using multiple cores is remarkable especially for systems with a large number of nodes. In a numerical experiment where the number of nodes is 2000, we achieved a speedup of 20 times compared with the method without the above techniques.
Sen FENG Eisuke NISHIYAMA Masayoshi AIKAWA
A novel broad-band ring-slot array antenna for simultaneous use of orthogonal polarizations is presented in this paper. In this antenna, the broad-band performance is obtained by integrating a 22 ring-slot array antenna and a broad-band π/2 hybrid circuit. The simultaneous use of the right-hand circular polarization (RHCP) and the left-hand circular polarization (LHCP) is achieved using orthogonal feed circuits on three layers. The both-sided MIC technology is effectively employed in forming this type of slot array antenna. Experimental results show that the proposed antenna has good circular polarization characteristics for both the LHCP and the RHCP. The measured impedance-bandwidth of return loss better than -10 dB are about 47% both for the LHCP and the RHCP. The 3 dB axial ratio bandwidths are 25% (RHCP) and 29% (LHCP). The isolation between the two input ports is better than -35 dB at center frequency of 7.5 GHz.
Muhammad Mahbub ALAM Md. Abdul HAMID Md. Abdur RAZZAQUE Choong Seon HONG
Broadband wireless access networks are promising technology for providing better end user services. For such networks, designing a scheduling algorithm that fairly allocates the available bandwidth to the end users and maximizes the overall network throughput is a challenging task. In this paper, we develop a centralized fair scheduling algorithm for IEEE 802.16 mesh networks that exploits the spatio-temporal bandwidth reuse to further enhance the network throughput. The proposed mechanism reduces the length of a transmission round by increasing the number of non-contending links that can be scheduled simultaneously. We also propose a greedy algorithm that runs in polynomial time. Performance of the proposed algorithms is evaluated by extensive simulations. Results show that our algorithms achieve higher throughput than that of the existing ones and reduce the computational complexity.
Go OHTAKE Goichiro HANAOKA Kazuto OGAWA
Provider authentication is necessary in bidirectional broadcasting services, and a digital signature scheme is often used to prevent an adversary from attempting impersonation. The cost of secure signing key management is extremely high. In addition, the key has to be updated very often, since it is frequently used. The result is that the verification key also has to be updated very often, and its redistribution cost is huge. These costs are real and substantive problems, especially when the number of users is large. In this paper, we propose a system that dramatically reduces these costs. In the system, the signing key is updated, but the corresponding verification key does not have to be updated. This means that the signing key can be updated without any cost for redistributing the verification key and that the system is secure against the threat of signing key leakage, since the key can be frequently updated. Moreover, we propose a new key management method that divides a conventional key management server's role into two. The use of a key-insulated signature (KIS) scheme enables low-cost and more secure key management with two servers. Finally, to make a bidirectional broadcasting service more secure even if the signing key is leaked, we developed a new strong KIS scheme. We performed an experiment that assessed the cost of our strong KIS scheme and found that it is sufficiently low. Accordingly, a provider authentication system employing this scheme would be more efficient and would have lower key redistribution and network costs in comparison with conventional authentication systems.
In this letter, we develop an analytical model for the drive-thru applications based on the IEEE 802.11p WAVE. The model shows that prioritizing the bitrates via the 802.11e EDCA mechanism leads to significant throughput improvement.
This paper presents effective and efficient implementation techniques for DMA buffer overflow elimination on the Cell Broadband EngineTM (Cell/B.E.) processor. In the Cell/B.E. programming model, application developers manually issue DMA commands to transfer data from the system memory to the local memories of the Cell/B.E. cores. Although this allows us to eliminate cache misses or cache invalidation overhead, it requires careful management of the buffer arrays for DMA in the application programs to prevent DMA buffer overflows. To guard against DMA buffer overflows, we introduced safe DMA handling functions for the applications to use. To improve and minimize the performance overhead of buffer overflow prevention, we used three different optimization techniques that take advantage of SIMD operations: branch-hint-based optimizations, jump-table-based optimizations and self-modifying-based optimizations. Our optimized implementation prevents all DMA buffer overflows with minimal performance overhead, only 2.93% average slowdown in comparison to code without the buffer overflow protection.
Logan VOLKERS Neil BARAKAT Thomas DARCIE
DOCSIS is the defacto industry standard for cable internet to the home. In this letter, we examine the delay characteristics of commercially deployed DOCSIS networks. We focus on four mechanisms of the DOCSIS MAC operation and develop a computationally simple simulator to reproduce the phenomena produced by these mechanisms. In reproducing these phenomena using our simulator, we demonstrate that the simulator properly encapsulates the core mechanisms of DOCSIS and effectively simulates the delay of packets.
Jihyun PARK Jeongsu LEE Jeonghyun KIM Jaecheol RYOU
A multicast content service, including numerous devices, requires an efficient group key management scheme as one of its core components. The purpose of group key management is to provide a secure key-sharing scheme among the members of a group so that messages transmitted via broadcasting or multicasting are not exposed to non-members. The Chinese Remaindering Group Key (CRGK) is an efficient group key management scheme based on the Chinese Remainder Theorem (CRT). It optimizes the number of re-key messages, the user-side key computation cost, and the number of stored keys. However, CRGK is not fit for a group with a large number of members because of the high computation complexity of the CRT. In this paper, we propose a Hierarchical CRGK (HCRGK) scheme that supports a group with a large number of members. We improved CRGK by adopting it to include an n-ary tree structure. The tree approach simplifies the group key management by distributing the group key computation to subgroups. Our scheme requires at most (log m N + 1) re-key messages for a group with N members and a short computation time even when the group is very large.