• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2894-2909
• /
• 2015

As the number of mobile devices such as smart phones and tablets explodes, the need for new services or applications is also rapidly increasing. Smart class application is one of the emerging applications, in which most of contents are distributed to all members of a class simultaneously. It is highly required to select relay nodes to cover shadow area of radio as well as extend coverage, but existing algorithms in a smart class environment suffer from high control packet overhead and delay for exchanging topology information among all pairs of nodes to select relay nodes. In addition, the relay selection procedure should be repeated in order to adapt to the dynamic topology changes caused by link status changes or device's movement. This paper proposes the learning based relay selection algorithm to overcome aforementioned problems. The key idea is that every node keeps track of its relay quality in a fully distributed manner, where RQI (Relay Quality Indicator) is newly defined to measure both the ability of receiving packets from content source and the ability of successfully relaying them to successors. The RQI of each node is updated whenever it receives or relays broadcast packet, and the node having the higher RQI is selected as a relay node in a distributed and run-time manner. Thus, the proposed algorithm not only removes the overhead for obtaining prior knowledge to select relay nodes, but also provides the adaptability to the dynamic topology changes. The network simulation and experimental results prove that the proposed algorithm provides efficient and reliable content distribution to all members in a smart class as well adaptability against network dynamics.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.4
• /
• pp.809-816
• /
• 2010

This paper proposed about a load-balanced multi-agent model in mobile distribution environment to monitor moving patients and to deal with a situation of emergency. This model was designed to have a structure based on distribution framework by expanding a mobile system, and provides healthcare services based on real time situational information on moving patients. In order to overcome the limitation of middleware when we design system, we provided an abstract layer between applications and their base network infrastructure so that balance between QoS requests and network life can be maintained. In addition, clustering was used in cells for the efficient load distribution among multi-agents. By using Clustering FCM, we got optimal resources and had solve about transmission delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3B
• /
• pp.183-190
• /
• 2003

The explosion of the Internet has brought an acute need for efficient operation, which becomes to develop several technologies based on optical networks. By matching merging technology using wavelength multiplexing, an efficient administration with limited wavelength can provide scalability of network. The merging in optical layer has limitation of devices since the merging can not be performed in this layer. Hence the merging must be implemented in electronic layer. When the merging is implemented, the delay time would be increased in OXC (Optical Cross Connection), but the improvement of throughput rate will be expected in the process of explosive traffic due to reduction of optical channel supporting large bandwidth. In this thesis, we proposed an OXC of dual module having a merging function. We considered the optimum merging point with the largest in system performance and confirmed results using the simulation.

• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.3
• /
• pp.205-218
• /
• 2012

Mobility management of the mobile nodes and provision of seamless handover is crucial to an efficient support for the global roaming of the mobile nodes in next-generation wireless networks. Mobile IPv6 and mobility management in extended IP layer, which highly depend on traffic characteristics and user mobility models, were proposed by the IETF. Therefore, to evaluate the in-depth performance about these factors is important. Generally, the performance of IPv6-based mobility management protocol is evaluated through simulation. This paper shows the correlation between network parameters and performance metrics through numerical results, which is investigated how influence handoff latency and packet loss. And this paper uses mathematical analysis of the system parameters, such as the subnet residence time, the packet arrival rate and delay in wireless connection through the analytical framework which evaluate the performance of IPv6-based mobility management protocol.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.4
• /
• pp.1976-1981
• /
• 2011

In this study, the optimal sewer layout model(Lee, J.H., 2010)[1] was applied to verify the reduction effect of urban inundation in the optimal sewer networks, which designed by this optimal model, for various artificial rainfall events in urban areas. Then the optimal model was developed by Lee, J.H. to minimize the peak outflow at outlet in sewer network. The applied rainfall events are two types. One is the rainfall event which the double peak occurs between specific time distance continuously. The other is the continuous rainfall event with specific rainfall intensity. As the result, in two applied rainfall types, the peak outflows at outlet were reduced in the optimal sewer networks which designed the optimal sewer layout model of Lee, J.H.. Therefore, the peak outflow is reduced because the inflows at each manhole are distributed in the whole sewer networks, it's not delay of inflows by this optimal model.

