• Title/Summary/Keyword: routing protocol

Search Result 1,461, Processing Time 0.029 seconds

Design and Implementation of Location Based Seamless Handover for IEEE 802.11s Wireless Mesh Networks (IEEE 802.11s 무선 메쉬 네트워크를 위한 위치 기반 핸드오버의 설계 및 구현)

  • Lee, Sung-Han;Yang, Seung-Chur;Kim, Jong-Deok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.10
    • /
    • pp.2004-2010
    • /
    • 2009
  • The characteristic of the backbond for distribution service in WMNs(Wireless Mesh Networks) is that WMNs has multiple links connected to mesh points and dynamic routing protocol such as AODV to establish routing paths. When the terminal is communicating with the service through new AP, mobile nodes can resume communication by setting only the link between new AP and mobile node in the case of existing WLANs, but WMNs needs path establishment process in multihop networks. Our goal in this paper is to support the seamless communication service by eliminating path establishment delay in WMNs. We present the method that eliminates the handover latency by predicting the location of handover using GPS information and making the paths to their destination in advance. We implement mesh nodes using embedded board that contains proposed handover method and evaluate performance of handover latency. Our experiment shows that handover delay time is decreased from 2.47 to 0.05 seconds and data loss rate is decreased from 20~35% in the existing method to 0~10% level.

A Crossover Node Discovery and Local Repair Mechanism for Reducing the Signaling Delay of Resource Reservation on HMIPv6 Networks (HMIPv6 네트워크에서 자원예약 시그널링 지연을 줄이기 위한 크로스오버 노드 발견 및 지역적 자원 갱신 방안)

  • Byun, Hae-Sun;Lee, Mee-Jeong
    • The KIPS Transactions:PartC
    • /
    • v.15C no.1
    • /
    • pp.37-44
    • /
    • 2008
  • In order to minimize the signaling delay for a resource reservation on the new routing path after the handover of Mobile Node(MN) is completed, it is important to discover the crossover node where the old and new routing paths meet. With the 크로스오버 노드 being found, the signaling messages only need to be transferred on the changed part of the end-to-end path. The crossover node is generally discovered using the end-to-end Session ID(SID) of the established session between MN and Correspondent Node(CN). However, in the Hierarchical Mobile IPv6(HMIPv6) network, if the Mobile Anchor Point (MAP) reserves the resource by aggregate with the Home Agent(HA), the crossover node discovery cannot be performed in the general way since the aggregate SID that has established between the previous MAP and HA is different from the that of the current MAP and HA after MN's handover. In this paper, we propose a mechanism to discover the crossover node within the tunnel between the MAP and the HA in an HMIPv6 network, assuming that the Next Steps in Signaling(NSIS) is deployed for the resource reservation and the aggregate reservation is applied over the MAP and HA tunnel. The local repair required for the change of path is performed upon the crossover node discovery. The simulation results show that the proposed scheme reduces the signaling delay for the reservation and outperforms the existing scheme with respect to throughput during the handover.

Distributed Certificate Authority under the GRID-Location Aided Routing Protocol (Ad hoc 네트워크에서 GRID-Location Aided Routing 프로토콜을 이용한 분산 CA 구성)

  • Lim, Ji-Hyung;Kang, Jeon-Il;Koh, Jae-Young;Han, Kwang-Taek;Nyang, Dae-Hun
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.15 no.6
    • /
    • pp.59-69
    • /
    • 2005
  • Ad hoc network is the network which can be considered without a pre-constructed infrastructure, and a mobile node can join the network freely. However, the participation of the mobile nodes to the ad hoc network brings up much burden of re-computation for new routes, because it leads to losing the connection frequently. And, also, it causes serious security problem to be broadcasted wrong information by the malicious user. Therefore, it needs authentication against the mobile nodes. To make that Possible, we have two methods: single CA and distributed CA. In the case of CA method, the wireless network can be collapsed owing to expose the CA, but still the distributed CA method is a little more safe than previous one because it needs attacks toward a lot of CAs to collapse the network We can consider Secret Share scheme as the method that constructs the distributed CA system, but it is weak when the network size is too large. In this paper, we suggest hierarchical structure for the authentication method to solve this problem, and we will show the results of simulation for this suggestion.

