• Title/Summary/Keyword: hop

Search Result 1,605, Processing Time 0.021 seconds

Adaptive Differentiated Integrated Routing Scheme for GMPLS-based Optical Internet

  • Wei, Wei;Zeng, Qingji;Ye, Tong;Lomone, David
    • Journal of Communications and Networks
    • /
    • v.6 no.3
    • /
    • pp.269-279
    • /
    • 2004
  • A new online multi-layer integrated routing (MLIR) scheme that combines IP (electrical) layer routing with WDM (optical) layer routing is investigated. It is a highly efficient and cost-effective routing scheme viable for the next generation integrated optical Internet. A new simplified weighted graph model for the integrated optical Internet consisted of optical routers with multi-granularity optical-electrical hybrid switching capability is firstly proposed. Then, based on the proposed graph model, we develop an online integrated routing scheme called differentiated weighted fair algorithm (DWFA) employing adaptive admission control (routing) strategies with the motivation of service/bandwidth differentiation, which can jointly solve multi-layer routing problem by simply applying the minimal weighted path computation algorithm. The major objective of DWFA is fourfold: 1) Quality of service (QoS) routing for traffic requests with various priorities; 2) blocking fairness for traffic requests with various bandwidth granularities; 3) adaptive routing according to the policy parameters from service provider; 4) lower computational complexity. Simulation results show that DWFA performs better than traditional overlay routing schemes such as optical-first-routing (OFR) and electrical-first-routing (EFR), in terms of traffic blocking ratio, traffic blocking fairness, average traffic logical hop counts, and global network resource utilization. It has been proved that the DWFA is a simple, comprehensive, and practical scheme of integrated routing in optical Internet for service providers.

Automatic Node Configuration Protocol for Small Sized Mobile Ad-Hoc Networks (소규모 이동 애드혹 네트워크에서의 자동 노드 설정 프로토콜)

  • Lee Hyewon K.;Mun Youngsong
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.1
    • /
    • pp.100-109
    • /
    • 2005
  • A Mobile Ad-Hoc Network (MANET) supports a multi-hop wireless network without any prepared base station (BS). The MANET is capable of building a mobile network automatically without any help from DHCP servers for address allocation or routers to forward or route messages. Many routing protocols have been proposed for the MANET, but these specify the most optimized or shortest path from a source to a destination, and they assume that nodes are pre-configured before communication. To make up for this, address allocation algorithms, such as MANETConf [1] and prophet address allocation algorithm [2], have been proposed. Especially, MANETConf proposes address allocation algorithm with duplication address check. In this paper, we present a dynamic node configuration protocol based on 2-tierd hierarchical network architecture for mobile ad-hoc network, modified from [1]. Especially, it reduces the number of broadcast message exchange between nodes when a new node somes into a network, which lessens network overhead, remarkably. This protocol is based on two-tired structure, and it ensures address allocation with simple duplication address defection mechanism.

A Mechanism to Support Scalability for Network Mobility (확장성 있는 네트워크 이동성 지원 방안)

  • Kim Taeeun;Lee Meejeong
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.1
    • /
    • pp.34-50
    • /
    • 2005
  • Recently, various proposals for supporting network mobility, which provides efficient Internet access when a network formed within a vehicle moves around as a unit, have emerged. The schemes in those proposals, though, manifest some major drawbacks with respect to scalability: If the number of mobile nodes within a mobile network is large, the handoff latency would increase greatly, causing communication disruption; Data delivery to a node within a nested mobile network nay suffer extremely inefficient pinball routing. We propose a scalable network mobility supporting mechanism named SNEMOS (Scalable NEtwork Mobility Support), which resolves the above two major problems of the existing schemes. The performance of SNEMOS is compared with the existing schemes through extensive simulations. The numerical results show that SNEMOS outperforms the existing schemes with respect to handoff latency hop counts of routing paths, packet delivery time, header overhead in data packets, and signaling overhead.

