• The Journal of the Korea Contents Association
• /
• v.22 no.5
• /
• pp.26-36
• /
• 2022

Recently, studies have been conducted to cluster vehicles and disseminate safety messages in a VANET environment for driver safety and smoothy traffic. This paper proposes cluster management scheme for safety message dissemination through V2V communication and V2I communication in a VANET environment with high vehicle density and mobility. The proposed scheme reduces packet loss by selecting CH considering reception quality, total data owned by vehicles, moving speed, and connected vehicles, and maintaining cluster head candidates, which are the main agents of message dissemination, considering frequent cluster departures and subscriptions. In addition, the proposed scheme reduces duplicate messages by utilizing clusters by collaborating with a Road side unit(RSU). To prove the excellence of the proposed scheme, various performance evaluations are performed in terms of message packet loss and the number of RSU processing requests. As a result of performance evaluation, the cluster management scheme proposed in this paper shows better performance than the existing scheme.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.8
• /
• pp.3672-3679
• /
• 2012

Vehicle Ad hoc Network (VANET) is next-generation network technology to provide various services using V2V (Vehicle-to-Vehicle) and V2I (Vehicle-to-Infrastructure). In VANET, many researchers proposed various studies for the safety of drivers. In particular, using the emergency message to increase the efficiency of traffic safety have been actively studied. In order to efficiently transmit to moving vehicle, to send a quick message to as many nodes is very important via broadcasting belong to communication range of vehicle nodes. However, existing studies have suggested a message for transmission to the communication node through indiscriminate broadcasting and broadcast storm problems, thereby decreasing the overall performance has caused the problem. In addition, theses problems has decreasing performance of overall network in various form of road and high density of vehicle node as urban area. Therefore, this paper proposed Clustering based Routing Algorithm (CBRA) to efficiently transmit emergency message in high density of vehicle as urban area. The CBRA managed moving vehicle via clustering when vehicle transmit emergency messages. In addition, we resolve linkage problem between vehicles according to various form of road. The CBRA resolve link brokage problem according to various form of road as urban using clustering. In addition, we resolve broadcasting storm problem and improving efficacy using selection flooding method. simulation results using ns-2 revealed that the proposed CBRA performs much better than the existing routing protocols.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.48-50
• /
• 1998

메시지에 기반을 둔 다중컴퓨터는 프로세서들 간에 고속통신을 위한 연결 망을 요구한다. ATM 스위치는 대규모의 다중컴퓨터를 구성하기에 유리한 접근 방식을 제공하며, 낮은 지연시간과 고성능을 제공하는 특성을 가진다. 본 논문은 고속 ATM 스위치를 통한 프로세서들간의 정보를 송신/수신하는 셀 라우터를 설명한다. 고속 ATM 스위치를 효율적으로 사용하기 위하여, 본 논문은 다중화와 역 다중화를 가지고 계층적 구조를 제안한다. 일반 연결 망에서 라우팅을 위해 착신주소를 가지는 기본단위는 메시지이지만, ATM 망에서는 셀이라고 부르는 고정된 크기의 프레임이 기본단위이다. 셀은 VPI와 VCI를 가지며, 이는 송신/수신 프로세서의 구별자로서 사용된다 결론적으로 제안한 고속 셀 라우터와 계층적 구조는 메시지 전송지연의 관점에서 이점을 가질 수 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.310-313
• /
• 2013

BitTorrent는 파일 공유를 위하여 가장 널리 사용되고 있는 P2P (Peer to Peer)프로토콜로서, Mesh-Pull 구조를 채용하여 라이브 스트리밍에 대한 연구가 꾸준히 이루어지고 있다. BitTorrent에서는 Peer Wire Protocol을 사용하여 피어들간에 파일조각들을 교환하게 되는데, 이를 위하여 주기적으로 버퍼맵 정보를 HAVE 메시지를 사용하여 브로드캐스트 하는데, 피어의 수가 증가할수록 이로 인한 시그널링 오버헤드가 크게 증가하는 문제를 갖고 있다. 본 논문에서는 이러한 문제를 극복하고 라이브 스트리밍의 성능을 개선하기 위하여 HAVE 메시지를 선택적으로 전송하는 방법을 제안한다. 실험을 통하여, 제안 방식은 기존의 BitTorrent 기반 Mesh-Pull 구조를 채용하는 라이브 스트리밍 방식과 비교하여 HAVE 메시지의 브로드캐스트로 인한 시그널링 오버헤드를 비약적으로 줄일 수 있음을 보였다.

• Journal of KIISE
• /
• v.42 no.7
• /
• pp.939-945
• /
• 2015

From 2009, the market of smart devices has been rapidly increasing. These devices provide various services to users. The cloud messaging service, especially, is applied to many various services, and sends messages asynchronously. In the cloud messaging service, there are two methods for message transmission, message transmission based on an IP address and a publish/subscribe technique. Each technique uses basic messages in order to send messages to mobile devices. In this paper, the hybrid message transmission, based on user-customized analysis to reduce basic messages, is proposed. The hybrid message transmission uses Exponential Moving Average (EMA) and K-means algorithms for user-customized analysis, and determines the message transmission techniques in each timeslot.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.701-708
• /
• 2005

