• Journal of Communications and Networks
• /
• v.13 no.1
• /
• pp.43-49
• /
• 2011

In this paper, a new medium access control (MAC) protocol entitled three-phase multiple access with continual contention resolution (TPMA-CCR) is proposed for wireless multi-hop ad hoc networks. This work is motivated by the previously known three-phase multiple access (TPMA) scheme of Hou and Tsai [2] which is the suitable MAC protocol for clustering multi-hop ad hoc networks owing to its beneficial attributes such as easy collision detectible, anonymous acknowledgment (ACK), and simple signaling format for the broadcast-natured networks. The new TPMA-CCR is designed to let all contending nodes participate in contentions for a medium access more aggressively than the original TPMA and with continual resolving procedures as well. Through the systematical performance analysis of the suggested protocol, it is also shown that the maximum throughput of the new protocol is not only superior to the original TPMA, but also improves on the conventional slotted carrier sense multiple access (CSMA) under certain circumstances. Thus, in terms of performance, TPMA-CCR can provide an attractive alternative to other contention-based MAC protocols for multi-hop ad hoc networks.

• Journal of Multimedia Information System
• /
• v.3 no.4
• /
• pp.141-148
• /
• 2016

This paper proposes a medium access control (MAC) protocol for multiple-input multiple-output (MIMO) ad-hoc networks. Multiple-packet receptions in MIMO systems have attracted as a key technique to achieve a high transmission rate. In the conventional protocols for multiple-packet receptions, timing offsets among multiple-frame transmissions cause frame collisions induced by hidden nodes, which degrades network performance. In the proposed protocol, transmission synchronization among hidden nodes can be achieved by applying pulse/tone exchanges. By applying the pulse/tone exchanges, multiple-packet receptions among hidden nodes can be achieved, which enhances network throughputs compared with the conventional protocol. Simulation results show effectiveness of the proposed protocol.

• KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
• /
• v.5B no.2
• /
• pp.103-110
• /
• 2005

Broken rotor bars in induction motors can be detected by monitoring any abnormality of the spectrum amplitudes at certain frequencies in the motor current spectrum. Broken rotor bar fault detection schemes should rely on multiple signatures in order to overcome or reduce the effect of any misinterpretation of the signatures that are obscured by factors such as measurement noises and different load conditions. Multiple Discriminant Analysis (MDA) and Artificial Neural Networks (ANN) provide appropriate environments to develop such fault detection schemes because of their multi-input processing capabilities. This paper describes two fault detection schemes for broken rotor bar fault detection with multiple signature processing, and demonstrates that multiple signature processing is more efficient than single signature processing.

• Journal of Communications and Networks
• /
• v.18 no.6
• /
• pp.884-891
• /
• 2016

The wireless mesh network (WMN) has attracted significant interests as a broadband wireless network to provide ubiquitous wireless access for broadband services. Especially with incorporating multiple orthogonal channels and multiple directional antennas into the WMN, each node can communicate with its neighbor nodes simultaneously without interference between them. However, as we allow more freedom, we need a more sophisticated algorithm to fully utilize it and developing such an algorithm is not easy in general. In this paper, we study a joint channel assignment, link scheduling, routing, and rate control problem for the WMN with multiple orthogonal channels and multiple directional antennas. This problem is inherently hard to solve, since the problem is formulated as a mixed integer nonlinear problem (MINLP). However, despite of its inherent difficulty, we develop an algorithm to solve the problem by using the generalized Benders decomposition approach [2]. The simulation results show the proposed algorithm provides the optimal solution to maximize the network utility, which is defined as the sum of utilities of all sessions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.956-970
• /
• 2015

In this paper, we study the design of network coding for the generalized transmit scheme in multiple input multiple output Y channel, where K users wish to exchange specified and shared information with each other within two slots. Signal space alignment at each user and the relay is carefully constructed to ensure that the signals from the same user pair are grouped together. The cross-pair interference can be canceled during both multiple accessing channel phase and broadcasting channel phase. The proposed signal processing scheme achieves the degrees of freedom of ${\eta}(K)=K^2$ with fewer user antennas.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.284-293
• /
• 2005

