• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.409-418
• /
• 2005

This paper presents an efficient multicast method based on a locality in mobile IPv6 networks. We exploit the repetitive movement pattern of mobile node to reduce the total number of experience of graft and join procedure. We defined the locality scope by a movement pattern. While the network is included in the locality scope, the network should maintain a multicast tree even when the mobile node moves to the other network. In this way, the mobile host can receive a multicast service without a delay when it moves to the network in the locality scope later. We compare our scheme with existing schemes under the total signaling cost and the service delay time by using a discrete analytical model for cost analysis. Analytical results demonstrated that the total signaling cost and service delay time was significantly reduced through our proposed scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4B
• /
• pp.153-161
• /
• 2005

In a multi-channel network based of wavelength division multiplexing (WDM) technology, an efficient protocol is needed in order for the transmitter and receiver to be tuned to the same wavelength during message transmission time. This paper proposes a priority-based reservation protocol that can efficiently support variable-length messages that require different QoS requirements. In this proposed protocol, high-priority nodes can reserve the data channel before low-priority nodes. However, once a node reserves a data channel successfully, it can persistently use the reserved channel till message transmission is finished regardless of the priority of the node. Moreover, the protocol can operate independently of the number of nodes, and any new node can join the network anytime without requiring network re-initialization. The protocol is analyzed with a finite population model and the throughput-delay characteristics are investigated as performance measures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1238-1246
• /
• 2000

In a multi-channel network based on wavelength division multiplexing (WDM), an efficient protocol is needed for transmitter and receiver to be tuned to same wavelength during message transmission time. This paper proposes a message scheduling protocol that can efficiently support variable-sized messages, where tunable transceiver has nonzero tuning time. In this protocol, once a node reserves one data channel, it can persistently use the reserved channel till message transmission is finished. Therefore, overhead due to tuning time of the tunable transceiver can be reduced. Moreover, the protocol does not require any global information. Therefore, it can operate independently of the change of the number of nodes, and any new node can join the network at anytime without requiring network initialization. With this protocol, one can avoid data channel and destination conflicts. The protocol is analyzed with a finite population model and the throughput-delay characteristics are investigated as performance measures.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.5
• /
• pp.225-236
• /
• 2015

Social network services, it has attracted a lot of popularity that it us to allow the formation of past human network has been thought possible only in the main offline also on-line and mobile. However, by a variety of SNS with a recent other features it appeared a lot, the user, rather than stick to one SNS use only, if necessary, to join simultaneously two or more kinds of SNS status it is. By problem of invasion of privacy in recent SNS is a problem of, the user, in many cases that I have to worry about whether or not to leave the mainly use SNS. This study focused on these aspects and trying to figure out whether changing the SNS people to why use. Therefore, it is possible to obtain two factor theory is trying to figure out the psychology of users feel satisfaction SNS use and unsatisfactory at the same time as the significant result.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.5
• /
• pp.410-415
• /
• 2013

Recently, as Internet enters WEB 2.0, many social network services through such as Facebook, Twitter and Youtube appeared. In these social network sites, users can easily make friends, join groups and access others personal information. Therefore, a malicious user can easily gather information of others. In order to protect user's personal information from the unauthenticated users, we propose privacy protection mechanism based on key assignment and user's trust level. A master-key is generated for each users and is segmented into a core-key and several sub-key. The master-key stores at the information owner's side and the sub-key will be distributed to requestor according to the relation and trust level. At last, in order to proof the efficiency, the performance of our proposed mechanism is compared with those of existing mechanisms.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.4
• /
• pp.77-89
• /
• 2001

Recently, with the explosive growth of communication technologies, group oriented services such as teleconference and multi-player game are increasing. Access control to information is handled by secret communications with group keys shared among members, and efficient updating of group keys is vital to such secret communications of large and dynamic groups. In this paper, we employ (2,4)-tree as a key tree, which is one of height balanced trees, to reduce the number of key updates caused by join or leave of members. Especially, we use CBT(Core Based Tree) to gather network configurations of group members and reflect this information to key tree structure to update group keys efficiently when splitting or merging of subgroups occurs by network failure or recovery.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1725-1728
• /
• 2005

