• Title/Summary/Keyword: Routing

Search Result 4,362, Processing Time 0.029 seconds

Understanding Channel-diversity Oriented Routing Metrics for Multicast in Wireless Mesh Networks

  • Gao, Hui;Nam, Ji-seung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.05a
    • /
    • pp.418-420
    • /
    • 2013
  • Issues on design of routing scheme and routing metric for multicast in multi-channel multi-radio (MCMR) wireless mesh networks (WMNs) are discussed. Emphasis is placed on channel-diversity oriented routing metrics. From case study the conclusion to be drawn is that the key for design of channel-diversity oriented routing metrics is how to construct an optimization function to quantify interdependence between channel assignment and multicast routing throughput.

Automatic Placement and Routing System for Gate Array (게이트 어레이의 자동 배치, 배선 시스템)

  • 이건배;정정화
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.25 no.5
    • /
    • pp.572-579
    • /
    • 1988
  • In this paper, a system of automatic placement and routing for gate array layout design is proposed. In the placement stage, the circuit is partitioned and using the concept of min-cut slicing, and each partitioned module is placed, so that the routing density over the entire chip be uniformized and the total wiring length be minimized. In the global routing stage, the concept of the probabilistic routing density is introduced to unify the wiring congestions in each channel. In the detailed routing stage, the multi-terminal nets are partitioned into the two-terminal nets. The ordered channel graph is proposed which implies the vertical and the horizontal constranint graphs simultaneously. And using the ordered channel graph, the proposed routing algorithm assigns the signal nets to the tracks. Also the proposed placement and routing algorithms are implimented on IBM/PC-AT to construct PC-level gate array layout system.

  • PDF

Cluster Routing for Service Lifetime of Wireless Multimedia Sensor Networks (무선 멀티미디어 센서 네트워크의 서비스 수명을 위한 클러스터 라우팅)

  • Lee, Chongdeuk
    • Journal of Digital Convergence
    • /
    • v.11 no.5
    • /
    • pp.279-284
    • /
    • 2013
  • This paper proposes a new cluster-based routing protocol for assuring the service lifetime of wireless multimedia sensor networks. The proposed protocol performs the intra-cluster routing and inter-cluster routing to reduce the energy consumption and service lifetime in the wireless sensor multimedia computing environment, and the proposed mechanism enhances the routing reliability, and it minimizes the packet loss, overhead, and energy consumption. The simulation results show that the proposed mechanism outperforms DSR and AODV.

Interference Aware Multipath Routing in Multi-rate Wireless Sensor Networks

  • Lee, Kang Gun;Park, Hyung Kun
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.8
    • /
    • pp.909-914
    • /
    • 2015
  • In wireless sensor networks, sensor nodes have a short transmission range and data is transferred from source to destination node using the multi-hop transmission. Sensor nodes are powered by battery and the link qualities are different, and the routing protocol in the wireless sensor network is one of the important technical issues. Multipath routing was proposed to reduce the data congestion and increase data throughput. In the multipath routing, however, each path can be interfered by the other path, and it can aggravate network performance. In this paper, we propose the multipath routing scheme for multi-rate wireless sensor networks. The multipath routing selects transmission paths to minimize transmission delay and path interference.

A Switchbox Router using Divide-and-Conquer Technique (Divide and Conquer 기법을 사용한 스위치박스 배선기)

  • 이성호;정종화
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.30A no.3
    • /
    • pp.104-113
    • /
    • 1993
  • A new switchbox router, called CONQUEROR, is proposed in this paper. The proposed CONQUEROR efficiently routes large switchbox routing area using divide-and-conquer technique. The CONQUEROR consists of three phases` namely, partition of large routing area and assignment of optimal pins of sub-area, detailed routing of each sub-ared, reassignment of pins after rip-up. First, large switchbox routing area is partitioned into several sub-areas and each sub-area contains 4-6 detailed grids. Then pins are assigned on boundary of sub-area by the estimated weight. Secondly, when global pin assignment is completed on all sub-areas, each sub-area is routed using detailed router. Also, detailed routing consists of three pases` layerless maze routing, assignment of layer using coloring, and rip-up and reroute. Lastly, if detailed routing of any sub-area fails,reassignment of pins after rip-up is invoked. Detailed routing is performed for the failed sub-area again. Benchmark test cases have been run, and on all the benchmark data known in the literature CONQUEROR has performed as well as or better than existing switchbox routers.

  • PDF

Multipath Routing Based on Opportunistic Routing for Improving End-to-end Reliability in Large-scale Wireless Sensor Networks (대규모 무선 센서 네트워크에서 종단 간 전송 성공률 향상을 위한 기회적 라우팅 기반 다중 경로 전송 방안)

  • Kim, SangDae;Kim, KyongHoon;Kim, Ki-Il
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.14 no.4
    • /
    • pp.177-186
    • /
    • 2019
  • In wireless sensor networks, the transmission success ratio would be decreased when the scale of the WSNs increased. To defeat this problem, we propose a multipath routing based on opportunistic routing for improving end-to-end reliability in large-scale wireless sensor networks. The proposed scheme exploits the advantages of existing opportunistic routing and achieves high end-to-end success ratio by branching like a multipath routing through local decision without information of the whole network. As a result of the simulation result, the proposed scheme shows a similar or higher end-to-end transmission success ratio and less energy consumption rather than the existing scheme.

