• Title/Summary/Keyword: hierarchical routing

Search Result 243, Processing Time 0.032 seconds

A study of set route path avoiding traffic concentration in Mobile Ad hoc Network (MANET에서 트래픽 집중현상을 회피하는 경로설정에 관한 연구)

  • Oh, Dong-keun;Oh, Young-jun;Lee, Kang-whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.05a
    • /
    • pp.781-783
    • /
    • 2014
  • Mobile ad hoc network(MANET) consists of node that has mobility. MANET has increased overhead that caused by frequent topology changes. For reducing overhead, hierarchical network that communicates through cluster head node has been researched. When traffic is concentrated on cluster head node, cluster member node can't send message. To solve this problem, we proposed Step Parent algorithm. Proposed algorithm, cluster member node checks traffic of cluster head node using route path of other cluster head node in efficient coverage area. When cluster head node has increased traffic, cluster member node make a new route path by route path by routing path to another cluster head node. So cluster member node sends a message to destination node, we check improving delivery ratio.

  • PDF

Sensor Network Deployment for Warehouse Management System based on RFID (RFID 기반 물류창고 시스템을 위한 센서 네트워크 구축)

  • Lee, Shin-Hyoung;Lee, Chi-Yung;Kim, Dong-Shin;Lee, Chan-Haeng;Lee, Won-Jun;Min, Sung-Gi;Yoo, Hyuck
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.1
    • /
    • pp.22-30
    • /
    • 2008
  • Warehouse has many changes for the stocks by entering and taking. Management about the stocks is important. To manage, sensor network based on RFID is deployed in warehouse. Sensor network uses fluster based on energy and hierarchical routing. Supporting mobility between clusters makes guarantee connectivity for mobile nodes.

Hierarchical Coloured Petri Net based Random Direction Mobility Model for Wireless Communications

  • Khan, Naeem Akhtar;Ahmad, Farooq;Hussain, Syed Asad;Naseer, Mudasser
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.8
    • /
    • pp.3656-3671
    • /
    • 2016
  • Most of the research in the area of wireless communications exclusively relies on simulations. Further, it is essential that the mobility management strategies and routing protocols should be validated under realistic conditions. Most appropriate mobility models play a pivotal role to determine, whether there is any subtle error or flaw in a proposed model. Simulators are the standard tool to evaluate the performance of mobility models however sometimes they suffer from numerous documented problems. To accomplish the widely acknowledged lack of formalization in this domain, a Coloured Petri nets (CPNs) based random direction mobility model for specification, analysis and validation is presented in this paper for wireless communications. The proposed model does not suffer from any border effect or speed decay issues. It is important to mention that capturing the mobility patterns through CPN is challenging task in this type of the research. Further, an appropriate formalism of CPNs supported to analyze the future system dynamic status. Finally the formal model is evaluated with the state space analysis to show how predefined behavioral properties can be applied. In addition, proposed model is evaluated based on generated simulations to track origins of errors during debugging.

The Threshold Based Cluster Head Replacement Strategy in Sensor Network Environment (센서 네트워크 환경의 임계값 기반 클러스터 헤드 지연 교체 전략)

  • Kook, Joong-Jin;Ahn, Jae-Hoon;Hong, Ji-Man
    • Journal of Internet Computing and Services
    • /
    • v.10 no.3
    • /
    • pp.61-69
    • /
    • 2009
  • Most existing clustering protocols have been aimed to provide balancing the residual energy of each node and maximizing life-time of wireless sensor networks. In this paper, we present the threshold based cluster head replacement strategy for clustering protocols in wireless sensor networks. This protocol minimizes the number of cluster head selection by preventing the cluster head replacement up to the threshold of residual energy. Reducing the amount of head selection and replacement cost, the life-time of the entire networks can be extended compared with the existing clustering protocols. Our simulation results show that our protocol outperformed than LEACH in terms of balancing energy consumption and network life-time.

  • PDF