무선 센서 네트워크는 컴퓨팅 용량 및 전력 자원이 매우 제약적인 특징을 가지고 있으며, 이로 인하여 동작시 실패하려는 경향(Error-prone)을 지닌다. 이를 해결하기 위하여 센서 네트워크에 적용 가능한 결함 허용 기법이 요구되며, 현재 노드의 참가(Join), 삭제(Delete), 사망(Death) 및 상태 오염(State Corruption)으로 인하여 발생하는 결함을 처리하기 위하여 노드의 물리적 위치를 기반으로 클러스터를 구성한 후 발생 결함을 지역화하여 처리하는 기법이 제안되었다[1]. 본 논문에서는 결함을 처리하기 위한 기존의 위치 인식 노드 클러스터 시스템에서 발생할 수 있는 헤드 노드의 결함을 효율적으로 처리하기 위한 개선된 기법을 제안하여 전체 센서 네트워크 시스템의 실질적인 가용도(Availability)를 높이고자 하며, 이를 위한 간단한 분석을 수행한 후 효용성을 검증한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.130-132
• /
• 2001

멀티미디어 통신을 위한 계층형 멀티캐스트를 무선 환경으로 화장할 때에는 무선 네트워크의 낮은 대역폭에 의한 네트워크 혼잡 및 핸드오프에 의한 전송률 불안정 현상이 나타나게 된다. 이러한 문제를 효과적이고 능동적으로 해결하기 위해 본 논문에서는이동 지원국 (MSS) 을 이용한 능동적인 전송률 조절 기법과 우선 순위에 따른 패킷 누락 기법을 제안한다. MSS는 네트워크 계층의 전송 큐 사용량을 통해 현재의 네트워크 상태를 파악해, 네트워크 혼잡 시 이동 호스트(MH)의 가입 실험 (Join-experiment) 을 막거나 수신 계층의 제거를 종용할 수 있다. 그리고 MSS에서 직접 계층별 우선 순위를 부여함으로써 핸드오프에 의한 전송량 불안정성 및 대역폭 분배 불공평성을 해결하고자 한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1A
• /
• pp.90-95
• /
• 2000

In the Ordered Core Based Tree(OCBT) protocol, a core location is the most important feature to affect the performance. In this paper, the location placement of multiple level cores is studied. The proposed algorithm isthat each node in the network evaluates a sum of shortest path costs from all the other nodes and the entirenetwork is divided into a hierarchy region to have 3-logical level(Small, Medium, Large). The node to have thelowest cost in each S-Region is decided to be a core node. Then, the core nodes in the each S-Region evaluatea sum of shortest path costs from all the other core nodes in the same M-Region. The core node to have thelowest cost is decided to be the upper level core node. Similarly the highest level core node is decided in theL-Region. The proposed algoritthm is compared with conventional two methods to put the core nodes in thenetwork One is the random method to put the core nodes randomly. The other is the center method to locatethe core node at the nearest node from the center of each S-Region and then to locate the highest level corenode at the nearest core node from the center of the entire network. Extensive simulations are performed in theview of mean tree cost and join latency. Simulation results show that the proposed algorithm has betterperformance than random method or center method.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.6
• /
• pp.47-58
• /
• 2002

The access control techniques, which can control unauthorized members to access to multicast service, have not been studied very often while there are a lot of on-going study on secure multicast architecture, multicast key distribution and sender authentication scheme have been studied. Multi level access control scheme in multicast can be used in a remote secure conference or to provide graduated multimedia services to each customers. In fact, multicast network has its own virtual networks according to different security levels. However, Early schemes are not effective when it protects unauthorized access in multi-access network environment. Furthermore this scheme does not provide us with hierarchical access control mechanism. This paper, therefore, proposes hierarchical access control scheme to provide the effectiveness in network layer by security level comparison. And we also suggests hierarchical key distribution scheme for multi level access control in application layer and effective hierarchical key renewal scheme in dynamic multicast environment which is easy to join and leaving the multicast group.