• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4A
• /
• pp.369-379
• /
• 2011

During the routing process between nodes on the CR(Cognitive Radio) network conducting for efficient use of limited frequency resources, spectrum handover process due to the appearance of the PU occupies most of the routing latency, and also decreases the reliability of the path. In this paper, a cooperative routing protocol in a multi-channel environment is proposed. The source node broadcasts a message with available channel lists and probability of PU appearance during its route guidance. The intermediate nodes re-transmit the message, received from the source node, and update and maintain the information, status table of the path. The destination node determines the optimal path and sends a reply message to the selected path after it receives the messages from the intermediate nodes. The average probability of the PU appearance and the average time of the PU appearance are updated while transferring data. During data transmission the channel with the lowest probability of appearance of the PU is selected dynamically and if a PU appears on the current channel partial repairment is performed. It is examined that reliability of the selected path considerably is improved and the routing cost is reduced significantly compared to traditional routing methods.

• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.557-562
• /
• 2005

Throughput and latency of interconnection network are important factors of the performance of multiprocessor systems. The dual-link CC-NUMA architecture using point-to-point unidirectional link is one of the popular structures in high-end commercial systems. In terms of optimal path between nodes, several paths exist with the optimal hop count by its native multi-path structure. Furthermore, transaction latency between nodes is affected by congestion of links on the transaction path. Hence the transaction latency may get worse if the transactions make a hot spot on some links. In this paper, I propose a dynamic transaction routing algorithm that maintains the balanced link utilization with the optimal path length, and I compare the performance with the fixed path method on the dual-link CC-NUMA systems. By the proposed method, the link competition is alleviated by the real-time path selection, and consequently, dynamic transaction algorithm shows a better performance. The program-driven simulation results show $1{\~}10\%$ improved fluctuation of link utilization, $1{\~}3\%$ enhanced acquirement of link, and $1{\~}6\%$ improved system performance.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.17-24
• /
• 2009

This paper deals with the cancellation performance of loop back interference signal in the case of multihop relay of 16-QAM received signal at the USN radio network. For this, it is necessary to the exchange of information with long distance located station by means of the relay function between the node in the USN environment. In the relay node, the loop-back interference signal which the retransmitting signal is feedback to the receiver side due to the antenna of transmitter and receiver are co-used or very colsely located or using the nonlinear device. Due to this signal, the performance of USN system are degraded which are using the limited resource of frequency and power. For improve this, it is necessary to applying the adaptive signal processing algorithm in order to cancellating the unwanted loop-back interference signal at the frontend of receiver in relaying node, we can get the better system and multi hop performance. In the adaptive signal processing, we considered the 16-QAM signal which has a good spectral efficiency, firstly, than, the QR-Array RLS algorithm was used that has a fairly good convergence property and the solving the finite length problem in the H/W implementation. Finaly, we confirmed that the good elimination performanc was confirmed by computer simulation in the learing cuved and received signal constellation compared to the conventional RLS.

• Journal of Internet Computing and Services
• /
• v.17 no.6
• /
• pp.33-39
• /
• 2016

With recent advances in sensor technology, CMOS-based semiconductor devices and networking protocol, the areas for application of wireless sensor networks greatly expanded and diversified. Such diversification of uses for wireless sensor networks creates a multitude of beneficial possibilities for several industries. In the application of wireless sensor networks for monitoring systems' data transmission process from the sensor node to the sink node, transmission through multi-hop paths have been used. Also mobile sink techniques have been applied. However, high energy costs, unbalanced energy consumption of nodes and time gaps between the measured data values and the actual value have created a need for advancement. Therefore, this thesis proposes a new model which alleviates these problems. To reduce the communication costs due to frequent data exchange, a State Prediction Model has been developed to predict the situation of the peripheral node using a geographic autocorrelation of sensor nodes constituting the wireless sensor networks. Also, a Risk Analysis Model has developed to quickly alert the monitoring system of any fatal abnormalities when they occur. Simulation results have shown, in the case of applying the State Prediction Model, errors were smaller than otherwise. When the Risk Analysis Model is applied, the data transfer latency was reduced. The results of this study are expected to be utilized in any efficient communication method for wireless sensor network monitoring systems where all nodes are able to identify their geographic location.