• Title/Summary/Keyword: Routing Protocols

Search Result 612, Processing Time 0.025 seconds

Energy Aware Routing Protocol over Wireless Sensor Network (센서 네트워크에서 에너지 보유량을 고려한 라우팅 프로토콜)

  • Choi, Hae-Won;Yoo, Kee-Young
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.13 no.2
    • /
    • pp.28-34
    • /
    • 2008
  • This paper reports the problem in the previous routing protocol, EAR, and proposes an energy aware routing protocol to solve the problem in it. Proposed routing protocol considers the number of hops, the possibility of node exhaustion, and the node energy amount at the same time from the source to the sink. Thereby, it could efficiently solve the potential network separation problem and the sensing hole problem in EAR. Proposed routing protocol could remove the problems in the previous routing protocols but it still gets the advantages in them.

  • PDF

Enhanced MPR Selection Strategy for Multicast OLSR

  • Matter, Safaa S.;Al Shaikhli, Imad F.;Hashim, Aisha H.A.;Ahmed, Abdelmoty M.;Khattab, Mahmoud M.
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.10
    • /
    • pp.137-144
    • /
    • 2022
  • Wireless community networks (WCNs) are considered another form of ownership of internet protocol (IP) networks, where community members manage and own every piece of equipment in a decentralized way, and routing for traffic is done in a cooperative manner. However, the current routing protocols for WCNs suffer from stability and scalability issues. In this paper, an enhanced routing protocol is proposed based on the optimized link state routing (OLSR) protocol to meet the standards of efficiency in terms of stability and scalability. The proposed routing protocol is enhanced through two phases: multicasting expansion and multipoint relay (MPR) selection based on an analytical hierarchical process (AHP). The experimental results demonstrate that the proposed routing protocol outperforms the OLSR protocol in terms of network control overhead and packet delivery ratio by 18% and 1% respectively.

The Study on the OLSR(Optimized Link State Routing Protocol) Implementation in the Mobile Ad-hoc Network (모바일 에드혹 네트워크의 OLSR(Optimized Link State Routing Protocol) 구현에 관한 연구)

  • Cho, Tae-Kyung;Lee, Jea-Hee
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.60 no.4
    • /
    • pp.257-261
    • /
    • 2011
  • In this paper, we research the OLSR(Optimized Link State Routing Protocol) of the mobile ad-hoc network protocols, and design the system implementation based on the Embedded Linux for the Ubiquitous Space construction. We prove the performance of proposed system in the various experiment environments through several scenarios which is about transmitting the image data on the mobile ad-hoc network environment.

Multicast Routing Protocol for Guaranting Host Mobility (호스트 이동성 보장을 위한 멀티캐스트 라우팅 프로토콜)

  • 양승제;박성한
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.133-136
    • /
    • 2003
  • In this paper, we propose a multicast routing protocol for the seamless delivery of multicast data to mobile hosts through the optimal route in IP based mobile networks. The proposed multicast routing protocol is a hybrid method employing the merits of the bi-directional tunneling and the remote subscription by considering the mobility of mobile hosts. The proposed protocol satisfies the bound of end-to-end delay and supports the seamless handoff. The simulation results show that the proposed protocol has better performance in the number of multicast tree reconstruction and tunneling length and packet loss time than the previous protocols.

  • PDF

Incentive Mechanism Design for Heterogeneous Networking Routing

  • Shu, Yongan;Shu, Ziyu;Luo, Bin
    • Journal of Communications and Networks
    • /
    • v.16 no.4
    • /
    • pp.458-464
    • /
    • 2014
  • In the future, an increasing number of heterogeneous networks will be connected with each other. Each of them has its own interest. Existing systems lack good incentive mechanisms to attract more networks to participate in cooperations. In this paper, we design an auction-based incentive mechanism for routing protocols applied in heterogeneous networking which is computationally efficient, individually rational, profitable, and truthful. Through several simulations, we evaluate the performance and validate the properties of our mechanism.

A Study on Improvement of AODV for Hybrid Wireless Mesh Networks (혼합형 무선 메시 네트워크를 위한 AODV 개선 연구)

  • Kim, Ho-Cheal
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.8
    • /
    • pp.943-953
    • /
    • 2013
  • By the enormous increase in mobile nodes and diverse service requests on wireless networks, wireless mesh network(WMN) takes an interest as the solution for such requests. However, lots of issues which should be solved to deploy WMN are still remained. In the network layer, the performance improvement of routing protocols is the major issue of nowadays researches. WMN can be easily deployed by use of protocols for mobile ad-hoc networks(MANET) because it is much similar with MANET in multi-hop wireless routing and which node plays as host and router concurrently. Unfortunately, most routing protocols for MANET have drawbacks such as large traffic overhead and long delay time for route discovery due to the network extension. They are major factors of performance degradation of WMN and most researches are focused on them. In this paper, domain-based AODV which is amended AODV to be applied in hybrid WMN is proposed. The proposed scheme divides a hybrid WMN as several domains and performs route discovery by header layer domain. Therefore it can reduce the distance for route discovery as much as average hop count between domain header and member nodes. From the simulation, domain-based AODV was showed slowly increasing delay time due to the network extension.

