• Title/Summary/Keyword: Network Routing Protocol

Search Result 1,135, Processing Time 0.032 seconds

A Design and Implementation of modified ZigBee using the Directed-Messaging for Energy Efficiency Improvement (에너지 효율성 향상을 위하여 방향성 메시징을 사용하는 수정된 지그비의 설계 및 구현)

  • Khil, A-Ra
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.10
    • /
    • pp.99-105
    • /
    • 2012
  • ZigBee is the low power, low cost and low data rate wireless personal area network(LR-WPAN) standard. The Directed-Messaging is the protocol which improves the energy efficiency through reducing the redundant message transmission by transmitting messages with directional information toward the specified sub-network area in wireless sensor network using broadcasting. In this paper, we design and implement the experimental grid sensor network using ZigBee modified by the Directed-Messaging for the energy efficiency improvement. The experimental sensor network in this paper is configured with Nano24 supporting the ADV message and the routing management module modified to use the directional information. The energy efficiency improvement of the experimental sensor-network by evaluating the experimental results according to transmitting ADV message.

Clustering Scheme using Memory Restriction for Wireless Sensor Network (무선센서네트워크에서 메모리 속성을 이용한 클러스터링 기법)

  • Choi, Hae-Won;Yoo, Kee-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1B
    • /
    • pp.10-15
    • /
    • 2009
  • Recently, there are tendency that wireless sensor network is one of the important techniques for the future IT industry and thereby application areas in it are getting growing. Researches based on the hierarchical network topology are evaluated in good at energy efficiency in related protocols for wireless sensor network. LEACH is the best well known routing protocol for the hierarchical topology. However, there are problems in the range of message broadcasting, which should be expand into the overall network coverage, in LEACH related protocols. Thereby, this paper proposes a new clustering scheme to solve the co-shared problems in them. The basic idea of our scheme is using the inherent memory restrictions in sensor nodes. The results show that the proposed scheme could support the load balancing by distributing the clusters with a reasonable number of member nodes and thereby the network life time would be extended in about 1.8 times longer than LEACH.

Network Management for the GSMP Open Interface in the MPLS (MPLS의 GSMP 개방형 인터페이스를 위한 망 관리)

  • Cha, Yeong-Uk;Kim, Jin-Nyeon;Kim, Chun-Hui
    • The KIPS Transactions:PartC
    • /
    • v.9C no.2
    • /
    • pp.227-234
    • /
    • 2002
  • MPLS which integrates routing of layer 3 and switching of layer 2, enables support for fast forwarding, traffic engineering and virtual private network services. GSMP is open interface protocol between a label switch and a controller, and it provides connection, configuration, event, performance management and synchronization. In the GSMP open interface, the functions of network management can be located either in the controller or in the label switch. To simplify the label switch and enhance the efficiency of resources, we adopt the network management model, in which the SNMP agent is located in the controller and is interworked with the GSMP. We presented the interworking scenrios between the GSMP and the network management of MPLS. We implemented the controller to verify the realization of our adopted network management model, and measured the connection setup delay of the provisioned connection.

A Performance Comparison of Flooding Schemes in Wireless Sensor Networks (무선센서네트워크에서 플러딩 기법의 성능평가)

  • Kim, Kwan-Woong;Cho, Juphil
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.6
    • /
    • pp.153-158
    • /
    • 2016
  • Broadcasting in multi-hop wireless sensor networks is a basic operation that supports many applications such as route search, setting up addresses and sending messages from the sink to sensor nodes. The broadcasting using flooding causes problems that can be mentioned as a broadcasting storm such as redundancy, contention and collision. A variety of broadcasting schemes using wireless sensor networks have been proposed to achieve superior performance rather than simple flooding scheme. Broadcasting algorithms in wireless sensor networks can be classified into six subcategories: flooding scheme, probabilistic scheme, counter-based scheme, distance-based scheme, location-based schemes, and neighbor knowledge-based scheme. This study analyzes a simple flooding scheme, probabilistic scheme, counter-based scheme, distance-based scheme, and neighbor knowledge-based scheme, and compares the performance and efficiency of each scheme through network simulation.

Transmission of Multimedia Traffic over Mobile Ad-hoc Networks (모바일 ad-hoc 네트워크에서 멀티미디어 트래픽 전송)

  • Kim, Young-Dong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.1
    • /
    • pp.95-101
    • /
    • 2005
  • In this paper, some performance characteristics of multimedia traffic for mobile ad-hoc networks is studied with simulations. Synthetic streaming video is considered as the multimedia traffic for MPEG-coded video in the simulation. The synthetic video stream is generated with a video stream generation algorithm. The algorithm generate VBR traffics for MPEG video streams with special predefined GOP(group of pictures) patterns that is consisted of a sequence of I(intra-coded), P(predicted-coded) and B(bidirectional-coded) frames. The synthetic VBR streams is transmitted through UDP protocol with on-demand mobile ad-hoc network routing protocols like as AODV and DSR. And performances for video streams through mobile ad-hoc networks is evaluated, the throughputs is compared between data and video traffics.