• The KIPS Transactions:PartC
• /
• v.15C no.1
• /
• pp.19-30
• /
• 2008

Sensor nodes are used as a storage space in the data centric storage method for sensor networks. Sensor nodes save the data to the node which is computed by hash table and users also access to the node to get the data by using hash table. One of the problems which the data centric storage method has is that queries from many users who are interested in the popular data could be concentrated to one node. In this case, responses for queries could be delayed and the energy of heavy loaded node could be dissipated fast. This would lead to reduction of network life time. In this paper, ALT, Data Centric Storage based on Adaptive Local Trajectory, is proposed as scalable data centric storage method for sensor network. ALT constructs trajectory around the storage node. The scope of trajectory is increased or decreased based on the query frequency. ALT distributes the query processing loads to several nodes so that delay of response is reduced and energy dissipation is also distributed.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.5
• /
• pp.71-77
• /
• 2021

Recently, there is a demand for efficient program development of an IoT application support frameworks considering heterogeneous hardware characteristics. In addition, the scope of hardware support is expanding with the development of neuromorphic architecture that mimics the human brain to learn on their own and enables autonomous computing. However, most existing IoT IDE(Integrated Development Environment), it is difficult to support AI(Artificial Intelligence) or to support services combined with various hardware such as neuromorphic architectures. In this paper, we design an AI component abstract model that supports the second-generation ANN(Artificial Neural Network) and the third-generation SNN(Spiking Neural Network), and implemented an autonomous IoT IDE based on the proposed model. IoT developers can automatically create AI components through the proposed technique without knowledge of AI and SNN. The proposed technique is flexible in code conversion according to runtime, so development productivity is high. Through experimentation of the proposed method, it was confirmed that the conversion delay time due to the VCL(Virtual Component Layer) may occur, but the difference is not significant.

• The KIPS Transactions:PartC
• /
• v.8C no.1
• /
• pp.60-67
• /
• 2001

Multicast Protocol for multimedia service on the Internet can be classified into two types, e.g., source based tree and shared tree according to difference of tree construction method. Shared tree based multicast is known to show outstanding results in the aspect of scalability than source based tree. Generally, There have been lots of researches on the method to satisfy QoS constraints through proper Rendezvous Point (RP) in the shared tree. In addition, as the multicast group members join and leave dynamically in the service time, RP of the shared tree should b be reselected for guranteeing Qos to new member, But, RP reselection method has not been considered generally as the solution to satisfy QoS C constraints. In this paper, new initial RP selection and RP reselection method are proposed, which utilize RTCP (Real Time Control Protocol) report packet fields. Proposed initial RP selection and RP reselection method use RTCP protocol which underlying multimedia application service So, the proposed method does not need any special process for collecting network information to calculate RP. New initial RP selection method s shows better performance than random and topology based one by 40-50% in simulation. Also, RP reselection method improves delay p performance by 50% after initial RP selection according to the member’s dynamicity.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.984-998
• /
• 1999