Modeling Geographical Anycasting Routing in Vehicular Networks

  • Amirshahi, Alireza;Romoozi, Morteza;Raayatpanah, Mohammad Ali;Asghari, Seyyed Amir
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.4
    • /
    • pp.1624-1647
    • /
    • 2020
  • Vehicular network is one of the most important subjects for researchers in recent years. Anycast routing protocols have many applications in vehicular ad hoc networks. The aim of an anycast protocol is sending packets to at least one of the receivers among candidate receivers. Studies done on anycast protocols over vehicular networks, however, have capability of implementation on some applications; they are partial, and application specific. No need to say that the lack of a comprehensive study, having a strong analytical background, is felt. Mathematical modeling in vehicular networks is difficult because the topology of these networks is dynamic. In this paper, it has been demonstrated that vehicular networks can be modeled based on time-expanded networks. The focus of this article is on geographical anycast. Three different scenarios were proposed including sending geographic anycast packet to exactly-one-destination, to at-least-one-destination, and to K-anycast destination, which can cover important applications of geographical anycast routing protocols. As the proposed model is of MILP type, a decentralized heuristic algorithm was presented. The evaluation process of this study includes the production of numerical results by Branch and Bound algorithm in general algebraic modeling system (GAMS) software and simulation of the proposed protocol in OMNET++ simulator. The comprehension of the result of proposed protocol and model shows that the applicability of this proposed protocol and its reactive conformity with the presented models based on presented metrics.

Evaluation on Routing Protocols over MANETs with Fading Channel (Fading 채널의 MANET에서의 라우팅 프로토콜 성능 분석)

  • Afzal, Muhammad Khalil;Kim, Byung-Seo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.5
    • /
    • pp.41-46
    • /
    • 2011
  • Mobile Ad-Hoc networks (MANET) has been getting the spotlight in the area of the wireless networks because of its flexibility and salability, and developing of many applications with it. As a consequence, MANETs are required to process not only simple data traffics, but also multimedia traffics, which has some constraints on the performances. However, unlike wired-networks, the wireless networks have frequent route-disconnections due to some reasons such as channel errors and mobility. Such frequent link disconnections makes the delivery of multimedia traffics difficult. Even though there many researches on multimedia transmissions on various environments, the performances of multimedia transmissions over fading channel and mobility even using various routing protocols have not been evaluated. Therefore, this paper extensively simulates the MPEG-4 video transmission over fading channel environment with node's mobility. In addition, the performances with two routing protocols such as AODV and DSR are compared. Finally, the simulation results shows that DSR protocol has the better performances to deliver MPEG-4 traffic.

A Performance Comparison of On-Demand Routing Protocols for Application Services in MANET (MANET에서 응용 서비스 데이터 유형에 따른 요구기반 라우팅 프로토콜의 성능비교)

  • Jang Jun-Young;Lee Kil-Sup;Lee Sung Jong
    • The KIPS Transactions:PartC
    • /
    • v.11C no.7 s.96
    • /
    • pp.871-878
    • /
    • 2004
  • Recenty, there has been great interest in MANET from various areas. In this paper we focus on performance analysis of on demand routing protocols surf as DSR, AODV, and TORA in MANET. We have conducted several simulations concerned with application service data such as sensor, text. voice, and video data. And then, we have evaluated the performance of three protocols in a pre-designed ad hoc network, which is consisted of 20 nodes. As a result, we have obtained quantitative data for packet delivery fraction, average end to-end delay, routing load, channel utilization from upper layer and supportable routing protocol for application service data. The results can be used for designing specific-purposed ad-hoc networks.

Routing Protocol using Node Connectivity for Hierarchical Wireless Sensor Network (계층형 무선센서네트워크에서 노드 연결성을 이용한 라우팅 프로토콜)

  • Choi, Hae-Won;Kim, Sang-Jin;Ryoo, Myung-Chun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.3A
    • /
    • pp.269-278
    • /
    • 2010
  • There are tendency that wireless sensor network is one of the important techniques for the future IT industry and thereby application areas in it are getting growing. Researches based on the hierarchical network topology are evaluated in good at energy efficiency in related protocols for wireless sensor network. LEACH is the best well known routing protocol for the hierarchical topology. However, there are problems in the range of message broadcasting, which should be expand into the overall network coverage, in LEACH related protocols. This dissertation proposes a new routing protocol to solve the co-shared problems in the previous protocols. The basic idea of our scheme is using the table for nodes connectivity and node energy information. The results show that the proposed protocol could support the load balancing by distributing the clusters with a reasonable number of member nodes and thereby the network life time would be extended in about 1.8 times longer than LEACH.