• Title/Summary/Keyword: Network Routing Protocol

Search Result 1,135, Processing Time 0.028 seconds

Dynamic Routing Interworking Method for Integrating Terrestrial Wireless Backbone Network and Satellite Communications System (지상 무선 백본망과 위성 통신망 통합을 위한 동적 라우팅 연동 방안)

  • Choi, Jaewon;Jo, Byung Gak;Kim, Ki Young;Park, KyoungYoul;Lee, Ju Hyung;Han, Joo Hee;Han, Yeesoo
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.19 no.5
    • /
    • pp.645-653
    • /
    • 2016
  • The terrestrial wireless backbone network and satellite communications system have been independently developed depending on their own purposes and operational concepts, which results in different characteristics in terms of network architecture and routing protocol operation. In this paper, we propose a method for structurally integrating them in consideration of routing mechanism in an autonomous system. Our approach is that the routers of satellite network operate the OSPF in PTP mode on their interfaces connected to the routers of terrestrial wireless backbone network with grid connectivity, whereas the OSPF in satellite network whose topology is of hub-spoke type runs in NBMA mode. We perform some simulations to verify that the satellite communications system can be integrated and interwork with the terrestrial wireless backbone network by our proposed approach. From simulation results, it is also found that the increases of network convergence time and routing overhead are acceptable.

HESnW: History Encounters-Based Spray-and-Wait Routing Protocol for Delay Tolerant Networks

  • Gan, Shunyi;Zhou, Jipeng;Wei, Kaimin
    • Journal of Information Processing Systems
    • /
    • v.13 no.3
    • /
    • pp.618-629
    • /
    • 2017
  • Mobile nodes can't always connect each other in DTNs (delay tolerant networks). Many DTN routing protocols that favor the "multi-hop forwarding" are proposed to solve these network problems. But they also lead to intolerant delivery cost so that designing a overhead-efficient routing protocol which is able to perform well in delivery ratio with lower delivery cost at the same time is valuable. Therefore, we utilize the small-world property and propose a new delivery metric called multi-probability to design our relay node selection principles that nodes with lower delivery predictability can also be selected to be the relay nodes if one of their history nodes has higher delivery predictability. So, we can find more potential relay nodes to reduce the forwarding overhead of successfully delivered messages through our proposed algorithm called HESnW. We also apply our new messages copies allocation scheme to optimize the routing performance. Comparing to existing routing algorithms, simulation results show that HESnW can reduce the delivery cost while it can also obtain a rather high delivery ratio.

Power Aware Routing Protocol based on Both Threshold by Residual Battery Capacity and Signal Strength in Mobile Ad-hoc Network (Mobile Ad-hoc 네트워크에서 Threshold 적용과 신호세기 기반의 효율적인 파워소모 라우팅 프로토콜)

  • Park Gun-Woo;Song Joo-Seok
    • Annual Conference of KIPS
    • /
    • 2006.05a
    • /
    • pp.1139-1142
    • /
    • 2006
  • Mobile Ad-hoc 네트워크(MANET)에서 각 노드들은 한정된 배터리에 의존하여 통신한다. 이와 같은 제한사항을 극복하기 위해 링크의 안정성을 유지하거나 파워 소모를 고려한 프로토콜에 대한 연구들이 활발히 이루어져 왔다. 하지만 링크의 안정성 또는 파워 소모의 어느 한 측면만을 고려함으로써 링크의 안정성은 높일 수 있으나 파워 소모가 효율적이지 못했다. 반면에 전체 파워소모는 줄일 수 있었으나 파워소모의 균형을 이루지 못함으로써 네트워크 수명을 오래 지속시킬 수 없는 문제점이 발생 했다. 본 논문에서는 배터리 잔량에 대한 threshold를 적용함과 동시에 신호세기를 고려하여 각 노드들의 균형된 파워소모와 네트워크 전체의 파워 소모를 최소화함으로써 네트워크 수명을 오래 지속시키기 위한 프로토콜인 PRTRS(Power Aware Routing Protocol based on Both Threshold by Residual Battery Capacity and Signal Strength in Mobile Ad-hoc Network)를 제안한다. PRTRS는 AODV(Ad-hoc On-demand Distance Vector Routing)를 기반으로 하였다. NS-2 네트워크 시뮬레이션 결과 PRTRS는 특정 노드로 집중되는 트래픽을 분산시켜 파워소모의 균형을 이루고 네트워크 전체의 파워소모를 최소화함으로써 네트워크 수명이 연장됨을 확인하였다.

  • PDF

