• Title/Summary/Keyword: routing policy

Search Result 96, Processing Time 0.023 seconds

A Study on ship's routing system in the approach waters of Wan-do Port (완도항 인근수역 해상교통 시스템 개선 연구)

  • Im, Nam-Kyun;Jeong, J.Y.;Choi, M.S.
    • Proceedings of KOSOMES biannual meeting
    • /
    • 2007.05a
    • /
    • pp.175-180
    • /
    • 2007
  • Until a recent date Wan-do Port have been made efforts to advance its marine policy toward the base of marine distribution industry. Therefore the administration of Wan-do port have been carried out many projects on improvements of harbour system very actively. The improvement of ship traffic system would be one of them. This research examined the general view of present situations of marine traffic system in Wan-do waters area and suggested improvements in ship route and anchorage.

  • PDF

i-LEACH : Head-node Constrained Clustering Algorithm for Randomly-Deployed WSN (i-LEACH : 랜덤배치 고정형 WSN에서 헤더수 고정 클러스터링 알고리즘)

  • Kim, Chang-Joon;Lee, Doo-Wan;Jang, Kyung-Sik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.1
    • /
    • pp.198-204
    • /
    • 2012
  • Generally, the clustering of sensor nodes in WSN is a useful mechanism that helps to cope with scalability problem and, if combined with network data aggregation, may increase the energy efficiency of the network. The Hierarchical clustering routing algorithm is a typical algorithm for enhancing overall energy efficiency of network, which selects cluster-head in order to send the aggregated data arriving from the node in cluster to a base station. In this paper, we propose the improved-LEACH that uses comparably simple and light-weighted policy to select cluster-head nodes, which results in reduction of the clustering overhead and overall power consumption of network. By using fine-grained power model, the simulation results show that i-LEACH can reduce clustering overhead compared with the well-known previous works such as LEACH. As result, i-LEACH algorithm and LEACH algorithm was compared, network power-consumption of i-LEACH algorithm was improved than LEACH algorithm with 25%, and network-traffic was improved 16%.

Adaptable PANID Generation Scheme for Resolving Address Conflict Based on Hash Mechanism in IoT Environment (IoT 환경을 위한 Hash 기반 동적 Zigbee PANID 생성 및 충돌 회피 방안)

  • Lee, Jaeho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.12
    • /
    • pp.2392-2400
    • /
    • 2015
  • Zigbee, which was a representative standard technology for dealing low energy and mesh networks in large deployment area such as smart home, smart building, and massive sensor networks, has been developed and deployed for increasing communication area by using Ad hoc method. It has been originally developed based on IEEE 802.15.4 standard so every node needs 48bit unique address defined by IEEE. However, it is absolutely inefficient to assign an unique address to every communication node where it would be deployed through large-scale network area, e.g., smart lighting and massive sensor networks, because there could be variously multiple companies to deploy network infrastructure and they could have different policy to assign node ID. To prevent the problem, this paper proposes a method of dynamic PANID assignment in overall Personal Coordinators, and also proposes a method for addressing PANID conflict problem which could be derived from dynamic PANID assignment.

Multi-layer Network Virtualization for QoS Provisioning in Tactical Networks (전술망의 서비스 품질 보장을 위한 다계층 네트워크 가상화 기법)

  • Kim, Yohan;An, Namwon;Park, Juman;Park, Chan Yi;Lim, Hyuk
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.21 no.4
    • /
    • pp.497-507
    • /
    • 2018
  • Tactical networks are evolving into an All-IP based network for network centric warfare(NCW). Owing to the flexibility of IP based network, various military data applications including real-time and multi-media services are being integrated in tactical networks. Because each application has diverse Quality-of-service(QoS) requirements, it is crucial to develop a QoS provisioning method for guaranteeing QoS requirements efficiently. Conventionally, differentiated services(DiffServ) have been used to provide a different level of QoS for traffic flows. However, DiffServ is not designed to guarantee a specific requirement of QoS such as delay, loss, and bandwidth. Therefore, it is not suitable for military applications with a tight bound of QoS requirements. In this paper, we propose a multi-layer network virtualization scheme that allocates traffic flows having different QoS requirements to multiple virtual networks, which are constructed to support different QoS policies such as virtual network functions(VNFs), routing, queueing/active queue management(AQM), and physical layer policy. The experiment results indicate that the proposed scheme achieves lower delays and losses through multiple virtual networks having differentiated QoS policies in comparison with conventional networks.

Realizing an End-to-End IP Multicast Monitoring Framework for the Support of Networked Collaboration (네트워크 기반 원격 협업 지원을 위한 End-to-End IP 멀티캐스트 모니터링 프레임워크 연구)

  • Jo, Jin-Yong;Kong, Jong-Uk
    • The KIPS Transactions:PartC
    • /
    • v.16C no.5
    • /
    • pp.605-614
    • /
    • 2009
  • Despite its graceful bandwidth saving nature, IP multicast has not been successful in widely spreading and using. Challenging includes policy and technological issues such as inter-domain routing, multicast availability and reachability. Properly detecting and isolating the faults would be the first step to stabilize IP multicast. In this paper, we introduce a scalable multicast monitoring framework. To efficiently cope with multicast network and networking problems, it enlarges its monitoring scopes from collecting delivery statistics to verifying end-to-end multicast availability, reachability and interactivity. We carry out various networking experiments to verify the scalability and feasibility of the proposed framework.

