• Title/Summary/Keyword: Ad hoc routing protocols

Search Result 257, Processing Time 0.027 seconds

Distance Ratio based Probabilistic Broadcasting Mechanism in Mobile Ad Hoc Network (모바일 애드 혹 네트워크에서이격 비율에 근거한 확률적 브로드캐스팅 기법)

  • Kim, Jeong-Hong;Kim, Jae-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.12
    • /
    • pp.75-84
    • /
    • 2010
  • As broadcasting in Mobile Ad hoc NETwork (MANET) is the process that a node sends a packet to all other nodes in the network. it is used for routing protocols such as Ad hoc On demand Distance Vector (AODV) to disseminate control information for establishing the routes. In this paper, we propose Probabilistic Broadcasting mechanism based on Distance Ratio between sender and receive node in MANETs. The proposed approach is based on the combination of probability and distance based approach. A mobile node receiving broadcast packets determines the probability of rebroadcasting considering distance ratio from sender. The distance ratio of a node is calculated by the distance from sender and the length of radio field strength. As a node with high distance ratio is located far away from sender, rebroadcast probability is set to high value. On contrary, the low rebroadcast probability is set for a node with low distance ratio which is close to sender. So it reduces packets transmission caused by the early die-out of rebroadcast packets. Compared with the simple flooding and fixed probabilistic flooding by simulation, our approach shows better performances results. Proposed algorithm can reduce the rebroadcast packet delivery more than 30% without scanting reachability, where as it shows up to 96% reachability compared with flooding.

Implementation of Wireless Network simulator considering a User's Call Characteristics (사용자 통화 특성을 고려한 무선 네트워크 시뮬레이터 구현)

  • Yoon, Young Hyun
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.5 no.3
    • /
    • pp.107-115
    • /
    • 2009
  • Traditionally, simulation method is used to test and evaluate the performance of communication protocol or functional elements for mobile communication service. In this paper, wireless network simulator is implemented using the C++ object-oriented programming language. This simulator can simulate wireless data services, like as ad-hoc networks, by considering the user's mobility. In this paper, the simulator includes network traffic model to reflect wireless data service and traffic source model to represent a user's mobility similar to real service environment and traffic characteristics can be reflected on the simulation, and also more accurate simulation results can be got through that. In addition, by using object-oriented techniques, new service feature or environment can be easily added or changed so that the developed mobile communication simulator can reflect the real service environment all the time. This simulator can be used in adjusting the characteristics of wireless data hosts following the mobility of the user, and also can be used in building new wireless ad-hoc network routing protocols.

Topology Graph Generation Based on Link Lifetime in OLSR (링크 유효시간에 따른 OLSR 토폴로지 그래프 생성 방법)

  • Kim, Beom-Su;Roh, BongSoo;Kim, Ki-Il
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.14 no.4
    • /
    • pp.219-226
    • /
    • 2019
  • One of the most widely studied protocols for tactical ad-hoc networks is Optimized Link State Routing Protocol (OLSR). As for OLSR research, most research work focus on reducing control traffic overhead and choosing relay point. In addition, because OLSR is mostly dependent on link detection and propagation, dynamic Hello timer become research challenges. However, different timer interval causes imbalance of link validity time by affecting link lifetime. To solve this problem, we propose a weighted topology graph model for constructing a robust network topology based on the link validity time. In order to calculate the link validity time, we use control message timer, which is set for each node. The simulation results show that the proposed mechanism is able to achieve high end-to-end reliability and low end-to-end delay in small networks.

