• Title/Summary/Keyword: Reliable Routing

Search Result 197, Processing Time 0.023 seconds

CMP: A Context Information-based Routing Scheme with Energy-based Message Prioritization for Delay Tolerant Networks

  • Cabacas, Regin;Ra, In-Ho
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.14 no.4
    • /
    • pp.295-304
    • /
    • 2014
  • Communication infrastructure supports wide variety of mobile services such as photo and file sharing, location tracking, social network services and instant messaging. However, instances like power-loss and natural disasters disrupt these communication infrastructures unable to render support to these mobile services. Delay-tolerant networks (DTNs) offer a solution to these problems at hand. By utilizing mobility and opportunistic contacts among mobile devices, a plausible communication network can be establish and enable support to mobile applications. This paper presents an energy-efficient, reliable message delivery routing scheme with message prioritization rules for DTN. It uses the context information of nodes (mobile devices) such as the contact history (location and time of contact), speed/velocity, moving direction to determine the best forwarders among nodes in the network. The remaining energy of the nodes is also used to determine the message types a node can deliver successfully. The simulation results show that proposed approach outperforms Epidemic and Prophet routing schemes in terms of delivery ratio, overhead ratio, delivered messages per types and remaining energy.

Analysis the Overhead of IEEE 802.11 RTS/CTS Handshake in Ad-hoc Networks Based Multipath Routing (다중경로 라우팅 기반 Ad-hoc Networks에서 IEEE 802.11 RTS/CTS 핸드세이크 오버헤드 분석)

  • Kim, Hyun-Chang;Lee, Jai-Yong
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.6
    • /
    • pp.33-44
    • /
    • 2008
  • Multipath routing protocols with load balance, fault tolerance, aggregated bandwidth in Ad-hoc Networks provide improved throughput and reliable route as compared with singlepath routing protocols. However, multipath routing protocols have not been explored thoroughly in the domain of overhead in Ad-hoc Networks. In this paper, we analyze and compare on-demand singlepath and multipath routing with IEEE 802.11 DCF in terms of Routing overhead and MAC overhead. The results reveals that in comparison with singlepath routing protocol, multipath routing mechanism creates more overheads but provides better performance in congestion and capacity provided that the route length is within a certain upper bound which is derivable. The analytical results are further confirmed by simulation.

QLGR: A Q-learning-based Geographic FANET Routing Algorithm Based on Multi-agent Reinforcement Learning

  • Qiu, Xiulin;Xie, Yongsheng;Wang, Yinyin;Ye, Lei;Yang, Yuwang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.11
    • /
    • pp.4244-4274
    • /
    • 2021
  • The utilization of UAVs in various fields has led to the development of flying ad hoc network (FANET) technology. In a network environment with highly dynamic topology and frequent link changes, the traditional routing technology of FANET cannot satisfy the new communication demands. Traditional routing algorithm, based on geographic location, can "fall" into a routing hole. In view of this problem, we propose a geolocation routing protocol based on multi-agent reinforcement learning, which decreases the packet loss rate and routing cost of the routing protocol. The protocol views each node as an intelligent agent and evaluates the value of its neighbor nodes through the local information. In the value function, nodes consider information such as link quality, residual energy and queue length, which reduces the possibility of a routing hole. The protocol uses global rewards to enable individual nodes to collaborate in transmitting data. The performance of the protocol is experimentally analyzed for UAVs under extreme conditions such as topology changes and energy constraints. Simulation results show that our proposed QLGR-S protocol has advantages in performance parameters such as throughput, end-to-end delay, and energy consumption compared with the traditional GPSR protocol. QLGR-S provides more reliable connectivity for UAV networking technology, safeguards the communication requirements between UAVs, and further promotes the development of UAV technology.