Container Transportation Models in Industrial Estate Area (산업단지내 효율적 컨테이너 운송을 위한 수송 모형)

  • Shin, Jae Young;Kim, Woong-Sub
    • Journal of Navigation and Port Research
    • /
    • v.38 no.2
    • /
    • pp.171-176
    • /
    • 2014
  • Companies are facing challenges to have high competitiveness because of continuous oil price rising and CO2 emissions regulations. Thus, companies are trying hard to construct effective logistics and operation system to achieve high customer service quality and saving cost. Also the ec-friendly idustrial complex is needed. Busan is in process to construct GILC(Global Industry Logistics City) in west Busan province to achieve high competitiveness and support lack of industrial complex. To construct this kind of logistics industrial complex, it needs logistics system through proper policy and freight transportation co-operation. Especially, efficient management through logistics hierarchy construction in industrial complex is very important for low cost and eco-friendly point of view. Therefore, this paper aims to analyze logistics system and suggest operation model to present logistics complex construction base data.

Public Transport Network Connectivity using GIS-based Space Syntax (GIS 기반 Space Syntax를 이용한 대중교통 접근성)

  • Jun, Chul-Min
    • Journal of Korea Spatial Information System Society
    • /
    • v.9 no.3
    • /
    • pp.25-33
    • /
    • 2007
  • The local governments of major cities in Korea are giving focus on public transportation to reduce congestion and improve accessibility in city areas. In this regards, the proper measurement of accessibility is now a key policy requirement for reorganizing the public transport network. Public transport routing problems, however, are considered to be highly complicated since a multi-mode travel generates different combinations of accessibility. While most of the previous research efforts on measuring transport accessibility are found at zone-levels, an alternative approach at a finer scale such as bus links and stops is presented in this study. We proposes a method to compute the optimal route choice of origin-destination pairs and measure the accessibility of the chosen modes combination based on topological configuration. The genetic algorithm is used for the computation of the journey paths, whereas the space syntax theory is used for the accessibility. This study used node-link data in GIS instead of axial lines which are manually drawn in space syntax. The resulting accessibilities of bus stops are calibrated by O-D survey data and the proposed process is tested on a CBD of Seoul.

  • PDF

A Policy of Movement Support for Multimedia Multicast Service in Wireless Network (무선 네트워크 환경에서 멀티미디어 멀티캐스트 서비스를 위한 이동성 지원 기법)

  • 이화세;홍은경;이승원;박성호;정기동
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.6
    • /
    • pp.1034-1045
    • /
    • 2003
  • In this paper, we study a multicast transport technique for multimedia services of mobile hosts in wireless network environments. To reduce packet loss during hand-off, we propose a Pre-join scheme in overlapped area and a Buffering scheme in crossover routers. To support seamless service in real time multimedia application, these scheme use an optimal path routing which was provided in remote subscription scheme and a prediction scheme of host movements which was considered overlapped area. To evaluate the peformance of our scheme, we compare Bi-direction tunneling of mobile If, Remote subscription, and MoM by using NS-2. As a result, our scheme shows better performance in network overhead, packet loss and bandwidth's use than other schemes.

  • PDF

Resource Allocation in Spectrum Sharing ad-hoc Cognitive Radio Networks Based on Game Theory: An Overview

  • Abdul-Ghafoor, Omar B.;Ismail, Mahamod;Nordin, Rosdiadee;El-Saleh, Ayman Abd
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.12
    • /
    • pp.2957-2986
    • /
    • 2013
  • The traditional approach of fixed spectrum allocation to licensed networks has resulted in spectrum underutilisation. Cognitive radio technology is envisioned as a promising solution that can be used to resolve the ineffectiveness of the fixed spectrum allocation policy by accessing the underutilised spectrum of existing technologies opportunistically. The implementation of cognitive radio networks (CRNs) faces distinct challenges due to the fact that two systems (i.e., cognitive radio (CR) and primary users (PUs)) with conflicting interests interact with each other. Specially, in self-organised systems such as ad-hoc CRNs (AHCRNs), the coordination of spectrum access introduces challenges to researchers due to rapid utilisation changes in the available spectrum, as well as the multi-hop nature of ad-hoc networks, which creates additional challenges in the analysis of resource allocation (e.g., power control, channel and rate allocation). Instead, game theory has been adopted as a powerful mathematical tool in analysing and modelling the interaction processes of AHCRNs. In this survey, we first review the most fundamental concepts and architectures of CRNs and AHCRNs. We then introduce the concepts of game theory, utility function, Nash equilibrium and pricing techniques. Finally, we survey the recent literature on the game theoretic analysis of AHCRNs, highlighting its applicability to the physical layer PHY, the MAC layer and the network layer.

Design of Heuristic Algorithm of Automatic Vehicle Delivery Support System (자동배차 지원시스템의 휴리스틱 알고리듬 설계)

  • Lee, Myeong-Ho
    • Journal of Digital Convergence
    • /
    • v.11 no.3
    • /
    • pp.181-187
    • /
    • 2013
  • Moreover a new logistics concept is needed through the sharing information between suppliers and consumers, which maximizes the level of customers service and its flexibility by changing functional-oriented to process-oriented. In other words, Supply Chain Management(SCM) is now considered as a key aspect of business, which controls the flows of information, funds, and goods in the supply chain. Rationalization of transport-delivery system will be one of the most important issues on logistics management to the domestic companies. The companies need the effective delivery system. Especially in the case of delivery system from distribution centers to customers or vendors, it might take a long time to control the delivery system manually because it would be hard to apply the automatic vehicle routing algorithm effectively considering all the practical constraints. Thus this study develops a heuristic algorithm of automatic vehicle delivery support system in terms of grouping by short ranges of vehicle movement utilizing postal coordinates, which satisfies a variety of realistic constraints and reduces controlling time of manual operations.