• Title/Summary/Keyword: communication networks

Search Result 5,470, Processing Time 0.035 seconds

Reduction of Authentication Cost Based on Key Caching for Inter-MME Handover Support (MME 도메인간 핸드오버 지원을 위한 키캐싱 기반 인증비용의 감소기법)

  • Hwang, Hakseon;Jeong, Jongpil
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.5
    • /
    • pp.209-220
    • /
    • 2013
  • Handover is the technology to minimize data lose of mobile devices and make continuous communication possible even if the device could be moved from one digital cell site to another one. That is, it is a function that enables the mobile user to avoid the disconnection of phone conversations when moving from a specific mobile communication area to another. Today, there are a lot of ongoing researches for fast and efficient hand-over, in order to address phone call's delay and disconnection which are believed to be the mobile network's biggest problems, and these should essentially be resolved in all mobile networks. Thanks to recent technology development in mobile network, the LTE network has been commercialized today and it has finally opened a new era that makes it possible for mobile phones to process data at high speed. In LTE network environment, however, a new authentication key must be generated for the hand-over. In this case, there can be a problem that the authentication process conducted by the hand-over incurs its authentication cost and delay time. This essay suggests an efficient key caching hand-over method which simplifies the authentication process: when UE makes hand-over from oMME to nMME, the oMME keeps the authentication key for a period of time, and if it returns to the previous MME within the key's lifetime, the saved key can be re-used.

Mutual Authentication Method between Wireless Mesh Enabled MSAPs in the Next-generation TICN (차세대 전술정보통신체계에서의 무선 메쉬 MSAP 노드 간 상호 인증 기법)

  • Son, Yu-Jin;Bae, Byoung-Gu;Shon, Tae-Shik;Ko, Young-Bae;Lim, Kwang-Jae;Yun, Mi-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.5B
    • /
    • pp.385-394
    • /
    • 2012
  • The tactical mobile communication network, which comprises a part of the next-generation Tactical Information and Communication Network (TICN), provides means of communication and control for Tactical Multi-Functional Terminals (TMFT) belonging to a Mobile Subscriber Access Point (MSAP). The next-generation of MSAP is capable of constructing a backbone network via LCTR and HCTR directional antennas. At the same time, WMN modules are used to create and manage a wireless mesh backbone. When directional antennas are used in mobile environments, seamless services cannot be efficiently supported as the movement of the node prevents the angle of the antenna to constantly match. Therefore, data communication through the wireless mesh networks is required to provide direct communication between mobile MSAPs. Accordingly, mutual authentication and data encryption mechanisms are required to provide reliable data transmission in this environment. To provide efficient mutual authentication between MSAP devices, the process of verifying a certificate of the other MSAP device through its own authentication server is required. This paper proposes mutual authentication mechanisms where the MSAP requiring authentication and the MSAP that permits it initiates low-cost and efficient authentication in a distributed way. More specifically, we propose a method of applying EAP-ELS (Extensible Authentication Protocol-Transport Layer Security) in the next-generation TICN.

A Study on Communication Safety and Evaluation Tool in Railway Communication System (열차제어시스템 통신 안정성 및 평가 도구 연구)

  • Kim, Sung-Un;Seo, Sang-Bo;Song, Seung-Mi;Jo, Chan-Hyo;Hwang, Jong-Gyu;Jo, Hyun-Jeong
    • Journal of the Korean Society for Railway
    • /
    • v.11 no.4
    • /
    • pp.349-356
    • /
    • 2008
  • Put Safety-critical systems related to the railway communications are currently undergoing changes. Mechanical and electro-mechanical devices are being replaced by programmable electronics that are often controlled remotely via communication networks. Therefore designers and operators now not only have to contend with component failures and user errors, but also with the possibility that malicious entities are seeking to disrupt the services provided by theirs systems. Recognizing the safety-critical nature of the types of communications required in rail control operations, the communications infrastructure will be required to meet a number of safety requirements such as system faults, user errors and the robustness in the presence of malicious attackers who are willing to take determined action to interfere in the correct operation of a system. This paper discusses the safety strategies employed in the railway communications and proposes a security mechanism for Korean railway communication system. We present the developed communication safety evaluation tool based on the proposed security mechanism and also evaluate its protecting capability against the threats of masquerading, eavesdropping, and unauthorized message manipulation.

