• Title/Summary/Keyword: Network Routing Protocol

Search Result 1,135, Processing Time 0.034 seconds

Cluster-Based Power-Efficient Routing Protocol for Sensor Network (센서 네트워크를 위한 클러스터 기반의 에너지 효율적인 라우팅 프로토콜)

  • 권기석;이승학;윤현수
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04a
    • /
    • pp.508-510
    • /
    • 2004
  • 센서 네트워크는 관심이 있는 현상을 관찰하기 위해서 관찰지역 내에 뿌려진 센서 노드들로 구성된다. 센서 네트워크를 구성하는 각 센서 노드들의 수명은 전체 센서 네트워크 수명에 많은 영양을 준다. 하나의 센서 노드가 수명을 다 했을 때 이는 센서 네트워크의 분할을 가져 올 수도 있다. 그러므로 모든 센서 노드들이 공평하게 다 같이 오래 사는 것이 전체 센서 네트워크의 수명을 연장하는 것이다. 이 논문에서 우리는 클러스터 기반의 에너지 효율적인 라우팅 프로토콜(Cluster-eased Power-Efficient Routing Protocol CBPER)을 제안하였다. 제안된 프로토콜은 여러 개의 유동성 싱크 노드를 가진 센서 네트워크에서 에너지 효율적인 데이터 전송을 지원하며 효율적인 라우팅을 위해서 각 센서 노드의 위치정보를 기반으로 만든 그리드 구조를 이용한다. 제안된 프로토콜의 성능을 평가하기 위해서 두 계층 데이터 전송 라우팅 (Two-Tier Data Dissemination Routing: TTDD) 프로토콜과 비교를 하였다. 실험결과는 CBPER 프로토콜이 TTDD 라우팅 프로토콜 보다 좀 더 에너지 효율적이라는 결과를 보여 준다.

  • PDF

Establishment and Performance Test of Wireless Communication Network for Train Control using Wireless Mesh Network(WMN) (무선 메쉬 네트워크를 이용한 열차무선통신망 구축 및 성능시험)

  • Cho, Dong-Rae;Yoo, Sung-Ho;Kim, Ja-Young;Park, Chae-Jung;Lee, Sung-Hoon
    • Proceedings of the KSR Conference
    • /
    • 2011.10a
    • /
    • pp.2787-2794
    • /
    • 2011
  • A mesh node, a component of a mesh network, is connected with the network by dynamic routing using routing protocol and collects the information of adjacent or connected mesh nodes for its self-management and settings. Also, it relays packets between the mesh nodes and provides AP(Access Point) with its corresponding functions based on IEEE 802.11 a/b/g for clients' access to the network. In this paper, the study focused on the design and performance tests of Wireless Mesh Network(WMN) which is applied to the wireless communication network for the CBTC(Communications Based Train Control) system. The WMN was established on a K-AGT test-line (Kyeongsan city, Gyeongsangbuk-do), and to verify the applicability, its operation and performances are checked by measuring the data throughput, delay latency, quality measurements such as transmission loss, radio interference and path recovery and setup between the on-board and wayside.

  • PDF

Location Based Load Balancing Method for Cluster Routing in Wireless Sensor Networks (무선 센서 네트워크의 클러스터 라우팅에서 위치기반 부하 균등화 기법)

  • Yoo, Woo Sung;Kang, Sang Hyuk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.8
    • /
    • pp.942-949
    • /
    • 2016
  • Efficient routing protocols designed for Wireless Sensor Networks (WSN) can be extended and applied to Internet of Things (IoT) data routing, as IoT can be considered to be an extension from WSN. When the size of the data in IoT is often bigger than in conventional WSNs, existing cluster routing protocol such as LEACH may cause high data loss rate due to its incomplete load balancing. We present an enhanced LEACH-based protocol which can minimize the data loss which is an important performance measure in IoT. In our proposed protocol, the base station estimates the location of nodes by the trilateration technique to make sure optimal number of cluster heads and members in a deterministic manner. We evaluate our proposed protocol via computer simulations in terms of data loss rate and average network lifetime.