Active Node Architecture considering He Characteristics of Active Applications (능동 응용의 특성을 고려한 능동 노드 구조)

  • 안상현;김경춘;손선경;손승원
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.6
    • /
    • pp.712-721
    • /
    • 2002
  • The active network is a new networking approach to allow new protocols to be developed easily by solving the limitation of the existing protocol development procedure and the long protocol standardization process. So far many research institutes and universities have proposed active node architectures and active packet formats, but still there are some problems needed to be solved. One of them is the active packet format and the routing approach which consider the requirements of various active applications. Therefore, in this paper, we figure cut the requirements of various active applications and design four types of active packet formats that reflect these requirements and propose routing schemes appropriate for these characteristics. Also we propose an active node architecture which reflect these requirements.

Distance-based Routing Mechanism in Mobile Sensor Networks (모바일 센서 네트워크에서 거리 기반 경로배정 메커니즘)

  • Kim, Jun Hyoung;Park, Jung Hyeon;Lee, Sung Keun;Koh, Jin Gwang
    • Smart Media Journal
    • /
    • v.5 no.1
    • /
    • pp.55-60
    • /
    • 2016
  • Mobility of the sensor networks proposed a new way to the efficient design of sensor networks and improvement of network system performance. Mobility results in a number of functional changes in the MAC protocol and routing protocol. Especially, the mobility of the nodes may occur the increase of the overhead of transmission or disconnection of the link. Therefore, the study of the energy efficient transmission is very important in mobile sensor networks. This paper proposed adaptive transmission mechanism on the distance-based power control. The proposed mechanism was analyzed better than conventional method in the average energy consumption and network life by simulation results.

Design of efficient location system for multiple mobile nodes in the wireless sensor network

  • Kim, Ki-Hyeon;Ha, Bong-Soo;Lee, Yong-Doo;Hong, Won-Kee
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2005.11a
    • /
    • pp.81-84
    • /
    • 2005
  • Various design schemes for network using wireless sensor nodes have been widely studied on the several application areas ranging from the real world information collection to environmental monitor. Currently, the schemes are focused on the design of sensor network for low power consumption, power-aware routing protocol, micro miniature operating system and sensor network middleware. The indoor localization system that identifies the location of the distributed nodes in a wireless sensor network requires features dealing with mobility, plurality and other environmental constraints of a sensor node. In this paper, we present an efficient location system to cope with mobility of multiple mobile nodes by designing a location handler that processes location information selectively depending on the nodes' density in a specific region. In order to resolve plurality of multiple mobile nodes, a routing method for the location system is also proposed to avoid the occurrence of overlapped location data.

  • PDF

Performance Variations of AODV, DSDV and DSR Protocols in MANET under CBR Traffic using NS-2.35

  • Chandra, Pankaj;Soni, Santosh
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.7
    • /
    • pp.13-20
    • /
    • 2022
  • Basically Mobile Ad Hoc Network (MANET) is an autonomous system with the collection of mobile nodes, these nodes are connected to each other by using wireless networks. A mobile ad hoc network poses this quality which makes topology in dynamic manner. As this type of network is Ad Hoc in nature hence it doesn't have fixed infrastructure. If a node wishes to transfer data from source node to a sink node in the network, the data must be passed through intermediate nodes to reach the destination node, hence in this process data packet loss occurs in various MANET protocols. This research study gives a comparison of various Mobile Ad Hoc Network routing protocols like proactive (DSDV) and reactive (AODV, DSR) by using random topology with more intermediate nodes using CBR traffic. Our simulation used 50, 100, and 150 nodes variations to examine the performance of the MANET routing protocols. We compared the performance of DSDV, AODV and DSR, MANET routing protocols with the result of existing protocol using NS-2 environment, on the basis of different performance parameters like Packet Delivery Ratio, average throughput and average end to end delay. Finally we found that our results are better in terms of throughput and packet delivery ratio along with low data loss.

