• 제목/요약/키워드: Routing protocol

검색결과 1,467건 처리시간 0.024초

자율구성 계층구조 애드혹 네트워크를 위한 상호 연동방식의 토폴로지 탐색 및 라우팅 프로토콜 (A Joint Topology Discovery and Routing Protocol for Self-Organizing Hierarchical Ad Hoc Networks)

  • 양서민;이혁준
    • 정보처리학회논문지C
    • /
    • 제11C권7호
    • /
    • pp.905-916
    • /
    • 2004
  • 자율구성 계층구조 에드혹 네트워크(Self-organizing hierarchical ad hoc network, SOHAN)는 편평구조 에드혹 네트워크의 확장성을 향상시키기 위해 설계된 새로운 형태, 즉, 액세스 포인트, 전달 노드, 이동 노드의 3 계층의 애드혹 노드로 구성된 네트워크 구조이다. 본 논문에서는 SOHAN의 자율구성을 위한 토폴로지 탐색과 라우팅 프로토콜을 소개한다. 또한 높은 전송 용량을 갖는 최적의 클러스터 기반 계층구조 토폴로지를 형성하기 위한 링크 품질 및 MAC 지연 시간 기반의 크로스레이어 설계방식의 경로 척도를 제안한다. 토폴로지 탐색 프로토콜은 2.5 계층에서 MAC 주소를 기반으로 동작하는 라우팅 프로토콜을 위한 기본적인 정보를 제공한다. 이 라우팅 프로토콜은 AODV 프로토콜을 기반으로 하며, 계층구조의 장점을 활용하기 위해 토폴로지 탐색 프로토콜과 상호 연동하도록 설계된다. 시뮬레이션을 통해 전송용량, 종단간 지연시간, 패킷 전달률, 제어 오버헤드 관점에서 SOHAN의 우수한 성능과 확장성을 보인다.

무선 메쉬 네트워크에서의 응용 서비스 인지 라우팅 프로토콜 선택 기법 (Application-aware Routing Protocol Selection Scheme in Wireless Mesh Network)

  • 최효현;손태식;박용석
    • 대한전자공학회논문지TC
    • /
    • 제46권6호
    • /
    • pp.103-110
    • /
    • 2009
  • 본 논문은 무선 메쉬 네트워크에서의 응용의 특징에 따른 라우팅 프로토콜 선택 방법에 대해서 제안한다. 각 응용들은 생성되는 평균 패킷 크기와 같은 서로 구분되는 특징을 가지고 있다. 예를 들자면, 텍스트 메신저는 작은 크기의 패킷을 주로 발생시키며, 파일 전송 응용의 경우는 큰 크기의 패킷을 주로 발생시킨다. 또한, 라우팅 프로토콜도 각기 다른 특징을 가진 경로를 설정한다. 최단 거리의 홉을 설정하는 라우팅 프로토콜과 홉 수는 보다 증가하더라도 높은 bandwidth를 가지는 링크로 경로를 구성하는 라우팅 프로토콜 등 각각의 특징을 가진 라우팅 프로토콜이 존재한다. 제안하는 방안은 서로 다른 응용의 특성을 제일 잘 반영시킬 수 있는 경로를 설정할 수 있도록 라우팅 프로토콜을 선택하는 방법론을 제시한다. 본 논문은 제안하는 방법이 반영되어 검증 및 구현된 메쉬 네트워크 시스템과 이에 대한 실험 결과를 보인다.