Structuring mechanism, important to serve messages in post-office box structure, is to construct the hierarchy of classes according to the contents of message objects. This Paper Proposes $\alpha$-cut based genealogy grouping method to cluster a lot of structured objects in application domain. The proposed method decides the relationship first by semantic similarity relation and fuzzy relation, and then performs the grouping by operations of search( ), insert() and hierarchy(). This hierarchy structure makes it easy to process group-related processing tasks such as answering queries, discriminating objects, finding similarities among objects, etc. The proposed post-office box structure may be efficiently used to serve and manage message objects by the creation of groups. The Proposed method is tested for 5500 message objects and compared with other methods such as non-grouping, BGM, RGM, OGM.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6A
• /
• pp.600-610
• /
• 2010

In this paper, a multicast mechanism is proposed for intermittently disconnected networks where the nodes move forward in formation or within a limited area. The proposed scheme extends the well-known tree-based multicast routing mechanism called MAODV by modifying the tree construction and data delivery scheme. Especially, an algorithm is introduced which determines the flooding hop count k estimating the degree of the movement of children in the tree. The performance evaluation was done by the simulation and the proposed scheme was compared with MAODV and two multicast routing schemes for DTN (Disruption Tolerant Network) including the Epidemic routing and ST-multicast. The evaluation results show that our scheme improves the original MAODV from the aspect of tree reconstruction events and message delivery ratio. Compared with the Epidemic routing scheme, our scheme achieves 85% message delivery ratio with less than 50% message delivery overhead.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.496-498
• /
• 2004

무선 ad-hoc 네트워크는 이동 노드만으로 구성된 자율적이고 수평적인 네트워크이다. 무선 ad-hoc 네트워크에서의 라우팅 프로토콜은 table driven 방식과 on-demand 방식으로 나뉘는데, 이 중 라우팅 메시지의 오버헤드가 비교적 적은 on-demand 방식이 주로 사용되고 있다. 이 프로토콜은 경로를 찾기 위해서 경로 요청 메시지를 브로드캐스팅 하는데, 경로 요청 메시지는 네트워크 전체로 확산되기 때문에 이를 이용한 공격이 가능하다 공격자는 연속적으로 경로 요청 메시지를 보냄으로써 패킷 충돌과 네트워크 큐오버플로우 등의 장애를 일으켜 정상적인 메시지나 데이터의 전송을 방해할 수 있다. 본 논문에서는 기존의 라우팅 프로토콜에 별도의 인증 절차 없이 경로 요청 패킷의 확산을 이용한 공격을 막는 방법을 제안하고자 한다. 각각의 노드는 경로 요청 메시지의 시작 주소와 수신 시간을 경로 요청 테이블을 이용해 관리함으로써 정상적인 경로 요청 패킷과 공격자의 경로 요청 패킷을 구분한다. 수신된 경로 요청 패킷이 공격자의 패킷이라고 판단된 경우, 공격자의 패킷을 이웃 노드에 전달하지 않음으로써 전체 네트워크에 가해지는 공격을 막을 수 있다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.5
• /
• pp.518-528
• /
• 2000

Messages in distributed real-time systems are categorized into two groups: synchronous messages and asynchronous messages. Synchronous messages, such as sampled audio and image data,are generated periodically with delivery time constraints. Protocols should guarantee the end-to-enddeadlines for such messages. Asynchronous messages are non-periodic and may arrive in a randomway with no strict time constraints.In this paper, we propose TTP/C(timed token protocol with concession), an extension of TTPprotocol, to achieve higher timeliness guarantee for synchronous messages in distributed real-timesystems. In TTP/C, a node concedes the allocated bandwidth to other nodes with urgent synchronousmessages to be sent provided that the node has no urgent messages, TTP/C works very well evenif the synchronous messages are generated with some jittering by nodes. The simulation results showthe improved performance of TTP/C protocol for guaranteeing synchronous messages deadlinescomeared to the existing TTP protocols.

• The Journal of the Korea Contents Association
• /
• v.8 no.1
• /
• pp.152-159
• /
• 2008

In this paper, we have studied a new method in which multimedia message can be processed effectively in SIP(Session Initiation Protocol)-based Instant Messaging service. Total system is composed of multimedia message server, presence server and user system. To provide effectively message informations such as number of messages stored in the multimedia message server, waiting status and message types to users, we have proposed a new method which can be a substitute for message waiting indication event package. In our proposed method, when changes of messages status informations occur, these informations are sent to the presence server, and can be transferred as a separate tag within notification message. The presence server processes subscription requests and notifications, and efficiency can be improved as it provides both message status informations and several communication status informations such as on-line status to service users. Partial publication is used in our system to improve data transfer efficiency more between user system and the presence server. The performance of our proposed model is evaluated by experiments measuring multimedia message transfer speed and server processing time.