Bayesian networks are a powerful approach for representation and reasoning under conditions of uncertainty. Of the many good algorithms for learning Bayesian networks from data, the bio-inspired search algorithm is one of the most effective. In this paper, we propose a hybrid mutual information-modified binary particle swarm optimization (MI-MBPSO) algorithm. This technique first constructs a network based on MI to improve the quality of the initial population, and then uses the decomposability of the scoring function to modify the BPSO algorithm. Experimental results show that, the proposed hybrid algorithm outperforms various other state-of-the-art structure learning algorithms.

This paper addresses power saving for STAs (Wireless Stations) in WLANs (Wireless LANs). Mobile devices are increasingly used in situations in which they access WLANs. However, mobile devices consume large amounts of power when they communicate through a WLAN, and this shortens their battery lifetime. IEEE 802.11 specifies PSM (Power-Saving Mode) as the power-saving method for standard WLANs. However, the sleep conditions specified by PSM for STAs are not optimal in terms of power saving, except when the number of STAs is small, and this increases packet transfer delay. In this paper, we propose a power-saving method in which STAs reduce power consumption by sleeping for a period specified by the NAV (Network Allocation Vector) duration, which is set by an RTS/CTS handshake, and the duration of the NAV is extended by bidirectional burst transmission. To suppress the transfer delay caused by the bidirectional burst transmission, an AP (Access Point) manages the transmission deadline of each downlink packet on the basis of its acceptable value of delay and adapts the number of packets transferred in the bidirectional burst transmission. Although another existing method also uses the NAV duration to manage STA sleeping, the bidirectional burst transmission can only be initiated by the STAs themselves and the NAV is of an extremely limited duration. On the other hand, the proposed method specifies generalized bidirectional burst transmission without the limitations of the transmission initiator and the burst length within acceptable packet transfer delay. Moreover, we investigate the combination of the proposed method with PSM in order to improve the performance in situations in which the number of STAs is small by taking advantage of the combined properties of PSM and the proposed method. The evaluation results demonstrate that these proposed methods can reduce the power consumption of wireless stations and suppress packet transfer delay.

In this paper, we consider a networked control system where bounded network delays and packet dropouts exist in the network. The physical plant is abstracted by a transition system whose states are quantized states of the plant measured by a sensor, and a control specification for the abstracted plant is given by a transition system when no network disturbance occurs. Then, we design a prediction-based controller that determines a control input by predicting a set of all feasible abstracted states at time when the actuator receives the delayed input. It is proved that the prediction-based controller suppresses effects of network delays and packet dropouts and that the controlled plant still achieves the specification in spite of the existence of network delays and packet dropouts.

This paper presents the formal analysis of the feature negotiation and connection management procedures of the Datagram Congestion Control Protocol (DCCP). Using state space analysis we discover an error in the DCCP specification, that result in both ends of the connection having different agreed feature values. The error occurs when the client ignores an unexpected Response packet in the OPEN state that carries a valid Confirm option. This provides an evidence that the connection management procedure and feature negotiation procedures interact. We also propose solutions to rectify the problem.

Wi-Fi Direct is a promising and available technology for device-to-device (D2D) proximity communications. To improve the performances of Wi-Fi Direct communication, optimized radio resource allocations are important. This paper proposes network assisted Wi-Fi Direct (NAWD), which operates based on the media independent services framework of IEEE 802.21 standard, for optimizing radio resource allocations. The NAWD is enhanced Wi-Fi Direct with the assistance of infrastructure networks (e.g., cellular network) and allocates radio resources (e.g., frequency channels and transmit power) to reduce radio interferences among Wi-Fi Direct devices (e.g., smart phones and set-top boxes). The NAWD includes mechanisms for gathering configuration information (e.g., location information and network connection information) of Wi-Fi Direct devices and allocating optimized radio resources (e.g., frequency channels and transmit power) to reduce radio interferences among Wi-Fi Direct devices. Simulation results show that the proposed NAWD increases significantly SINR, power efficiency, and areal capacity compared to legacy Wi-Fi Direct, where areal capacity is total traffic throughput per unit area.

This paper proposes the statistical analysis of phase-only correlation functions between two real signals with phase-spectrum differences. For real signals, their phase-spectrum differences have odd-symmetry with respect to frequency indices. We assume phase-spectrum differences between two signals to be random variables. We next derive the expectation and variance of the POC functions considering the odd-symmetry of the phase-spectrum differences. As a result, the expectation and variance of the POC functions can be expressed by characteristic functions or trigonometric moments of the phase-spectrum differences. Furthermore, it is shown that the peak value of the POC function monotonically decreases and the sidelobe values monotonically increase as the variance of the phase-spectrum differences increases.

