• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06d
• /
• pp.199-201
• /
• 2012

무선 멀티미디어 센서 네트워크를 활용하기 위한 응용에서는 대용량 멀티미디어 데이터 저장 및 처리 기술, 데이터 전송 기술 등과 같은 다양한 기반 기술들이 요구된다. 특히, 응용을 실제 환경에 적용하기 위해서는 대용량 데이터에 대한 데이터 보안 기술은 필수적이다. 본 논문은 여러 해킹 기술 중 하나인 스니핑 공격으로부터 원천적인 방어를 위해, 데이터 전송 경로를 위험 요소로부터 물리적으로 회피시키기 위한 다중 경로 라우팅 기법을 제안한다. 제안하는 기법은 위험 요소의 감지 반경과 움직임을 토대로 위험 요소의 인근에 위치한 센서 노드에 준비태세 단계를 설정한다. 이를 기반으로 데이터의 우선 순위를 설정하여 데이터 라우팅 과정에서 준비태세 단계와 데이터의 우선 순위를 고려하여 우선순위에 맞는 안전한 경로를 통해 위험요소 우회 다중 경로 라우팅을 수행한다. 시뮬레이션을 통해 제안하는 기법의 구현 가능성을 제시하였으며, 준비태세를 기반으로 효과적인 위험요소 우회 다중 경로 라우팅을 보였다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.3
• /
• pp.47-54
• /
• 2004

By using wireless terminal, the number of users who wish to use the multimedia service like the Internet as well as Short Message Services and voice service has increased dramatically over the last years. We propose the method that improves Mobile IPv4 (MIPv4) Regional Registration in wireless mobile networks to decrease traffic's transmission delay and message generation compared with an existing method We design the scheme in MIPv4 environments that a packet do not pass through the home agent transmitted from correspondent node to mobile node, if a mobile node moves to other mobility agent. Simulation results show that the proposed method significantly reduces the expenses for registration and delivering packet.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1A
• /
• pp.7-16
• /
• 2003

Handover is very important to support the mobility of user because wireless ATM networks have smaller cell size such as micro/pico cell for broadband mobile multimedia service In this paper, we propose dynamic path reservation handover scheme for fast inter-MSC (Mobile Switching Center) handovers To reduce the handover delay for connection re-routing, the proposed scheme reserves virtual channels from nearest common node to neighbor MSC in advance Especially, our handover scheme predicts the number of inter-MSC handover calls at each period by the prediction algorithm and reserve virtual channels The simulation and analysis results show that our scheme reduce handover complexity and has higher reservation channel utilization, compared with DVCT scheme.

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

Micro-mobility protocols have been developed to reduce the control message overhead due to movements of mobile nodes. With the spread of mobile devices, services using mobile nodes are increasing and multicast services are becoming more important in providing multimedia services. In this paper we propose a new multicast protocol suitable for micro-mobility environments. The proposed protocol is designed to maintain optimal multicast routing paths and continue to provide multicast services without disruption in spite of frequent handoffs due to movements of mobile nodes. We used simulation to evaluate the proposed protocol, compared its performance with existing multicast protocols for mobile environments including bi-directional tunneling, remote subscription, and MMA, and observed that the proposed protocol exhibited better performance in terms of transmission success ratio and overhead on the network.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1053-1056
• /
• 2010

현재 센서 네트워크 시스템을 이용한 다양한 지능형 응용들에 대한 연구가 진행되고 있다. 일반적으로 센서 네트워크는 환경정보를 수집하기 위해 많이 활용된다. 최근 더욱 상세한 환경 모니터링이나 고품질 데이터에 대한 요구로 인해 멀티미디어 데이터의 요구가 증가하고 있다. 본 논문에서는 Zigbee 기반 센서 네트워크의 낮은 대역폭의 한계를 극복하고, 실시간 멀티미디어 데이터 전송을 위한 라우팅 기법에 대한 연구를 수행한다. 기존에 제안된 멀티미디어 데이터 전송 기법의 경우 비효율적인 다중경로 설정단계로 인해 경로설정 시간의 지연이 발생하고, Zigbee 의 대역폭 한계로 인해 낮은 데이터 전송속도를 보인다. 본 논문은 기존 기법의 대역폭 문제를 해결하는 블루투스와 Zigbee 하이브리드 라우팅 구조를 제안한다. 또한 경로설정 시간 지연 문제를 해결하는 경쟁기반 비-중첩 다중 경로 설정 기법을 제안한다. 제안하는 기법의 우수성을 비교평가하기 위해 시뮬레이션을 수행하였다. 그 결과 약 78% 지연시간이 감소되었으며, 통신 속도가 약 6.9 배 증가하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.1188-1191
• /
• 2011

