• Journal of Computing Science and Engineering
• /
• v.5 no.4
• /
• pp.324-330
• /
• 2011

To avoid collisions, IEEE 802.11 medium access control (MAC) uses predetermined inter-frame spaces and the random back-off process. However, the retransmission strategy of IEEE 802.11 MAC results in considerable time wastage. The hidden node problem is well known in wireless networks; it aggravates the consequences of time wastage for retransmission. Many collision prevention and recovery approaches have been proposed to solve the hidden node problem, but all of them have complex control overhead. In this paper, we propose a fast retransmission scheme as a recovery approach. The proposed scheme identifies collisions caused by hidden nodes and then allows retransmission without collision. Analysis and simulations show that the proposed scheme has greater throughput than request-to-send and clear-to-send (RTS/CTS) and a shorter average waiting time.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.3
• /
• pp.79-94
• /
• 2001

This paper presents a new algorithm for the K shortest paths Problem which develops initial K shortest paths, and repeat to expose hidden shortest paths with dual approach and to replace the longest path in the present K paths. The initial solution comprises K shortest paths among shortest paths to traverse each arc in a Double Shortest Arborescence which is made from bidirectional Dijkstra algorithm. When a crossing node that have two or more inward arcs is found at least three time by turns in this K shortest paths, there may be some hidden paths which are shorter than present k-th path. To expose a hidden shortest path, one inward arc of this crossing node is chose by means of minimum detouring distance calculated with dual variables, and then the hidden shortest path is exposed with joining a detouring subpath from source to this inward arc and a spur of a feasible path from this crossing node to sink. If this exposed path is shorter than the k-th path, the exposed path replaces the k-th path. This algorithm requires worst case time complexity of O(Kn$^2$), and O(n$^2$) in the case k$\leq$3.

• Journal of Environmental Science International
• /
• v.11 no.3
• /
• pp.201-207
• /
• 2002

This study was carried out to evaluate the artificial neural network algorithm for water quality forecasting in Chungju lake, north Chungcheong province. Multi-layer perceptron(MLP) was used to train artificial neural networks. MLP was composed of one input layer, two hidden layers and one output layer. Transfer functions of the hidden layer were sigmoid and linear function. The number of node in the hidden layer was decided by trial and error method. It showed that appropriate node number in the hidden layer is 10 for pH training, 15 for DO and BOD, respectively. Reliability index was used to verify for the forecasting power. Considering some outlying data, artificial neural network fitted well between actual water quality data and computed data by artificial neural networks.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.28 no.2
• /
• pp.193-200
• /
• 2022

We conducted a case study to determine the optimal model parameters and predictors of Long Short-Term Memory (LSTM) for the reproduction of dissolved oxygen (DO) concentration in Jinhae Bay. The model parameter case study indicated the lowest accuracy when the Hidden node=10, Epoch=100. This was caused by underfitting of machine learning. The accuracy increased as the Hidden node and Epoch increased. The accuracy was the highest when the Hidden node=80 and Epoch=100 with R²=0.99. In the bottom DO reproduction of Step 1 of the predictors case study, accuracy was highest when the water temperature was used as a predictor with R²=0.81. In Step 2, The R² value increased up to 0.92 when the water temperature and SiO₂ were used as a predictor. This was caused by a high correlation between the bottom DO and SiO₂ concentrations. Consequently, we determined the optimal model parameters and predictors of LSTM for the reproduction of DO concentration in Jinhae Bay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.4
• /
• pp.605-613
• /
• 1994

In this paper, we evaluate performance of multiple access for distributed wireless communication network by CSMA protocol. It is envident that the existence of hidden node in an environment degrades the performance of CSMA. In order to improve performance due to the problem of hidden node, the previous paper used random multiple access protocols a as such as ISMA, BTMA, BCMA. In this paper, We propose a protocol that we can improve performance by allowing node to sense the carrier of any other transmission on the channel in the distributed wireless communication networks The probability of transmission success was obtained by steady stats analysis under given assumptions. We confirmed that hidden node problem be virtually elimated by using a new protocol.

• Information and Communications Magazine
• /
• v.30 no.6
• /
• pp.20-25
• /
• 2013

