• Title/Summary/Keyword: Network Routing Protocol

Search Result 1,128, Processing Time 0.026 seconds

CAMR: Congestion-Aware Multi-Path Routing Protocol for Wireless Mesh Networks

  • Jang, Seowoo;Kang, Seok-Gu;Yoon, Sung-Guk
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.1
    • /
    • pp.411-419
    • /
    • 2017
  • The Wireless Mesh Network (WMN) is a multi-hop wireless network consisting of mesh routers and clients, where the mesh routers have minimal mobility and form the backbone. The WMN is primarily designed to access outer network to mesh clients through backhaul gateways. As traffic converges on the gateways, traffic hotspots are likely to form in the neighborhood of the gateways. In this paper, we propose Congestion Aware Multi-path Routing (CAMR) protocol to tackle this problem. Upon congestion, CAMR divides the clients under a mesh STA into two groups and returns a different path for each group. The CAMR protocol triggers multi-path routing in such a manner that the packet reordering problem is avoided. Through simulations, we show that CAMR improves the performance of the WMN in terms of throughput, delay and packet drop ratio.

Energy Aware Landmark Election and Routing Protocol for Grid-based Wireless Sensor Network (그리드 기반 무선센서네트워크에서 에너지 인지형 Landmark 선정 및 라우팅 프로토콜)

  • Sanwar Hosen, A.S.M.;Cho, Gi-Hwan
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.11a
    • /
    • pp.177-180
    • /
    • 2011
  • In practice, it is well known that geographical and/or location based routing is highly effective for wireless sensor network. Here, electing some landmarks on the network and forwarding data based on the landmark is one of the good approaches for a vast sensing field with holes. In the most previous works, landmarks are elected without considering the residual energy on each sensor. In this paper, we propose an Energy aware Landmark Election and Routing (ELER) protocol to establish a stable routing paths and reduce the total power consumption. The proposed protocol makes use of each sensor's energy level on electing the landmarks, which would be utilized to route a packet towards the target region using greedy forwarding method. Our simulation results illustrate that the proposed scheme can significantly reduce the power dissipation and effectively lengthen the lifetime of the network.

Security Framework for Hybrid Wireless Mesh Protocol in Wireless Mesh Networks

  • Avula, Mallikarjun;Lee, Sang-Gon;Yoo, Seong-Moo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.6
    • /
    • pp.1982-2004
    • /
    • 2014
  • Wireless Mesh Networks (WMNs) are emerging as promising, convenient next generation wireless network technology. There is a great need for a secure framework for routing in WMNs and several research studies have proposed secure versions of the default routing protocol of WMNs. In this paper, we propose a security framework for Hybrid Wireless Mesh Protocol (HWMP) in WMNs. Contrary to existing schemes, our proposed framework ensures both end-to-end and point-to-point authentication and integrity to both mutable and non-mutable fields of routing frames by adding message extension fields to the HWMP path selection frame elements. Security analysis and simulation results show that the proposed approach performs significantly well in spite of the cryptographic computations involved in routing.

Dynamic Source Multi-path Routing Protocol for Wireless Ad-hoc Network Environments (무선 에드-혹 네트워크 환경을 위한 동적다중경로라우팅 프로토콜)

  • Kim, Moon-Jeong;Eom, Young-Ik
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.3
    • /
    • pp.336-346
    • /
    • 2001
  • A wireless ad-hoc network is a temporal network formed by a collection of wireless mobile nodes without the aid of any existing network infrastnlcture or centralized administration. Currently, numerous routing protocols have been developed for changing messages between nodes in a wireless ad-hoc network. Applications of wireless ad-hoc network technology are various and proper routing protocol must be used according to application domain or network size. In a wireless ad-hoc network. some hosts want services from fixed networks. For supporting such services, it is necessary to interconnect wireless ad-hoc networks and fixed networks. The DSMIHDynamic Source Multipath Routing) protocol, proposed in this paper, focuses on supporting seamless communication services between the nodes within a wireless ad-hoc network and providing fixed networks to the mobile hosts in wireless an-hoc networks. In DSMR protocol, each node need not broadcast routing messages periodically. and mobile hosts that to send data packets initiate route request and route establishment procedure. By maintaining multiple paths in each node. faster route re-establishment is also possible in our scheme.

  • PDF

Network Architecture and Routing Protocol for Supporting Mobile IP in Mobile Ad Hoc Networks (이동 애드 혹 네트워크의 Mobile IP 지원을 위한 네트워크 구조 및 라우팅 프로토콜)

  • Oh, Hoon;TanPhan, Anh
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.1A
    • /
    • pp.24-35
    • /
    • 2008
  • We propose a tree-based integrated network of infrastructure network and mobile ad hoc network to effectively support Mobile IP for mobile ad hoc networks and also proposed a network management protocol for formation and management of the integrated network and a tree-based routing protocol suitable for the integrated network. The integrated network has fixed gateways(IGs) that connect two hybrid networks and the mobile nodes in the network form a small sized trees based on the mobile nodes that are in the communication distance with a IG. A new node joins an arbitrary tree and is registered with its HA and FA along tree path. In addition, the proposed protocol establishes a route efficiently by using the tree information managed in every node. We examined the effectiveness of the tree-based integrated network for some possible network deployment scenarios and compared our routing protocol against the Mobile IP supported AODV protocol.

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.