Cost-aware Optimal Transmission Scheme for Shared Subscription in MQTT-based IoT Networks (MQTT 기반 IoT 네트워크에서 공유 구독을 위한 비용 관리 최적 전송 방식)

  • Seonbin Lee;Younghoon Kim;Youngeun Kim;Jaeyoon Choi;Yeunwoong Kyung
    • Journal of Internet of Things and Convergence
    • /
    • v.10 no.4
    • /
    • pp.1-8
    • /
    • 2024
  • As technology advances, Internet of Things (IoT) technology is rapidly evolving as well. Various protocols, including Message Queuing Telemetry Transport (MQTT), are being used in IoT technology. MQTT, a lightweight messaging protocol, is considered a de-facto standard in the IoT field due to its efficiency in transmitting data even in environments with limited bandwidth and power. In this paper, we propose a method to improve the message transmission method in MQTT 5.0, specifically focusing on the shared subscription feature. The widely used round-robin method in shared subscriptions has the drawback of not considering the current state of the clients. To address this limitation, we propose a method to select the optimal transmission method by considering the current state. We model this problem based on Markov decision process (MDP) and utilize Q-Learning to select the optimal transmission method. Through simulation results, we compare our proposed method with existing methods in various environments and conduct performance analysis. We confirm that our proposed method outperforms existing methods in terms of performance and conclude by suggesting future research directions.

The Effect of Synchronous CMC Technology by Task Network: A Perspective of Media Synchronicity Theory (개인의 업무 네트워크 특성에 따른 동시적 CMC의 영향 : 매체 동시성 이론 관점)

  • Kim, Min-Soo;Park, Chul-Woo;Yang, Hee-Dong
    • Asia pacific journal of information systems
    • /
    • v.18 no.3
    • /
    • pp.21-43
    • /
    • 2008
  • The task network which is formed of different individuals can be recognized as a social network. Therefore, the way to communicate with people inside or outside the network has considerable influence on their outcome. Moreover, the position on which a member stands in a network shows the different effects of the information systems supporting communication with others. In this paper, it is to be studied how personal CMC (computer-mediated communication) tools affect the mission that those who work for a network perform through diverse task networks. Especially, we focused on synchronicity of CMC. On this score, the perspective of Media Synchronicity Theory was taken that had been suggested by criticizing Media Richness Theory. It is the objective, from this perspective, to find which characteristics of networks make the value of IT supporting synchronicity high. In the research trends of social networks, there have been two traditional perspectives to explain the effect of network: embeddedness and diversity ones. These differ from the aspect which type of social network can provide much more economic benefits. As similar studies have been reported by various researchers, these are also divided into the bonding and bridging views which are based on internal and external tie, respectively, Size, density, and centrality were measured as the characteristics of personal task networks. Size means the level of relationship between members. It is the total number of other colleagues who work with a specific member for a certain project. It means, the larger the size of task network, the more the number of coworkers who interact each other through the job. Density is the ratio of the number of relationships arranged actually to the total number of available ones. In an ego-centered network, it is defined as the ratio of the number of relationship made really to the total number of possible ones between members who are actually involved each other. The higher the level of density, the larger the number of projects on which the members collaborate. Centrality means that his/her position is on the exact center of whole network. There are several methods to measure it. In this research, betweenness centrality was adopted among them. It is measured by the position on which one member stands between others in a network. The determinant to raise its level is the shortest geodesic that represents the shortest distance between members. Centrality also indicates the level of role as a broker among others. To verify the hypotheses, we interviewed and surveyed a group of employees of a nationwide financial organization in which a groupware system is used. They were questioned about two CMC applications: MSN with a higher level of synchronicity and email with a lower one. As a result, the larger the size of his/her own task network, the smaller its density and the higher the level of his/her centrality, the higher the level of the effect using the task network with CMC tools. Above all, this positive effect is verified to be much more produced while using CMC applications with higher-level synchronicity. Among the a variety of situations under which the use of CMC gives more benefits, this research is considered as one of rare cases regarding the characteristics of task network as moderators by focusing ITs for the operation of his/her own task network. It is another contribution of this research to prove empirically that the values of information system depend on the social, or comparative, characteristic of time. Though the same amount of time is shared, the social characteristics of users change its value. In addition, it is significant to examine empirically that the ITs with higher-level synchronicity have the positive effect on productivity. Many businesses are worried about the negative effect of synchronous ITs, for their employees are likely to use them for personal social activities. However. this research can help to dismiss the concern against CMC tools.

