• Title/Summary/Keyword: Network Routing Protocol

Search Result 1,135, Processing Time 0.029 seconds

An Entropy-Based Routing Protocol for Supporting Stable Route Life-Time in Mobile Ad-hoc Wireless Sensor Networks (모바일 Ad-hoc 무선 센서 네트워크에서 안정된 경로의 Life-Time을 지원하기 위한 엔트로피 기반의 라우팅 프로토콜)

  • An, Beong Ku;Lee, Joo Sang
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.1
    • /
    • pp.31-37
    • /
    • 2008
  • In this paper, we propose an entropy-based routing protocol to effectively support both stable route construction and route lifetime in Mobile Ad-hoc Wireless Sensor Networks (MAWSN). The basic idea and feature of the proposed routing protocol are as follows. First, we construct the stable routing routes based on entropy concept using mobility of mobile nodes. Second, we consider a realistic approach, in the points of view of the MAWSN, based on mobile sensor nodes as well as fixed sensor nodes in sensor fields while the conventional research for sensor networks focus on mainly fixed sensor nodes. The performance evaluation of the proposed routing protocol is performed via simulation using OPNET(Optimized Network Engineering Tool) and analysis. The results of the performance evaluation show that the proposed routing protocol can efficiently support both the construction of stable route and route lifetime in mobile ad-hoc wireless networks.

  • PDF

An Energy- Efficient Optimal multi-dimensional location, Key and Trust Management Based Secure Routing Protocol for Wireless Sensor Network

  • Mercy, S.Sudha;Mathana, J.M.;Jasmine, J.S.Leena
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.10
    • /
    • pp.3834-3857
    • /
    • 2021
  • The design of cluster-based routing protocols is necessary for Wireless Sensor Networks (WSN). But, due to the lack of features, the traditional methods face issues, especially on unbalanced energy consumption of routing protocol. This work focuses on enhancing the security and energy efficiency of the system by proposing Energy Efficient Based Secure Routing Protocol (EESRP) which integrates trust management, optimization algorithm and key management. Initially, the locations of the deployed nodes are calculated along with their trust values. Here, packet transfer is maintained securely by compiling a Digital Signature Algorithm (DSA) and Elliptic Curve Cryptography (ECC) approach. Finally, trust, key, location and energy parameters are incorporated in Particle Swarm Optimization (PSO) and meta-heuristic based Harmony Search (HS) method to find the secure shortest path. Our results show that the energy consumption of the proposed approach is 1.06mJ during the transmission mode, and 8.69 mJ during the receive mode which is lower than the existing approaches. The average throughput and the average PDR for the attacks are also high with 72 and 62.5 respectively. The significance of the research is its ability to improve the performance metrics of existing work by combining the advantages of different approaches. After simulating the model, the results have been validated with conventional methods with respect to the number of live nodes, energy efficiency, network lifetime, packet loss rate, scalability, and energy consumption of routing protocol.

Improved Intelligent Routing Protocol in Vehicle Ad-hoc Networks (차량 Ad-hoc 혹 통신에서 개선된 지능형 경로 프로토콜)

  • Lee, Dong Chun
    • Convergence Security Journal
    • /
    • v.21 no.1
    • /
    • pp.129-135
    • /
    • 2021
  • Greedy protocols show good performance in Vehicular Ad-hoc Networks (VANETs) environment in general. But they make longer routes causing by surroundings or turn out routing failures in some cases when there are many traffic signals which generate empty streets temporary, or there is no merge roads after a road divide into two roads. When a node selects the next node simply using the distance to the destination node, the longer route is made by traditional greedy protocols in some cases and sometimes the route ends up routing failure. Most of traditional greedy protocols just take into account the distance to the destination to select a next node. Each node needs to consider not only the distance to the destination node but also the direction to the destination while routing a packet because of geographical environment. The proposed routing scheme considers both of the distance and the direction for forwarding packets to make a stable route. And the protocol can configure as the surrounding environment. We evaluate the performance of the protocol using two mobility models and network simulations. Most of network performances are improved rather than in compared with traditional greedy protocols.

Rerouting Method for MANET Using Local Path Modification (MANET에서 부분 경로 변경을 이용한 재라우팅 기법)

  • Suh, Hyo-Joong;Hwang, Hoyoung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.9
    • /
    • pp.620-628
    • /
    • 2014
  • Various on-demand manner routing protocols have been proposed for efficient energy consumption in mobile ad-hoc networks. Some of the protocols tried to extend the network lifetime by periodically rerouting paths according to the energy consumption rate of nodes. However, those protocols suffer from frequent flooding and high overhead. This paper proposed a new routing protocol called ALPMR (Adaptive Local Path Modification Routing) that extends the network lifetime by using local path rerouting. The proposed ALPMR protocol performs local rerouting around nodes with little remaining energy as well as data congestion, thus reduces flooding and routing overhead and can extend the network lifetime. The performance of ALPMR protocol is observed using ns-2 simulator.

Performance analysis of ZRP supporting QoS for Mobile Ad hoc networks (MANET에 대해 QoS를 지원하는 ZRP의 성능연구)

  • Kwon, Oh-Seong;Jeong, Eui-Hyun;Kim, Jun-Nyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.3B
    • /
    • pp.224-236
    • /
    • 2003
  • MANET(Mobile Ad hoc networks) is a mobile, multi-hop, and wireless network which is bandwidth constrained, energy constrained, resource constrained, autonomous, and self operating systems with dynamic topology. These constraints make the routing between communicating nodes in ad hoc networks difficult. In this paper we survey several routing protocol for mobile ad hoc networks. Especially, we focus on Zone Routing Protocol, hybrid routing framework suitable for a wide of mobile ad hoc networks and analyze performance of ZRP. In the case of ZRP protocol, it is essential that the use of optimal zone radius for efficient use. Otherwise it was proved through an simulation that performance of whole network is rapidly decrease with greatly increasing overhead of ZRP traffic that need for transmission of packet by IARP or IERP traffic. Also we suggest the process of finding QoS path that use in-band signal for QoS routing in ad hoc network. This method guarantees route that make real time multimedia service for QoS enabled path.