Hierarchical WSN Dual-hop Routing Protocol for Improvement of Energy Consumption

  • Park, SeaYoung;LEE, WooSuk;Kwon, Oh Seok;Jung, KyeDong;Lee, Jong-Yong
    • International journal of advanced smart convergence
    • /
    • v.5 no.2
    • /
    • pp.24-37
    • /
    • 2016
  • This paper proposes to increase the efficiency of energy in nodes, which rapidly drops during the transmission of the Low Energy Adaptive Clustering Hierarchy (LEACH), through the use of dual-hop layered application in the sensor field. Along with introducing the dual-hop method in the data transmission, the proposed single-hop method for short-range transmission and multi-hop transmission method between the cluster heads for remote transmission were also introduced. Additionally, by introducing a partial multi-hop method in the data transmission, a single-hop method for short range transmission method between the cluster heads for remote transmission was used. In the proposed DL-LEACH, the energy consumption of the cluster head for remote transmission reduced, as well as increased the energy efficiency of the sensor node by reducing the transmission distance and simplifying the transmission route for short-range transmission. As compared the general LEACH, it was adapted to a wider sensor field.

A QoS-based Multicast Protocol in Hierarchical Encoding Environment (계층화된 인코딩 환경에서 서비스 품질 보장을 지원하는 멀티캐스트 프로토콜)

  • Im, Yu-Jin;Choe, Jong-Won
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.9
    • /
    • pp.1112-1125
    • /
    • 1999
  • 최근 들어 멀티미디어를 지원하는 응용들의 서비스 품질 보장과 멀티캐스트 지원에 대한 요구가 증가되고 있으나 기존의 멀티캐스트 프로토콜로는 이러한 요구를 수용할 수 없는 문제가 발생하고 있다. 현재 인터넷에서 사용되고 있는 라우팅 메커니즘은 네트워크 자원 정보나 세션의 QoS 요구사항을 고려하지 않고 단순히 종단간의 연결에만 초점을 맞추고 있기 때문이다. 따라서 본 논문에서는 멀티캐스트 환경에서 서비스 품질보장을 지원하기 위한 새로운 프로토콜, LayeredQoS을 제안한다. 다중의 CP (Central Point)를 채택하고 각각의 CP에 적절한 QoS 레벨을 부여하여 사용함으로써 대역폭의 공유정도를 높일 뿐만 아니라 전체 트리 비용을 감소시켜 궁극적으로 네트워크 처리량이 증가되도록 하였다. 또한 시뮬레이션 방법을 통하여 다른 프로토콜보다 나은 성능을 가지는 것으로 평가하였다.Abstract Many emerging multimedia applications often require a guaranteed quality of service and multicast connection. But the traditional multicast protocol can't meet the needs since the routing mechanisms deployed in today's Internet are focused on connectivity, not on resource availability in the network or QoS requirements of flows. In this paper, we present LayeredQoS, a new QoS-based multicast routing algorithm. We adopt the multiple CPs(Central Points) and allocate QoS-levels for each CP in order to improve the degree of resource sharing and decrease the total tree cost, and then network throughput is increased. The proposed protocol is verified by simulations and it is shown that the performance of LayeredQoS is much better than the existing protocols.

Hierarchical Evaluation of Flexibility in Production Systems

  • Tsuboner, Hitoshi;Ichimura, Tomotaka;Horikawa, Mitsuyoshi;Sugawara, Mitsumasa
    • Industrial Engineering and Management Systems
    • /
    • v.3 no.1
    • /
    • pp.52-58
    • /
    • 2004
  • This report examines the issue of designing an efficient production system by increasing several types of flexibility. Increasing manufacturing flexibility is a key strategy for efficiently improving market responsiveness in the face of uncertain market demand for final products. The manufacturing system comprises multiple plants, of which individual plants have multiple manufacturing lines that are designed to produce limited types of products in accordance with their size and materials. Imbalance in the workload occurs among plants as well as among manufacturing lines because of fluctuations in market demand for final products. Thereby, idleness of some manufacturing lines and longer lead times in some manufacturing lines occur as a result of the high workload. We clarify how these types of flexibility affect manufacturing performance by improving only one type of flexibility or by improving multiple types of flexibility simultaneously. The average lead time and the imbalance in workload are adopted as measures of manufacturing performance. Three types of manufacturing flexibility are interrelated: machine flexibility, routing flexibility, and process flexibility. Machine flexibility refers to the various types of operations that a machine can perform without requiring the prohibitive effort of switching from one order to another. Routing flexibility is the capability of processing a given set of part types using more than one line (alternative line) in the plant. Process flexibility results from being able to build different types of final products at the same plant.

