• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.199-204
• /
• 2006

오버레이 멀티캐스트는 IP 멀티캐스트의 대안으로 많은 관심을 받아 왔다. 본 논문에서는 오버레이 멀티캐스트에서 각 단말의 특성에 따라 적응적으로 멀티미디어를 전송하는 기법을 연구하였다. 데이터 기반으로 컨텐츠를 전달하는 피어-투-피어 형태의 전송 구조를 사용하여 각 단말이 네트웍 특성에 따라 데이터를 요청하는 형태로 구성되었다. 이웃 노드 선택, 버퍼 맵 교환, 필요한 데이터를 전송 요청하는 과정으로 구성되는 피어-투-피어 형태의 전송 구조에서 적응적인 멀티미디어 전송을 지원하기 위하여 전략적 세그먼테이션을 통한 버퍼 맵 교환, Fine-grained 적응 스케줄러를 통한 데이터 교환을 제안하였다. 본 연구에서 적용된 기법의 특성을 분석하기 위하여 정성적인 분석 모델을 제시하고 이를 통해 결론을 도출하였다.

• Journal of Communications and Networks
• /
• v.11 no.3
• /
• pp.211-228
• /
• 2009

After clarifying the underlying problems in a secure network storage, we introduce two important requirements, leakageresilience and availability in higher levels respectively, for data keys that are used to protect remotely-stored data. As a main contribution of this paper, we give a new security layer for overlay networks by proposing a leakage-resilient authentication and data management system. In this system, we specifically propose a single mode and a cluster mode where the latter provides a higher level of both leakage-resilience and availability for the data key.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.791-800
• /
• 2009

Multicasting is fundamental to many ad hoc network applications requiring collaboration of multiple nodes in a group. A general approach is to construct an overlay tree and to deliver a multicast packet to multiple receivers over the tree. This paper proposes adaptive overlay trees (AOTs) on wireless ad hoc networks of static nodes for delay- and energy-efficient multicast. A tradeoff function is derived, and an algorithm for AOT construction is developed. Note here that the requirements of delay and energy consumption may vary with different classes of applications. By adjusting parameters in the tradeoff function, different AOTs can be adaptively chosen for different classes of applications. An AOT is constructed in O(ke) time where e is the number of wireless links in a network and k is the number of member nodes in a multicast group. The simulation study shows that AOT adaptively provides tradeoffs between the fastest multicast (which is the choice if delay is the most important factor) and the most energy efficient multicast (which is used when energy consumption is the primary concern). In other words, one of AOTs can be appropriately chosen in accordance with the operation requirement.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.51-63
• /
• 2013

Recently with base apply MANET with the application for the service discovery and delivery which are various techniques are being proposed the result of such MANET base research techniques from actual inside. This dissertation proposes T-Chord(Trustworthy-based Chord) Ring system for MANET to guarantees from such requirements. T-Chord Ring system in order to manage Efficiently the services which the mobile nodes provide is the service discovery system which uses P2P overlay network Technique in mobile environment. The system which is proposed MANET communications in order to accomplish a service discovery operation with physical network class and logical network class will be able to minimize problems from about MANET service discoveries, and uses the dispersive hash table technique for a service discovery and effectiveness of service discovery improves and will be able to guarantee the expandability of network size. The mobile nodes(mobile device) have a mobility from MANET and operate with service request node, service provide node and service transmit node. The mobile nodes will be able to elect cluster header using Trustworthy that was evaluated service request, provision and delivery in each other. The system which is proposed a service discovery and a delivery efficiently will compose the cluster head which will grow of P2P overlay networks and will be able to accomplish. The system which proposes from dissertation is composed of Trustworthy evaluations of MANET mobile nodes, service information collection which is dispersed and P2P overlay networks that composed of Chord algorithm modules which provide O(Log N) efficiencies. The system comparison evaluation analyzes an efficiency from the expandability side of effectiveness and the network of service discovery technique and the service discovery message over head, service discovery and delivery of former times and service discovery and delivery is excellent gives proof from MANET.

• Journal of Communications and Networks
• /
• v.7 no.2
• /
• pp.104-114
• /
• 2005

