• Title/Summary/Keyword: multi-path routing

Search Result 235, Processing Time 0.027 seconds

A Reservation-based HWMP Routing Protocol Design Supporting E2E Bandwidth in TICN Combat Wireless Network (TICN 전투무선망에서의 종단간 대역폭을 보장하는 예약 기반 HWMP 라우팅 프로토콜 설계)

  • Jung, Whoi Jin;Min, Seok Hong;Kim, Bong Gyu;Choi, Hyung Suk;Lee, Jong Sung;Lee, Jae Yong;Kim, Byung Chul
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.16 no.2
    • /
    • pp.160-168
    • /
    • 2013
  • In tactical environment, tactical wireless networks are generally comprised of Tactical MANETs(T-MANETs) or Tactical WMNs(T-WMNs). The most important services in tactical network are voice and low rate data such as command control and situation awareness. These data should be forwarded via multi-hop in tactical wireless networks. Urgent and mission-critical data should be protected in this environment, so QoS(Quality of Service) must be guaranteed for specific type of traffic for satisfying the requirement of a user. In IEEE 802.11s, TDMA-based MAC protocol, MCCA(MCF Controlled Channel Access), has a function of resource reservation. But 802.11s protocol can not guarantee the end-to-end QoS, because it only supports reservation with neighbors. In this paper, we propose the routing protocol, R-HWMP(Reservation-based HWMP) which has the resource reservation to support the end-to-end QoS. The proposed protocol can reserve the channel slots and find optimal path in T-WMNs. We analyzed the performance of the proposed protocol and showed that end-to-end QoS is guaranteed using NS-2 simulation.

A TDMA-based Relay Protocol for Voice Communication on a Small Group (소규모 그룹에서의 음성 통신을 위한 TDMA 기반의 릴레이 프로토콜)

  • Hwang, Sangho;Park, Chang-Hyeon;Ahn, Byoungchul
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.1
    • /
    • pp.259-266
    • /
    • 2013
  • Since the wireless communications have a limited transmission, the devices just around a master node can exchange data. Though Bluetooth and Zigbee support ad hoc, they are not appropriate for real-time voice communications. In this paper, we present a TDMA-based relay protocol for several users to communicate simultaneously. The proposed protocol can relay data or voice to other nodes in real-time by the multi-hop transmission method using TDMA. And the proposed protocol improves the network performance by allocating different frequencies to the slaves depending on the routing path scheduled by the routing table. NS-2 simulation shows that the performance of the proposed protocol is good in terms of the transmission delay and pecket loss probability in the real-time voice transmission.

An Efficient Node Life-Time Management of Adaptive Time Interval Clustering Control in Ad-hoc Networks (애드혹 네트워크에서 적응적 시간관리 기법을 이용한 클러스터링 노드 에너지 수명의 효율적인 관리 방법)

  • Oh, Young-Jun;Lee, Knag-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.2
    • /
    • pp.495-502
    • /
    • 2013
  • In the mobile Ad hoc Network(MANET), improving technique for management and control of topology is recognized as an important part of the next generation network. In this paper, we proposed an efficient node life time management of ATICC(Adaptive Time Interval Clustering Control) in Ad-hoc Networks. Ad-hoc Network is a self-configuration network or wireless multi-hop network based on inference topology. This is a method of path routing management node for increasing the network life time through the periodical route alternation. The proposed ATICC algorithm is time interval control technique depended on the use of the battery energy while node management considering the attribute of node and network routing. This can reduce the network traffic of nodes consume energy cost effectively. As a result, it could be improving the network life time by using timing control method in ad-hoc networks.

An Efficient Route Maintenance Scheme Utilizing Hello Messages for AODV-based Ad Hoc Networks (AODV 기반 애드 혹 네트워크에서 헬로우 메시지를 이용한 효과적인 경로 유지 기법)

  • 서재홍;김기형;서현곤
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.3
    • /
    • pp.280-288
    • /
    • 2004
  • In Ad Hoc Networks, a connection breaks due to the irregular movement of mobile nodes and the inherent characteristics of the wireless medium such as the interference and the multi-path fading. AODV, a typical on-demand routing protocol in Ad Hoc networks, uses the local repair mechanism to cope with the connection breaks. This paper proposes an efficient route maintenance scheme for AODV, named as AODV-ERM, by utilizing hello messages. The proposed AODV-ERM scheme can recover some link breaks efficiently without relying on the expensive local repair process, thereby reducing the repair time. To show the effectiveness of the proposed scheme, we performed extensive simulation with NS2. The simulation results show that the proposed scheme can reduce the repair time effectively and thus, increase the overall packet delivery ratio.

