Secret sharing is a method to protect information for security. The information is divided into n shares, and the information is reconstructed from any k shares but no knowledge of it is revealed from k-1 shares. Physical layer security is a method to yield a favorable receive condition to an authorized destination terminal in wireless communications based on multi-antenna transmission. In this study, we propose wireless packet communications protected by the secret sharing based on Reed Solomon coding and the physical layer security based on vector coding, which implements a single-antenna system and a multi-antenna system. Evaluation results show the validity of the proposed scheme.

Wireless technologies that offer high data rate are generally energy-consuming ones while low-energy technologies commonly provide low data rate. Both kinds of technologies have been integrated in a single mobile device for different services. Therefore, if the service does not always require high data rate, the low energy technology, i.e., Bluetooth, can be used instead of the energy-consuming one, i.e., Wi-Fi, for saving energy. It is obvious that energy savings are maximized by turning the unused technology off. However, when active sessions of ongoing services migrate between different technologies, the network-layer connectivity must be maintained, or a vertical handover (VHO) between different networks is required. Moreover, when the networks are not interconnected, the VHO must be fully controlled by the device itself. The device typically navigates traffic through the firmware of the wireless network interface cards (WNIC) using their drivers, which are dependent on the vendors. To control the traffic navigation between WNICs without any modification of the WNICs' drivers, Software-Defined Networking (SDN) can be applied locally on the mobile device, the so called local SDN. In the local SDN architecture, a local SDN controller (SDNC) is used to control a virtual OpenFlow switch, which turns WNICs into its switch ports. Although the SDNC can navigate the traffic, it lacks the global view of the network topology. Hence, to correctly navigate traffic in a VHO process, an extended SDN controller (extSDNC) was proposed in a previous work. With the extSDNC, the SDNC can perform VHO based on a link layer trigger but with a significant packet loss rate. Therefore, in this paper, a framework named esVHO is proposed that executes VHO at the network layer to reduce the packet loss rate and reduce energy consumption. Experiments on VHO performance prove that esVHO can reduce the packet loss rate considerably. Moreover, the results of an energy saving experiment show that esVHO performs high energy saving up to 4.89 times compared to the others.

A joint deployment of base stations (BSs) and RGB-depth (RGB-D) cameras for camera-assisted millimeter-wave (mmWave) access networks is discussed in this paper. For the deployment of a wide variety of devices in heterogeneous networks, it is crucial to consider the synergistic effects among the different types of nodes. A synergy between mmWave networks and cameras reduces the power consumption of mmWave BSs through sleep control. A purpose of this work is to optimize the number of nodes of each type, to maximize the average achievable rate within the constraint of a predefined total power budget. A stochastic deployment problem is formulated as a submodular optimization problem, by assuming that the deployment of BSs and cameras forms two independent Poisson point processes. An approximate algorithm is presented to solve the deployment problem, and it is proved that a (1-e-1)/2-approximate solution can be obtained for submodular optimization, using a modified greedy algorithm. The numerical results reveal the deployment conditions under which the average achievable rate of the camera-assisted mmWave system is higher than that of a conventional system that does not employ RGB-D cameras.

This paper presents a strategy, Weighted Voting of Discriminative Regions (WVDR), to improve the face recognition performance, especially in Small Sample Size (SSS) and occlusion situations. In WVDR, we extract the discriminative regions according to facial key points and abandon the rest parts. Considering different regions of face make different contributions to recognition, we assign weights to regions for weighted voting. We construct a decision dictionary according to the recognition results of selected regions in the training phase, and this dictionary is used in a self-defined loss function to obtain weights. The final identity of test sample is the weighted voting of selected regions. In this paper, we combine the WVDR strategy with CRC and SRC separately, and extensive experiments show that our method outperforms the baseline and some representative algorithms.

In order to support seamless mobility in the Information-Centric Networking (ICN) Architecture we propose the Named-Node Network Architecture (3NA). 3NA introduces two independent namespaces to ICN, the 3N namespace used to uniquely identify nodes within a network and the Point of Attachment (PoA) namespace to identify a node's PoA to the network. The mappings between the two namespaces, along with all the necessary mechanisms to keep the mappings updated over time, are used when routing ICN packets to improve delay and the goodput when either the producer or the consumer are mobile. To support simultaneous producer and consumer mobility, we expand on the 3NA by adding a new Protocol Data Unit (PDU), the DU PDU. The DU PDU permits the encapsulation of ICN packets in a header that has source and destination name fields which belong to 3NA's 3N namespace. The new PDU permits seamless connectivity as long as 3NA's point of attachment signaling is strictly followed. We demonstrate the performance of the DU PDU against our previous defined communication methods and Named Data Networking's (NDN) Smart Flooding forwarding strategy using our open source nnnSIM module for the ns-3 framework. The new PDU outperforms all existing alternatives when the producer or both consumer and provider are mobile, obtaining overall lower mean network delay and higher median goodput.

In this letter, three types of constructions for multipermutation codes are investigated by using interleaving technique and single-deletion permutation codes to correct a predetermined number of adjacent deletions. The decoding methods for the proposed codes are provided in proofs and verified with examples. The rates of these multipermutation codes are also compared.