This paper investigates open-loop Stackelberg games for a class of stochastic systems with multiple players. First, the necessary conditions for the existence of an open-loop Stackelberg strategy set are established using the stochastic maximum principle. Such conditions can be represented as solvability conditions for cross-coupled forward-backward stochastic differential equations (CFBSDEs). Second, in order to obtain the open-loop strategy set, a computational algorithm based on a four-step scheme is developed. A numerical example is then demonstrated to show the validity of the proposed method.

In this paper, we investigate the channel characteristics of underwater optical wireless communications (UOWC) based on Monte Carlo simulation method. The impulse response and channel time dispersion of the link are discussed. Also we consider the channel parameters comprehensively like the water type, attenuation length, divergence angle, beam width, field-of-view (FOV), receiver aperture and position. Simulation results suggest that in clear water, the channel can effectively be considered as non inter-symbol interference (ISI) when working over distance of up to 40m. Therefore, in practice the receiver does not need to perform computationally complex signal processing operations. However, in harbor water, the channel time dispersion will enlarge with larger FOV or divergence angle, and reduce the data transmission efficiency. When the attenuation length is smaller than diffused length, larger receivers offer lower intensity than smaller ones. In contrast, the intensity enhances with larger receiver at the small FOV, however, they trend to similar regardless of the apertures at large FOV. Furthermore, we study the effect of misalignment of the transmitter and receiver on the received intensity. The results give us some insight in terms of what constitutes an accurate UOWC channel.

The differential fault analysis of SOSEMNAUK was presented in Africacrypt in 2011. In this paper, we improve previous work with algebraic techniques which can result in a considerable reduction not only in the number of fault injections but also in time complexity. First, we propose an enhanced method to determine the fault position with a success rate up to 99% based on the single-word fault model. Then, instead of following the design of SOSEMANUK at word levels, we view SOSEMANUK at bit levels during the fault analysis and calculate most components of SOSEMANUK as bit-oriented. We show how to build algebraic equations for SOSEMANUK and how to represent the injected faults in bit-level. Finally, an SAT solver is exploited to solve the combined equations to recover the secret inner state. The results of simulations on a PC show that the full 384 bits initial inner state of SOSEMANUK can be recovered with only 15 fault injections in 3.97h.

In this paper, we present two classes of zero difference balanced (ZDB) functions, which are derived by difference balanced functions, and a class of perfect ternary sequences respectively. The proposed functions have parameters not covered in the literature, and can be used to design optimal constant composition codes, and perfect difference systems of sets.

Frequencies around 300GHz offer extremely broad atmospheric transmission window with relatively low losses of up to 10dB/km and can be regarded as the ultimate platform for ultrahigh-speed wireless communications with near-fiber-optic data rates. This paper reviews technical challenges and recent advances in integrated circuits targeted at communications using these and nearby “terahertz (THz)” frequencies. Possible new applications of THz wireless links that are hard to realize by other means are also discussed.

Event-triggered control is a control method that the measured signal is sent to the controller only when a certain triggering condition on the measured signal is satisfied. In this paper, we propose a linear quadratic regulator (LQR) with decentralized triggering conditions. First, a suboptimal solution to the design problem of LQRs with decentralized triggering conditions is derived. A state-feedback gain can be obtained by solving a convex optimization problem with LMI (linear matrix inequality) constraints. Next, the relation between centralized and decentralized triggering conditions is discussed. It is shown that control performance of an LQR with decentralized event-triggering is better than that with centralized event-triggering. Finally, a numerical example is illustrated.

We present a novel receiver for reliable IoT communications. In this letter, it is assumed that IoT communications are based on ZigBee under frequency-selective indoor environments. The ZigBee includes IEEE 802.15.4 specification for low-power and low-cost communications. The presented receiver fully follows the specification. However, the specification exhibits extremely low performance under frequency-selective environments. Therefore, a channel estimation approach is proposed for reliable communications under frequency-selective fading indoor environments. The estimation method relies on FFT operations, which are usually embedded in cellular phones. We also suggest a correlation method for accurate recovery of original information. The simulation results show that the proposed receiver is very suitable for IoT communications under frequency-selective indoor environments.

Controlling synchrony as well as desynchrony in a network of neuronal oscillators has been one of the focus issues in nonlinear science and engineering. It has been well known that spike stimuli injected commonly to multiple neurons can synchronize them if the strength of the common spike stimuli is high enough. Our recent study showed that this common spike-induced synchrony could be suppressed by introducing heterogeneity to inhibitory connections, through which the common spikes are transmitted. The aim of the present study is apply this methodology to electronic neurons as a real physical hardware. Using an Axon-Hillock circuit that represents basic properties of the leaky integrate-and-fire (LIF) neuron, our experiment demonstrated that the method was quite effective for desynchronizing the neuron circuits. The experimental results are also in a good agreement with the linear response theory that describes the input-output relationship of LIF neurons. Our method of suppressing the neuronal synchrony should be of practical use for enhancement of neural information processing as well as for improvement of pathological state of the brain.