Urgency-Aware Adaptive Routing Protocol for Energy-Harvesting Wireless Sensor Networks

  • Kang, Min-Seung;Park, Hyung-Kun
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.13 no.3
    • /
    • pp.25-33
    • /
    • 2021
  • Energy-harvesting wireless sensor networks(EH-WSNs) can collect energy from the environment and overcome the technical limitations of existing power. Since the transmission distance in a wireless sensor network is limited, the data are delivered to the destination node through multi-hop routing. In EH-WSNs, the routing protocol should consider the power situations of nodes, which is determined by the remaining power and energy-harvesting rate. In addition, in applications such as environmental monitoring, when there are urgent data, the routing protocol should be able to transmit it stably and quickly. This paper proposes an adaptive routing protocol that satisfies different requirements of normal and urgent data. To extend network lifetime, the proposed routing protocol reduces power imbalance for normal data and also minimizes transmission latency by controlling the transmission power for urgent data. Simulation results show that the proposed adaptive routing can improve network lifetime by mitigating the power imbalance and greatly reduce the transmission delay of urgent data.

Performance Analysis of Position Based Routing Protocol for UAV Networks (UAV 네트워크 환경에 적합한 위치기반 라우팅 프로토콜의 성능 분석)

  • Park, Young-Soo;Jung, Jae-Il
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.2C
    • /
    • pp.188-195
    • /
    • 2012
  • Many systems are developing for the realization of NCW(Network Centric Warfare). UAV(Unmanned Aerial Vehicle) Network is attracting attention in a lot of military applications. In general, UAVs have the potential to create an ad-hoc network and greatly reduce the hops from source to destination. However, UAV networks exhibit unique properties such as high mobility, high data rate, and real time service. The routing protocols are required to design the multi-hop routing protocols that can dynamically adapt to the requirements of UAV network. In this paper we analyse Geographic Routing Protocol is based on geographical distance between source and destination for efficient and reliable transmission. Geographic Routing Protocol is evaluated in video service scenarios with TDMA model in our simulation. The simulation results show that the performance of Geographic Routing Protocol is better than the MANET Routing Protocol in terms of packet received ratio, end to end delay, and routing traffic sent.

A Performance Comparison of Routing Protocols for Mobile Ad hoc Networks using the NS-3 (NS-3를 사용한 이동 애드혹 네트워크용 라우팅 프로토콜 성능 비교)

  • Jang, Jaeshin;Ngo, Van-Vuong;Wie, Sunghong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.2
    • /
    • pp.308-316
    • /
    • 2015
  • In this paper, we carried out performance comparison of four routing protocols that had been proposed for mobile ad hoc networks using the NS-3 network simulator. Those four routing protocols consist of two proactive routing protocols, DSDV(destination-sequenced distance vector) and OLSR(optimized link state routing), and two reactive routing protocols, AODV(ad-hoc on-demand distance vector) and DSR(dynamic source routing). Two performance metrics, system throughput and packet delivery ratio, are adopted and performance evaluation was carried out in a square communication area where each communicating mobile node moves independently. Numerical results show that the AODV routing protocol provides the best performance among those four routing protocols.

A Cost-Aware Multi-path DSDV Routing Protocol in Wireless Mesh Networks (무선 메쉬 네트워크에서 비용 인지 다중 경로 DSDV 라우팅 프로토콜)

  • Lee, Seong-Woong;Chung, Yun-Won
    • The KIPS Transactions:PartC
    • /
    • v.15C no.4
    • /
    • pp.289-296
    • /
    • 2008
  • In wireless mesh network, studies on routing protocols have been actively carried out recently, and hop count is used as a major routing metric in destination-sequenced distance-vector (DSDV) routing protocol, which is a representative proactive routing protocol. Although hop-by-hop multi-path (HMP) DSDV and enhanced HMP (EHMP) DSDV routing protocols perform routing by considering both hop count and residual bandwidth within one hop distance nodes, it has a shortcoming that routing is carried out via non-optimal path from the aspect of end-to-end routing. In order to overcome the shortcoming, a cost-aware multi-path (CAMP) DSDV routing protocol is proposed in this paper, which considers hop count and end-to-end minimum residual bandwidth. Simulation results based on NS-2 show that the proposed routing protocol performs better than DSDV, HMP DSDV, and EHMP DSDV protocols from the aspect of throughput and packet delivery ratio, by appropriately using hop count and end-to-end minimum residual bandwidth information and has the same number of management messages with HMP DSDV and EHMP DSDV protocols.