Highly-reliable Multi-path Protocol by MANET (MANET에 의한 신뢰성 높은 다중 경로 프로토콜)

  • Lee, Yang-Min;Lee, Jae-Kee
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.4
    • /
    • pp.352-362
    • /
    • 2008
  • In the mobile ad hoc network, network nodes are continuously capable of movement, but have battery limitations and these characteristics of MANET cause network link failure. Therefore, when performing ubiquitous services with the application of MANET, a technique is required to improve the packet transmission rates as to enable continuous packet transmission while flexibly adapting to topology changes caused by the mobility of nodes. In this paper, we are proposing PAOMDV(Possibility based AOMDV) and OLSR-ME(OLSR with Modified Energy Efficiency) which are mixed-type protocols to solve the problem for design a more efficient protocol. Especially by classifying mobile ad hoc networks as clusters, OLSR-ME protocol is implemented on communication within the clusters, while PAOMDV is used in protocols between clusters. In addition, a selection algorithm for forwarding nodes that responding packet relays in the case of increased hops was proposed for designing a more efficient protocol than existing protocols. We verified the performance of the proposed protocols through a comparative experiment with AODV, AOMDV, ZRP, and the existing protocols. We confirmed the results of the experiment revealed that the proposed protocol had the best packet transmission rate, the shortest delay between nodes, and showed better results in routing overhead.

Mobility-Aware Service Migration (MASM) Algorithms for Multi-Access Edge Computing (멀티 액세스 엣지 컴퓨팅을 위한 Mobility-Aware Service Migration (MASM) 알고리즘)

  • Hamzah, Haziq;Le, Duc-Tai;Kim, Moonseong;Choo, Hyunseung
    • Journal of Internet Computing and Services
    • /
    • v.21 no.4
    • /
    • pp.1-8
    • /
    • 2020
  • In order to reach Ultra-Reliable Low-Latency communication, one of 5G aims, Multi-access Edge Computing paradigm was born. The idea of this paradigm is to bring cloud computing technologies closer to the network edge. User services are hosted in multiple Edge Clouds, deployed at the edge of the network distributedly, to reduce the service latency. For mobile users, migrating their services to the most proper Edge Clouds for maintaining a Quality of Service is a non-convex problem. The service migration problem becomes more complex in high mobility scenarios. The goal of the study is to observe how user mobility affects the selection of Edge Cloud during a fixed mobility path. Mobility-Aware Service Migration (MASM) is proposed to optimize service migration based on two main parameters: routing cost and service migration cost, during a high mobility scenario. The performance of the proposed algorithm is compared with an existing greedy algorithm.

Vehicle-to-Vehicle Broadcast Protocols Based on Wireless Multi-hop Communication (무선 멀티 홉 통신 기반의 차량간 브로드캐스트 프로토콜)

  • Han, Yong-Hyun;Lee, Hyuk-Joon;Choi, Yong-Hoon;Chung, Young-Uk
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.8 no.4
    • /
    • pp.53-64
    • /
    • 2009
  • Inter-vehicular communication that propagates information without infrastructures has drawn a lot of interest. However, it is difficult to apply conventional ad-hoc routing protocols directly in inter-vehicular communication due to frequent changes in the network topology caused by high mobility of the vehicles. MMFP(Multi-hop MAC Forwarding) is a unicast forwarding protocol that transport packets based on the reachability information instead of path selection or position information. However, delivering public safety messages informing road conditions such as collision, obstacles and fog through inter-vehicular communication requires broadcast rather than unicast since these messages contain information valuable to most drivers within a close proximity. Flooding is one of the simplest methods for multi-hop broadcast, but it suffers from reduced packet delivery-ratio and high transmission delay due to an excessive number of duplicated packets. This paper presents two multi-hop broadcast protocols for inter-vehicular communication that extend the MMFP. UMHB(Unreliable Multi-Hop Broadcast) mitigates the duplicated packets of MMFP by limiting the number of nodes to rebroadcast packets. UMHB, however, still suffers from low delivery ratio. RMHB(Reliable Multi-Hop Broadcast) uses acknowledgement and retransmission in order to improve the reliability of UMHB at the cost of increase in transmission delay, which we show through simulation is within an acceptable range for collision avoidance application.

  • PDF