Clustering Technique of Intelligent Distance Estimation for Mobile Ad-hoc Network (이동 Ad-hoc 통신을 위한 지능형 거리추정 클러스터방식)

  • Park, Ki-Hong;Shin, Seong-Yoon;Rhee, Yang-Won;Lee, Jong-Chan;Lee, Jin-Kwan;Jang, Hye-Sook
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.11
    • /
    • pp.105-111
    • /
    • 2009
  • The study aims to propose the intelligent clustering technique that calculates the distance by improving the problems of multi-hop clustering technique for inter-vehicular secure communications. After calculating the distance between vehicles with no connection for rapid transit and clustering it, the connection between nodes is created through a set distance vale. Header is selected by the distance value between nodes that become the identical members, and the information within a group is transmitted to the member nodes. After selecting the header, when the header is separated due to its mobility, the urgent situation may occur. At this time, the information transfer is prepared to select the new cluster header and transmit it through using the intelligent cluster provided from node by the execution of programs included in packet. The study proposes the cluster technique of the intelligent distance estimation for the mobile Ad-hoc network that calculates the cluster with the Store-Compute-Forward method that adds computing ability to the existing Store-and-Forward routing scheme. The cluster technique of intelligent distance estimation for the mobile Ad-hoc network suggested in the study is the active and intelligent multi-hop cluster routing protocol to make secure communications.

Cluster Topology Algorithm for Efficient Data Transmission in Wireless Body Area Network based on Mobile Sink (WBAN 환경에서 효율적인 데이터 전송을 위한 모바일 싱크기반의 클러스터 토폴로지 알고리즘)

  • Lee, Jun-Hyuk
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.12
    • /
    • pp.56-63
    • /
    • 2012
  • The WBAN technology means a short distance wireless network which provides each device interactive communication by connecting devices inside and outside of body. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. Wireless body area network is usually configured in energy efficient using sensor and zigbee device due to the power limitation and the characteristics of human body. Wireless sensor network consist of sensor field and sink node. Sensor field are composed a lot of sensor node and sink node collect sensing data. Wireless sensor network has capacity of the self constitution by protocol where placed in large area without fixed position. Mobile sink node distribute energy consumption therefore network life time was increased than fixed sink node. The energy efficient is important matter in wireless body area network because energy resource was limited on sensor node. In this paper we proposed cluster topology algorithm for efficient data transmission in wireless body area network based mobile sink. The proposed algorithm show good performance under the advantage of grid routing protocol and TDMA scheduling that minimized overlap area on cluster and reduced amount of data on cluster header in error prone wireless sensor network based on mobile sink.

Dynamic States Consideration for Next Hop Nodes Selection Method to Improve Energy Efficiency in LEAP based Wireless Sensor Networks (LEAP기반의 무선 센서 네트워크에서 가변적 상태를 고려한 에너지 효율적 다음 홉 노드 선택 기법)

  • Nam, Su-Man;Cho, Tae-Ho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.6
    • /
    • pp.558-564
    • /
    • 2013
  • Wireless sensor networks (WSNs) contain limited energy resources and are left in open environments. Since these sensor nodes are self-operated, attacks such as sinkhole attacks are possible as they can be compromised by an adversary. The sinkhole attack may cause to change initially constructed routing paths, and capture of significant information at the compromised node. A localized encryption and authentication protocol (LEAP) has been proposed to authenticate packets and node states by using four types of keys against the sinkhole attack. Even though this novel approach can securely transmits the packets to a base station, the packets are forwarded along the constructed paths without checking the next hop node states. In this paper, we propose the next hop node selection method to cater this problem. Our proposed method evaluates the next hop node considering three factors (i.e., remaining energy level, number of shared keys, and number of filtered false packets). When the suitability criterion for next hop node selection is satisfied against a fix threshold value, the packet is forwarded to the next hop node. We aim to enhance energy efficiency and a detour of attacked areas to be effectively selected Experimental results demonstrate validity of the proposed method with up to 6% energy saving against the sinkhole attack as compared to the LEAP.