A Simple Cooperative Transmission Protocol for Energy-Efficient Broadcasting Over Multi-Hop Wireless Networks

  • Kailas, Aravind;Thanayankizil, Lakshmi;Ingram, Mary Ann
    • Journal of Communications and Networks
    • /
    • v.10 no.2
    • /
    • pp.213-220
    • /
    • 2008
  • This paper analyzes a broadcasting technique for wireless multi-hop sensor networks that uses a form of cooperative diversity called opportunistic large arrays (OLAs). We propose a method for autonomous scheduling of the nodes, which limits the nodes that relay and saves as much as 32% of the transmit energy compared to other broadcast approaches, without requiring global positioning system (GPS), individual node addressing, or inter-node interaction. This energy-saving is a result of cross-layer interaction, in the sense that the medium access control (MAC) and routing functions are partially executed in the physical (PHY) layer. Our proposed method is called OLA with a transmission threshold (OLA-T), where a node compares its received power to a threshold to decide if it should forward. We also investigate OLA with variable threshold (OLA-VT), which optimizes the thresholds as a function of level. OLA-T and OLA-VT are compared with OLA broadcasting without a transmission threshold, each in their minimum energy configuration, using an analytical method under the orthogonal and continuum assumptions. The trade-off between the number of OLA levels (or hops) required to achieve successful network broadcast and transmission energy saved is investigated. The results based on the analytical assumptions are confirmed with Monte Carlo simulations.

The MANET based Distributed Control Communications for Remote Controlled drones (원거리 드론 제어를 위한 MANET기반의 분산제어 통신)

  • Jeong, Seong Soon;Kwon, Ki Mun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.5
    • /
    • pp.168-173
    • /
    • 2016
  • The latest drone market is evolving rapidly. The commercial drone market developed rapid growth. Up to now, one controller had controlled the only one drone. So Remote control and information collection of the remote drone was impossible. Therefore we suggests drone intercommunication distributed network based on the MANET. Subsequently classified according to the characteristics of the drone intercommunication distributed network(speed, distance, applications) and chose a MANET routing protocol in accordance with the classification result.

Classification and Analysis of Mobility Patterns in Nested NEMO Network (중첩 NEMO 환경에서 이동 패턴 분류 및 분석에 대한 연구)

  • Lim, Hyung-Jin;Chung, Tai-Myoung
    • Journal of Internet Computing and Services
    • /
    • v.9 no.4
    • /
    • pp.29-41
    • /
    • 2008
  • Currently, IETF MANEMO(Mobile Adhoc for NEMO) working group is working on standardization supporting internal routing in nested NEMO networks. Nested NEMO has a independent topology feature that Mobile IP and basic NEMO protocol did not caused. This is the reason that causes exceptional mobility pattern. Such mobility patterns also trigger each other reconfiguration requirements. This paper classified and analyzed probable new mobility patterns in nested NEMO network. In concludion, we derived configuration problem from the new mobility patterns and suggested differential reconfiguration requirements through analytical approach.

  • PDF

Quickest Path Based Integrated Routing Algorithms for Different Network Router Mechanisms (이종 라우팅 메커니즘을 위한 quickest path 기반 통합 라우팅 알고리즘)

  • Bang Young-Cheol;Chung Sung-Taek
    • Journal of Internet Computing and Services
    • /
    • v.7 no.1
    • /
    • pp.143-150
    • /
    • 2006
  • The quickest path problem deals with the transmission of a message of size ${\sigma}$ from a source to a destination with the minimum end to end delay over a network with bandwidth and delay constraints on the links. We consider two basic modes and four variations for the message delivery at the nodes reflecting the mechanisms such as circuit switching. Internet protocol, and their combinations, For each of first five modes, we present O($m^2+mnlogn$) algorithm to compute the quickest path for a given message size ${\sigma}$, For the last mode, the quickest path can be computed in O(m+nlogn) time.

  • PDF

A Study on the Efficient ATICC(Adaptive Time Interval Clustering Control) Algorithm for MANET (MANET에서 효율적인 ATICC(Adaptive Time Interval Clustering Control) 알고리즘에 대한 연구)

  • Kim, Young-sam;Lee, Kang-whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.306-309
    • /
    • 2009
  • MANET(Mobile Ad-hoc Network)은 기간망에 의존하지 않는 이동 노드들로 구성된 자율망 또는 추론망 토폴로지에 의한 멀티홉 무선 네트워크이다. MANET을 구성하는 각 노드의 이동성, 속도 그리고 에너지와 같은 다양한 속성정보는 망의 특징과 운영을 결정하는 요인이다. 특히 망의 운영상, 전송 대역폭과 에너지 사용에 따른 제약을 가지며 이러한 특징을 고려한 라우팅 프로토콜의 설계 및 하드웨어 개발이 중요하게 요구된다. 본 논문에서는 계층적 클러스터 구조의 MANET 환경에서 노드의 에너지 속성과 네트워크의 트래픽 상태를 고려한 적응적 시간차 노드관리 기법인 ATICC(Adaptive Time Interval Clustering Control)을 제안한다. 제안된 ATICC은 시간차 노드 관리기법인 TICC(Time Interval Clustering Control)[1]에 기반하며 노드에 최적화된 Active/Sleep, Idle Listening 상태를 적응적으로 설정한 후 패킷을 전송함으로서 계층적 클러스터 내의 각 노드의 균형적인 에너지 소모를 이루는 에너지 효율적인 방식이다. 제안한 노드관리 방법은 기존의 LEACH, TICC과 비교 실험하고 그 성능을 검증하였다. 실험 결과, 제안한 노드관리 방법이 노드별 에너지 소모량을 줄였으며 전체 네트워크의 생존시간을 연장함으로서 기존의 방법 보다 우수함을 확인하였다.

  • PDF