• Title/Summary/Keyword: 라우팅프로토콜

Search Result 1,258, Processing Time 0.033 seconds

Mobility Management Scheme for the Wireless Mesh Network using Mobility Anchor Point (MAP를 적용한 무선 매쉬 네트워크에서의 이동성 관리방법)

  • Jang, Sung-Hwan;Cho, Kyu-Seob
    • Journal of Internet Computing and Services
    • /
    • v.12 no.3
    • /
    • pp.101-110
    • /
    • 2011
  • WMN is highlighted as a next generation network technology due to relatively reasonable cost to be built, compared with the pre-existing wireless network. It also enables same kind of network or even other kind of network to be integrated. Some WMN researches support mobility using router protocol such as AODV and DSR because WMN has the similar features with Ad-hoc network in terms of operation. However, WMN has got different operations with additional functions of multi-interface and internet connect, it can't be a good method to manage efficient mobility any more. This study suggests method to apply MAP function of HMIPv6 to WMN as a way to manage WMN mobility. Through simulation, operation was verified and function was appreciated. Through the results of evaluation, the suggest mobility management had shorter handover delay and packet loss reduced, which improved whole network throughput rate, compared with mobility management using AODV.

Designing of Network based Tiny Ubiquitous Networked Systems (네트워크 기반의 소형 유비쿼터스 시스템의 개발)

  • Hwang, Kwang-Il;Eom, Doo-Seop
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.13 no.3
    • /
    • pp.141-152
    • /
    • 2007
  • In this paper, we present a network-oriented lightweight real-time system, which is composed of an event-driven operating system called the Embedded Lightweight Operating System (ELOS) and a generic multi hop ad hoc routing protocol suite. In the ELOS, a conditional preemptive FCFS scheduling method with a guaranteed time slot is designed for efficient real-time processing. For more elaborate configurations, we reinforce fault tolerance by supplementing semi-auto configuration using wireless agent nodes. The developed hardware platform is also introduced, which is a scalable prototype constructed using off-the-shelf components. In addition, in order to evaluate the performance of the proposed system, we developed a ubiquitous network test-bed on which several experiments with respect to various environments are conducted. The results show that the ELOS is considerably favorable for tiny ubiquitous networked systems with real-time constraints.

Design and Implementation of SIP System for Supporting Mobility Based on JAIN (이동성 지원을 위한 JAIN 기반 SIP 시스템의 설계 및 구현)

  • Lee Jong eon;Cha Si ho;Kim Dae young;Lee Jae oh;Cho Kuk hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.3B
    • /
    • pp.144-152
    • /
    • 2005
  • Mobile IP(MIP) and SIP have been proposed to support mobility in the wireless internet working at different layers of the protocol stack. However MIP has some problems such as triangle routing, the need of each host's home address, the overhead of tunneling and the lack of wide deployment. Thus we proposed a scheme for supporting mobility based on SIP in this research. A novel SIP system to provide a hierarchical registration has been designed according to this scheme. Our SIP system has been established by implementing JAIN technologies which follow next generation network standards to support the mobility of wireless terminal. This system successfully satisfied ITU-T recommendation.

A Restoration Method for Improving Fault Recovery in MPLS Networks Routing Protocol (패킷망에서 NGN을 위한 라우팅 프로토콜MPLS망에서 장애 개선을 위한 복구 기법)

  • In Chi-Hyung
    • 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.

Reliable Message Routing Protocol for Periodic Messages on Wireless Sensor Networks (무선센서 네트워크에서 주기적 메시지에 대해 신뢰성 있는 메시지 전송을 위한 라우팅 프로토콜)

  • Ngo, Hoai Phong;Kim, Myung-Kyun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.2
    • /
    • pp.190-197
    • /
    • 2011
  • In industrial distributed control systems, sensors collect data from the physical environment periodically and transmit them to the actuators, which process the control operations based on the received data. For the effective operation of the control systems, the data transmitted by the sensors has to be delivered to the actuators reliably within the deadline, and if the message reception rate of the actuators becomes lower than a threshold, then the performance of the control systems drops greatly. This paper suggests a message routing protocol to transmit periodic messages reliably in a distributed control system based on wireless sensor networks. For reliable message transmission, the proposed protocol selects a routing path whose end-to-end message reception rate is the highest before transmitting data messages. The proposed protocol has the capability of maintaining a target message reception rate for each flow. To maintain the required target reception rate, each destination monitors the actual message reception rate periodically and transmits a feedback message to the source if it drops below the target reception rate. On receiving the feedback message, the source tries to find a new path which can satisfy the target rate. The performance of the proposed protocol has been evaluated using simulation and compared with other protocols in terms of the message reception rate, the message delay and delay jitter, and so on. The simulation results show that the proposed protocol has a higher message reception rate and comparable message delay and delay jitter to other protocols. The simulation results also show that the proposed protocol has an ability to adapt well to the dynamic network traffic change.

