Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

PDF

Missouri University of Science and Technology

2006

Protocols

Articles 1 - 2 of 2

Full-Text Articles in Physical Sciences and Mathematics

Dynamic Programming-Based Energy-Efficient Rate Adaptation For Wireless Ad Hoc Networks, Maciej Jan Zawodniok, Jagannathan Sarangapani Nov 2006

Dynamic Programming-Based Energy-Efficient Rate Adaptation For Wireless Ad Hoc Networks, Maciej Jan Zawodniok, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

Resource constraints require that ad hoc wireless networks are energy efficient during transmission and rate adaptation. In this paper we propose a novel cross-layer energy-efficient rate adaptation scheme that employs dynamic programming (DP) principle to analytically select the modulation scheme online. The scheme uses channel state information from the physical layer and congestion information from the scheduling layer to select a modulation rate. This online selection maximizes throughput while saving energy and preventing congestion. The simulation results indicate that an increase in throughput by 96% and energy-efficiency by 131% is observed when compared to the Receiver Based AutoRate (RBAR) protocol.


Model Checking Control Communication Of A Facts Device, Bruce M. Mcmillin, J. K. Townsend, David Cape Jan 2006

Model Checking Control Communication Of A Facts Device, Bruce M. Mcmillin, J. K. Townsend, David Cape

Computer Science Faculty Research & Creative Works

This paper concerns the design and verification of a realtime communication protocol for sensor data collection and processing between an embedded computer and a DSP. In such systems, a certain amount of data loss without recovery may be tolerated. The key issue is to define and verify the correctness in the presence of these lost data frames under real-time constraints. This paper describes a temporal verification that if the end processes do not detect that too many frames are lost, defined by comparison of error counters against given threshold values, then there will be a bounded delay between transmission of …