Study on Implementation of an MPLS Switch Supporting Diffserv with VOQ-PHB (Diffserv 지원 VOQ-PHB방식의 MPLS 스위치의 구현에 관한 연구)

  • 이태원;김영철
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.41 no.5
    • /
    • pp.133-142
    • /
    • 2004
  • Recently, the growth of Internet and a variety of multimedia services through Internet increasingly demands high-speed packet transmission, the new routing function, and QoS guarantee on conventional routers. Thus, a new switching mechanical called the MPLS(Multi-Protocol Label Switching), was proposed by IETF(Internet Engineering Task Force) as a solution to meet these demands. In addition the deployment of MPLS network supporting Differentiated Services is required. In this paper, we propose the architecture of the MPLS switch supporting Differentiated Services in the MPLS-based network. The traffic conditioner consists of a classifier, a meter, and a marker. The VOQ-PHB module, which combines input Queue with each PHB queue, is implemented to utilize the resources efficiently. It employs the Priority-iSLIP scheduling algorithm to support high-speed switching. We have designed and verified the new and fast hardware architecture of VOQ-PHB and the traffic conditioner for QoS and high-speed switching using NS-2 simulator. In addition, the proposed architecture is modeled in VHDL, synthesized and verified by the VSS analyzer from SYNOPSYS. Finally, to justify the validity of the hardware architecture, the proposed architecture is placed and routed using Apollo tool.

An Adaptive AODV Algorithm for Considering Node Mobility (노드 이동성을 고려한 적응형 AODV 알고리즘)

  • Hong, Youn-Sik;Hong, Jun-Sik;Lim, Hwa-Seok
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.6
    • /
    • pp.529-537
    • /
    • 2008
  • AODV routing protocol is intended for use by mobile' nodes in an ad-hoc network. In AODV nodes create routes on an on-demand basis. As the degree of node mobility becomes high, however, the number of the control packets, RREQ and RREP messages, have increased so rapidly. The unexpected increases in the number of the control packets cause the destination node to decrease the packet receiving rate and also to increase the overall energy consumption of such a network. In this paper, we propose a novel method of adaptively controlling the occurrences of such RREQ messages based on AIAD (additive increase additive decrease) under a consideration of the current network status. We have tested our proposed method with the conventional AODV and the method using timestamp based on the three performance metrics, i.e.. how long does node moves, node velocity, and node density, to compare their performance.

u-IT Based Plant Green Growth Environment Management System (u-IT 기반의 그린 생장환경 관리 시스템)

  • Kim, Jong-Chan;Cho, Seung-Il;Ban, Kyeong-Jin;Kim, Chee-Yong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.6
    • /
    • pp.1391-1396
    • /
    • 2011
  • A way to increase productivity in agriculture that is labor-centered industry is to graft IT technology. Today, many technologies in ubiquitous computing are deployed in all areas of society such as traffic control, automotive manufacturing, construction, defence, healthcare and clinical services. These IT technologies is gaining more attention as a fusion technology among traditional industries. To successfully build ubiquitous agriculture environment, it needs optimized core technology development for agriculture that includes sensor node H/W, middleware platform, routing protocol and agriculture environment application services. To achieve accurate botany growth environment management, we propose a green growth environment management system using environmental factor monitoring sensor and biological information sensors in greenhouse. By using our proposed system, it is expected to realize fusion complex agriculture technology with low cost.

The Regional transferring Model for Multicasting Service based on IP (IP 기반 멀티캐스트 서비스의 지역분할 전송 모델)

  • Jang, Kyung-Sung;Kim, Byung-Ki
    • The KIPS Transactions:PartC
    • /
    • v.8C no.5
    • /
    • pp.637-646
    • /
    • 2001
  • The multicasting telecommunication is an important research as an applicable technique in the development of adaptable technique for modern mobile computing and mobile IP, because that is supposed to be a solution for transferring the large-size information on the mobile and wireless network with the narrow bandwidth. This paper will suggest one solution for the bidirectional tunneling and the local re-registration problems to support transferring mobile multicasting datagram by the partitioned network. The bidirectional tunneling technique is in use for mobile host moving around in a region and the local re-registration technique for crossing regions to reduce traffic load caused by transferring datagram along a long distance, and we compare those models with our suggested model by simulation.

  • PDF