Secure Routing with Time-Space Cryptography for Mobile Ad-Hoc Networks (이동 애드혹 망을 위한 시공간 방식의 보안 라우팅 프로토콜)

  • Joe, In-Whee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.1B
    • /
    • pp.11-16
    • /
    • 2007
  • This paper describes the design and performance of a secure routing protocol with time-space cryptography for mobile ad-hoc networks. The proposed time-space scheme works in the time domain for key distribution between source and destination as well as in the space domain for intrusion detection along the route between them. For data authentication, it relies on the symmetric key cryptography due to high efficiency and a secret key is distributed using a time difference from the source to the destination. Also, a one-way hash chain is formed on a hop-by-hop basis to prevent a compromised node or an intruder from manipulating the routing information. In order to evaluate the performance of our routing protocol, we compare it with the existing AODV protocol by simulation under the same conditions. The proposed protocol has been validated using the ns-2 network simulator with wireless and mobility extensions.

An Energy Efficient Routing Protocol using Transmission Range and Direction for Sensor Networks (센서 네트워크에서 전송범위와 전송방향을 이용한 에너지 효율적인 라우팅 프로토콜)

  • Lee, Hyun-Jun;Lee, Young-Han;Lee, Kyung-Oh
    • The KIPS Transactions:PartC
    • /
    • v.17C no.1
    • /
    • pp.81-88
    • /
    • 2010
  • Sensors in sensor networks are operated by their embedded batteries and they can not work any more if the batteries run out. The data collected by sensors should be transferred to a sink node through the efficient routes. Many energy efficient routing algorithms were proposed. However, the previous algorithms consume more energy since they did not consider the transmission range and direction. In this paper we propose an algorithm TDRP(Transmission range and Direction Routing Protocol) that considers the transmission range and direction for the efficient data transmission. Since TDRP does not produce clusters or grids but four quadrants and send data to the nodes in one quadrant in the direction of the sink node, it has less network overhead. Furthermore since the proposed algorithm sends data to the smaller number of nodes compared to the previous algorithms, the energy efficiency is better than other algorithms in communication node fields that are located in packet transmit directions.

A Bio-inspired Hybrid Cross-Layer Routing Protocol for Energy Preservation in WSN-Assisted IoT

  • Tandon, Aditya;Kumar, Pramod;Rishiwal, Vinay;Yadav, Mano;Yadav, Preeti
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.4
    • /
    • pp.1317-1341
    • /
    • 2021
  • Nowadays, the Internet of Things (IoT) is adopted to enable effective and smooth communication among different networks. In some specific application, the Wireless Sensor Networks (WSN) are used in IoT to gather peculiar data without the interaction of human. The WSNs are self-organizing in nature, so it mostly prefer multi-hop data forwarding. Thus to achieve better communication, a cross-layer routing strategy is preferred. In the cross-layer routing strategy, the routing processed through three layers such as transport, data link, and physical layer. Even though effective communication achieved via a cross-layer routing strategy, energy is another constraint in WSN assisted IoT. Cluster-based communication is one of the most used strategies for effectively preserving energy in WSN routing. This paper proposes a Bio-inspired cross-layer routing (BiHCLR) protocol to achieve effective and energy preserving routing in WSN assisted IoT. Initially, the deployed sensor nodes are arranged in the form of a grid as per the grid-based routing strategy. Then to enable energy preservation in BiHCLR, the fuzzy logic approach is executed to select the Cluster Head (CH) for every cell of the grid. Then a hybrid bio-inspired algorithm is used to select the routing path. The hybrid algorithm combines moth search and Salp Swarm optimization techniques. The performance of the proposed BiHCLR is evaluated based on the Quality of Service (QoS) analysis in terms of Packet loss, error bit rate, transmission delay, lifetime of network, buffer occupancy and throughput. Then these performances are validated based on comparison with conventional routing strategies like Fuzzy-rule-based Energy Efficient Clustering and Immune-Inspired Routing (FEEC-IIR), Neuro-Fuzzy- Emperor Penguin Optimization (NF-EPO), Fuzzy Reinforcement Learning-based Data Gathering (FRLDG) and Hierarchical Energy Efficient Data gathering (HEED). Ultimately the performance of the proposed BiHCLR outperforms all other conventional techniques.

