• Title/Summary/Keyword: 애드혹 네트워크

Search Result 649, Processing Time 0.025 seconds

A Study of Stable Route Decision Based on VANET Routing Protocol in Urban Environment (도심환경에서의 안정적 경로 설정을 위한 VANET 라우팅 프로토콜)

  • Ham, Woo-Hyung;Jang, Sang-Woo;Lee, Sang-Sun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.3
    • /
    • pp.70-80
    • /
    • 2012
  • In Vehicular Ad-hoc Network(VANET) which constructs networks without fixed infrastructure among vehicles, network topology is frequently changed due to high mobility. In case of urban model, communication disconnections caused by interruptions of communication propagation such as buildings and constructions could be often occurred. Therefore, in VANET environment a routing protocol to complement its characteristics is needed. This paper suggests an algorithm to improve the transmission performance at intersections by approaching of the distance-based broadcasting which utilizes the information of vehicle's position. By using relative velocity among vehicles, it makes the stability of route decision improved and reduces packet collisions through graded priorities in the intersection, and simultaneously improves the performance of data rate. It can be seen that the performance compared with previous algorithm is significantly improved when using the suggested algorithm in the urban traffic environment.

The network reliability based OLSR protocol (네트워크의 신뢰도를 고려한 OLSR 프로토콜)

  • Woo, Hyun-Jae;Lee, Dong-Yul;Lee, Chae-Woo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.6
    • /
    • pp.68-76
    • /
    • 2008
  • It is difficult to maintain mutes in the mobile ad hoc network (MANET) due to the high probability of disconnected routes break by frequent change of topology. The links can have the different reliability about data transmission due to these characteristics. Hence a measure which can evaluate this reliability and a algorithm which reflects this are required. In this paper, we propose routing algorithm based on reliability about transmission. First the bayesian inference which infers the hypothesis by past information is considered to obtain the link's transmission reliability. The other is that the link-based reliability estimation model which considers each link's reliability additionally is proposed while the standard uses only Dijkstra's shortest path algorithm. the simulation results using NS-2 show that the performance of proposed algorithm is superior to the standard OLSR in terms of throughput and stability.

The establishment of Proactive Routing Selection and Maintenance Algorithms for Mobile Ad Hoc Networks (이동 Ad Hoc 네트워크에서 사전 활성화 라우팅 선택과 관리유지 알고리즘의 구축)

  • Cho, Young-Joo;Lee, Yeo-Jin;Chung, Il-Yong
    • The KIPS Transactions:PartC
    • /
    • v.14C no.1 s.111
    • /
    • pp.73-80
    • /
    • 2007
  • In conventional on-demand mobile ad hoc routing algorithms, an alternate path is sought only after an active path is broken. It incurs a significant cost in terms of money and time in detecting the disconnection and establishing a new route. In this thesis, we propose proactive route selection and maintenance to conventional mobile ad hoc on-demand routing algorithms. The key idea for this research is to only consider a path break to be likely when the signal power of a received packet drops below an optimal threshold value and to generate a forewarning packet. In other words, if a path is lost with high probability, the neighboring node that may easily be cut off notifies the source node by sending a forewarning packet. Then the source node can initiate route discovery early and switched to a reliable path potentially avoiding the disconnection altogether. For the simulational study, network simulator(NS2) is used. The result of simulation shows that the algorithm significantly improves the performance of networks comparing to conventional on-demand routing protocols based on DSR and AODV in terms of packet delivery ratio, packet latency and routing overhead.

Multi-Channel Switching Protocol Using Channel Busy Degree in Ad Hoc Wireless Networks with Multi-Interfaces (다중-인터페이스를 갖는 애드 혹 무선 네트워크에서 채널 혼잡도를 이용한 다중-채널 스위칭 프로토콜)

  • Lim, Hunju;Joung, Sookyoung;Lee, Sungwha;Park, Inkap
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.5
    • /
    • pp.239-247
    • /
    • 2013
  • In network based on multi-interface, there are needed channel assignment strategy that reduce interference and improve bandwidth efficiency by assigning each interface to available channels in order to utilize effectively multiple wireless interfaces on each node. MCS protocol had been proposed, which improve capacity and throughput of network by using hybrid assignment. MCS uses as the criterion to assign channel the number of node that use the same channel in contention area. but there have an problem that this information exactly does not reflect actually offered channel load. in this paper, we proposes CAMCS protocol to assign channel by that the channel busy degree to indicate the occupancy rate of channel by nodes as well as the number of nodes that use the same channel in inference area is used as criterion for estimation channel load, and conform performance improvement effect by simulation.