(A Scalable Multipoint-to-Multipoint Routing Protocol in Ad-Hoc Networks) (애드-혹 네트워크에서의 확장성 있는 다중점 대 다중점 라우팅 프로토콜)

  • 강현정;이미정
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.3
    • /
    • pp.329-342
    • /
    • 2003
  • Most of the existing multicast routing protocols for ad-hoc networks do not take into account the efficiency of the protocol for the cases when there are large number of sources in the multicast group, resulting in either large overhead or poor data delivery ratio when the number of sources is large. In this paper, we propose a multicast routing protocol for ad-hoc networks, which particularly considers the scalability of the protocol in terms of the number of sources in the multicast groups. The proposed protocol designates a set of sources as the core sources. Each core source is a root of each tree that reaches all the destinations of the multicast group. The union of these trees constitutes the data delivery mesh, and each of the non-core sources finds the nearest core source in order to delegate its data delivery. For the efficient operation of the proposed protocol, it is important to have an appropriate number of core sources. Having too many of the core sources incurs excessive control and data packet overhead, whereas having too little of them results in a vulnerable and overloaded data delivery mesh. The data delivery mesh is optimally reconfigured through the periodic control message flooding from the core sources, whereas the connectivity of the mesh is maintained by a persistent local mesh recovery mechanism. The simulation results show that the proposed protocol achieves an efficient multicast communication with high data delivery ratio and low communication overhead compared with the other existing multicast routing protocols when there are multiple sources in the multicast group.

The IEEE 802.15.4e based Distributed Scheduling Mechanism for the Energy Efficiency of Industrial Wireless Sensor Networks (IEEE 802.15.4e DSME 기반 산업용 무선 센서 네트워크에서의 전력소모 절감을 위한 분산 스케줄링 기법 연구)

  • Lee, Yun-Sung;Chung, Sang-Hwa
    • Journal of KIISE
    • /
    • v.44 no.2
    • /
    • pp.213-222
    • /
    • 2017
  • The Internet of Things (IoT) technology is rapidly developing in recent years, and is applicable to various fields. A smart factory is one wherein all the components are organically connected to each other via a WSN, using an intelligent operating system and the IoT. A smart factory technology is used for flexible process automation and custom manufacturing, and hence needs adaptive network management for frequent network fluctuations. Moreover, ensuring the timeliness of the data collected through sensor nodes is crucial. In order to ensure network timeliness, the power consumption for information exchange increases. In this paper, we propose an IEEE 802.15.4e DSME-based distributed scheduling algorithm for mobility support, and we evaluate various performance metrics. The proposed algorithm adaptively assigns communication slots by analyzing the network traffic of each node, and improves the network reliability and timeliness. The experimental results indicate that the throughput of the DSME MAC protocol is better than the IEEE 802.15.4e TSCH and the legacy slotted CSMA/CA in large networks with more than 30 nodes. Also, the proposed algorithm improves the throughput by 15%, higher than other MACs including the original DSME. Experimentally, we confirm that the algorithm reduces power consumption by improving the availability of communication slots. The proposed algorithm improves the power consumption by 40%, higher than other MACs.

Spine Computed Tomography to Magnetic Resonance Image Synthesis Using Generative Adversarial Networks : A Preliminary Study

  • Lee, Jung Hwan;Han, In Ho;Kim, Dong Hwan;Yu, Seunghan;Lee, In Sook;Song, You Seon;Joo, Seongsu;Jin, Cheng-Bin;Kim, Hakil
    • Journal of Korean Neurosurgical Society
    • /
    • v.63 no.3
    • /
    • pp.386-396
    • /
    • 2020
  • Objective : To generate synthetic spine magnetic resonance (MR) images from spine computed tomography (CT) using generative adversarial networks (GANs), as well as to determine the similarities between synthesized and real MR images. Methods : GANs were trained to transform spine CT image slices into spine magnetic resonance T2 weighted (MRT2) axial image slices by combining adversarial loss and voxel-wise loss. Experiments were performed using 280 pairs of lumbar spine CT scans and MRT2 images. The MRT2 images were then synthesized from 15 other spine CT scans. To evaluate whether the synthetic MR images were realistic, two radiologists, two spine surgeons, and two residents blindly classified the real and synthetic MRT2 images. Two experienced radiologists then evaluated the similarities between subdivisions of the real and synthetic MRT2 images. Quantitative analysis of the synthetic MRT2 images was performed using the mean absolute error (MAE) and peak signal-to-noise ratio (PSNR). Results : The mean overall similarity of the synthetic MRT2 images evaluated by radiologists was 80.2%. In the blind classification of the real MRT2 images, the failure rate ranged from 0% to 40%. The MAE value of each image ranged from 13.75 to 34.24 pixels (mean, 21.19 pixels), and the PSNR of each image ranged from 61.96 to 68.16 dB (mean, 64.92 dB). Conclusion : This was the first study to apply GANs to synthesize spine MR images from CT images. Despite the small dataset of 280 pairs, the synthetic MR images were relatively well implemented. Synthesis of medical images using GANs is a new paradigm of artificial intelligence application in medical imaging. We expect that synthesis of MR images from spine CT images using GANs will improve the diagnostic usefulness of CT. To better inform the clinical applications of this technique, further studies are needed involving a large dataset, a variety of pathologies, and other MR sequence of the lumbar spine.