A single-dimensional interface which enables users to obtain diverse localizations of audio sources is proposed. In many conventional interfaces for arranging audio sources, there are multiple arrangement parameters, some of which allow users to control positions of audio sources. However, it is difficult for users who are unfamiliar with these systems to optimize the arrangement parameters since the number of possible settings is huge. We propose a simple, single-dimensional interface for adjusting arrangement parameters, allowing users to sample several diverse audio source arrangements and easily find their preferred auditory localizations. To select subsets of arrangement parameters from all of the possible choices, auditory-localization space vectors (ASVs) are defined to represent the auditory localization of each arrangement parameter. By selecting subsets of ASVs which are approximately orthogonal, we can choose arrangement parameters which will produce diverse auditory localizations. Experimental evaluations were conducted using music composed of three audio sources. Subjective evaluations confirmed that novice users can obtain diverse localizations using the proposed interface.

Constant weight codes have mathematical interest and practical applications such as coding for bandwidth-efficient channels and construction of spherical codes for modulation. In this letter, by using difference balanced functions with d-form property, we constructed a class of constant composition code with new parameters, which achieves the equal sign of generalized Johnson bound.

Constant composition codes (CCCs) are a special class of constant-weight codes. They include permutation codes as a subclass. The study and constructions of CCCs with parameters meeting certain bounds have been an interesting research subject in coding theory. A bridge from zero difference balanced (ZDB) functions to CCCs with parameters meeting the Luo-Fu-Vinck-Chen bound has been established by Ding (IEEE Trans. Information Theory 54(12) (2008) 5766-5770). This provides a new approach for obtaining optimal CCCs. The objective of this letter is to construct two classes of ZDB functions whose parameters not covered in the literature, and then obtain two classes of optimal CCCs meeting the Luo-Fu-Vinck-Chen bound from these new ZDB functions.

To suppress intercell interference for three-cell half-duplex relay systems, joint interference suppression and multiuser detection (MUD) schemes that estimate weight coefficients by the recursive least-squares (RLS) algorithm have been proposed but show much worse bit error rate (BER) performance than maximum likelihood detection (MLD). To improve the BER performance, this paper proposes a joint interference suppression and MUD scheme that estimates the weight coefficients by eigenvalue decomposition. The proposed scheme carries the same advantages as the conventional RLS based schemes; it does not need channel state information (CSI) feedback while incurring much less amount of computational complexity than MLD. In addition, it needs to know only two out of three preambles used in the system. Computer simulations of orthogonal frequency-division multiplexing (OFDM) transmission under three-cell and frequency selective fading conditions are conducted. It is shown that the eigendecomposition-based scheme overwhelmingly outperforms the conventional RLS-based scheme although requiring higher computational complexity.

Communications satellites have been the primary mission from the early period of Japanese space development and their on-board communication equipment are the core devices to realize satellite communications systems. The technologies for this equipment have been developed to meet the requirements of high capacity and high functionality under the severe satellite-imposed constraints. This paper summarizes progress in on-board communication equipment technologies developed and verified by using Engineering Test Satellites and commercial satellites in Japan and describes their prospects.

Research efforts initiated by the EXAT Initiative are described to realize Exabit/s optical communications, utilizing the 3M technologies, i.e. multi-core fiber, multi-mode control and multi-level modulation.

A bi-dimensional empirical mode decomposition (BEMD) is one of the powerful methods for decomposing non-linear and non-stationary signals without a prior function. It can be applied in many applications such as feature extraction, image compression, and image filtering. Although modified BEMDs are proposed in several approaches, computational cost and quality of their bi-dimensional intrinsic mode function (BIMF) still require an improvement. In this paper, an iteration-free computation method for bi-dimensional empirical mode decomposition, called iBEMD, is proposed. The locally partial correlation for principal component analysis (LPC-PCA) is a novel technique to extract BIMFs from an original signal without using extrema detection. This dramatically reduces the computation time. The LPC-PCA technique also enhances the quality of BIMFs by reducing artifacts. The experimental results, when compared with state-of-the-art methods, show that the proposed iBEMD method can achieve the faster computation of BIMF extraction and the higher quality of BIMF image. Furthermore, the iBEMD method can clearly remove an illumination component of nature scene images under illumination change, thereby improving the performance of text localization and recognition.

As a result of large-scale and complicated of ICT (Information and Communication Technology), the technologies of operations and management of ICT infrastructure and systems are changing to adopt the variation and diversity of usage and communication characteristics. In retrospect, operations and management technologies cover widely from the support of telecommunications operations and remote monitoring for maintaining network equipments, to an integrated network management framework for configuration, monitoring, testing and controls. Recently, the spread of network virtualization technologies enable agility, integrity, and resilience to ICT services. Operations and management technologies will be more important in future, for the support of integrated management of ICT infrastructure including computing resource, and automation of service operations. In this paper, we review research activities of the Technical Committee on Information and Communications Management (ICM) with discussions of individual research category. We then describe the state-of-the-art topics and future directions in the area of ICM.

