scispace - formally typeset
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

LEACH-MAC: a new cluster head selection algorithm for Wireless Sensor Networks

TL;DR: This paper presents an approach which attempts to control the randomness present in LEACH’s clustering algorithm, and makes the cluster head count stable.
Journal ArticleDOI

Decision Making in Multiagent Systems: A Survey

TL;DR: This survey investigates state-of-the-art work within the past five years on cooperative MAS decision making models, including Markov decision processes, game theory, swarm intelligence, and graph theoretic models, and algorithms that result in optimal and suboptimal sequences of actions.
Journal ArticleDOI

Multi-objective fractional artificial bee colony algorithm to energy aware routing protocol in wireless sensor network

TL;DR: An energy efficient clustering mechanism, based on artificial bee colony algorithm and factional calculus is proposed in this paper to maximize the network energy and life time of nodes by optimally selecting cluster-head.
Journal ArticleDOI

Energy harvesting and battery power based routing in wireless sensor networks

TL;DR: The most recent energy-efficient data routing approaches are reviewed and categorized based on their aims and methodologies and a new emerging energy harvesting technology that uses piezoelectric nanogenerators to supply power to nanosensor is presented.
Journal ArticleDOI

A new clustering routing method based on PECE for WSN

TL;DR: A new clustering routing method based on predictive energy consumption efficiency (PECE) for a wireless sensor network (WSN) is presented in this paper and can improve the quality of clusters, thereby increasing the overall network performance, and reduces and balances the energy consumption of whole network and prolongs the survival time of the network.
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

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.
Related Papers (5)