Design of Border Surveillance and Control System Based on Wireless Sensor Network (WSN 기반 국경 감시 및 제어 시스템 설계)

  • Hwang, Bo Ram;An, Sun Shin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.1
    • /
    • pp.11-14
    • /
    • 2015
  • WSN (Wireless Sensor Network) based on low-power is one of the core technologies in the ubiquitous society. In this paper, we present a border surveillance and control system in WSN environment. The system consists of static sensor node, mobile sensor node, static gateway, mobile gateway, server and mobile application. Mobile applications are divided into user mode and manager mode. So users monitor border surveillance through mobile phone and get information of border network environment without time and space constraints. In manager mode, for the flexible operation of nodes, manager can update to the software remotely and adjust the position of the mobile node. And also we implement a suitable multi-hop routing protocol for scalable low-power sensor nodes and confirm that the system operates well in WSN environment.

Random Backoff Scheme of Emergency Warning Message for Vehicle-to-Vehicle Communications (차량 간 통신에서 충돌을 완화하기 위한 랜덤 백오프 방안)

  • Byun, Jae-Uk;Kwon, Sung-Oh
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.3B
    • /
    • pp.165-173
    • /
    • 2012
  • In this paper, we propose a random backoff scheme for Emergency Warning Messages (EWMs) in the vehicle-to-vehicle environment. The EWMs are disseminated from a vehicle that detects an emergency situation to other vehicles in a multi-hop fashion. Since the vehicle-to-vehicle communication based on IEEE 802.11 adapts CSMA/CA, the density of vehicles increase the probability of collisions between transmissions. Moreover, in the presence of background traffic, the EWM should have a higher priority than that of other messages in neighboring vehicles. To that end, we propose the Distant-Dependent Adaptive Backoff (DDAB) scheme, which set a different contention window for random backoff depending on the distance from the sender to the receiver. In the case when a vehicle is expected to located in the outskirts of the communication boundary, the proposed scheme makes the contention window size small in order to compete the background traffic transmission. Otherwise the contention window is set to a large number to reduce the collision possibility among the EWM transmissions. Via simulations, we show that the proposed scheme performs better than the previous schemes for EWM.

Cooperative Analog and Digital (CANDI) Time Synchronization for Large Multihop Network (다중 홉 네트워크를 위한 디지털 및 아날로그 협동 전송 시간 동기화 프로토콜)

  • Cho, Sung-Hwan;Ingram, Mary Ann
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.11
    • /
    • pp.1084-1093
    • /
    • 2012
  • For large multihop networks, large time synchronization (TS) errors can accumulate with conventional methods, such as TPSN, RBS, and FTSP, since they need a large number of hops to cover the network. In this paper, a method combining Concurrent Cooperative Transmission (CCT) and Semi- Cooperative Spectrum Fusion (SCSF) is proposed to reduce the number of hops to cover the large network. In CCT, cooperating nodes transmit the same digitally encoded message in orthogonal channels simultaneously, so receivers can benefit from array and diversity gains. SCSF is an analog cooperative transmission method where different cooperators transmit correlated information simultaneously. The two methods are combined to create a new distributed method of network TS, called the Cooperative Analog and Digital (CANDI) TS protocol, which promises significantly lower network TS errors in multi-hop networks. CANDI and TPSN are compared in simulation for a line network.

Dual-Radio Tag System for RFID Tag Mesh Networking (RFID 태그간 메쉬 네트워킹을 위한 듀얼 라디오 태그 시스템)

  • Kim, Jin-Hwan;Yoo, Young-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.11B
    • /
    • pp.1272-1282
    • /
    • 2009
  • This paper consists of two parts: the protocol for tag-to-tag mesh network and the implementation of dual-radio RFID system. Recently, RFID has been adopted in ports or warehouse, being attached to containers and palettes for loading/unloading automation. However, the RFID system has encountered one problem - some tags cannot receive any command from reader intermittently due to signal interference by containers or field equipments (e. g. cranes and yard tractors). This area where reader signal cannot reach is called dead-zone. The proposed method for solving the dead-zone problem is as follows. A zone which can be communicated directly between readers and tags communicates in 433MHz frequency band in compliance with ISO/IEC 18000-7 standard. On the other hand, dead-zone communicates in 2.4GHz frequency band by using tag-to-tag mesh network in compliance with IEEE 802.15.4 standard. The proposed method can not only save much cost to install additional readers but also help resolve the dead-zone problem. Furthermore, it can provide the easier, faster, and more economical network infrastructure.