A Study on Performance of Content Store Replacement Algorithms over Vehicular CCN (VCCN에서 Content Store 교체 알고리즘의 성능에 관한 연구)

  • Choi, Jong-In;Kang, Seung-Seok
    • The Journal of the Convergence on Culture Technology
    • /
    • v.6 no.1
    • /
    • pp.495-500
    • /
    • 2020
  • VANET (Vehicular Ad Hoc Network), an example of an ad hoc vehicular networks, becomes one of the popular research areas together with the self-driving cars and the connected cars. In terms of the VANET implementation, the traditional TCP/IP protocol stack could be applied to VANET. Recently, CCN (Content Centric Networking) shows better possibility to apply to VANET, called VCCN (VANET over CCN). CCN maintains several data tables including CS (Content Store) which keeps track of the currently requested content segments. When the CS becomes full and new content should be stored in CS, a replacement algorithm is needed. This paper compares and contrasts four replacement algorithms. In addition, it analyzes the transmission characteristics in diverse network conditions. According to the simulation results, LRU replacement algorithm shows better performances than the remaining three algorithms. In addition, even the size of CS is small, the network maintains a reasonable transmission performance. As the CS size becomes larger, the transmission rate increases proportionally. The transmission performance decreases when the network is crowded as well as the number of transmission hops becomes large.

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.

A study of set route path avoiding traffic concentration in Mobile Ad hoc Network (MANET에서 트래픽 집중현상을 회피하는 경로설정에 관한 연구)

  • Oh, Dong-keun;Oh, Young-jun;Lee, Kang-whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.05a
    • /
    • pp.781-783
    • /
    • 2014
  • Mobile ad hoc network(MANET) consists of node that has mobility. MANET has increased overhead that caused by frequent topology changes. For reducing overhead, hierarchical network that communicates through cluster head node has been researched. When traffic is concentrated on cluster head node, cluster member node can't send message. To solve this problem, we proposed Step Parent algorithm. Proposed algorithm, cluster member node checks traffic of cluster head node using route path of other cluster head node in efficient coverage area. When cluster head node has increased traffic, cluster member node make a new route path by route path by routing path to another cluster head node. So cluster member node sends a message to destination node, we check improving delivery ratio.

  • PDF

A Routing Scheme by Normalized Transmission Characteristics (NTCR) for Multi-Carrier MANETs at Sea (다중캐리어 해상 MANET을 위한 정규화된 전송특성에 의한 경로배정방식)

  • Son, Joo-Young
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.35 no.8
    • /
    • pp.1092-1097
    • /
    • 2011
  • Data communications at sea are done by the traditional radio and satellite carriers. Because of the restrictions on the data rate and cost of the carriers, a novel data communication system at sea is needed. Nowadays the efforts to make use of the broadband land carriers at sea have been pursued. This paper proposes a routing scheme (NTCR) using the various carriers on land for a MANET model at sea. The NTCR scheme optimizes the route using a chosen carrier by taking considerations of normalized transmission characteristics (NTC) of applications and carriers. The NTCR scheme is compared with the MWR (max-win based routing) scheme.

A Routing Scheme based on Normalized Location and Transmission Characteristics (NLTCR) for Multi-Carrier MANETs at Sea (다중캐리어 해상자율망을 위한 위치와 전송특성 정규값 기반 경로배정방식)

  • Son, Joo-Young
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.36 no.2
    • /
    • pp.302-308
    • /
    • 2012
  • Self-configuration network model is to overcome the limits of data communications at sea. As a research for enhancing the connectivity and scalability of data networks at sea using the diversity and heterogeneity of the data networks on land, in this paper, a routing scheme (NLTCR) based on not conventional hop counts but distances to destination ships is introduced. The NLTCR seeks an optimal route by normalized distances to a destination, and transmission characteristics of applications and carriers. Performance is evaluated and compared with those of the max-win (MWR) and the normalized transmission characteristics (NTCR) based schemes.

An Analysis of Contention-Based Forwarding in Lossy Wireless Links (손실이 있는 무선 링크에서의 경쟁기반 전달방식 분석)

  • Na, Jong-Keun;Kim, Chong-Kwon
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.1
    • /
    • pp.56-66
    • /
    • 2008
  • Contention-based forwarding in wireless ad-hoc networks reduces transmission failure rate by selecting one receiver with good channel among multiple receivers. However, contention-based forwarding may increase transmission latency due to the collision problem caused by the simultaneous transmission among multiple receivers. In this paper, we present an analytic model that reflects the delay and collision rate of contention-based forwarding in lossy wireless links. Through the analytic model, we calculate the expected delay and progress in one-hop transmission under given wireless link model and delay model. Based on the analytic results, we observe that delay model should be adapted to wireless link model for optimal performance in contention-based forwarding.