Journal ArticleDOI
Directional routing and scheduling for green vehicular delay tolerant networks
Reads0
Chats0
TLDR
A directional routing and scheduling scheme (DRSS) for green vehicle DTNs is presented by using Nash Q-learning approach that can optimize the energy efficiency with the considerations of congestion, buffer and delay.Abstract:
The vehicle delay tolerant networks (DTNs) make opportunistic communications by utilizing the mobility of vehicles, where the node makes delay-tolerant based "carry and forward" mechanism to deliver the packets. The routing schemes for vehicle networks are challenging for varied network environment. Most of the existing DTN routing including routing for vehicular DTNs mainly focus on metrics such as delay, hop count and bandwidth, etc. A new focus in green communications is with the goal of saving energy by optimizing network performance and ultimately protecting the natural climate. The energy---efficient communication schemes designed for vehicular networks are imminent because of the pollution, energy consumption and heat dissipation. In this paper, we present a directional routing and scheduling scheme (DRSS) for green vehicle DTNs by using Nash Q-learning approach that can optimize the energy efficiency with the considerations of congestion, buffer and delay. Our scheme solves the routing and scheduling problem as a learning process by geographic routing and flow control toward the optimal direction. To speed up the learning process, our scheme uses a hybrid method with forwarding and replication according to traffic pattern. The DRSS algorithm explores the possible strategies, and then exploits the knowledge obtained to adapt its strategy and achieve the desired overall objective when considering the stochastic non-cooperative game in on-line multi-commodity routing situations. The simulation results of a vehicular DTN with predetermined mobility model show DRSS achieves good energy efficiency with learning ability, which can guarantee the delivery ratio within the delay bound.read more
Citations
More filters
Journal ArticleDOI
Multiagent Reinforcement Learning With Unshared Value Functions
Yujing Hu,Yang Gao,Bo An +2 more
TL;DR: This paper proposes a novel MARL algorithm called negotiation-based Q-learning (NegoQ), which performs well in team Markov games such as pursuit games, as compared with team-task-oriented MARL algorithms (such as friend Q- Learning and distributed Q- learning).
Journal ArticleDOI
Adaptive energy aware cluster-based routing protocol for wireless sensor networks
TL;DR: Simulation results demonstrate that AECR protocol outperforms state of the art in terms of various performance metrics.
Journal ArticleDOI
FMRQ—A Multiagent Reinforcement Learning Algorithm for Fully Cooperative Tasks
TL;DR: Experimental results show that the proposed algorithm outperforms others with higher performance and can converge to one of the optimal Nash equilibria in these cases.
Journal ArticleDOI
Mobility management for IoT: a survey
TL;DR: This paper extensively reviews and discusses the algorithms developed to address the challenges and the techniques of integrating IP over WSNs, the attributes of mobility management within the IPv4 and IPv6, respectively, and special focus is given on a comprehensive review encompassing mechanisms, advantages, and disadvantages on related workWithin the IPv6 mobility management.
Journal ArticleDOI
A grid based clustering and routing algorithm for solving hot spot problem in wireless sensor networks
Srikanth Jannu,Prasanta K. Jana +1 more
TL;DR: The hot spot problem is addressed and a grid based clustering and routing algorithms, combinedly called GFTCRA (grid based fault tolerant clusteringand routing algorithms) which takes care the failure of the CHs are proposed which follow distributed approach.
References
More filters
Book
Reinforcement Learning: An Introduction
TL;DR: This book provides a clear and simple account of the key ideas and algorithms of reinforcement learning, which ranges from the history of the field's intellectual foundations to the most recent developments and applications.
Epidemic routing for partially-connected ad hoc networks
TL;DR: This work introduces Epidemic Routing, where random pair-wise exchanges of messages among mobile hosts ensure eventual message delivery and achieves eventual delivery of 100% of messages with reasonable aggregate resource consumption in a number of interesting scenarios.
Proceedings ArticleDOI
A delay-tolerant network architecture for challenged internets
TL;DR: This work proposes a network architecture and application interface structured around optionally-reliable asynchronous message forwarding, with limited expectations of end-to-end connectivity and node resources.
Journal ArticleDOI
Mobility increases the capacity of ad hoc wireless networks
Matthias Grossglauser,David Tse +1 more
TL;DR: The per-session throughput for applications with loose delay constraints, such that the topology changes over the time-scale of packet delivery, can be increased dramatically under this assumption, and a form of multiuser diversity via packet relaying is exploited.
Proceedings ArticleDOI
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
TL;DR: A new routing scheme, called Spray and Wait, that "sprays" a number of copies into the network, and then "waits" till one of these nodes meets the destination, which outperforms all existing schemes with respect to both average message delivery delay and number of transmissions per message delivered.