본고에서는 1GHz 이하 주파수에서 동작하는 Wireless LAN(WLAN) 표준으로, IEEE 802.11ah PHY/MAC 표준 규격에 대해서 알아 본다. IEEE 802.11ah 표준은, Smart Grid, M2M, IoT 와 같이 실내, 실외에서 많은 수의 단말들을 최소한의 전력소모로 데이터 통신을 하기 위한 목적으로 개발되었다. WLAN의 서비스 범위가 1Km 이상으로 늘어나게 되면, 그 동안 WLAN 에서 심각하게 다루지 않았던 Hidden Node 문제가 단말의 전력 소모, throughput performance 을 결정하는 중요한 요소로 등장하게 된다. 특별히 IEEE 802.11ah 에서는, 많은 수의 단말들간에 Hidden Node 을 고려한 Restricted Access Window 라는 새로운 channel access 기법이 제안되었고, 이에 본 고에서는 IEEE 802.11ah 에 새롭게 지원되는 MAC 기능들에 대해 중점적으로 살펴 보도록 한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1775-1784
• /
• 1999

This paper proposes a method of removing unnecessary hidden nodes by a new cost function that evaluates the variance and the mean of hidden node outputs during training. The proposed cost function makes necessary hidden nodes be activated and unnecessary hidden nodes be constants. We can remove the constant hidden nodes without performance degradation. Using the CEDAR handwritten digit recognition, we have shown that the proposed method can remove the number of hidden nodes up to 37.2%, with higher recognition rate and shorter learning time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11B
• /
• pp.1373-1382
• /
• 2011

Zigbee is communication technology most ideal because Zigbee support low power communication and wide expansion in wireless home network. However, Zigbee is not popular, because of Zigbee always has Hidden Node Problem and Transit Delay Problem. We propose new Beacon Frame structure to solve the two problem in Zigbee. New Beacon Frame structure reduces a Super Frame Duration and add a same space of a Control Frame Duration. We expect to solved method of Hidden Node Problem that exchange terminal information to using RTS/CTS. Also, We expect to solved method of Transit Delay Problem that put Beacon between Control Frame Duration and Super Frame Duration for synchronization. We confirm new Beacon Frame to solved two problem in OPNET simulation at Zigbee QoS Parameters. We measure Delay(sec) for solution degree of Transit Delay Problem, and measure Throughput(bits/sec) and Load (bits/sec) for solution degree of Hidden Node Problem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.955-963
• /
• 2009

In this paper, we propose a medium access control(MAC) protocol for reducing the energy efficiency and for improving the transmission efficiency in underwater acoustic sensor networks. In underwater environment, the transmission delay is longer and bandwidth is smaller than terrestrial environment. Considering these points, we propose a new MAC protocol to enhance throughput and to manage efficiently the energy of nodes. The proposed protocol operates as a channel reservation scheme to decrease data collisions, and uses a mechanism to control the hidden node problem and the exposed node problem occurred in ad hoc networks. The proposed protocol consists of the slotted based transmission frame and reduces data collisions between nodes by putting separately the reservation period in the transmission frame. In addition, it is able to solve the hidden node problem and the exposed node problem by reservation information between nodes. We carry out the simulation to evaluate the proposed protocol in terms of the average energy consumption, the ratio of collision, throughput, and the average transmission delay, and compare the proposed protocol to a traditional MAC protocol in the underwater environment. The simulation results show that the proposed protocol outperforms the traditional protocol under a various of network parameters.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.2
• /
• pp.7-16
• /
• 2000

In this paper, IEEE 802.11 MAC layer protocol is modeled by p-persistent CSMA method. And We introduce performance analysis model based on Basic CSMA/CA protocol, CTS/RTS protocol and hidden node effect reflected Basic CSMA/CA Protocol, Which is mathematically assayed by renewal theory. In this throughput, the result shown that Basic CSMA/CA protocol is profitable when the number of active node is smaller, or the length of packet is shorter, and CTS/RTS protocol is lucrative when the number of active node is larger, or the length of packet is longer. Also the result shown that hidden node less affected when the active node has small one, rather than when the active node has larger one.