A Study on Region-based Secure Multicast in Mobile Ad-hoc Network (Mobile Ad-hoc Network에서 영역기반 보안 멀티캐스트 기법 연구)

  • Yang, Hwanseok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.12 no.3
    • /
    • pp.75-85
    • /
    • 2016
  • MANET is a network composed only mobile network having limited resources and has dynamic topology characteristics. Therefore, every mobile node acts as a route and delivers data by using multi-hop method. In particular, group communication such as multicast is desperately needed because of characteristics such as battery life of limited wireless bandwidth and mobile nodes. However, the multicast technique can have different efficient of data transmission according to configuring method of a virtual topology by the movement of the nodes and the performance of a multicast can be significantly degraded. In this paper, the region based security multicast technique is proposed in order to increase the efficiency of data transmission by maintaining an optimal path and enhance the security features in data transmission. The group management node that manages the state information of the member nodes after the whole network is separated to area for efficient management of multicast member nodes is used. Member node encrypts using member key for secure data transmission and the security features are strengthened by sending the data after encrypted using group key in group management node. The superiority of the proposed technique in this paper was confirmed through experiments.

A Risk Factor Detour Multi-Path Routing Scheme Based on DEFCON in Multimedia Sensor Networks (멀티미디어 센서 네트워크 환경에서 준비태세기반 위험요소 우회 다중 경로 라우팅 기법)

  • Hwang, Dong-Gyo;Son, In-Gook;Park, Jun-Ho;Seong, Dong-Ook;Yoo, Jae-Soo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06d
    • /
    • pp.199-201
    • /
    • 2012
  • 무선 멀티미디어 센서 네트워크를 활용하기 위한 응용에서는 대용량 멀티미디어 데이터 저장 및 처리 기술, 데이터 전송 기술 등과 같은 다양한 기반 기술들이 요구된다. 특히, 응용을 실제 환경에 적용하기 위해서는 대용량 데이터에 대한 데이터 보안 기술은 필수적이다. 본 논문은 여러 해킹 기술 중 하나인 스니핑 공격으로부터 원천적인 방어를 위해, 데이터 전송 경로를 위험 요소로부터 물리적으로 회피시키기 위한 다중 경로 라우팅 기법을 제안한다. 제안하는 기법은 위험 요소의 감지 반경과 움직임을 토대로 위험 요소의 인근에 위치한 센서 노드에 준비태세 단계를 설정한다. 이를 기반으로 데이터의 우선 순위를 설정하여 데이터 라우팅 과정에서 준비태세 단계와 데이터의 우선 순위를 고려하여 우선순위에 맞는 안전한 경로를 통해 위험요소 우회 다중 경로 라우팅을 수행한다. 시뮬레이션을 통해 제안하는 기법의 구현 가능성을 제시하였으며, 준비태세를 기반으로 효과적인 위험요소 우회 다중 경로 라우팅을 보였다.

Job-aware Network Scheduling for Hadoop Cluster

  • Liu, Wen;Wang, Zhigang;Shen, Yanming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.1
    • /
    • pp.237-252
    • /
    • 2017
  • In recent years, data centers have become the core infrastructure to deal with big data processing. For these big data applications, network transmission has become one of the most important factors affecting the performance. In order to improve network utilization and reduce job completion time, in this paper, by real-time monitoring from the application layer, we propose job-aware priority scheduling. Our approach takes the correlations of flows in the same job into account, and flows in the same job are assigned the same priority. Therefore, we expect that flows in the same job finish their transmissions at about the same time, avoiding lagging flows. To achieve load balancing, two approaches (Flow-based and Spray) using ECMP (Equal-Cost multi-path routing) are presented. We implemented our scheme using NS-2 simulator. In our evaluations, we emulate real network environment by setting background traffic, scheduling delay and link failures. The experimental results show that our approach can enhance the Hadoop job execution efficiency of the shuffle stage, significantly reduce the network transmission time of the highest priority job.