This paper presents a novel multipath energy aware routing for wireless ad hoc network. A deep analysis of different routing metrics such as MBCR, MMBCR and MDR have been led out and the Minimum Drain Rate metric has been selected as energy metric to integrate in the Multipath DSR protocol. Performance comparison with an energy efficient DSR (DSR-MDR) has been presented showing the benefits of ...

The challenge in conserving energy in embedded real-time systems is to reduce power consumption while preserving temporal correctness. Previous research has focused on power conservation for either the processor or I/O devices alone. The system-wide energy conservation has received little attention. In this paper, we analyze the problem of system-wide energy-efficient scheduling for hard real-t...

It's coming again, the new collection that this site has. To complete your curiosity, we offer the favorite energy efficient scheduling under delay constraints for wireless networks eytan modiano book as the choice today. This is a book that will show you even new to old thing. Forget it; it will be right for you. Well, when you are really dying of energy efficient scheduling under delay constr...

In wireless sensor networks data aggregation is a very important one and at the same time the aggregation should be energy efficient and a lesser amount of delay. To solve the problem we propose Delay Efficient Distributed Data Aggregation (DEDA) Scheduling Algorithm for Wireless Sensor Network (WSN) to handle the delay and energy tradeoff in the process of aggregation using the timeout concept...

In a shared-medium wireless network, an effective technique that allows for a tradeoff of message transmission time for energy savings is to transmit messages over multiple smaller hops as opposed to using the long direct source-destination hop. In this context, we address the problem of scheduling messages with probabilistic deadline constraints. Unlike most other works in this area, we consid...

This paper gives a new application of DEA to evaluate the scheduling solutions of parallel processing. It evaluates the scheduling solutions of parallel processing using the non-convex DEA model, FDH model. By introducing each solution of parallel processing scheduling as a DMU with some relevant inputs and outputs this paper shows that how the most efficient schedule(s) can be identified.

In wireless sensor network most of the devices operate on batteries. These devices or nodes have limited amount of initial energy that are consumed at different rates, depending on the power level and intended receiver. In sleep scheduling algorithms most of the nodes are put to sleep to conserve energy and increase network life time . There are to main approaches to sleep scheduling i) random ...

Scheduling trains on a single railway line is treated by converting the scheduling problem to a discrete event dynamic system, and converting a greedy time-efficient strategy to an energy efficient schedule. While such a schedule cannot be referred to as a strategy dependent solely on the state of the system the strategy is easily re-computed when perturbations in the nominal schedule occur. Co...