• Title/Summary/Keyword: routing path

Search Result 981, Processing Time 0.026 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.

An Efficient Cluster header Election Scheme Using Remain Energy in Ad hoc network (Ad hoc 네트워크에서 잔여전력량을 이용한 효율적인 클러스터 헤드 선출 기법)

  • Park, Hye-Ran;Kim, Wu-Woan;Jang, Sang-Dong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.224-227
    • /
    • 2012
  • In the Cluster-Based Routing Protocol (CBRP), a cluster header in each cluster is selected. The cluster headers consume energy much more than other nodes because they manage and operate all of mobile nodes in their cluster. The traditional CBRP selects a cluster header without considering the remaining energy of each node. So, there exists problems that the cluster header has short average lifetime, and another cluster header should be selected frequently. In this paper, we propose the advanced protocol which prolongs the lifetime of the cluster header and enhances the stability of the path. In order to achieve this, when a cluster header is elected in a cluster, the remaining energies of all of nodes are compared with one another, and the node with the highest energy is selected as the cluster header.

  • PDF

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.

Research on a Mobile-aware Service Model in the Internet of Things

  • An, Jian;Gui, Xiao-Lin;Yang, Jian-Wei;Zhang, Wen-Dong;Jiang, Jin-Hua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.5
    • /
    • pp.1146-1165
    • /
    • 2013
  • Collaborative awareness between persons with various smart multimedia devices is a new trend in the Internet of Things (IoT). Because of the mobility, randomness, and complexity of persons, it is difficult to achieve complete data awareness and data transmission in IoT. Therefore, research must be conducted on mobile-aware service models. In this work, we first discuss and quantify the social relationships of mobile nodes from multiple perspectives based on a summary of social characteristics. We then define various decision factors (DFs). Next, we construct a directed and weighted community by analyzing the activity patterns of mobile nodes. Finally, a mobile-aware service routing algorithm (MSRA) is proposed to determine appropriate service nodes through a trusted chain and optimal path tree. The simulation results indicate that the model has superior dynamic adaptability and service discovery efficiency compared to the existing models. The mobile-aware service model could be used to improve date acquisition techniques and the quality of mobile-aware service in the IoT.

LTRE: Lightweight Traffic Redundancy Elimination in Software-Defined Wireless Mesh Networks (소프트웨어 정의 무선 메쉬 네트워크에서의 경량화된 중복 제거 기법)

  • Park, Gwangwoo;Kim, Wontae;Kim, Joonwoo;Pack, Sangheon
    • Journal of KIISE
    • /
    • v.44 no.9
    • /
    • pp.976-985
    • /
    • 2017
  • Wireless mesh network (WMN) is a promising technology for building a cost-effective and easily-deployed wireless networking infrastructure. To efficiently utilize limited radio resources in WMNs, packet transmissions (particularly, redundant packet transmissions) should be carefully managed. We therefore propose a lightweight traffic redundancy elimination (LTRE) scheme to reduce redundant packet transmissions in software-defined wireless mesh networks (SD-WMNs). In LTRE, the controller determines the optimal path of each packet to maximize the amount of traffic reduction. In addition, LTRE employs three novel techniques: 1) machine learning (ML)-based information request, 2) ID-based source routing, and 3) popularity-aware cache update. Simulation results show that LTRE can significantly reduce the traffic overhead by 18.34% to 48.89%.

An Enhanced AODV based Energy-aware Routing Protocol for Route Maintenance in MANET (배터리 용량을 고려한 개선된 AODV 라우팅 알고리즘)

  • Kim Kwan-Woong;Lee Jeong-Soo;Pan Ce;Chung Kyung-Taek;Chon Byoung-Sil
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.4 s.346
    • /
    • pp.22-30
    • /
    • 2006
  • In this paper, the goal of our proposed algorithm is to reduce link -failure and route failure caused by dead nodes which consume all of the battery life. I propose an algorithm which provides a ability of changing mutes to neighbor nodes before some of intermediate nodes be shutting don to get the stable route maintenance. To achieve this goal, The proposed routing algerian uses additional new messages to check energy status for monitoring energy of neighbor nodes and to change the path to a neighbor node. From extensive simulations, results show that possibility of cut-offs and time-delay cause of packet-loss have been decreased and also the improvement of transmission effectiveness.

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.