DT-GPSR: Delay Tolerant-Greedy Perimeter Stateless Routing Protocol (DT-GPSR: 지연감내형 GPSR 라우팅 프로토콜)

  • Nam, Jae-Choong;Cho, You-Ze
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.2
    • /
    • pp.189-197
    • /
    • 2016
  • Mobile ad-hoc networks (MANETs) experience frequent link disconnections due to non-uniform node distribution and mobility. Thus, end-to-end path establishment-based routing protocols cause frequent transmission failures in MANETs, resulting in heavy control messages for path reestablishment. While location-based MANET routing protocols, such as Greedy Perimeter Stateless Routing (GPSR), use location information to forward messages in a hop-by-hop routing fashion without an end-to-end path establishment procedure, such protocols encounter communication void problems when message forwarding to the next hop fails due to the absence of a relay node. Therefore, to solve this problem, this paper proposes a Delay Tolerant-GPSR (DT-GPSR) protocol, which combines Delay Tolerant Networking (DTN) technology with the GPSR protocol. The performance of DT-GPSR is compared with the performances of the original GPSR and PRoPHET routing protocols through simulation using NS-2. The simulation results confirm that DT-GPSR outperforms GPSR and PRoPHET in terms of the message delivery ratio and message delivery delay.

Resilient Routing Protocol Scheme for 6LoWPAN (6LoWPAN에서 회복력 있는 라우팅 프로토콜 기법)

  • Woo, Yeon Kyung;Park, Jong Tae
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.11
    • /
    • pp.141-149
    • /
    • 2013
  • IETF 6LoWPAN standard technique has been studied in IoT environment to support the IPv6 packet communication. 6LoWPAN protocol for transmission of packets mainly in the AODV routing protocol and a variety of extended techniques have been investigated. In particular, consisting of nodes with limited resources in a network error occurs when the 6LoWPAN reliable data transfer and fast routing method is needed. To this end, in this paper, we propose resilient routing protocol and extension of IETF LOAD algorithm, for optimal recovery path, More specifically, the optimal recovery path setup algorithm, signal flow, and detailed protocols for the verification of the reliability of packet transmission mathematical model is presented. The proposed protocol techniques to analyze the performance of the NS-3 performance through the simulation results that is end-to-end delay, throughput, packet delivery fraction and control packet overhead demonstrated excellence in comparison with existing LOAD.

A Routing Scheme for Reducing the Power Consumption of USN Nodes (USN 노드의 소비전력 절감을 위한 경로설정 기법)

  • Lee, Moon-Ho
    • Journal of Information Technology Applications and Management
    • /
    • v.14 no.2
    • /
    • pp.1-10
    • /
    • 2007
  • The ubiquitous computing system is expected to be widely utilized in digital home, logistics control, environment/disaster management, medical/health-care services and other applications. The ubiquitous sensor network (USN) is a key infra-structure of this system. Nodes in the USN are exposed to adverse environments and required to perform their missions with very limited power supply only. Also the sensor network is composed of much more nodes. In case some node consumes up its power capacity under a certain required level, the network topology should change and re-routing/ re-transmission of data is necessitated. Resultantly communication protocols studied for conventional wireless networks or ad-hoc networks are not suitable for the sensor network. Schemes should be devised to control the efficient usage of node power in the sensor network. This paper proposes a routing algorithm to enhance the efficiency of power consumption for USN node and analyzes its performance by simulation.

  • PDF

Automatic Node Configuration Protocol for Small Sized Mobile Ad-Hoc Networks (소규모 이동 애드혹 네트워크에서의 자동 노드 설정 프로토콜)

  • Lee Hyewon K.;Mun Youngsong
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.1
    • /
    • pp.100-109
    • /
    • 2005
  • A Mobile Ad-Hoc Network (MANET) supports a multi-hop wireless network without any prepared base station (BS). The MANET is capable of building a mobile network automatically without any help from DHCP servers for address allocation or routers to forward or route messages. Many routing protocols have been proposed for the MANET, but these specify the most optimized or shortest path from a source to a destination, and they assume that nodes are pre-configured before communication. To make up for this, address allocation algorithms, such as MANETConf [1] and prophet address allocation algorithm [2], have been proposed. Especially, MANETConf proposes address allocation algorithm with duplication address check. In this paper, we present a dynamic node configuration protocol based on 2-tierd hierarchical network architecture for mobile ad-hoc network, modified from [1]. Especially, it reduces the number of broadcast message exchange between nodes when a new node somes into a network, which lessens network overhead, remarkably. This protocol is based on two-tired structure, and it ensures address allocation with simple duplication address defection mechanism.