Teen Based Secure Group Communication Scheme for Wireless Sensor Networks (무선 센서네트워크를 위한 TEEN 기반의 안전한 그룹통신 기법)

  • Seo, Il-Soo
    • Convergence Security Journal
    • /
    • v.9 no.2
    • /
    • pp.71-78
    • /
    • 2009
  • It is very difficult to apply previous security protocols to WSNs(Wireless Sensor Networks) directly because WNSs have resource constrained characteristics such as a low computing ability, power, and a low communication band width. In order to overcome the problem, we proposes a secure group communication scheme applicable to WSNs. The proposed scheme is a combined form of the TEEN(Threshold sensitive Energy Efficient sensor Network protocol) clustering based hierarchical routing protocol and security mechanism, and we assume that WSNs are composed of sensor nodes, cluster headers, and base stations. We use both private key and public key cryptographic algorithms to achieve an enhanced security and an efficient key management. In addition, communications among sensor nodes, cluster headers, and base stations are accomplished by a hierarchical tree architecture to reduce power consumption. Therefore, the proposed scheme in this paper is well suited for WSNs since our design can provide not only a more enhanced security but also a lower power consumption in communications.

  • PDF

A Multibit Tree Bitmap based Packet Classification (멀티 비트 트리 비트맵 기반 패킷 분류)

  • 최병철;이정태
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.3B
    • /
    • pp.339-348
    • /
    • 2004
  • Packet classification is an important factor to support various services such as QoS guarantee and VPN for users in Internet. Packet classification is a searching process for best matching rule on rule tables by employing multi-field such as source address, protocol, and port number as well as destination address in If header. In this paper, we propose hardware based packet classification algorithm by employing tree bitmap of multi-bit trio. We divided prefixes of searching fields and rule into multi-bit stride, and perform a rule searching with multi-bit of fixed size. The proposed scheme can reduce the access times taking for rule search by employing indexing key in a fixed size of upper bits of rule prefixes. We also employ a marker prefixes in order to remove backtracking during searching a rule. In this paper, we generate two dimensional random rule set of source address and destination address using routing tables provided by IPMA Project, and compare its memory usages and performance.

A Design and Implementation of Dynamic Hybrid P2P System with Hierarchical Group Management and Maintenance of Reliability (계층적 그룹관리와 신뢰성을 위한 동적인 변형 P2P 시스템 설계 및 구현)

  • Lee, Seok-Hee;Cho, Sang;Kim, Sung-Yeol
    • The KIPS Transactions:PartD
    • /
    • v.11D no.4
    • /
    • pp.975-982
    • /
    • 2004
  • In current P2P concept, pure P2P and Hybrid P2P structures are used commonly. Gnutella and Ktella are forms of pure P2P. and forms of Hybrid P2P are innumerable. File searching models exist in these models. These models provide group management for file sharing, searching and indexing. The general file sharing model is good at maintaining connectivity. However, it is defective in group management. Therefore, this study approaches hierarchical structure in file sharing models through routing technique and backup system. This system was designed so that the user was able to maintain group efficiency and connection reliability in large-scale network.

Performance Evaluation of RSIP Gateway in Intranet Environment (인트라넷 환경에서 RSIP 게이트웨이의 성능분석)

  • Kim, Won;Lee, Young-Taek;Jun, Moon-Seog
    • The KIPS Transactions:PartC
    • /
    • v.11C no.5
    • /
    • pp.683-688
    • /
    • 2004
  • NAT is a very useful IP address translation technique that allows two connected networks using different and incompatible IP address schemes. But it is impractical to use NAT for an application which uses the encrypted IP packet, embedding IP addresses inside of data payloads, to guarantee End-to-End Security such as IPSec. In addition to rewriting the source/destination IP addresses in the packet, NAT must modify IP checksum every time, which could lead to considerable performance decrease of the overall system in the process of the address translation. RSIP is an alternative to solve these disadvantages of NAT and the address shortage problems. Both NAT and RSIP divide networks into inside and outside addressing realms. NAT translates addresses between internal network and external network, but RSIP uses a borrowed external address for outside communications. RSIP server assigns a routable public address to a RSIP client temporarily to communicate with public net-work outside of the private network. In this paper, RSIP gateway for intranet environment is designed and its performance is evaluated. From the results of performance evaluation, we knew that RSIP is operated less sensitive to the data traffic. Also, the experiment shows that RSIP performs better than NAT when the transmission data grows larger.

A Path Establishment Method for Improving Path Stability in Mobile Ad-Hoc Networks (이동 애드혹 네트워크에서 경로의 안정성 향상을 위한 경로 설정 방식)

  • Joe, In-Whee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9B
    • /
    • pp.563-568
    • /
    • 2007
  • This paper proposes a routing establishment method for improving path stability in mobile ad-hoc networks. In mobile ad-hoc networks, the network topology is highly dynamic due to the node mobility unlike wired networks. Since the existing methods are based on the shortest path algorithm with the minimum hop count regardless of the path stability, it could lead to packet loss and path disconnection in mobile ad-hoc networks. In particular, if control packets and critical data are transmitted on the unstable path, it causes serious problems. Therefore, this paper proposes one approach in order to minimize packet loss and path disconnection by considering the node mobility. After the destination node receives multiple RREQ messages, it selects the stable path through the proposed MinMax algorithm according to the node speed.