• Title/Summary/Keyword: Network Routing Protocol

Search Result 1,135, Processing Time 0.029 seconds

Hybrid Routing protocol for Energy Efficiency in Wireless Sensor Networks (무선센서네트워크에서 에너지 효율을 위한 혼합적 라우팅 프로토콜)

  • Kim, Jin-Su
    • Journal of Digital Convergence
    • /
    • v.10 no.9
    • /
    • pp.363-368
    • /
    • 2012
  • The Cluster-based routing protocol is consumed the energy consumption efficiently, but there are many isolated nodes while clustering, so these are impeding energy efficiency. Hop-by-hop based routing protocol is suitable large-scaled network or dynamic environment. However, with the periodic flooding signal and rapid energy loss of near sink nodes, the network life time become shorter. In this paper, We propose the hybrid routing protocol that combine the cluster based routing method for energy efficiency of nodes and hop-by-hop method for re-joining the isolated nodes and load balance of nodes in the near cluster using fibonacci sequence. Based on the analysis, it is proved that the hybrid routing protocol provided higher energy efficiency and less the isolated nodes than previous methods.

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

  • Park, Seong-Seung;Park, Gun-Woo;Ryu, Keun-Ho;Lee, Sang-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.5
    • /
    • pp.103-117
    • /
    • 2009
  • In MANET(Mobile Ad-Hoc Network), providing security to routing has been a significant issue recently. Existing studies, however, focused on either of secure routing or packet itself where malicious operations occur. In this paper, we propose SRPPnT(A Secure Routing Protocol in MANET based on Malicious Pattern of Node and Trust Level) that consider both malicious behavior on packet and secure routing. SRPPnT is identify the node where malicious activities occur for a specific time to compose trust levels for each node, and then to set up a routing path according to the trust level obtained. Therefore, SRPPnT is able to make efficient countermeasures against malicious operations. SRPPnT is based on AODV(Ad-Hoc On-Demand Distance Vector Routing). The proposed SRPPnT, from results of the NS-2 network simulation. shows a more prompt and accurate finding of malicious nodes than previous protocols did, under the condition of decreased load of networks and route more securely.

An Efficient Secure Routing Protocol Based on Token Escrow Tree for Wireless Ad Hoc Networks (무선 애드 혹 네트워크에서 보안성을 고려한 Token Escrow 트리 기반의 효율적인 라우팅 프로토콜)

  • Lee, Jae Sik;Kim, Sung Chun
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.4
    • /
    • pp.155-162
    • /
    • 2013
  • Routing protocol in ad hoc mobile networking has been an active research area in recent years. However, the environments of ad hoc network tend to have vulnerable points from attacks, because ad hoc mobile network is a kind of wireless network without centralized authentication or fixed network infrastructure such as base stations. Also, existing routing protocols that are effective in a wired network become inapplicable in ad hoc mobile networks. To address these issues, several secure routing protocols have been proposed: SAODV and SRPTES. Even though our protocols are intensified security of networks than existing protocols, they can not deal fluidly with frequent changing of wireless environment. Moreover, demerits in energy efficiency are detected because they concentrated only safety routing. In this paper, we propose an energy efficient secure routing protocol for various ad hoc mobile environment. First of all, we provide that the nodes distribute security information to reliable nodes for secure routing. The nodes constitute tree-structured with around nodes for token escrow, this action will protect invasion of malicious node through hiding security information. Next, we propose multi-path routing based security level for protection from dropping attack of malicious node, then networks will prevent data from unexpected packet loss. As a result, this algorithm enhances packet delivery ratio in network environment which has some malicious nodes, and a life time of entire network is extended through consuming energy evenly.

A New Framework for Ad Hoc Network routing Protocol without Destination Sequence Number (목적지 순차 번호를 사용하지 않은 새로운 구조의 Ad Hoc 네트워크의 라우팅 프로토콜)

  • Seo, Jae-Hong;Jung, Ho-Youl
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.2 no.3
    • /
    • pp.155-163
    • /
    • 2007
  • In Ad Hoc Networks, a connection breaks due to the irregular movement of mobile nodes and the inherent characteristics of the wireless medium such as the interference and the multi-path fading. AODV, a typical on-demand routing protocol in Ad Hoc networks, uses Destination sequence numbering for loop-free, but it may cause RREQ broadcast storm problem. This paper proposes AODV_ods that does not need destination sequence number, in routing message and routing table without routing loop. To show the effectiveness of the proposed scheme, we performed extensive simulation with NS-2. The simulation results show that the proposed ADOV_ods efficiently uses wireless bandwidth compare to the original AODV. Finally AODV ods reduces the routing overhead, end to end delay and increases the overall packet delivery ratio.

  • PDF