Protocol Design for Wavelength Routing in Optical Ring Access Networks (광링액세스네트워크에서의 파장 라우팅을 위한 프로토콜 설계)

  • Lee, Sang-Wha
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.4
    • /
    • pp.2382-2392
    • /
    • 2014
  • In this paper, a new data frame structure for wavelength routing in optical ring access network(ORAN) is designed and the functions of each field in the frame are defined. In addition, the IP packet transmission to the network layer corresponding to the newly proposed structure of the protocol stack is newly presented. Tha data transmission protocol design techniques of ORAN was proposed. IP packet and broadcasting packet transmission within the sub-network, and the IP packet transmission to other sub-network was shown through the process illustration. In the process, the encapsulation and framing process of the wavelength information to routing has been described in detail. And each step takes place in a packet transfer process is demonstrated. A ring type optical access network protocol is not yet research field. ORAN data transfer protocol to send/receive module structure of a subscriber node and a control node of the two rings which analyzed the results are shown. The high-speed Internet solution is proposed that by using wavelength routing the packet transport protocol for ORAN is designed.

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

  • Yang Seomin;Lee Hyukjoon
    • The KIPS Transactions:PartC
    • /
    • v.11C no.7 s.96
    • /
    • pp.905-916
    • /
    • 2004
  • Self-organizing hierarchical ad hoc network (SOHAN) is a new ad-hoc network architecture designed to improve the scalability properties of conventional 'flat' ad hoc networks. This network architecture consists of three tiers of ad-hoc nodes, i.e.. access points, forwarding nodes and mobile nodes. This paper presents a topology discovery and routing protocol for the self-organization of SOHAN. We propose a cross-layer path metric based on link quality and MAC delay which plays a key role in producing an optimal cluster-based hierarchical topology with high throughput capacity. The topology discovery protocol provides the basis for routing which takes place in layer 2.5 using MAC addresses. The routing protocol is based on AODV with appropriate modifications to take advantage of the hierarchical topology and interact with the discovery protocol. Simulation results are presented which show the improved performance as well as scalability properties of SOHAN in terms of through-put capacity, end-to-end delay, packet delivery ratio and control overhead.

An Energy Estimation-based Routing Protocol for Maximizing Network Lifetime in Wireless Sensor Networks (무선 센서네트워크에서 네트워크 수명을 최대화하기 위한 에너지 추정 기반의 라우팅 프로토콜)

  • Hong, Ran-Kyung;Kweon, Ki-Suk;Ghim, Ho-Jin;Yoon, Hyun-Soo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.3
    • /
    • pp.281-285
    • /
    • 2008
  • Wireless sensor networks are closely related with the geometric environment in which they are deployed. We consider the probable case when a routing protocol runs on an environment with many complex obstacles like downtown surroundings. In addition, there are no unrealistic assumptions in order to increase practicality of the protocol. Our goal is to find a routing protocol for maximizing network lifetime by using only connectivity information in the complex sensor network environment. We propose a topology-based routing algorithm that accomplishes good performance in terms of network lifetime and routing complexity as measures. Our routing algorithm makes routing decision based on a weighted graph as topological abstraction of the complex network. The graph conduces to lifetime enhancement by giving alternative paths, distributing the skewed burden. An energy estimation method is used so as to maintain routing information without any additional cost. We show how our approach can be used to maximize network lifetime and by extensive simulation we prove that out approach gives good results in terms of both measures-network lifetime and routing complexity.

Improved Routing Metrics for Energy Constrained Interconnected Devices in Low-Power and Lossy Networks

  • Hassan, Ali;Alshomrani, Saleh;Altalhi, Abdulrahman;Ahsan, Syed
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.327-332
    • /
    • 2016
  • The routing protocol for low-power and lossy networks (RPL) is an internet protocol based routing protocol developed and standardized by IETF in 2012 to support a wide range of applications for low-power and lossy-networks (LLNs). In LLNs consisting of resource-constrained devices, the energy consumption of battery powered sensing devices during network operations can greatly impact network lifetime. In the case of inefficient route selection, the energy depletion from even a few nodes in the network can damage network integrity and reliability by creating holes in the network. In this paper, a composite energy-aware node metric ($RER_{BDI}$) is proposed for RPL; this metric uses both the residual energy ratio (RER) of the nodes and their battery discharge index. This composite metric helps avoid overburdening power depleted network nodes during packet routing from the source towards the destination oriented directed acyclic graph root node. Additionally, an objective function is defined for RPL, which combines the node metric $RER_{BDI}$ and the expected transmission count (ETX) link quality metric; this helps to improve the overall network packet delivery ratio. The COOJA simulator is used to evaluate the performance of the proposed scheme. The simulations show encouraging results for the proposed scheme in terms of network lifetime, packet delivery ratio and energy consumption, when compared to the most popular schemes for RPL like ETX, hop-count and RER.