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

Potential position node placement approach via oppositional gravitational search for fulfill coverage and connectivity in target based wireless sensor networks

TL;DR: An Oppositional Gravitational Search algorithm (OGSA) based approach to solve the problem of target based WSNs where the sensor nodes are prone to failure and the system provides l-coverage to all targets and n-connectivity to each sensor node.
Journal ArticleDOI

Pair-wise key agreement and hop-by-hop authentication protocol for MANET

TL;DR: Simulation result show that the proposed hop by hop group key agreement protocol is efficient as it minimizes bandwidth usage, delay, packet drop, and overhead, as well as fulfills all primary security concern, with improved delivery ratio and throughput.
Journal ArticleDOI

Mobility-based routing algorithm in delay tolerant networks

TL;DR: This paper presents a routing algorithm based on the use of the mobility of the nodes in the Delay and Disruptive Tolerant Networks that assumes that the greater mobility of node results in higher number of contacts with other nodes and higher probability in message delivery to the destination.
Journal ArticleDOI

A review on energy management issues for future 5G and beyond network

TL;DR: This paper focuses on four key EE solutions for future wireless systems: EE resource allocation, network planning, RE, and C-RAN, and discusses various related work, research challenges and possible future work for these four areas.
Journal ArticleDOI

An Autonomous Self-Aware and Adaptive Fault Tolerant Routing Technique for Wireless Sensor Networks

TL;DR: The results of simulations based on a comparison of the ASAART with the SHR and SSR protocols exhibit a greater resiliency to errors and failure and better routing performance in terms of the number of successfully delivered network packets, end-to-end delay, delivered MAC layer packets, packet error rate, as well as efficient energy conservation in a highly congested, faulty, and scalable sensor 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)