• Title/Summary/Keyword: reliable routing

Search Result 197, Processing Time 0.027 seconds

Timer-based Buffer Management for Reliable Multicast (신뢰적 멀티캐스트를 위한 타이머 기반 버퍼 관리)

  • 안상현;김영민;권영호
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.4
    • /
    • pp.513-519
    • /
    • 2003
  • In order to deliver multicast traffic efficiently, multicast routing and reliable transmission mechanisms are required. The reliable delivery implies that lost packets must be retransmitted, which in turn requires that transmitted packets be stored in a retransmission buffer. Therefore how to manage a retransmission buffer is important and, in this paper, we try to solve the problem of how many packets should be maintained in the buffer. Our proposed scheme, the timer-based buffer management (TBM), maintains only necessary amount of buffer based on the timer value calculated from the NAKs between the replier and receivers on a multicast tree and can adjust to the dynamic network conditions. By performing simulations, we show that TBM manages the buffer efficiently regardless of the error situation, network size, and so on.

Setup and Operation Sequence Generation from Manufacturability Evaluation for Prismatic Parts (제조성 평가를 기반으로 한 비회전형상 부품의 작업준비 및 작업순서 생성)

  • Choi, Hoo Gon;Han, Jung Hyun;Kang, Mujin
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.31 no.4
    • /
    • pp.316-333
    • /
    • 2005
  • Although some successful recognition algorithms have been developed, most of them did emphasize on extracting accurate interpretations without considerations of manufacturability. Evaluating the manufacturability for multiple features leads to produce the machining sequences. In this paper, the A* algorithm guarantees the optimal setup sequences with minimizing the machining cost. Also, tolerances including surface roughness are converted to STEP formats to be utilized for more reliable process plans. Finally, decision tables are used to create the detailed operational sequences based on geometric tolerances and surface roughness. Machining parameters such as feed, depth of cut, and cutting speed for each operation are added to the routing sheet. Windows are presented to show how the entire system works for a sample part.

A Sinkhole Detection Method based on Incremental Learning in Wireless Ad Hoc Networks

  • Kim, Ki-Sung;Kim, Se-Hun
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2007.11a
    • /
    • pp.377-382
    • /
    • 2007
  • Mobile ad hoc network(MANET) is a kind of wireless network which has no infrastructure. Each component node of MANET can move freely and communicate based on wireless peer to peer mode. Because of its vulnerable routing protocols, MANET is exposed to many kinds of attacks. A sinkhole attack is one of the representative attacks in MANET caused by attempts to draw all network traffic to a sinkhole node. This paper focuses on the sinkhole problem on Dynamic Source Routing(DSR) protocol in MANET. To detect the sinkhole node, we extract several useful sinkhole indicators through analyzing the sinkhole problem, then propose an efficient detection method based on an incremental learning algorithm. The simulation results show that the proposed method is effective and reliable for detecting sinkhole intrusion.

  • PDF

RTE: Routing Tree Estimation Scheme for Reliable Multicast (RTE: 신뢰적 멀티캐스트를 위한 라우팅 트리 추정 기법)

  • 윤원용;이동만
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10c
    • /
    • pp.439-441
    • /
    • 1999
  • 트리 기반 신뢰적 멀티캐스트에서 효율적이고 확장성 있는 손실 복구를 하기 위한 RTE(Routing Tree Estimation) 기법을 제안한다. 에러 비트맵(error bitmap) 정보를 통하여 멀티캐스트 라우팅 트리와 유사한 논리적 트리(logical tree)를 구성함으로써 멀티캐스트 라우팅 트리에서 상위에 위치하는 수신자들이 재전송을 요청한 수신자의 신뢰성을 책임지도록 보장한다. 논리적 트리는 세션 멤버쉽이나 멀티캐스트 경로의 변화에 따라 적응적으로 재구성되는데 이는 멀티캐스트 세션 진행동안 논리적 트리와 멀티캐스트 라우팅 트리 사이에 불일치를 최소화함으로써 멤버십과 경로가 변하는 상황에서도 implosion과 exposure를 감소시키는 장점을 지닌다. 제안한 기법과 정적 트리기반의 신뢰적 멀티캐스트 프로토콜의 시뮬레이션 결과는 세션의 크기가 커짐에 따라 제안한 적응형 트리 기반의 복구방식의 효율성을 입증한다.

  • PDF

An Energy Efficient Cluster Formation and Maintenance Scheme for Wireless Sensor Networks

  • Hosen, A.S.M. Sanwar;Kim, Seung-Hae;Cho, Gi-Hwan
    • Journal of information and communication convergence engineering
    • /
    • v.10 no.3
    • /
    • pp.276-283
    • /
    • 2012
  • Nowadays, wireless sensor networks (WSNs) comprise a tremendously growing infrastructure for monitoring the physical or environmental conditions of objects. WSNs pose challenges to mitigating energy dissipation by constructing a reliable and energy saving network. In this paper, we propose a novel network construction and routing method by defining three different duties for sensor nodes, that is, node gateways, cluster heads, and cluster members, and then by applying a hierarchical structure from the sink to the normal sensing nodes. This method provides an efficient rationale to support the maximum coverage, to recover missing data with node mobility, and to reduce overall energy dissipation. All this should lengthen the lifetime of the network significantly.

