energy the root of all pervasiveness n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
ENERGY: THE ROOT OF ALL PERVASIVENESS PowerPoint Presentation
Download Presentation
ENERGY: THE ROOT OF ALL PERVASIVENESS

Loading in 2 Seconds...

play fullscreen
1 / 19

ENERGY: THE ROOT OF ALL PERVASIVENESS - PowerPoint PPT Presentation


  • 102 Views
  • Uploaded on

ENERGY: THE ROOT OF ALL PERVASIVENESS. Anthony Ephremides University of Maryland April 29, 2004. “PERVASIVE” NETWORKING. Ability to access the network (“Anywhere,” Anytime,” “Anyone”) Focus on wireless More specifically: Ad Hoc (multihop). KEY ELEMENTS. Wireless Channel fading

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'ENERGY: THE ROOT OF ALL PERVASIVENESS' - lucio


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
energy the root of all pervasiveness

ENERGY: THE ROOT OF ALLPERVASIVENESS

Anthony Ephremides

University of Maryland

April 29, 2004

pervasive networking
“PERVASIVE” NETWORKING
  • Ability to access the network

(“Anywhere,” Anytime,” “Anyone”)

  • Focus on wireless
  • More specifically: Ad Hoc

(multihop)

key elements
KEY ELEMENTS
  • Wireless Channel
      • fading
      • interference
      • SINR
  • Portable Energy Supply
      • efficiency

vs.

      • limited
    • ‘SOFT” – LINK GRAPHS
    • CROSS-LAYER COUPLING

>

<

two illustrations
TWO ILLUSTRATIONS
  • MAC/ROUTING

with

Energy Metrics

  • Processing vs. Transmission

in

Sensor Networks

mac routing
MAC/ROUTING
  • Routing algorithm flows on each link
  • MAC assigns resources to competing flows
  • Actual link throughput depends on MAC
  • New link quality metric values
  • Routing Algorithm new flows
multi hop ad hoc network
MULTI-HOP AD HOCNETWORK
  • Single channel – slotted time
  • Separate control channel
  • Single transceiver per node
  • Power control - Pmax
        • regulate interference
        • save energy
  • Simple attenuation model
        • free-space, distance based
  • SINR

>

<

slide7

SCHEDULING

  • Scheduling Rules:
  • A node can only be associated with one active link at a time.
  • SIR requirements are satisfied.
  • The link with the lowest metric has the top priority.
slide8

Scheduling Algorithms:

1. Power is preset. Links are added (if SIRs are satisfied) in the order of link metric. Easy for distributed implementation.

2. With iterative power control. Links are added (if SIRs are satisfied) in the order of link metric. Difficult for distributed implementation.

3. First find maximal number of links that can coexist, then run iterative power control. Remove links until SIRs are satisfied. Difficult for distributed implementation.

slide9

Simulation Results

No rerouting.

Throughput and Delay for different scheduling algorithms.

slide10

JOINT SCHEDULING AND ROUTING

Routing:Bellman-Ford algorithm with routing distance:

control of sensor networks
CONTROL OFSENSOR NETWORKS
  • Application : Major Driver
  • But, in all cases: Longevity

(energy efficiency)

  • Major Challenges:
    • MAC
    • Routing

(map application-related objective function to link metric or MAC priority)

slide12

SENSOR NETWORK FOR

DETECTION

Ignore Routing Component

control node

slide13

1

2

K

MODEL

  • Simplified Model

control center

Each Node

Collects Independently

T independent

Binary Measurements

model cont
MODEL (cont.)

Three Operating Options

- Centralized :

All data transmitted to CC

- Distributed :

Each node decides & transmits its decision to CC

- Quantized :

Each node sends a quantized M-bit quantity to CC

where

energy consumption analysis
ENERGY CONSUMPTION ANALYSIS

- Energy for Data Processing

- based on # of comparisons

- represents the energy consumed for one comparison

- is the # of comparisons

- Energy for Transmission

- based on the distance from sensor nodes to control center and # of bits

transmitted

- represents the energy consumed for transmitting one bit data

over a unit distance, for a fixed communication system

- represents the distance from sensor nodes to control center

- is the # of bits transmitted

- Total Energy

energy consumption analysis cont
ENERGY CONSUMPTIONANALYSIS (cont.)

- Energy Consumption per Node for Three Options

- Centralized Option

- option 1: transmit all observations to CC

- option 2: transmit # of 1 out of T observations to CC

- Distributed Option

- Quantized Option (suboptimal solution)

where represents the expected # of comparisons needed for the suboptimal solution, which is a function of

energy consumption analysis cont1
Energy ConsumptionAnalysis (cont.)

- Energy Consumption vs. Accuracy

fix ; vary

example 1:

example 2:

next steps
NEXT STEPS
  • Spatial/Temporal Correlation
  • Routing (map objective function to link metric)
  • Broader measurement model

MORE FUNDAMENTALLY

  • Couple processing energy (dictated by the chosen SP algorithm) to the embedded system design. (memory management, signal flow graphs for software vs. hardware split, computing fabric)
  • Trade-off transmission to processing under such “INTERACTIVE” design (ultimate cross-layering)
conclusions
CONCLUSIONS
  • Holistic cross-layer design from energy point of view
  • Application dependency/exploitation
  • “It takes courage to succeed”

“It takes energy to be pervasive”