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

Upper bounds for the min---max and min---sum cost online problems in wireless ad hoc networks

TL;DR: An algorithm is presented for minimizing the cost of adjusting the initial energies of nodes such that the network can send the first $$h$$h messages and the total cost of the min–sum and min–max norms are smaller than the values computed by the TSWRP, TSFWP and TSWCRP algorithms in the cases: the transmission radius and node density.
Journal ArticleDOI

A restricted flooding mechanism for efficient anycast server localization in MANETs

TL;DR: The obtained results show that the proposed approach to server localization in mobile ad hoc networks has good characteristics and can be easily implemented at the application layer, without any changes at lower layers of the network protocol stack.
Journal ArticleDOI

Minimum average relative load for online routing

TL;DR: An algorithm for routing of messages where at the time of arrival of each request, if its bandwidth is bigger than associated bound, then the request is rejected and the algorithm assigns it a path to send the message.
Journal ArticleDOI

EGEC: An Energy Efficient Exponentially Generated Clustering Mechanism for Reactive Wireless Sensor Networks

TL;DR: An optimum number of clusters is computed based on the ratio between active nodes and alive nodes and found that the proposed methodology outperforms the existing protocol in terms of networks life time and throughput.

An adaptive load-aware routing algorithm for multi-interface wireless mesh networks

TL;DR: In this paper, a new dynamic adaptive channel load-aware metric (LAM) is proposed to solve the link load imbalance caused by inter-flow and inner-flow interference, designed a self-adaptive dynamic load balancing on-demand routing algorithm through extending and improving AODV routing method with the LAM, to achieve flow balance, reduce the high packet loss ratio and latency because congestion and Packet retransmission, and can increase network throughput.
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)