A Secure Data Transmission Mechanism for Sensor Network Communication (센서네트워크 통신을 위한 안전한 데이터 전송 기법)

  • Doh, In-Shil;Chae, Ki-Joon
    • The KIPS Transactions:PartC
    • /
    • v.14C no.5
    • /
    • pp.403-410
    • /
    • 2007
  • For reliable sensor network communication, secure data transmission mechanisms are necessary. In our work, for secure communication, we cluster the network field in hexagonal shape and deploy nodes according to Gaussian distribution. After node deployment, clusterheads and gateway nodes in each cluster play the role of aggregating and delivering the sensed data with suity information all the way to the base station. Our mechanism decreases the overhead and provides food performance. It also has resilience against various routing attacks.

Reliable Extension Scheme using Multiple Paths in Wireless Ad-hoc Networks (무선 애드-혹 네트워크의 다중 경로를 이용한 신뢰적인 확장 기법)

  • Kim, Moon-Jeong;Eom, Young-Ik
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.3
    • /
    • pp.218-225
    • /
    • 2007
  • As the research on home network technologies, sensor network technologies, and ubiquitous network technologies makes rapid progresses, wireless ad-hoc network have attracted a lot of attention. A wireless mobile ad-hoc network is a temporary network formed by a collection of wireless mobile nodes without the aid of any existing network infrastructure or centralized administration, and it is suitable for ubiquitous computing environments. In this paper, we suggest an extension scheme of a wireless mobile ad-hoc network based on limited multiple paths source routing protocol. This scheme reduces the overhead of route re-establishment and re-registration by maintaining link/node non-disjoint multiple paths between mobile hosts in a wireless mobile ad-hoc network or a mobile host in a wireless mobile ad-hoc network and a base station supporting fixed network services. By maintaining multiple paths, our scheme provides short end-to-end delay and is reliable extension scheme of a wireless mobile ad-hoc network to a fixed network. In this paper, our simulations show that our scheme outperforms existing schemes with regards to throughput and end-to-end delay. Also we show that our scheme outperforms multi-paths approach using disjoint routes with regards to routing overhead.

Dynamic Link Failure and Power Aware Reliable Path Routing in MANET (MANET에서의 신뢰성을 고려한 경로 설정 매커니즘)

  • 한상희;김상하
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04a
    • /
    • pp.556-558
    • /
    • 2004
  • 현재 제안된 MANET에서의 유니캐스트 라우팅[3][4]들은 신뢰성 있는 데이터 전송을 위한 응용에는 적합하지 않다. 신뢰성 있는 데이터 전송을 위하여 제안된 다중 경로 라우팅 메커니즘[5][6]은 추가적인 오버헤드와 비효율적인 자원의 이용이라는 문제점을 발생시킨다. 본 논문에서는 노드의 링크 단절 빈도와 데이터 전송시의 배터리 소모를 기반으로 하는 신뢰성 있는 단일 경로 설정 메커니즘을 제안한다. 제안된 메커니즘의 경우 단절될 확률이 적은 노드들로 구성된 경로를 선택함으로써 기존의 라우팅 알고리즘보다 신뢰성 높은 경로를 설정할 수 있는 동시에 높은 동적 환경에서는 다중 경로를 설정하여 신뢰성을 향상시킬 수 있다.

  • PDF

Link Handover Scheme in Ad Hoc Networks (Ad Hoc 망에서 링크 핸드오버 방안)

  • 박상준;김형종
    • Journal of the Korea Society for Simulation
    • /
    • v.13 no.2
    • /
    • pp.53-63
    • /
    • 2004
  • In ad hoc networks, the link survivability is firstly considered if a routing between two mobile nodes takes place through wireless environments, because all of mobile nodes participating in a connection dynamically move to anywhere. Also, mobile nodes have multi-role to implement a communication without a static system supported by wired networks. Hence, it is difficult that all mobile nodes continuously provide a reliable connection when the nodes operate each role for the connection. Therefore, it is desired to maximize the lifetime of a route as long as possible for the reliable communication. In this paper, we propose a proactive link management scheme that can provide the continuous route supported by the link handover. It consider the wireless link quality and the power lifetime of a node so that the link handover is implemented for the link survivability without disconnecting the route on the communication.

  • PDF

A Study on Buffer Node for QoS Quarantee in Static Ad Hoc Networks (Static Ad Hoc 망에서 버퍼 노드를 이용한 QoS 향상 기법)

  • Kim, Hyo;Park, Sang-jun;Kim, Byung-Gi
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2003.11a
    • /
    • pp.219-223
    • /
    • 2003
  • A lot of researches have been done on supporting QoS in the mobile networks and ad hoc network architectures, but most of them are not suitable in the static ad hoc environment. Most Research in mobile ad hoc networks has been devoted to routing protocol since they are fundamantal to the technology for improving QoS. In mobile ad hoc networks, QoS means not only fast speed and reliable transmission but reliable node. Needless to say, general QoS is serious question. In this paper, we enunciate the proposition to reduce network load and prevent node expire using buffer node.

  • PDF