A Multicast Routing Scheme for Mobile Hosts in Next Generation Internet Networks (차세대 인터넷망에서 이동 호스트들을 위한 멀티캐스트 라우팅 기법)

  • 양승제;박성한
    • Proceedings of the IEEK Conference
    • /
    • 2001.06a
    • /
    • pp.137-140
    • /
    • 2001
  • In this paper, we propose a multicast routing scheme for an efficient and reliable support of multicast service to mobile hosts in IPv6 based networks. The purpose of this paper is to develop an algorithm to reduce both the number of multicast tree reconstruction and the multicast service disrupt time using the RSVP scheme. The proposed multicast routing scheme is a hybrid method using the advantages of the hi-directional tunneling and the remote subscription proposed by the IETF Mobile IP working group. The proposed scheme satisfies the maximum tolerable transfer delay time and supports the maximum tunneling service. The simulation results show that the proposed scheme has better performance in the number of multicast tree reconstruction and the time of multicast service disrupt than the previous schemes does.

  • PDF

Distribution based Reliable Routing Scheme with Cooperative Nodes for Wireless Sensor Networks (무선 센서 네트워크의 분산 기반 라우팅 기법)

  • Cho, Bum-Sung;Shon, Min Han;Choo, Hyunseung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.11a
    • /
    • pp.752-754
    • /
    • 2012
  • 무선센서네트워크 환경에서는 에너지 효율적인 데이터 패킷 전송을 위해 multi-hop routing 기법과 multi-path routing 기법 등이 연구되고 있다. 두 기법 모두 에너지를 적게 소모하는 경로를 택하여 데이터 패킷을 전송한다. 그러나 에너지를 적게 소모하는 경로를 택하기 위해 센서 노드 간 거리가 가까워져 목적지까지 데이터 패킷을 전송하는데 많은 홉 수를 필요로 한다. 따라서 본 논문에서는 에너지 효율적인 경로를 택하면서 동시에 목적지 가까이에서 데이터 패킷 전송을 이어가는 cooperative communication 기반의 라우팅 기법을 제안한다.

Reliable multi-hop communication for structural health monitoring

  • Nagayama, Tomonori;Moinzadeh, Parya;Mechitov, Kirill;Ushita, Mitsushi;Makihata, Noritoshi;Ieiri, Masataka;Agha, Gul;Spencer, Billie F. Jr.;Fujino, Yozo;Seo, Ju-Won
    • Smart Structures and Systems
    • /
    • v.6 no.5_6
    • /
    • pp.481-504
    • /
    • 2010
  • Wireless smart sensor networks (WSSNs) have been proposed by a number of researchers to evaluate the current condition of civil infrastructure, offering improved understanding of dynamic response through dense instrumentation. As focus moves from laboratory testing to full-scale implementation, the need for multi-hop communication to address issues associated with the large size of civil infrastructure and their limited radio power has become apparent. Multi-hop communication protocols allow sensors to cooperate to reliably deliver data between nodes outside of direct communication range. However, application specific requirements, such as high sampling rates, vast amounts of data to be collected, precise internodal synchronization, and reliable communication, are quite challenging to achieve with generic multi-hop communication protocols. This paper proposes two complementary reliable multi-hop communication solutions for monitoring of civil infrastructure. In the first approach, termed herein General Purpose Multi-hop (GPMH), the wide variety of communication patterns involved in structural health monitoring, particularly in decentralized implementations, are acknowledged to develop a flexible and adaptable any-to-any communication protocol. In the second approach, termed herein Single-Sink Multi-hop (SSMH), an efficient many-to-one protocol utilizing all available RF channels is designed to minimize the time required to collect the large amounts of data generated by dense arrays of sensor nodes. Both protocols adopt the Ad-hoc On-demand Distance Vector (AODV) routing protocol, which provides any-to-any routing and multi-cast capability, and supports a broad range of communication patterns. The proposed implementations refine the routing metric by considering the stability of links, exclude functionality unnecessary in mostly-static WSSNs, and integrate a reliable communication layer with the AODV protocol. These customizations have resulted in robust realizations of multi-hop reliable communication that meet the demands of structural health monitoring.