A critical issue in applications involving networks of wireless sensors is their ability to synchronize, and mitigate the fading propagation channel effects. Especially when distributed 'slave' sensors (nodes) reach-back to communicate with the 'master' sensor (gateway), low power cooperative schemes are well motivated. Viewing each node as an antenna element in a multi-input multi-output (MIMO) multi-antenna system, we design pilot patterns to estimate the multiple carrier frequency offsets (CFO), and the multiple channels corresponding to each node-gateway link. Our novel pilot scheme consists of non-zero pilot symbols along with zeros, which separate nodes in a time division multiple access (TDMA) fashion, and lead to low complexity schemes because CFO and channel estimators per node are decoupled. The resulting training algorithm is not only suitable for wireless sensor networks, but also for synchronization and channel estimation of single- and multi-carrier MIMO systems. We investigate the performance of our estimators analytically, and with simulations.

• Journal of Communications and Networks
• /
• v.16 no.5
• /
• pp.559-567
• /
• 2014

In this paper, a framework for power allocation of downlink transmissions in orthogonal frequency division multiple access-based decode-and-forward cellular relay networks is investigated. We consider a system with a single base station communicating with multiple users assisted by multiple relays. The relays have limited power which must be divided among the users they support in order to maximize the data rate of the whole network. Advanced power allocation schemes are crucial for such networks. The optimal relay power allocation which maximizes the data rate is proposed as an upper bound, by finding the optimal power requirement for each user based on knapsack problem formulation. Then by considering the fairness, a new relay power allocation scheme, called weighted-based scheme, is proposed. Finally, an efficient power reallocation scheme is proposed to efficiently utilize the power and improve the data rate of the network. Simulation results demonstrate that the proposed power allocation schemes can significantly improve the data rate of the network compared to the traditional scheme.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.10
• /
• pp.107-119
• /
• 1996

In this paper, we propose multiple component neural network(MCNN) which learn partitioned patterns in each multiple component neural networks by reducing dimensions of input pattern vector using PCA (principal component analysis). Procesed neural network use Oja's rule that has a role of PCA, output patterns are used a slearning patterns on small component neural networks and we call it CBP. For simply not solved patterns in a network, we solves it by regenerating new CBP neural networks and by performing dynamic partitioned pattern learning. Simulation results shows that proposed MCNN neural networks are very small size networks and have very fast learning speed compared with multilayer neural network EBP.

• Journal of Korean Institute of Industrial Engineers
• /
• v.17 no.2
• /
• pp.87-95
• /
• 1991

The exact solution of the closed queueing networks(CQN) is known only for the product form (BCMP) queueing networks. Various computational algorithms are available to derive system throughput(the rate at which a system completes units of computational work) of the networks. However, the computational expense of an exact solution is often excessive when there are multiple classes of cutomers. Instead of computing the exact values, it may be sufficient to derive bounds on the performance measures. Techniques for obtaining bounds on BCMP queueing networks have appeared in the past years. This paper also presents bounds on throughput in CQN models with multiple classes of customers.

• Proceedings of the Korea Concrete Institute Conference
• /
• 2002.10a
• /
• pp.647-652
• /
• 2002

In the previous study, authors presented the I-ProConS (Intelligent PREdiction system of CONcrete Strength) using artificial neural networks (ANN) that provides in-place strength information of the concrete to facilitate concrete form removal and scheduling for construction. The serious problem of the system has occured, which it cannot appropriately predict the concrete strength when the curing temperature of a curing day is changed. This is because it uses the single neural networks, which all nodes are fully connected, and thus it cannot smoothly respond for external impact. However this paper presents that the problem can be solved by multiple neural networks, which is composed of five ANNs.