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
Posted Content

Load-Based On/Off Scheduling for Energy-Efficient Delay-Tolerant 5G Networks

TL;DR: This paper considers the energy-efficient small cell networks using smart on/off scheduling (OOS) strategies, where a certain fraction of small base stations are put into less energy-consuming sleeping states to save energy.
Journal ArticleDOI

Moth and Ant Inspired Routing in Hierarchical Airborne Networks with Multi-Beam Antennas

TL;DR: This work uses the bio-inspired algorithms (based on moth and ant behaviors) to design the routing schemes for both levels of a directional hierarchical airborne networks, and constructs a weighted fence routing topology among higher-level nodes with multi-beam antennas in order to achieve high throughput.
Journal ArticleDOI

Bridging the gap among actor–sensor–actor communication through load balancing multi-path routing

TL;DR: Simulation results show that, compared with related routing schemes, HTDM routing scheme can achieve higher throughput performance and distribute transmission loads more evenly to most of the nodes in the network.
Journal ArticleDOI

LIP: an efficient lightweight iterative positioning algorithm for wireless sensor networks

TL;DR: Simulation results indicate that LIP is not only scalable, but it is also capable of providing localization accuracy comparable to the Robust Positioning Algorithm, while significantly reducing the number of messages exchanged, and achieving energy savings.
Journal ArticleDOI

Actor-oriented directional anycast routing in wireless sensor and actor networks with smart antennas

TL;DR: ADA as mentioned in this paper is a directional anycast routing protocol for wireless sensor and actor networks (WSANs), which exploits actors as main routing anchors as much as possible because they have better energy and computing power compared to constraint sensor nodes.
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)