노드의 악의적 행위패턴 및 신뢰수준 기반의 MANET Secure 라무팅 방안 (A Secure Routing Protocol in MANET based on Malicious behavior Pattern of Node and Trust Level)

  • 박성승;박건우;류근호;이상훈
    • 한국컴퓨터정보학회논문지
    • /
    • 제14권5호
    • /
    • pp.103-117
    • /
    • 2009
  • 최근 MANET(Mobile Ad-Hoc Network)에서 보안요소를 추가한 라우팅 연구가 활발히 진행되어왔다. 그러나 기존 연구들은 secure 라우팅 또는 패킷 자체에 대한 악의적인 행위 탐지 중 어느 한 측면에 대해서만 연구가 되어왔다. 본 논문에서는 패킷 자체에 대한 악의적인 행위 및 라우팅 측면에서 보안 요소를 모두 고려한 SRPPnT(A Secure Routing Protocol in MANET based on Malicious Pattern on Node and Trust Level)를 제안한다. SRPPnT는 악의적인 행위가 이루어진 노드를 확인하여 각 노드에 대한 신뢰수준을 측정 후, 획득한 각 노드의 신뢰수준에 따라 라우팅 경로를 설정함으로써 패킷 및 라우팅 경로 설정에 대해 이루어질 수 있는 악의적인 행위를 효율적으로 대응할 수 있다. SRPPnT는 AODV(Ad-Hoc On-Demand Distance Vector Routing)를 기반으로 하였다. NS 네트워크 시뮬레이션 결과를 통해, 제안된 SRPPnT는 기존 프로토콜보다 네트워크 부하를 감소시킨 상태에서 악의적인 노드의 보다 정확하고 신속한 식별과 secure한 라우팅이 이루어짐을 확인하였다.

A Genetic-Algorithm-Based Optimized Clustering for Energy-Efficient Routing in MWSN

  • Sara, Getsy S.;Devi, S. Prasanna;Sridharan, D.
    • ETRI Journal
    • /
    • 제34권6호
    • /
    • pp.922-931
    • /
    • 2012
  • With the increasing demands for mobile wireless sensor networks in recent years, designing an energy-efficient clustering and routing protocol has become very important. This paper provides an analytical model to evaluate the power consumption of a mobile sensor node. Based on this, a clustering algorithm is designed to optimize the energy efficiency during cluster head formation. A genetic algorithm technique is employed to find the near-optimal threshold for residual energy below which a node has to give up its role of being the cluster head. This clustering algorithm along with a hybrid routing concept is applied as the near-optimal energy-efficient routing technique to increase the overall efficiency of the network. Compared to the mobile low energy adaptive clustering hierarchy protocol, the simulation studies reveal that the energy-efficient routing technique produces a longer network lifetime and achieves better energy efficiency.

Associativity-Based On-Demand Multi-Path Routing In Mobile Ad Hoc Networks

  • Rehman, Shafqat Ur;Song, Wang-Cheol;Park, Gyung-Leen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제3권5호
    • /
    • pp.475-491
    • /
    • 2009
  • This paper is primarily concerned with multi-path routing in Mobile Ad hoc Networks (MANETs). We propose a novel associativity-based on-demand source routing protocol for MANETs that attempts to establish relatively stable path(s) between the source and the destination. We introduce a new notion for gauging the temporal and spatial stability of nodes, and hence the paths interconnecting them. The proposed protocol is compared with other unipath (DSDV and AODV) and multi-path (AOMDV) routing protocols. We investigate the performance in terms of throughput, normalized routing overhead, packet delivery ratio etc. All on-demand protocols show good performance in mobile environments with less traffic overhead compared to proactive approaches, but they are prone to longer end-to-end delays due to route discovery and maintenance.

Building Efficient Multi-level Wireless Sensor Networks with Cluster-based Routing Protocol

  • Shwe, Hnin Yu;Kumar, Arun;Chong, Peter Han Joo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권9호
    • /
    • pp.4272-4286
    • /
    • 2016
  • In resource constrained sensor networks, usage of efficient routing protocols can have significant impact on energy dissipation. To save energy, we propose an energy efficient routing protocol. In our approach, which integrates clustering and routing in sensor networks, we perform network coding during data routing in order to achieve additional power savings in the cluster head nodes. Efficacy of the proposed method in terms of the throughput and end-to-end delay is demonstrated through simulation results. Significant network lifetime is also achieved as compared with other techniques.