최근 개인 휴대 통신에 대한 관심도가 증가하면서 B-ISDN (Broadband Integrated Services Digital Network)과 같은 기존의 유선 망에서 제공하던 다양한 멀티미디어 응용 지원을 무선 망으로 확장시키기 위한 연구가 활발히 진행되고 있다. 그러나 기존의 유선 망에서는 멀티미디어 응용 지원을 위해 QoS (Quality of Service) Provisioning에 관한 많은 연구가 되어 있으나 무선 망에서는 이동성과 무선 전파의 열악한 전송으로 인해 새로운 QoS Provisioning 방법에 관한 연구가 필수적이다. 본 논문에서는 이러한 무선 망의 특수성으로 인해 발생할 수 있는 서비스의 질 저하와 강제 종료를 줄임으로써 지속적인 QoS를 보장해 주고 한정된 무선 자원을 효율적으로 사용하며 처리에 의한 오버헤드를 줄이기 위하여 다음과 같은 세 가지 방법을 제안하였다. 첫째, 핸드오프 강제 종료율을 줄이기 위하여 대역폭 예약 방법을 사용하되 특정 셀의 트래픽 특성에 맞게 또한 시간대에 따른 트래픽 특성에 따라 예약 대역폭의 양을 조절하는 적응적 대역폭 예약 방법이다. 둘째, 많은 경우 각 셀의 트랙픽 변화는 일정한 주기로 변화한다는 특성에 따라 과거의 트래픽 정보를 이용하는 예측 기반의 대역폭 예약 방법이다. 마지막으로 호의 종류, 트래픽 특성, 단말기의 이동 속도에 따라 다른 우선 순위에 의해 호 수락 제어를 수행하는 우선 순위 기반의 호 수락 제어를 제안하였다. 시뮬레이션을 통하여 기존에 제안된 방법과 성능 비교하여, 요구되는 수준의 QoS 보장과 효율적인 자원의 사용, 요구되는 처리비용의 최소화를 통해 전체 시스템의 성능 향상을 입증하였다.Abstract As interest in wireless hand-held terminals and in personal communications services increases recently, there have been broad studies on the ways to support multimedia applications provided in wired networks such as B-ISDN (Broadband Integrated Services Digital Network) in wireless networks. However, since many studies have focused on Quality of Service (QoS) Provisioning in wired networks to provide multimedia applications, new methods of QoS Provisioning are needed in wireless networks to resolve the problem of wireless channel fading and the difficulty of mobility occurred in wireless networks. This paper proposes three schemes of QoS Provisioning in wireless networks which will make continuous QoS guarantee and efficient use of limited wireless resources possible. The first scheme reserves bandwidth in proportion to the amount of real-time traffic in the neighbor cells to decrease the handoff dropping rate of delay sensitive real-time connections, adapting reserved bandwidth for efficient resource utilization. The second scheme is predictive bandwidth reservation scheme that utilizes the past handoff information. It can decrease overheads required to adapt bandwidth reservation. The last scheme is priority-based call admission control prioritizing traffic type (real-time traffic/ non-real-time traffic), connection type (new connection /handoff connection), and mobile terminal speed (fast mobile/slow mobile). Simulation results show that the proposed QoS Provisioning schemes improve the total system performance by achieving three goals - required QoS guarantee, higher bandwidth utilization and less overhead.

• Journal of Internet Computing and Services
• /
• v.15 no.2
• /
• pp.19-31
• /
• 2014

In this paper, a parallel backoff delay procedure on multiple IEEE 802.15.4 channels and a channel searching method considering the frequency spectrum of WiFi traffic are studied for IEEE 802.15.4 nodes to avoid the interference from WiFi traffic. In order to search the channels being occupied by WiFi traffic, we analyzed the methods measuring the powers of adjacent channels simultaneously, checking the duration of measured power levels greater than a threshold, and finding the same periodicity of sampled RSSI data as the beacon frame by signal processing. In an wireless channel overlapped with IEEE 802.11 network, the operation of CSMA-CA algorithm for IEEE 802.15.4 nodes is explained. A method to execute a parallel backoff procedure on multiples IEEE 802.15.4 channels by an IEEE 802.15.4 device is proposed with the description of its algorithm. When we analyze the data measured by the experimental system implemented with the proposed method, it is observed that medium access delay times increase at the same time in the associated IEEE 802.15.4 channels that are adjacent each other during the generation of WiFi traffic. A channel evaluation function to decide the interference from other traffic on an IEEE 802.15.4 channel is defined. A channel searching method considering the channel evaluations on the adjacent channels together is proposed in order to search the IEEE 802.15.4 channels interfered by WiFi, and the experimental results show that it correctly finds the channels interfered by WiFi traffic.