As a with-carry analog (based on modular arithmetic) of the usual Walsh-Hadamard transform (WHT), arithmetic Walsh transform (AWT) has been used to obtain analogs of some properties of Boolean functions which are important in the design and analysis of cryptosystems. The existence of nonzero linear structure of Boolean functions is an important criterion to measure the weakness of these functions in their cryptographic applications. In this paper, we find more analogs of linear structures of Boolean functions from AWT. For some classes of n-variable Boolean functions f, we find necessary and sufficient conditions for the existence of an invariant linear structure and a complementary linear structure 1n of f. We abstract out a sectionally linear relationship between AWT and WHT of n-variable balanced Boolean functions f with linear structure 1n. This result show that AWT can characterize cryptographic properties of these functions as long as WHT can. In addition, for a diagonal Boolean function f, a recent result by Carlet and Klapper says that the AWT of f can be expressed in terms of the AWT of a diagonal Boolean function of algebraic degree at most 3 in a larger number of variables. We provide for the result a complete and more modular proof which works for both even and odd weights (of the parameter c in the Corollary 19 by Carlet and Klapper (DCC 73(2): 299-318, 2014).

Cayley hash functions are a family of cryptographic hash functions constructed from Cayley graphs, with appealing properties such as a natural parallelism and a security reduction to a clean, well-defined mathematical problem. As this problem involves non-Abelian groups, it is a priori resistant to quantum period finding algorithms and Cayley hash functions may therefore be a good foundation for post-quantum cryptography. Four particular parameter sets for Cayley hash functions have been proposed in the past, and so far dedicated preimage algorithms have been found for all of them. These algorithms do however not seem to extend to generic parameters, and as a result it is still an open problem to determine the security of Cayley hash functions in general. In this paper, we study the case of Chiu's Ramanujan graphs. We design a polynomial time preimage attack against the resulting Cayley hash function, showing that these particular parameters like the previous ones are not suitable for the construction. We extend our attacks on hash functions based on similar Cayley graphs as Chiu's Ramanujan graphs. On the positive side, we then suggest some possible ways to construct the Cayley hashes that may not be affected by this type of attacks. Our results contribute to a better understanding of the hard problems underlying the security of Cayley hash functions.

This paper considers the recovery problem of distributed compressed sensing (DCS), where J (J≥2) signals all have sparse common component and sparse innovation components. The decoder attempts to jointly recover each component based on {Mj} random noisy measurements (j=1,…,J) with the prior information on the support probabilities, i.e., the probabilities that the entries in each component are nonzero. We give both the sufficient and necessary conditions on the total number of measurements $sum olimits_{j = 1}^J M_j$ that is needed to recover the support set of each component perfectly. The results show that when the number of signal J increases, the required average number of measurements $sum olimits_{j = 1}^J M_j/J$ decreases. Furthermore, we propose an extension of one existing algorithm for DCS to exploit the prior information, and simulations verify its improved performance.

Index generation functions model content-addressable memory, and are useful in virus detectors and routers. Linear decompositions yield simpler circuits that realize index generation functions. This paper proposes a balanced decision tree based heuristic to efficiently design linear decompositions for index generation functions. The proposed heuristic finds a good linear decomposition of an index generation function by using appropriate cost functions and a constraint to construct a balanced tree. Since the proposed heuristic is fast and requires a small amount of memory, it is applicable even to large index generation functions that cannot be solved in a reasonable time by existing heuristics. This paper shows time and space complexities of the proposed heuristic, and experimental results using some large examples to show its efficiency.

Non-contiguous orthogonal frequency-division multiplexing (OFDM) is a promising technique for cognitive radio systems. The secondary users transmit on the selected subcarriers to avoid the frequencies being used by the primary users. However, the out-of-band power (OBP) of the OFDM-modulated tones induces interference to the primary users. Another major drawback of OFDM-based system is their high peak-to-average power ratio (PAPR). In this paper, algorithms are proposed to jointly reduce the OBP and the PAPR for non-contiguous OFDM based on the method of alternating projections onto convex sets. Several OFDM subcarriers are selected to accommodate the adjusting weights for OBP and PAPR reduction. The frequency-domain OFDM symbol is projected onto two convex sets that are defined according to the OBP requirements and the PAPR limits. Each projection iteration solves a convex optimization problem. The projection onto the set constrained by the OBP requirement can be calculated using an iterative algorithm which has low computational complexity. Simulation results show good performance of joint reduction of the OBP and the PAPR. The proposed algorithms converge quickly in a few iterations.

Hybrid analog/digital precoding has attracted growing attention for millimeter wave (mmWave) communications, since it can support multi-stream data transmission with limited hardware cost. A main challenge in implementing hybrid precoding is that the channels will exhibit frequency-selective fading due to the large bandwidth. To this end, we propose a practical hybrid precoding scheme with finite-resolution phase shifters by leveraging the correlation among the subchannels. Furthermore, we utilize the sparse feature of the mmWave channels to design a low-complexity algorithm to realize the proposed hybrid precoding, which can avoid the complication of the high-dimensionality eigenvalue decomposition. Simulation results show that the proposed hybrid precoding can approach the performance of unconstrained fully-digital precoding but with low hardware cost and computational complexity.