Restricted Multi-hop Information Lookahead Scheme for Real-Time Data Dissemination in Wireless Sensor Networks (무선 센서 망에서 실시간 데이터 전송을 위한 제한적 멀티-홉 정보 예측 기법)

  • Jung, Ju-Hyun;Oh, Seung-Min;Lee, Jeong-Cheol;Park, Ho-Sung;Yim, Yong-Bin;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.7A
    • /
    • pp.706-714
    • /
    • 2010
  • In wireless sensor networks, real-time data delivery schemes typically achieve a desired delivery speed by performing one-hop lookahead. Recently, to reduce the deadline miss ratio against the desired delivery speed, a study has proposed a real-time routing protocol based on proactively performing two-hop lookahead. However, the study might cause heavy message exchange overhead and high computing complexity to carry out obtainment of two-hop neighborhood speed information in the entire sensor nodes whether data are delivered or not. Moreover, although multi-hop lookahead provides the least deadline miss ratio, due to the restriction from the overhead and the complexity, the recent study merely adopts the two-hop lookahead manner. In this paper, we propose a novel real-time routing protocol that adopts on-demand neighborhood multi-hop information obtainments only around data forwarding paths. Simulation results prove that the proposed routing protocol offers better performances with respect to deadline miss ratio, total communication costs, energy efficiency, and network lifetime.

A Location-Aided Cooperative Transmission Method in Mobile Ad-hoc Wireless Sensor Networks (모바일 Ad-hoc 무선 센서 네트워크에서 위치도움 협력 전송 방법)

  • Son, Dong-Hwan;Lee, Joo-Sang;An, Beongku;Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.2
    • /
    • pp.23-28
    • /
    • 2008
  • In this paper, we propose location-aided cooperative routing protocol (LACARP) for supporting power saving and stable route lifetime in mobile ad-hoc wireless sensor networks. The main ideas and features of the proposed routing protocol are as follows. First, the definition of the area of route search using location-based information to support power saving transmission. Second, the expect zone-based establishment of routing route within the area of route search. Third, the cooperative-aided transmission method. In the operation of data transmission over the established rout the datas are transmitted via both the established route and cooperative route aided by neighbor nodes. The performance evaluation using OPNET(Optimized Network Engineering Tool) shows the LACARP can improve the packet delivery ratio and power saving transmission efficiently.

  • PDF

Power-Aware Dynamic Source Routing in Wireless Ad-hoc Networks (무선 애드혹 망에서의 전력 인식 동적 소스 라우팅)

  • 정혜영;신광욱;임근휘;이승학;윤현수
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.5
    • /
    • pp.519-531
    • /
    • 2004
  • Ad-hoc networks are temporary wireless systems composed of mobile nodes without any fixed infrastructure. The life time of each node in the ad-hoc network significantly affects the life time of whole ad-hoc network. A node which drained out its battery may incur the partition of whole network in some network topology The life time of each node depends on the battery capacity of each node. Therefore if all mobile nodes in the network live evenly long, the life time of the network will be longer. In this paper, we propose Power-Aware Dynamic Source Routing (PADSR) which selects the best path to make the life time of the network be longer. In PADSR, when a source node finds a path to the destination node, it selects the best path that makes nodes in the network live evenly long. To find the best path, PADSR considers the consumption of transmission energy and residual battery capacity of nodes upon the path. Consequently the network lives longer if we use PADSR.