IPTV 방송에서 인터넷 기반 멀티캐스트는 일대다 또는 다대다 통신을 위한 차세대 중요한 서비스로 주목 받고 있다. 멀티캐스트는 네트워크 또는 애플리케이션 레벨에서 서비스할 수 있다. IP 멀티캐스트는 소스노드에서 라우터로 데이터그램을 보내면 라우터가 이를 복제하여 수신노드들에게 전달해 주는 네트워크레벨 서비스로 네트워크 자원을 효율적 사용할 수 있다. 그러나 네트워크에 IP 멀티캐스트 라우터가 설치되어야 하는 등 여러 문제로 인해 널리 사용되지 못하고 있다. 따라서 대안으로 애플리케이션 레벨에서의 오버레이 멀티캐스트가 주목 받고 있다. 오버레이 멀티캐스트는 종단호스트가 라우터처럼 동작하는 것으로 비록 IP 멀티캐스트에 비해서 링크 사용율과 지연 값이 높아질 수 있지만, IP 멀티캐스트의 현실적인 적용의 어려움을 해결할 수 있는 장점을 가지고 있다. 본 논문에서는 IP 멀티캐스트가 제공되지 않는 네트워크에서 효율적인 SVC(Scalable Video Coding) 멀티미디어 방송서비스와 SSENS(SVC Stream Exchange Network Server) 라우팅을 위한 MST(Minimum Spanning tree)를 목적으로 하는 오버레이 멀티캐스트 트리를 구현하는 알고리즘을 설계한다. 제안된 알고리즘의 성능 분석을 위해 시뮬레이션을 통해 패킷 손실 측면에서 Prim 알고리즘에 비해 평균 패킷 손실율이 40% 가까이 향상됨을 증명하였다.

• 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 Korea Multimedia Society
• /
• v.11 no.10
• /
• pp.1446-1459
• /
• 2008

In an infrastructure-based wireless network, an access point is used for all communications among mobile devices. However, when a mobile device moves into a dead Bone, a connectivity disruption between the mobile device and the access point occurs. Such connectivity disruption consequently leads to another connectivity disruption between the mobile device moving toward the dead zone and other wireless-enabled devices located within the area of the infrastructure-based wireless network. To cope with the connectivity disruption in the infrastructure-based wireless network the ad hoc network that dynamically forms a network without any preexisting communication infrastructure needs to be set up to provide seamless connections among mobile devices. In this paper, we propose the DNSQ-MAC (Dynamic Network State aware QoS-Medium Access Control) technique that meets the deadlines of MAC frames forwarded over hop-by-hop multipaths and guarantees the QoS performance of an ad hoc-based wireless network. Mobile devices incorporating the DNSQ-MAC technique are capable of adjusting to the new dynamic network status in order to enhance the QoS performance in the ad hoc-based wireless network. A case study which exploits the Qualnet simulator shows that the proposed DNSQ-MAC technique can guarantee the deadlines of MAC frames forwarded over hop-by-hop multipaths and enhance the QoS performance of various routing protocols and packet schedulers running on the network layer above the MAC layer.

• Journal of Korea Multimedia Society
• /
• v.11 no.8
• /
• pp.1082-1092
• /
• 2008

In wireless sensor networks, clustering protocol such as LEACH is an efficient method to increase whole networks lifetime. However, this protocol result in high energy consumption at the cluster head node. Hence, this protocol must changes the cluster formation and cluster head node in each round to prolong the network lifetime. But this method also causes a high amount of energy consumption during the set-up process of cluster formation. In order to improve energy efficiency, in this paper, we propose a new cluster formation algorithm. In this algorithm, we define a intra cluster as the sensor nodes within close proximity of each other. In a intra cluster, a node senses and transmits data at a time on the round-robin basis. In a view of whole network, intra cluster is treated as one node. During the setup phase of a round, intra clusters are formed first and then they are re-clustered(network cluster) by choosing cluster-heads(intra clusters). In the intra cluster with a cluster-head, every member node plays the role of cluster-head on the round-robin basis. Hence, we can lengthen periodic round by a factor of intra cluster size. Also, in the steady-state phase, a node in each intra cluster senses and transmits data to its cluster-head of network cluster on the round-robin basis. As a result of analysis and comparison, our scheme reduces energy consumption of nodes, and improve the efficiency of communications in sensor networks compared with current clustering methods.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.5
• /
• pp.133-142
• /
• 2004

Recently, the growth of Internet and a variety of multimedia services through Internet increasingly demands high-speed packet transmission, the new routing function, and QoS guarantee on conventional routers. Thus, a new switching mechanical called the MPLS(Multi-Protocol Label Switching), was proposed by IETF(Internet Engineering Task Force) as a solution to meet these demands. In addition the deployment of MPLS network supporting Differentiated Services is required. In this paper, we propose the architecture of the MPLS switch supporting Differentiated Services in the MPLS-based network. The traffic conditioner consists of a classifier, a meter, and a marker. The VOQ-PHB module, which combines input Queue with each PHB queue, is implemented to utilize the resources efficiently. It employs the Priority-iSLIP scheduling algorithm to support high-speed switching. We have designed and verified the new and fast hardware architecture of VOQ-PHB and the traffic conditioner for QoS and high-speed switching using NS-2 simulator. In addition, the proposed architecture is modeled in VHDL, synthesized and verified by the VSS analyzer from SYNOPSYS. Finally, to justify the validity of the hardware architecture, the proposed architecture is placed and routed using Apollo tool.