• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.491-496
• /
• 2009

In this paper, we propose USN Protocol of Room Control with high efficiency and new routing techniques. I establish a network of cluster hierarchy structure under bases standard for IEEE 802.15.4 and another networks to manage each room use a control packet transmitted and The proposed protocol does not perform BroadCast over a network and transmits a packet to same layer to the destination and then passes the packet after doing searches. If a destination to be transmitted cannot be looked up, the protocol transmits AODV routing packet so that not only traffic load of a wireless network is decreased, but also efficient routing path can be obtained.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.5
• /
• pp.21-29
• /
• 2010

In Ad-Hoc Networks, the limited energy is the key issue for longer network operation time. To solve this problem, various energy-aware routing techniques have been proposed including PSR (Power-aware Source Routing), HPSR (Hirachical Power-aware Source Routing), and etc. Those techniques generally select the most adequate route considering the energy consumption so that the energy efficiency can be improved. However, There are problems in those techniques that traffic can be concentrated in some specific area in a network. In this paper, a new energy aware routing technique called MPSR is proposed to achieve longer network lifetime and fewer rerouting attempts.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.2C
• /
• pp.188-195
• /
• 2012

Many systems are developing for the realization of NCW(Network Centric Warfare). UAV(Unmanned Aerial Vehicle) Network is attracting attention in a lot of military applications. In general, UAVs have the potential to create an ad-hoc network and greatly reduce the hops from source to destination. However, UAV networks exhibit unique properties such as high mobility, high data rate, and real time service. The routing protocols are required to design the multi-hop routing protocols that can dynamically adapt to the requirements of UAV network. In this paper we analyse Geographic Routing Protocol is based on geographical distance between source and destination for efficient and reliable transmission. Geographic Routing Protocol is evaluated in video service scenarios with TDMA model in our simulation. The simulation results show that the performance of Geographic Routing Protocol is better than the MANET Routing Protocol in terms of packet received ratio, end to end delay, and routing traffic sent.

• Journal of KIISE
• /
• v.44 no.9
• /
• pp.976-985
• /
• 2017

Wireless mesh network (WMN) is a promising technology for building a cost-effective and easily-deployed wireless networking infrastructure. To efficiently utilize limited radio resources in WMNs, packet transmissions (particularly, redundant packet transmissions) should be carefully managed. We therefore propose a lightweight traffic redundancy elimination (LTRE) scheme to reduce redundant packet transmissions in software-defined wireless mesh networks (SD-WMNs). In LTRE, the controller determines the optimal path of each packet to maximize the amount of traffic reduction. In addition, LTRE employs three novel techniques: 1) machine learning (ML)-based information request, 2) ID-based source routing, and 3) popularity-aware cache update. Simulation results show that LTRE can significantly reduce the traffic overhead by 18.34% to 48.89%.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2000.04a
• /
• pp.23-24
• /
• 2000

최근 개인 이동 통신 단말기의 수요와 인터넷 사용자의 증가와 함께, 유선 통신 서비스에서부터 개인 휴대 통신 서비스에 이르기까지 다양한 통신 서비스가 제공되기 시작하면서 이러한 서비스가 결합된 mobile IP의 관심이 높아지고 있다. 기존의 IP에서는 노드가 계속해서 접속을 유지하기 위해서는 접속되는 위치가 반드시 고정적으로 지정되는 것이 필요하며 노드의 위치가 바뀌면 기존의 IP 주소는 사용할 수 없다. 그러나 mobile IP는 인터넷상의 임의의 다른 위치에 접속해 노드가 IP 주소를 바꾸지 않고 인터넷을 사용할 수 있도록 한다. 이동(mobile) 노드가 새로운 셀 지역으로 이동하면, 그 셀에 해당하는 외부(foreign) 에이전트로부터 임시 주소(care-of address)를 할당받아 홈 네트워크에 위치한 홈 에이전트에 등록하고, 홈 에이전트는 송신 노드가 이동노드로 전송한 패킷을 새롭게 등록된 임시 주소로 터널링을 통해 전달한다. 이러한 기본적인 mobile IP 방법은 모든 패킷이 홈 에이전트를 통해 이동 노드로 전송되므로 최적화된 라우팅 방법을 제공하지 못한다. 그러므로 이러한 mobile IP의 단점을 보완한 route optimization mobile IP가 제안되고 있다. Route optimization mobile IP는 이동 노드의 현재 위치와 관련된 정보를 갖는 바인딩을 저장하여 송신 노드가 패킷을 이동 노드의 홈 에이전트를 거치지 않고 이동 노드로 직접 전송하는 기능을 제공한다. 또한 이동 노드가 다른 셀 지역으로 핸드오프가 이루어질 경우, 핸드오프 발생전의 바인딩 정보를 이용하여 송신 노드가 전송한 패킷은 이전 셀 지역에 있는 에이전트가 새로운 셀 지역에 있는 이동 노드로 패킷을 재전송하여 전달하는 smooth 핸드오프 기능을 제공한다. 이전 셀 지역에 속한 외부 에이전트가 바인딩을 갱신하기 전에 송신 노드로부터 이동노드로 전달된 패킷이 있을 경우는 패킷을 저장하여 이후에 이동 노드의 위치 정보에 관한 바인딩 정보가 갱신되면 이러한 바인딩 정보에 따라 패킷을 재전송하는 버퍼기능도 제공한다. route optimization mobile IP는 기본적인 mobile IP에서의 복잡한 라우팅 문제를 해결하고, 핸드오프에서의 패킷 손실률을 최소화 한다.본 논문에서는 컴퓨터 시뮬레이션을 통해 smooth 핸드오프를 이용한 mobile IP의 성능을 분석한다. 일반적으로 데이터 트래픽 특성, 노드의 이동성, 바인딩 갱신시간, 버퍼관리 방법 등은 핸드오프 동안 mobile IP의 성능에 많은 영향을 미친다. 따라서 시뮬레이션 모델을 이용하여 다양한 트래픽 환경에서 위에 언급된 성능 파라미터들의 영향을 분석한다. 마지막으로 시뮬레이션 결과를 이용하여 mobile IP의 성능을 개선시키기 위한 방법을 제시한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.3B
• /
• pp.437-445
• /
• 2000