Efficient Multicast Tree Construction in Wireless Mesh Networks

  • Nargesi, Amir-Abbas;Bag-Mohammadi, Mozafar
    • Journal of Communications and Networks
    • /
    • 제16권6호
    • /
    • pp.613-619
    • /
    • 2014
  • Multicast routing algorithms designed for wireline networks are not suitable for wireless environments since they cannot efficiently exploit the inherent characteristics of wireless networks such as the broadcast advantage. There are many routing protocols trying to use these advantages to decrease the number of required transmissions or increase the reception probability of data (e.g., opportunistic routing).Reducing the number of transmissions in a multicast tree directly decreases the bandwidth consumption and interference and increases the overall throughput of the network. In this paper, we introduce a distributed multicast routing protocol for wireless mesh networks called NCast which take into account the data delivery delay and path length when constructing the tree. Furthermore, it effectively uses wireless broadcast advantage to decrease the number of forwarding nodes dynamically when a new receiver joins the tree.Our simulation results show that NCast improves network throughput, data delivery ratio and data delivery delay in comparison with on demand multicast routing protocol. It is also comparable with multichannel multicast even though it does not use channeling technique which eliminates the interference inherently.

이동 애드 혹 네트워크를 위한 자가치유 라우팅기법에 관한 연구 (A Self-Healing Routing Technique for Mobile Ad Hoc Networks)

  • 박성호;윤원식
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2006년도 하계종합학술대회
    • /
    • pp.167-168
    • /
    • 2006
  • Mobile Ad Hoc Networks (MANETs) has the characteristics such as dynamic network topology, constrained power capacity, constrained wireless bandwidth and quality, etc. For MANETs AODV (Ad-Hoc On-Demand Distance Vector) routing protocol has been proposed. However AODV routing protocol has some inefficiency related to re-routing path establishment corresponding to node's failure. In this paper, we propose a Self-Healing Routing Technique for MANETs that uses the one-hop nodes from the failed node to set up the routing path efficiently. We also include simulation results to show the performance of our method.

  • PDF

B-ISDN에서 점 대 점 다중연결 호를 위한 효율적인 신호프로토콜 (An efficient signaling protocol for point-to-point multi-connection call in B-ISDN)

  • 배상재;조현철;주언경
    • 전자공학회논문지S
    • /
    • 제34S권12호
    • /
    • pp.1-9
    • /
    • 1997
  • The signaling protocol for B-ISDN should support variety of services including point-to-pont single-connection call, point-to-point multi-connection call and point-to-multipoint connection call. an efficient signaling protocol for point-to-point multi-connection call based on ITU-T Recommendation Q.298X is presented in this paper. Sequential establishment of madatory and optional connections and common routing scheme for synchronization, along with separation of information elements for establishement of multi-connection call are included in the proposed signaling protocol. Limited network resources can be used more efficiently by proposed sequential establishement of mandartory and optional connection for point-to-point multi-connection call which can provide multimedia services. And common routing can be provided effectively by proposed common routing scheme for connectios requiring synchronization like as video-phone and video-conference.

  • PDF

Efficient Routing Protocol to Select a High-Performance Route in Wireless Mesh Networks

  • Youn, Joo-Sang
    • Journal of information and communication convergence engineering
    • /
    • 제7권2호
    • /
    • pp.185-192
    • /
    • 2009
  • In wireless mesh networks multi-rate technology environment, a mesh node can dynamically modify the data transmission rate on a particular link, in response to link distance, or more accurately, the perceived SNR ratio between neighbor nodes. In such networks, existing route selection schemes use a link quality metric. Thus, these schemes may easily result in the network being overloaded. In this paper, a new route metric is proposed; it considers both per-hop service delay and link quality at mesh nodes. In addition, the Load-Aware AODV (LA-AODV) protocol using the proposed metric is presented. The performance evaluation is performed by simulation using the OPNET simulator. It is demonstrated that the LA-AODV protocol outperforms the existing routing protocols using other existing route metrics in multi-rate WMN environment.