An Improved Hierarchical Routing Protocol for Wireless Hybrid Mesh Network (무선 하이브리드 메쉬 네트워크를 위한 개선된 계층구조 라우팅 프로토콜)

  • Ki, Sang-Youl;Yoon, Won-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.5
    • /
    • pp.9-17
    • /
    • 2010
  • In this paper we propose an improved hierarchical routing protocol for wireless hybrid mesh network. The proposed method efficiently manages network topology and reduces overhead traffic for setting routing path by considering link stability. The simulation results show that the proposed method outperforms the HOLSR (hierarchical optimized link state routing) method in aggregate goodput, packet delivery ratio, and end-to-end delay.

A study on link-efficiency and Traffic analysis for Packet-switching using the link state algorithm (링크상태 알고리즘을 이용한 패킷스위칭의 트래픽분석과 링크효율에 관한 연구)

  • 황민호;고남영
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.1
    • /
    • pp.30-35
    • /
    • 2002
  • Dynamic routing uses routing protocols to select the best routes and to update the routing table. RP (Routing Information Protocol)using a distance-vector algorithm becomes generally known a routing protocol on the network. RIP selects the route with the lowest "hop count" (metric) as the best route. but RIP has a serious shortcoming. a mP router cannot maintain a complete routing table for a network that has destinations more than 15 hops away. To overcome this defect, It uses the OSPF (Open Shortest Path First) of link -state protocols developed for TCP/IP. It is suitable for very large networks and provides several advantages over RIP. This paper analyzes the traffic and the link efficiency between two protocols such as message delivery and delay, link utilization, message counts on the same network.e network.

Multi-interface Wireless Mesh Network Testbed using Wireless Distribution System (무선 분산 시스템을 이용한 멀티 인터페이스 무선 메쉬 네트워크 테스트베드)

  • Yoon, Mi-Kyung;Yang, Seung-Chur;Kim, Jong-Deok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.6
    • /
    • pp.1077-1082
    • /
    • 2009
  • Wireless Mesh Network(WMN) is wireless backbone networks technique which has ease of network configuration and cost of advantage. Recently, WNM released a new product, but most of existing research and technology analysis the performance through the simulation. This paper build the wireless mesh network testbed for actual situation. Testbed supports multi-channel multi-interface using bridge, the Wireless Distribution System and dynamic location-based routing protocol. This routing protocol strongly design against wireless interference using metric for link channel change and real distance. Then, the address of mesh clients assigned by the centralized address management server. Mesh clients is designed and implemented to manage network through Simple Network Management Protocol.

The Comparison of Performance Hierarchical Routing Protocols in Wide Area Sensor Field

  • Park, SeaYoung;Jung, KyeDong;Lee, Jong-Yong
    • International journal of advanced smart convergence
    • /
    • v.5 no.1
    • /
    • pp.8-15
    • /
    • 2016
  • Studies have been made for the wireless sensor network protocols by a number of researchers to date. In particular, the studies as to the hierarchical protocol LEACH algorithm was concentrated. Various studies have been derived for the performance of the protocol is based on the LEACH protocol have been made. Improved algorithms have been proposed continuously. On the other hand, The performance comparison and evaluation of the improved algorithm is insufficient. Therefore, we compared the performance for the ML-LEACH (Multi Hop-Layered) and DL-LEACH (Dual Hop-Layered) been derived mainly LEACH. scalability, energy consumption, CH elected, network lifetime were selected as a Performance evaluation items.

A Performance Comparison Routing Protocols for control Mobile Host (Mobile Host 제어를 위한 Routing Protocol 성능 비교)

  • 김탁근;이광재;김동일
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.10a
    • /
    • pp.129-132
    • /
    • 2001
  • The ad hoc network was composed of Mobile hosts. Due to the limited transmission range of each mobile node hosts, in such an environment, it is essential for other hosts to coorperate to transfer packet to destination. Moreover, the existing routing protocol algorithms are not efficient on the ad hoc network because a mobile host operates router without fixed router. In this paper, we will compare and analysis for the performance of existing ad hoc network routing protocols through simulation.

  • PDF

A Low Overhead, Energy Efficient, Sink-initiated Multipath Routing Protocol for Static Wireless Sensor Networks

  • Razzaque, Md. Abdur;Hong, Choong Seon
    • Annual Conference of KIPS
    • /
    • 2009.04a
    • /
    • pp.1167-1169
    • /
    • 2009
  • Multipath routing in wireless sensor networks has been proven to provide with increased data delivery ratio, security, robustness to node and link failures, network throughput, etc. However, the energy cost for multiple routes construction and their maintenance is very high. This paper proposes a sink-initiated, node-disjoint multipath routing protocol for static wireless sensor networks that significantly minimizes the route construction messages and thereby saves the critical batter energy of sensor nodes. It also distributes the traffic load spatially over many nodes in the forwarding paths, which ensures balanced energy consumption in the network and thereby increases the network lifetime. The simulation results show that it decreases the routing overhead as well as the standard deviation of nodes' residual energies.