In this paper, we present a low and variable computation complexity decoder based on K-Best for uncoded detection in spatially multiplexed MIMO systems. In the variable complexity K-Best (VKB), the detection of each symbol is carried out using only a symbol constellation of variable size. This symbol constellation is obtained by considering the channel properties and a given target SNR. Simulations show that the proposed technique almost matches the performance of the original K-Best decoder. Moreover, it is able to reduce the average computation complexity by at least 75% in terms of the number of visited nodes.

In this paper, we propose two secure multiuser multiple-input multiple-output (MIMO) transmission approaches based on interference alignment (IA) in the presence of an eavesdropper. To deal with the information leakage to the eavesdropper as well as the interference signals from undesired transmitters (Txs) at desired receivers (Rxs), our approaches aim to design the transmit precoding and receive subspace matrices to minimize both the total inter-main-link interference and the wiretapped signals (WSs). The first proposed IA scheme focuses on aligning the WSs into proper subspaces while the second one imposes a new structure on the precoding matrices to force the WSs to zero. In each proposed IA scheme, the precoding matrices and the receive subspaces at the legitimate users are alternatively selected to minimize the cost function of a convex optimization problem for every iteration. We provide the feasible conditions and the proofs of convergence for both IA approaches. The simulation results indicate that our two IA approaches outperform the conventional IA algorithm in terms of the average secrecy sum rate.

Card-based protocols enable us to easily perform cryptographic tasks such as secure multiparty computation using a deck of physical cards. Since the first card-based protocol appeared in 1989, many protocols have been designed. A protocol is usually described with a series of somewhat intuitive and verbal descriptions, such as “turn over this card,” “shuffle these two cards,” “apply a random cut to these five cards,” and so on. On the other hand, a formal computational model of card-based protocols via abstract machine was constructed in 2014. By virtue of the formalization, card-based protocols can be treated more rigorously; for example, it enables one to discuss the lower bounds on the number of cards required for secure computations. In this paper, an overview of the computational model with its applications to designing protocols and a survey of the recent progress in card-based protocols are presented.

One of the major subjects for marine resources development and information processing is how to realize underwater short-range and large-capacity data transmissions. The acoustic wave is an effective carrier and has been used for underwater data transmissions because it has lower attenuation in seawater than the radio wave, and has average propagation distance of about 10km or more. However, along with the imaging of transmission data, the inherent low speed of the acoustic wave makes it cannot and become an ideal carrier for high-speed and large-capacity communications. On the other hand, visible-light wave with wavelength of 400nm-650nm is an ideal carrier, which has received much attention. Its attractive features are high transparency and low attenuation rate in underwater, easily control the propagation direction and range by the visibility, and high data rate and capacity, making it excellent for application in underwater wireless communications. However, visible-light waves in the seawater have the spectral attenuation characteristics due to different marine environment. Therefore, in this paper an underwater optical wireless communication method with adaptation seawater function is considered for seawater turbidity of the spatio-temporal change. Two crucial components in the underwater optical wireless communication system, the light wavelength and the modulation method are controlled using wavelength- and modulation-adaptation techniques, respectively. The effectiveness of the method of the adaptation wavelength is demonstrated in underwater optical image transmissions.

The RC4 stream cipher is widely used including WEP and WPA, which are the security protocols for IEEE 802.11 wireless standard. WPA improved a construction of the RC4 key setting known as TKIP to avoid the known WEP attacks. The first 3-byte RC4 keys generated by IV in WPA are known since IV can be obtained by observing packets. The weaknesses in TKIP using the known IV were reported by Sen Gupta et al. at FSE 2014 and by Ito and Miyaji at FSE 2015. Both showed that TKIP induces many RC4 key correlations including the keystream bytes or the unknown internal states. Ideally TKIP should be constructed in such a way that it can keep the security level of generic RC4. In the first part of this paper, we will provide newly theoretical proofs of 17 correlations remain unproven in our previous work theoretically. Our theoretical analysis can make clear how TKIP induces biases of internal states in generic RC4. In the second part of this paper, we will further provide a refined construction of the RC4 key setting. As a result, we can reduce the number of correlations in the refined construction by about 70% in comparison with that in the original setting.

An efficient balanced truncation for RC and RLC networks is presented in this paper. To accelerate the balanced truncation, sparse structures of original networks are considered. As a result, Lyapunov equations, the solutions of which are necessary for making the transformation matrices, are efficiently solved, and the reduced order models are efficiently obtained. It is proven that reciprocity of original networks is preserved while applying the proposed method. Passivity of the reduced RC networks is also guaranteed. In the illustrative examples, we will show that the proposed method is compatible with PRIMA in efficiency and is more accurate than PRIMA.