This work presents a concept and the related analysis of the traffic performance for a wireless broadband system based on fixed relay stations acting as wireless bridges. The analysis focuses on the important performance indicators end-to-end throughput and delay, taking into account the effects of an automated repeat request protocol. An extension to a MAC frame based access protocol like IEEE 802.11e, 802.15.3, 802.16a, and HIPERLAN2 is outlined and taken as basis for the calculations. The system is intended for both dense populated areas as an overlay to cellular radio systems and to provide wide-area broad-band coverage. The two possible deployment scenarios for both dense urban and wide-area environments are introduced. Analytical and validating simulation results are shown, proving the suitability of the proposed concept for both of the mentioned scenarios. It is established that the fixed relaying concept is well suited to substantially contribute to provide high capacity cellular broad-band radio coverage in next generation (NG) cellular wireless broadband systems.

• Journal of Information Processing Systems
• /
• v.3 no.1
• /
• pp.8-15
• /
• 2007

Grid environments provide the mechanism to share heterogeneous resources among nodes. Because of the similarity between grid environments and P2P networks, the structures of P2P networks can be adapted to enhance scalability and efficiency in deployment and to search for services. In this paper, we present a membership management based on a hierarchical ring which constructs P2P-like Grid environments. The proposed approach uses only a limited number of connections, reducing communication cost. Also, it only keeps local information for membership, which leads to a further reduction in management cost. This paper analyzes the performance of the approach by simulation and compares it with other approaches.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3455-3473
• /
• 2016

Cloud computing is a paradigm in which information is permanently stored in servers on the Internet and cached temporarily on clients. Virtual private network (VPN) is the most widely used technology for secure cloud access. Unfortunately, VPN-based cloud services become unavailable when a VPN failure occurs. In this paper, we propose a new scheme to improve the availability of VPN connections against such failures, called high-availability virtual communication (HAVC). Unlike most of the multipath transmission schemes in the literature, the proposed scheme is implemented by using a virtualization technique, and its protocol functions are independent of existing networks - potential clients are not required to modify their applications or operating systems. Simulation results show that the HAVC can not only tolerate VPN failures but also achieve high transmission performance.

• ETRI Journal
• /
• v.34 no.2
• /
• pp.159-167
• /
• 2012

In this paper, a new distributed resource allocation algorithm is proposed to alleviate the cross-tier interference for orthogonal frequency division multiplexing access macrocell and femtocell overlay. Specifically, the resource allocation problem is modeled as a non-cooperative game. Based on game theory, we propose an iterative algorithm between subchannel and power allocation called distributed resource allocation which requires no coordination among the two-hierarchy networks. Finally, a macrocell link quality protection process is proposed to guarantee the macrocell UE's quality of service to avoid severe cross-tier interference from femtocells. Simulation results show that the proposed algorithm can achieve remarkable performance gains as compared to the pure waterfilling algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.538-541
• /
• 2006

Recently researches of P2P media streaming have been actively published, but the research what kind of P2P overlay networks are better to delivering media data has not been attended. This paper designs a P2P streaming media system model. In this system, we constructs a Half-Structure P2P overlay protocol based on node's capability as the infrastructure of streaming application, which utilizes the heterogeneity of the nodes to maintain topology, presents a active contents diffusing algorithm and Two-stage search algorithm, make it possible for nodes in P2P system to collect information according their capacity and reduces the number of forwarding packet compared with flooding. Also, we give an optimal scheme to scheduling media data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.1
• /
• pp.5-25
• /
• 2009

In recent years the popularity of multi-hop wireless networks has been growing. Its flexible topology and abundant routing path enables many types of applications. However, the lack of a centralized controller often makes it difficult to design a reliable service in multi-hop wireless networks. While packet routing has been the center of attention for decades, recent research focuses on data discovery such as file sharing in multi-hop wireless networks. Although there are many peer-to-peer lookup (P2P-lookup) schemes for wired networks, they have inherent limitations for multi-hop wireless networks. First, a wired P2P-lookup builds a search structure on the overlay network and disregards the underlying topology. Second, the performance guarantee often relies on specific topology models such as random graphs, which do not apply to multi-hop wireless networks. Past studies on wireless P2P-lookup either combined existing solutions with known routing algorithms or proposed tree-based routing, which is prone to traffic congestion. In this paper, we present two wireless P2P-lookup schemes that strictly build a topology-dependent structure. We first propose the Ring Interval Graph Search (RIGS) that constructs a DHT only through direct connections between the nodes. We then propose the ValleyWalk, a loosely-structured scheme that requires simple local hints for query routing. Packet-level simulations showed that RIGS can find the target with near-shortest search length and ValleyWalk can find the target with near-shortest search length when there is at least 5% object replication. We also provide an analytic bound on the search length of ValleyWalk.