A Route Optimization Scheme for Heterogeneous Nested Mobile Networks (혼재된 중첩 이동 네트워크에서의 라우팅 최적화 기법)

  • Cho, Ho-Sik;Kwon, Tae-Kyoung;Choi, Yang-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.2B
    • /
    • pp.82-89
    • /
    • 2008
  • Mobile IP is the basic solution to provide host mobility, whereas network mobility refers to the concept of collective mobility of a set of nodes. In a network mobility scenario, mobile networks can be nested in a hierarchical form. That situation is referred to a nested mobile network Nested mobile networks exhibit the pinball routing problem, which becomes worse in proportion to the number of nested levels in the hierarchy. In this paper, we propose a routing optimization scheme having backward compatibility to the basic network mobility protocol and concerning heterogeneity of nested mobile network, also we perform comparison and analysis of proposed schemes.

A PMIPv6 Routing Optimization Mechanism using the Routing Table on the MAG (MAG의 라우팅 테이블을 이용한 PMIPv6 라우팅 최적화 기법)

  • Han, Byung-Jin;Lee, Jae-Min;Lee, Jong-Hyouk;Chung, Tai-Myoung
    • Annual Conference of KIPS
    • /
    • 2008.05a
    • /
    • pp.889-892
    • /
    • 2008
  • 최근 이동 중에도 인터넷을 사용하고자하는 사용자의 요구에 맞추어 노드의 이동성을 제공하기 위한 기술들이 개발되고 있다. 그 중 대표적인 기술이 네트워크 계층에서의 이동성 관리 기법인 Mobile IP 기술이다. Mobile IP 기술은 크게 두 가지 분류로 나눌 수 있다. 하나는 호스트가 직접 핸드오프에 대한 시그널링을 수행하는 호스트 기반 이동성 관리 기술이고, 다른 하나는 네트워크 엔터티가 호스트를 대신하여 호스트의 이동에 따른 시그널링을 수행하는 네트워크 기반 이동성 관리 기술이다. 전자의 대표적인 프로토콜은 Mobile IPv6, Fast Mobile IPv6, Hierarchical Mobile IPv6가 있고, 후자의 대표적인 프로토콜은 Proxy Mobile IPv6 기법이 있다. 그 중, 최근 가장 주목 받고 있는 기술은 Proxy Mobile IPv6이다. 네트워크 기반 이동성 관리라는 개념이 서비스 제공자와 기기 제조사에게 모두 이득을 주는 방식이기 때문이다. 하지만 Proxy Mobile IPv6는 아직 개발 중인 기법이라 최적화에 대한 논의가 끝나지 않았다. 특히 Proxy Mobile IPv6 도메인 내에서의 라우팅 최적화에 대한 논의는 활발하게 이루어지고 있다. 본 논문에서는 Proxy Mobile IPv6의 네트워크 엔터티인 Mobile Access Gateway의 라우팅 테이블을 이용한 라우팅 최적화 기법을 제안한다. 또한 제안한 기법이 가져오는 성능향상과 효과에 대해 분석한다.

Hierarchical Mesh-based Multicast Routing Protocol for Ad-Hoc Networks (에드 혹 네트워크를 위한 계층적인 메쉬 기반 멀티캐스트 라우팅 프로토콜)

  • Kim, Ye-Kyung;Lee, Mee-Jeong
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.4
    • /
    • pp.586-601
    • /
    • 2001
  • We propose a mesh based multicast routing protocol referred to as HMMRP for ad-hoc networks. In HMMRP, a limited number of sources are selected as core sources, and the rest of the sources of a multicast group are connected to one of those core sources. The sources and the receivers of a multicast group are also connected through per source trees. In HMMRP, the data delivery mesh of a multicast group are composed of the nodes on these paths, and are reconfigured at regular intervals. Furthermore, each mesh member that lies on the paths between the sources and the core sources as well as be-tween the core sources and the receivers keeps checking if there is a symptom of mesh separation around itself. When a mesh member finds such symptom, it tries to patch itself to the mesh with a local flooding. As a result, the part of the data delivery mesh on those paths are kept connected with a lot higher probability than the rest of the data delivery mesh. That is, for a certain source receiver pair, it is very likely that at least there exists a data delivery path that route from the source to a core source and then to the receiver. Therefore, HMMRP may provide very high data delivery ratio without frequent entire data delivery mesh reconfiguration even when the nodal mobility is high. Simulation results show that HMMRP shows relatively little performance degradation with respect to mobility. Furthermore, the performance degradation with respect to mobility is even smaller when the size of the multicast group becomes larger.

  • PDF