Costas Busch Louisiana State University CCW08. Becomes an issue when designing algorithms The output of the algorithms may affect the energy efficiency.

Slides:

Advertisements

Similar presentations

Energy-Efficient Distributed Algorithms for Ad hoc Wireless Networks Gopal Pandurangan Department of Computer Science Purdue University.

Advertisements

* Distributed Algorithms in Multi-channel Wireless Ad Hoc Networks under the SINR Model Dongxiao Yu Department of Computer Science The University of Hong.

Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.

A Unified View to Greedy Routing Algorithms in Ad-Hoc Networks

A Presentation by: Noman Shahreyar

Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.

Minimum Energy Mobile Wireless Networks IEEE JSAC 2001/10/18.

CLUSTERING IN WIRELESS SENSOR NETWORKS B Y K ALYAN S ASIDHAR.

Network Layer Routing Issues (I). Infrastructure vs. multi-hop Infrastructure networks: Infrastructure networks: ◦ One or several Access-Points (AP) connected.

Max-Min D-Cluster Formation in Wireless Ad Hoc Networks - Alan Amis, Ravi Prakash, Thai Vuong, Dung Huynh Presenter: Nirav Shah.

Broadcasting Protocol for an Amorphous Computer Lukáš Petrů MFF UK, Prague Jiří Wiedermann ICS AS CR.

1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Christian Schindelhauer Algorithms for Radio Networks Winter Term 2005/2006.

CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.

1 ENERGY: THE ROOT OF ALL PERVASIVENESS Anthony Ephremides University of Maryland April 29, 2004.

Multicasting in Mobile Ad-Hoc Networks (MANET)

Wireless Mesh Networks 1. Architecture 2 Wireless Mesh Network A wireless mesh network (WMN) is a multi-hop wireless network that consists of mesh clients.

An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.

A Robust Interference Model for Wireless Ad-Hoc Networks Pascal von Rickenbach Stefan Schmid Roger Wattenhofer Aaron Zollinger.

1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Theory of Interferences, Trade-Offs between.

NCKU CSIE CIAL1 Principles and Protocols for Power Control in Wireless Ad Hoc Networks Authors: Vikas Kawadia and P. R. Kumar Publisher: IEEE JOURNAL ON.

1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Mobility (III) 12th Week

Towards a Connectivity-Based, Reliable Routing Framework Alec Woo Winter NEST Retreat 2004 UC Berkeley.

Design and Analysis of an MST-Based Topology Control Algorithm Ning Li and Jennifer Hou Department of Computer Science University of Illinois at Urbana-Champaign.

Dynamic Medial Axis Based Motion Planning in Sensor Networks Lan Lin and Hyunyoung Lee Department of Computer Science University of Denver

Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.

Topology Control, Interference, and Throughput for Wireless Mesh Networks presented by Qin LIU.