One-way Short-range Communication using Channel Symbol of Color Light Signal based on USN environment (USN 환경에서 색 광신호를 채널 부호화한 단거리 단방향 통신)

  • Lee, Gong;Jeon, Young-Jun;Shin, Seung-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.4C
    • /
    • pp.437-445
    • /
    • 2009
  • Node of USN(Ubiquitous Sensor Network) environments uses radio based communication mechanism for a delivering message. Thus the multiple hop flooding is necessary for considering limited power and communicating unknown node long-range. However if there are many unknown nodes located in users' vision, the flooding of the radio base is insufficient alternative. Thus as a flash may be used to find a key in a darkness, a more direct and short range communication system is required. This study shall resolve such question through 2 different steps. First a Two kind of code method that convert Text message to color code shall be suggested. Second a hardware module, which may deliver various LED(light-emitting diode) color signal, shall be developed. The experiment may take place by fixing the entry angle of light and distance by setting a specific element as a standard mean.

A Channel Estimation Technique Based on Pilot Tones for OFDM Systems with a Symbol Timing Offset (시간 동기 옵셋을 갖는 OFDM 시스템을 위한 파일럿 톤 기반의 채널 추정 기법)

  • Park, Chang-Hwan;Kim, Jae-Kwon;Lee, Hee-Soo;Cho, Yong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.10A
    • /
    • pp.992-1003
    • /
    • 2007
  • In this paper, a channel estimation technique based on pilot tones, which does not degrade channel estimation performance even with the existence of symbol timing offset (STO) in OFDM systems, is proposed. The proposed technique performs channel estimation by interpolating channels with respect to amplitude and phase with a minimum computational complexity, differently from the conventional interpolation techniques. The proposed technique requires neither the estimation of fine STO in advance nor trigonometric operation for phase interpolation, signifying a significant reduction in computational complexity. Since the performance of the proposed technique does not depend on the STO present in OFDM systems. It can be directly applied to the following areas in OFDM-based communication system: elimination of fine STO estimation step in the synchronization procedure, elimination of STO estimation step in multiuser uplink, and channel estimation in multi-hop relay system. It is verified by computer simulation that the proposed technique can improve the performance of channel estimation significantly in the presence of STOs, compared with previous channel estimation techniques based on pilot tones.

Implementation of LMPR on TinyOS for Wireless Sensor Network (전송 부하를 분산하는 무선 센서 네트워크 구축을 위한 TinyOS 기반 LMPR 구현)

  • Oh, Yong-Taek;Kim, Pung-Hyeok;Jeong, Kug-Sang;Choi, Deok-Jai
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.12
    • /
    • pp.136-146
    • /
    • 2006
  • In Wireless Sensor Network(WSN) a sensor node transfers sensing data to the base-node through multi-hop because of the limited transmission range. Also because of the limited energy of the sensor node, the sensor nodes are required to consume their energy evenly to prolong the lifetime of the network. LMPR is a routing protocol for WSN, LMPR configures the network autonomously based on level which is the depth from the base-node, and distributes the transmission and computation load of the network to each sensor node. This paper implements LMPR on TinyOS and experiments on the performance of LMPR in WSN. As the result, the average of the received rate of LMPR is 91.39% and LMPR distributes the load of the transmission and computation about 4.6 times compare to the shortest cost routing protocol. We expect LMPR evenly distributes the transmission and computation load of the network to each node, and the lifetime of the network will be longer than it used to be.

  • PDF