Centralized Scheme for the Provisioning Control in the Synchronous Optical Transport Network (SDH 기반 광 전달망에서 연결 설정을 위한 집중형 제어 체계에 관한 연구)

  • Kang Dongwoo;Kim Dalwon;Cho Kyuseob;Yae Byungho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.11B
    • /
    • pp.707-721
    • /
    • 2005
  • Recently, there has been a dramatic increase in data traffic, driven primarily by the explosive growth of the Internet. Optical networking is believed as a key solution to keep up with the growth, thus, the most pressing issue is how to manage and control large optical networks. Currently, provisioning end-to-end connections across the transport network has involved the network operator, leading to long provisioning times in an era when customers are demanding shorter provisioning time. To address this critical issue, new control intelligence is being studied for use within optical networks to shorten provisioning time. Both the IETF and the ITU-T have been aggressively defining many aspects of a control plane for the next generation convergence transport network. Basically, they are based on the distributed control scheme. In this Paper, we suey the applicability of the centralized control scheme for the provisioning control of optical transport network to utilize its inherent advantages over the distributed control scheme. We discuss new central control architecture, and control procedure. Also, we examine the applicability of the existing IETF routing and signaling protocols to the new control concepts, and then, we propose the additional routing and signaling information elements.

User Authentication Mechanism of Ad-hoc Network (Ad Hoc망의 사용자 인증 메커니즘)

  • Lee, Cheol-Seung;Park, Do-Jun;Shin, Myung-Suk;Lee, Joon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2004.05b
    • /
    • pp.713-716
    • /
    • 2004
  • In this paper we challenge the user Authentication using Kerberos V5 authentication protocol in Ad-hoc network environment. Ad-hoc network is a collection of wireless mobile nodes without the support of a stationary infrastructure. and DSR routing protocol, which is one of famous mobile ad-hoc routing protocols, has the following network path problem. this paper is the security structure that defined in a mobile network and security and watches all kinds of password related technology related to the existing authentication system. It looks up weakness point on security with a problem on the design that uses Ad-hoc based structure and transmission hierarchical security back of a mobile network, and a server-client holds for user authentication of an application level all and all, and it provides one counterproposal.

  • PDF

Opportunity Coefficient for Cluster-Head Selection in LEACH Protocol

  • Soh, Ben;AlZain, Mohammed;Lozano-Claros, Diego;Adhikari, Basanta
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.1
    • /
    • pp.6-11
    • /
    • 2021
  • Routing protocols play a pivotal role in the energy management and lifespan of any Wireless Sensor Network. Lower network lifetime has been one of the biggest concerns in LEACH protocol due to dead nodes. The LEACH protocol suffers from uneven energy distribution problem due to random selection of a cluster head. The cluster head has much greater responsibility compared to other non- cluster head nodes and consumes greater energy for its roles. This results in early dead nodes due to energy lost for the role of cluster- head. This study proposes an approach to balance the energy consumption of the LEACH protocol by using a semi-deterministic opportunity coefficient to select the cluster head. This is calculated in each node with the battery energy level and node ID. Ultimately, based on the opportunity cost, cluster head will be selected and broadcasted for which other nodes with higher opportunity cost will agree. It minimizes the chances of nodes with lower battery level being elected as cluster head. Our simulation experiments demonstrate that cluster heads chosen using our proposed algorithm perform better than those using the legacy LEACH protocol.