More advanced and demanding applications, like videoconferencing, video on demand. distributed computing etc., have been devised thanks to the availability of enhanced network feature. Network technologies need to be enhanced to support these applications and to cope with the increasing number of users. Increasing the availability of network resources is just not enough to achieve this goal; scalable network architecture. increased packet forwarding capabilities, a wider range of services are all additional requirements. MOLS (multiprotocol label Switching) is one of the new networking techniques under standardization in the scientific community. In this paper, we analyze the performance of label switching in ATM networks. Simulation tests were performed. In this simulation, we set a simple network configuration and used internet traffic traces from NLANR as input traffic sources. The simulation results and analysis will be helpful in utilizing the functions of ATM switching and IP routing.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.267-276
• /
• 2002

By using wireless terminal, User that want to transmit multimedia traffic as well as simple text and voice have a tendency to increase. This paper proposes a fast handoff protocol that is suitable transmission for real-tim of multimedia traffic by using modified local registration. The proposed protocol solves the Triangle Routing Protocol that is one of existing opened issues without modifying protocol of CN, and we propose the method that MN is able to received a packet by real-time, even if MN is being handoff. We compare fast handoff protocol proposed in this paper with existing method n the registration cost and data packet transmission cost. As a result, we showed that fast handoff protocol proposed in this paper outperforms existing method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.946-955
• /
• 2004

It is shown that the do Bruijn graph (dBG) can be used as an architecture for interconnection network and a suitable structure for parallel computation. Recent works have classified dBG based routing algorithms into shortest path routing and fault tolerant routing but investigation into fault free shortest path (FFSP) on dBG has been non-existent. In addition, as the size of the network increase, more faults are to be expected and therefore shortest path dBG algorithms in fault free mode may not be suitable routing algorithms for real interconnection networks, which contain several failures. Furthermore, long fault free path may lead to high traffic, high delay time and low throughput. In this paper we investigate routing algorithms in the condition of existing failure, based on the Bidirectional do Bruijn graph (BdBG). Two FFSP routing algorithms are proposed. Then, the performances of the two algorithms are analyzed in terms of mean path lengths and discrete set mean sizes. Our study shows that the proposed algorithms can be one of the candidates for routing in real interconnection networks based on dBG.

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

In this paper, label assignment schemes considering the IP flow model for the efficient MPLS traffic engineering are proposed and evaluated. Based on the IP flow model, the IP flows are classified into transient flows and base flows. Base flows, which last for a long time, transmit data in high bit rate, and be composed of many packets, have good implications for the MPLS traffic engineering, because they usually cause network congestion. To make use of base flows for the MPLS traffic engineering, we propose two base flow classifiers and label assignment schemes where transient flows are allocated to the default LSPs and base flows to explicit LSPs. Proposed schemes are based on the traffic-driven label triggering method combined with a routing tabel. The first base flow classifier uses both flow size in packet counts and routing entries, and the other one, extending the dynamic X/Y flow classifier, is based on a cut-through ratio. Proposed schemes are shown to minimize the number of labels, not degrading the total cut-through ratio.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.956-966
• /
• 2004

Nowadays, NGN(Next Generation Network) is evolving into network with packet based QoS.\ulcorner This paper presents the recovery method as a selecting way of more efficient path in MPLS network that reduces the service interruption time. In order to increase the efficiency of usage of recovering resource which is one of major functions of disorder recovering, it opens the state information of each Node both to fault detector and bandwidth broker so that it reduces message transmission time for recovery when functional disorder occurs. in addition, by effective management and adjustment of required bandwidth of entire network depending on the changes of traffic load, it improves the efficiency of bandwidth usage. and in MPLS network supporting priority selection function, it allocates domains depending on the traffic relating to priority order to the entire network so that\ulcorner it efficiently allocates proper resources to the restoring process between the entry and the end for the traffic of high priority and for low priority traffic, it restores path oかy inside disordered domain. by doing this, it reduces resetting time and unnecessary massage transmission.