LFH: Low-Cost and Fast Handoff Scheme in Proxy Mobile IPv6 Networks with Multicasting Support (프록시 모바일 IPv6 네트워크에서 멀티캐스팅을 지원하는 저비용의 빠른 이동성관리 기법)

  • Kim, Eunhwa;Jeong, Jongpil
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.6
    • /
    • pp.265-278
    • /
    • 2013
  • With the recent advancements in various wireless communication technologies, the importance of mobile multicasting is coming to the fore, in an effort to use network resources more efficiently. In the past, when various mobile IP-based multicast techniques were proposed, the focus was put on the costs needed for network delivery for providing multicast services, as well as on minimizing the multicast handover delay. For techniques using MIPv6 (Mobile IPv6), a host-based mobility management protocol, however, it is fundamentally difficult to resolve the problems of handover delay and tunnel convergence. To resolve these problems, a network-based mobility management protocol called PMIPv6 (Proxy Mobile IPv6) was standardized. Although performance is improved in PMIPv6 over MIPv6, it still suffers from the problems of handover delay and tunnel convergence. In this paper, to overcome these limitations, a technique called LFH (Low-cost and Fast Handoff) is proposed for fast and low-cost mobility management with multicasting support in PMIPv6 networks. To reduce the interactions between the complex multicast routing protocol and the multicast messages, a simplified proxy method called MLD (Multicast Listener Discovery) is implemented and modified. Furthermore, a TCR (Tunnel Combination and Reconstruction) algorithm was used in the multicast handover procedure within the LMA (Local Mobility Anchor) domain, as well as in the multicast handover procedure between domains, in order to overcome the problem of tunnel convergence. As a result, it was found that LFH has reduced multicast delay compared to other types of multicast techniques, and that it requires lower costs as well.

Query Processing of Uncertainty Position Using Road Networks for Moving Object Databases (이동체 데이타베이스에서 도로 네트워크를 이용한 불확실 위치데이타의 질의처리)

  • Ahn Sung-Woo;An Kyung-Hwan;Bae Tae-Wook;Hong Bong-Hee
    • Journal of KIISE:Databases
    • /
    • v.33 no.3
    • /
    • pp.283-298
    • /
    • 2006
  • The TPR-tree is the time-parameterized indexing scheme that supports the querying of the current and projected future positions of such moving objects by representing the locations of the objects with their coordinates and velocity vectors. If this index is, however, used in environments that directions and velocities of moving objects, such as vehicles, are very often changed, it increases the communication cost between the server and moving objects because moving objects report their position to the server frequently when the direction and the velocity exceed a threshold value. To preserve the communication cost regularly, there can be used a manner that moving objects report their position to the server periodically. However, the periodical position report also has a problem that lineal time functions of the TPR-tree do not guarantee the accuracy of the object's positions if moving objects change their direction and velocity between position reports. To solve this problem, we propose the query processing scheme and the data structure using road networks for predicting uncertainty positions of moving objects, which is reported to the server periodically. To reduce an uncertainty of the query region, the proposed scheme restricts moving directions of the object to directions of road network's segments. To remove an uncertainty of changing the velocity of objects, it puts a maximum speed of road network segments. Experimental results show that the proposed scheme improves the accuracy for predicting positions of moving objects than other schemes based on the TPR-tree.