RMA: Reliable Multicast Architecture for Scalable and Reliable Multicast (RMA: 확장성과 신뢰성을 지원하는 신뢰적인 멀티캐스트 구조)

  • Kang, Pil-Yong;Shin, Yong-Tae
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.4
    • /
    • pp.578-585
    • /
    • 2001
  • IP Multicast that provides best-efforts service does not guarantee reliable delivery of multicast packets. In recent years, there are many approaches to support reliable multicast, but those are insufficient for implementing scalable and reliable multicast over Internet. We propose a Reliable Multicast Architecture(RMA) for scalable and reliable multicast. The RMA model guarantees reliability using a receiver initiated retransmission mechanism, and scalability using a feedback suppression mechanism by Multicast Router(MR). Furthermore, it utilizes underlying multicast routing information to minimize the cost of protocol modification and overheads. Our performance analyses show that RMA is much superior to previous works in the point of scalability and compatibility.

  • PDF

Neighbor Discovery Protocol Based on Inhibited and Priority Access Controls for Multihop Cellular Networks (멀티홉 셀룰러 네트워크에서 억제 및 우선순위 접속 제어기반의 이웃노드 탐색 프로토콜)

  • Choi, Hyun-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.11
    • /
    • pp.2533-2540
    • /
    • 2013
  • In multihop cellular network environments, the mobility of nodes is a major obstacle to find a reliable routing path between a mobile node (MN) and the access node (AN). Therefore, in this paper, we propose a fast and reliable neighbor discovery protocol that enables the fast and reliable neighbor discovery by considering the node mobility in the multihop cellular network. The proposed neighbor discovery protocol inhibits the transmission of unnecessary control messages to quickly find a suitable neighbor node (NN) and performs a priority-based access control to transmit control messages without collision in the order of NN desirable to be selected. Simulation results show that the proposed neighbor discovery protocol can discover the NNs faster than the conventional scheme and select a more reliable relay node although the number of neighbor nodes increases and the node mobility increases.

Epidemic Reliable Multicast by Peer Collaborations in Wireless Tactical Networks (무선 전술 네트워크에서 단말의 협력을 통한 전염 기반의 신뢰성 있는 멀티캐스트)

  • Hong, Min-Ki;Kang, Kyung-Ran;Cho, Young-Jong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.10B
    • /
    • pp.865-875
    • /
    • 2008
  • In this paper, we propose a reliable multicast scheme for the tactical wireless ad hoc network where the members share the situation and operation data. Our scheme consists of two phases to guarantee the reliability. During the dissemination phase, we utilizes an epidemic approach similar to gossip-based ad hoc routing. Then the group members interchange the message reception state information periodically so that they are able to recover missing packets from the other members. We evaluate the performance of our scheme through extensive simulations using the network simulator in comparison with other existing reliable multicast schemes in mobile ad hoc network. Our scheme shows higher packet delivery ratio regardless of the mobility and imposes much lower control overhead to the non-group members compared with the existing schemes.

Trajectory Information-based Routing Protocol for Mobile Mesh Router in Wireless Mesh Networks (무선 메쉬 네트워크에서 이동 메쉬 라우터의 이동 경로 정보를 고려한 라우팅 프로토콜)

  • Cho, Yong-Jin;Jeong, Hong-Jong;Kim, Dong-Kyun;Ryu, Kwan-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.11A
    • /
    • pp.912-923
    • /
    • 2011
  • In this paper, we propose a routing protocol for WMNs to provide passengers in public transportation vehicles (e.g., bus and tram) with Internet access service. In order to support end users with a reliable Internet connection despite the mobility of vehicles, we assume that mesh router, called mobile mesh router (MMR), is installed in a vehicle and manages a route to Internet Gateway (IGW). We therefore propose an efficient routing protocol and its routing metric, called ETT-TR, considering trajectory information of vehicle as well as link quality in order to find a route between them. Using NS-2 simulations, we observe that our proposed routing protocol reduces the end-to-end delay and improves throughput performance.