Performance Evaluation of On-Demand Routing Protocol using Look-ahead Selective Flooding in Ad-hoc Network (Ad-hoc 네트워크에서 Look-ahead Selective Flooding을 이용한 On-Demand 라우팅 프로토콜 성능 개선)

  • Yo-chan Ahn
    • Journal of Information Technology Applications and Management
    • /
    • v.10 no.2
    • /
    • pp.61-71
    • /
    • 2003
  • Ad-hoc networks are characterized by multi-hop wireless links, frequently changing network topology and the need for efficient dynamic routing protocols. In an Ad-hoc network, each host assumes the role of a router and relays packets toward final destinations Because a packet is broadcast to all neighboring nodes, the optimality criteria of wireless network routing is different from that of wired network routing. tn this paper 1 point out the more important cost factor than the number of links in the Ad-hoc network. A class routing protocols called on-demand protocols has recently found attention because of their low routing overhead since it performs a blind flooding to look for a path. In this paper, 1 propose the method which reduces overhead by using the information of neighboring nodes and doing a selective flooding. Simulation results demonstrate better reduction of routing overheads with this scheme.

  • PDF

Analysis of Routing Protocol for Tactical Backbone of TICN (TICN 전술백본망을 위한 라우팅 프로토콜 분석)

  • Jang, Dong-Ki;Kwon, Tae-Wook
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.13 no.4
    • /
    • pp.650-658
    • /
    • 2010
  • Recently Korea Army developed the TICN which is the next army tactical communication system. The TICN will support ability from under environment, strategy maneuver communication system of integrated army dimension overcome and NCW. If the IER(Information Exchange Requirement) phases 3 of the future application system, the analysis that a transmission ability of the TICN is the uncapable is govern. The TICN tactical backbone's ability is very important. Therefore, network efficiency index in application and analysis of the standard protocol for the data transmission guarantee are obliged. For the TICN tactical backbone, this paper analyzes of routing protocol efficiency index and compares to superiority of the OSPF(v2) and integrated IS-IS protocols in the tactical environment. Conclusively we proposed that integrated IS-IS protocol is more suitable for TICN backbone routing protocol.

Cluster Based Routing Protocol Using Fixed Cell in Mobile Ad hoc Networks (MANET) (Mobile Ad Hoc Networks(MANET)에서의 고정셀을 이용한 Cluster Based Routing Protocol)

  • 정종광;김재훈
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.04a
    • /
    • pp.583-585
    • /
    • 2002
  • Mobile Ad Hoc Network에서는 무선으로 연결된 호스트들이 쉽게 이동할 수 있으며 미리 설치된 유선망을 이용하는 셀롤러망과 달리 이동 호스트 사이의 통신만으로 이루어진 망이다. Mobile Ad Hoc Network에서는 각각의 노드들의 이동성이 높기 때문에 이 각각의 노드들의 라우팅 경로를 결정하는 것이 중요하다. 이에 따라 Mobile Ad Hoc Network를 위한 많은 라우팅 프로토콜이 제안되었다. 본 논문에서는 기존에 제안된 Cluster Based Routing Protocol(CBRP)극 변형하여 마치 셀롤러망에서의 셀과 같이 고정된 위치를 하나의 셀로 정의하고 그 하나의 셀이 클러스터를 형성하여 라우팅 오버 헤드를 줄일 수 있는 기법을 제안한다.

  • PDF

A Multi-hop routing protocol for bluetooth devices (블루투스 멀티 홉 라우팅 프로토콜)

  • Yang, Il-Sik;Kim, Myung-Gyu;Son, Ji-Yeon;Park, Jun-Seok
    • Proceedings of the KIEE Conference
    • /
    • 2005.10b
    • /
    • pp.448-450
    • /
    • 2005
  • A ubiquitous network allows all users to access and exchange information of any kind freely at any time, from anywhere, and from any appliance through the use of broadband and mobile access. Bluetooth commincation can provide the missing wireless extension to the heterogeneous network, allowing a more ubiquitous access. In this point of view, the BT specifications define ways for which each BT device can set up multiple connections with neighboring devices to communicate in a multi-hop fashion. this paper provides insights on the Bluetooth technology and on some limitations of the scatternet formations. so that, we describe a new multi-hop routing protocol for the establishment of scatternets. this protocol defines rules for forming a multi-hop topology in two phases. the first phase, topology discovery, concerns the discovery of the node's depth from a root node initiating inquiry process. the second phase forms scatternet topology based on the result of topology discovery.

  • PDF

Self-Organization Routing Protocol supporting Node moving in Wireless Sensor Network (무선 센서 네트워크에서의 노드 이동을 지원하는 자가 구성 라우팅 프로토콜)

  • Kim, Yong;Jang, Kyung-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.1035-1037
    • /
    • 2009
  • Common to use fixed-node sensor network and wireless sensor networks, unlike the recent move of the node happens frequently. These wireless sensor networks by taking into account the mobility of sensor nodes dynamically self-configurable routing protocol is required. In this paper, a fixed-node configuration and energy efficiency in the self-LEACH protocol is based on the useful movement of the nodes of the cluster is dynamically self-configuring routing protocols offer M-LEACH.

  • PDF