A Secure and Effective Optimal Path Searching Method on Certificate Chains in Mobile Ad hoc NETworks (모바일 애드흑 네트워크의 안전하고 효과적인 치적의 인증경로 탐색 기법)

  • Choi, Sung-Jae;Kim, Yong-Woo;Lee, Hong-Ki;Song, Joo-Seok;Nyang, Dae-Mon
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.3
    • /
    • pp.310-317
    • /
    • 2005
  • In opposition to conventional networks, mobile ad hoc networks usually do not offer trust about nodes or online access through certificate authorities or centralized servers. But, nodes in those systems need process that can search path as well as trust each other to exchange data in safety For these reasons, traditional security measures that require online trusted authorities or certificate storages are not well-suited for securing ad hoc networks. In this paper, I propose a secure and effective method to search the optimized path using profitable flooding techniques on certificate chains in MANETS(Mobile Ad hoc NETworks). This system includes not only using routing protocols that are generally broadcasting packets but also finding nodes securely and verifing the process through tiust relationships between nodes that are searched.

An Enhanced Greedy Message Forwarding Protocol for Increasing Reliability of Mobile Inter-Vehicle Communication (이동하는 차량 간 통신의 신뢰성 향상을 위한 개선된 탐욕 메시지 포워딩 프로토콜)

  • Ryu, Min-Woo;Cha, Si-Ho;Cho, Kuk-Hyun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.4
    • /
    • pp.43-50
    • /
    • 2010
  • Vehicle-to-Vehicle (V2V) is a special type of vehicle ad-hoc network (VANET), and known as a solution to provide communication among vehicles and reduce vehicle accidents. Geographical routing protocols as Greedy Perimeter Sateless Routing (GPSR) are very suitable for the V2V communication due to special characters of highway and device for vehicles. However, the GPSR has problem that appears local maximum by some stale neighbor nodes in the greedy mode of the GPSR. It can lose transmission data in recovery mode, even if the problem is can be solved by the recovery mode of the GPSR. We therefore propose a Greedy Perimeter Reliable Routing (GPRR), can provide more reliable data transmission, to resolve the GPSR problem in the V2V environment. Simulation results using ns-2 shown that the GPRR reveals much better performance than the GPSR by remarkably reducing the local maximum rate in the greedy mode.

ARM: Anticipated Route Maintenance Scheme in Location-Aided Mobile Ad Hoc Networks

  • Park Seungjin;Yoo Seong-Moo;Al-Shurman Mohammad;VanVoorst Brian;Jo Chang-Hyun
    • Journal of Communications and Networks
    • /
    • v.7 no.3
    • /
    • pp.325-336
    • /
    • 2005
  • Mobile ad hoc networks (MANET) are composed of moving wireless hosts which, within range of each other, form wireless networks. For communication to occur between hosts that are not within each other's range, routes involving intermediate nodes must be established; however, since the hosts may be in motion, a host that was part of a route may move away from its upstream and downstream partners, thus breaking the route. In this paper, we propose anticipated route maintenance (ARM) protocol with two extensions to route discovery based routing scheme: Extend the route when nodes on a link move apart from each other and they have common neighbor that can be 'inserted' in the path, and shrink route when a node discovers that one of its neighbor which is not the next hop is also on the same route several hops later on. By utilizing only local geographic information (now a part of some route finding algorithms), a host can anticipate its neighbor's departure and, if other hosts are available, choose a host to bridge the gap, keeping the path connected. We present a distributed algorithm that anticipates route failure and performs preventative route maintenance using location information to increase a route lifespan. The benefits are that this reduces the need to find new routes (which is very expensive) and prevents interruptions in service. As the density of nodes increases, the chance to successfully utilize our route maintenance approach increases, and so does the savings. We have compared the performance of two protocols, pure dynamic source routing (DSR) protocol and DSR with ARM. The simulation results show how ARM improves the functionality of DSR by preventing the links in the route from breaking. Packets delivery ratio could be increased using ARM and achieved approximately $\100%$ improvement. The simulations clarify also how ARM shows a noticeable improvement in dropped packets and links stability over DSR, even though there is more traffic and channel overhead in ARM.