Delay Guaranteed Bandwidth-Efficient Multicast Routing in Wireless Multi-hop Networks (다중 홉 무선 네트�p에서 지연을 고려한 멀티케스트 루팅)

  • Sohn, Hee-Seok;Lee, Chae Y.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.41 no.2
    • /
    • pp.53-65
    • /
    • 2016
  • Static wireless multi-hop networks, such as wireless mesh networks and wireless sensor networks have proliferated in recent years because of they are easy to deploy and have low installation cost. Two key measures are used to evaluate the performance of a multicast tree algorithm or protocol : end-to-end delay and the number of transmissions. End-to-end delay is the most important measure in terms of QoS because it affects the total throughput in wireless networks. Delay is similar to the hop count or path length from the source to each destination and is directly related to packet success ratio. In wireless networks, each node uses the air medium to transmit data, and thus, bandwidth consumption is related to the number of transmission nodes. A network has many transmitting nodes, which will cause many collisions and queues because of congestion. In this paper, we optimize two metrics through a guaranteed delay scheme. We provide an integer linear programming formulation to minimize the number of transmissions with a guaranteed hop count and preprocessing to solve the aforementioned problem. We extend this scheme not only with the guaranteed minimum hop count, but also with one or more guaranteed delay bounds to compromise two key metrics. We also provide an explanation of the proposed heuristic algorithm and show its performance and results.

Performance Enhancement of Proxy Mobile IPv6 using Binding Query (Binding Query를 활용한 Proxy Mobile IPv6의 성능 향상 기법)

  • Park, Jae-Wan;Kim, Ji-In;Koh, Seok-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.11B
    • /
    • pp.1269-1276
    • /
    • 2011
  • In the Proxy Mobile IPv6 (PMIPv6), the data transmission performance may be degraded when the two communicating hosts are located within the same mobile domain, since all the data packet shall be delivered by way of Local Mobility Anchor (LMA). In this paper we propose an extensional scheme of PMIPv6 using binding query. In the proposed Query-based PMIPv6 (Q-PMIPv6) scheme, the Mobile Access Gateway (NAG) of Correspondent Node (CN) sends a binding query to LMA to obtain the Proxy Care-of-Address of Mobile Node (MN). Since then, CN and MN can communicate with each other by using an optimized data path. For comparison, we performed the numerical analysis and the ns-2 simulations for the proposed Q-PMIPv6 scheme and the existing PMIPv6 and PMIPv6 Localized Routing (PMIPv6-LR). From the results, we can see that the proposed scheme outperforms the existing PMIPv6 and PMIPv6-LR schemes in terms of the signaling control and data delivery costs.

A Study on Mobile IP-over-MPLS Framework to Provide Mobile IP service with Guarantied QoS (QoS 보장형 이동성 IP 서비스 제공을 위한 Mobile IP-over-MPLS 구조 연구)

  • 김호철;김영탁
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.9B
    • /
    • pp.834-844
    • /
    • 2003
  • Mobile IP has some performance degrade factors such as triangle routing and packet loss by the hand-off because the original IP was designed for the fixed network. The design goal for the next generation Internet service is to guarantee QoS. So, Mobile IP also should be able to provide the guaranteed QoS with performance enhancement because it is an IP-based mobile Internet service. In this paper, we propose route optimization, smooth hand-off scheme and MIP-LDP(Mobile IP-Label Distribution Protocol) on Mobile IP-over-MPLS framework to enhance the performance of the previously researched Mobile IP-over-MPLS schemes. The proposed framework enhanced long routing path problem and packet loss problem by the hand-off.