Enhancing TCP Fairness in Ad Hoc Wireless Networks Using Neighborhood RED Kaixin Xu, Mario Gerla University of California, Los Angeles {xkx,

August 6, Mobile Computing COE 446 Network Planning Tarek Sheltami KFUPM CCSE COE Principles of.

1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:

Message Passing Systems A Formal Model. The System Topology – network (connected undirected graph) Processors (nodes) Communication channels (edges) Algorithm.

07/21/2005 Senmetrics1 Xin Liu Computer Science Department University of California, Davis Joint work with P. Mohapatra On the Deployment of Wireless Sensor.

بسم الله الرحمن الرحيم. Wireless Mesh Network (WMN) Izzeldin Shibeika – April, UNCC -

Clustering in Mobile Ad hoc Networks. Why Clustering? –Cluster-based control structures provides more efficient use of resources for large dynamic networks.

Introduction Distributed Algorithms for Multi-Agent Networks Instructor: K. Sinan YILDIRIM.

Gathering Data in Wireless Sensor Networks Madhu K. Jayaprakash.

High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Baruch Awerbuch, David Holmer, Herbert Rubens Szikszay Fábri Anna, ELTE IK Prog.terv.mat.

Mobile Routing protocols MANET

1 BitHoc: BitTorrent for wireless ad hoc networks Jointly with: Chadi Barakat Jayeoung Choi Anwar Al Hamra Thierry Turletti EPI PLANETE 28/02/2008 MAESTRO/PLANETE.

Wireless Ad-Hoc Networks

CS4231 Parallel and Distributed Algorithms AY 2006/2007 Semester 2 Lecture 10 Instructor: Haifeng YU.

BitTorrent enabled Ad Hoc Group 1  Garvit Singh( )  Nitin Sharma( )  Aashna Goyal( )  Radhika Medury( )

1 Maximal Independent Set. 2 Independent Set (IS): In a graph G=(V,E), |V|=n, |E|=m, any set of nodes that are not adjacent.

Energy-Efficient Shortest Path Self-Stabilizing Multicast Protocol for Mobile Ad Hoc Networks Ganesh Sridharan

A Power Assignment Method for Multi-Sink WSN with Outage Probability Constraints Marcelo E. Pellenz*, Edgard Jamhour*, Manoel C. Penna*, Richard D. Souza.

SR: A Cross-Layer Routing in Wireless Ad Hoc Sensor Networks Zhen Jiang Department of Computer Science West Chester University West Chester, PA 19335,

Algorithms for Energy-Efficient Multicasting in Static Ad Hoc Wireless Networks Mobile Networks and Applications 6, ,2001 Author ： JEFFREY E. WIESELTHIER.

Review of key networking techniques: –Reliable communication over unreliable channels –Error detection and correction –Medium access control –routing –Congestion.

Ad Hoc Multicast Routing

1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.

Self-stabilizing energy-efficient multicast for MANETs.

SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.

Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.

ETH Zurich – Distributed Computing Group Stephan HolzerSODA Stephan Holzer Silvio Frischknecht Roger Wattenhofer Networks Cannot Compute Their Diameter.

Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.

-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.

Power-Aware Topology Control for Wireless Ad-Hoc Networks Wonseok Baek and C.-C. Jay Kuo Department of Electrical Engineering University of Southern California.

RTLAB Real-Time Systems Lab. Kyungpook National University School of Electrical Engineering and Computer Science Sung Ho Park Message Ferrying: Proactive.

Data Link Layer Architecture for Wireless Sensor Networks Charlie Zhong September 28, 2001.

Dominik Kaspar, Eunsook Kim, Carles Gomez, Carsten Bormann

ECE 544 Protocol Design Project 2016

Shuffle Exchange Point-to-point, Bus, Ring, Star, Mesh

Sensor Network Routing

Net 435: Wireless sensor network (WSN)

Ad hoc Routing Protocols

by Saltanat Mashirova & Afshin Mahini

Totally Disjoint Multipath Routing in Multihop Wireless Networks Sonia Waharte and Raoef Boutaba Presented by: Anthony Calce.

Routing in Ad Hoc Networks: A Case for Long Hops

ECE453 – Introduction to Computer Networks

Introduction Wireless Ad-Hoc Network

Presentation transcript:

Costas Busch Louisiana State University CCW08

Becomes an issue when designing algorithms The output of the algorithms may affect the energy efficiency

Computation power at each node is abundant Unlimited energy for computations at each node Computation time at each node does not affect total time complexity Point to point communication Messages in local neighborhood can be sent simultaneously Message delivery dominates time complexity

The network is reliable The network topology does not change The messages are delivered as expected Global Synchronization All nodes can synchronize A special node initiates the algorithm The algorithm runs only once One shot problems

Computation power is limited Communication is not point-to-point Requires more energy due to channel interference The network is unreliable (ad hoc, mobility) More energy to transfer messages Global synchronization is not easy More messages, energy to achieve synchronization An algorithm may run forever It continuously consumes energy

Consider energy consumption when designing algorithms Do not make strong assumptions Design algorithms with: Smaller computation at each node Low message complexity Self-stabilizing Local Online

Classic metrics: Number of messages Total time New metrics: Max, Average utilization of the nodes Combination of the above metrics Number of Messages X Total Time? What are realistic metrics of performance?

Topology Control Focuses on obtaining sparse connected spanners, But what is the effect on load balancing? Routing Focuses on just obtaining routing paths, But what is the effect on congestion?

Peer-to-peer Focus on uniformly distributing and accessing the data But what about the actual node utilization and actual network paths? Data aggregation Focus on minimizing the total aggregation cost, But how does this affect the max cost at a node? Facility location Focus on path distances But how about the load on each facility?

How frequently do uniform disc graphs appear in practice? Can we afford to ignore maximum node utilization? Is the computation power at each node abundant?