Efficient distribution of An infrastructure Cluster network under constraints Ben Gurion University, Communication System Engineering Department, Faculty.

Slides:

Advertisements

Similar presentations

Chapter 5: Tree Constructions

Advertisements

Lindsey Bleimes Charlie Garrod Adam Meyerson

1 Structures for In-Network Moving Object Tracking inWireless Sensor Networks Chih-Yu Lin and Yu-Chee Tseng Broadband Wireless Networking Symp. (BroadNet),

Management Science 461 Lecture 2b – Shortest Paths September 16, 2008.

Hierarchical Decompositions for Congestion Minimization in Networks Harald Räcke 1.

Coverage Algorithms Mani Srivastava & Miodrag Potkonjak, UCLA [Project: Sensorware (RSC)] & Mark Jones, Virginia Tech [Project: Dynamic Sensor Nets (ISI-East)]

Multicasting in Mobile Ad-Hoc Networks (MANET)

Graph Algorithms: Minimum Spanning Tree We are given a weighted, undirected graph G = (V, E), with weight function w:

Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of.

Probabilistic Data Aggregation Ling Huang, Ben Zhao, Anthony Joseph Sahara Retreat January, 2004.

CSE 222 Systems Programming Graph Theory Basics Dr. Jim Holten.

T H E O H I O S T A T E U N I V E R S I T Y Computer Science and Engineering T H E O H I O S T A T E U N I V E R S I T Y Computer Science and Engineering.

1 Introduction to Industrial Engineering (II) Z. Max Shen Dept. of Industrial Engineering and Operations Research University of California.

1 Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network Prof. Yu-Chee Tseng Department of Computer Science National Chiao-Tung University.

Linear Programming – Max Flow – Min Cut Orgad Keller.

Interference Minimization and Uplink Relaying For a 3G/WLAN Network Ju Wang Virginia Commonwealth University May, 2005.

The Shortest Path Problem

Kick-off meeting 3 October 2012 Patras. Research Team B Communication Networks Laboratory (CNL), Computer Engineering & Informatics Department (CEID),

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

Direct movement has long relocation time and overuses the redundant sensor Motivation Coverage under random deployment Coverage under clustering All the.

1 Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment Infocom /12/20.

Xin-Wei Shih and Yao-Wen Chang.  Introduction  Problem formulation  Algorithms  Experimental results  Conclusions.

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)

SOS: A Safe, Ordered, and Speedy Emergency Navigation Algorithm in Wireless Sensor Networks Andong Zhan ∗ †, Fan Wu ∗, Guihai Chen ∗ ∗ Shanghai Key Laboratory.

Mobility Limited Flip-Based Sensor Networks Deployment Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic.

Network Aware Resource Allocation in Distributed Clouds.

IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.

Evgueni (Eugene) Khokhlov1 A Mobility-Centric Data Dissemination Algorithm for Vehicular Networks (MDDV) Evgueni (Eugene) Khokhlov.

De-Nian Young Ming-Syan Chen IEEE Transactions on Mobile Computing Slide content thanks in part to Yu-Hsun Chen, University of Taiwan.

7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.

Module 5 – Networks and Decision Mathematics Chapter 23 – Undirected Graphs.

Efficient Deployment Algorithms for Prolonging Network Lifetime and Ensuring Coverage in Wireless Sensor Networks Yong-hwan Kim Korea.

DDR-based Multicast routing Protocol with Dynamic Core (DMPDC) Shiyi WU, Navid Nikaein, Christian BONNET Mobile Communications Department EURECOM Institute,

An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle Presented by Yu Wang.

RF network in SoC1 SoC Test Architecture with RF/Wireless Connectivity 1. D. Zhao, S. Upadhyaya, M. Margala, “A new SoC test architecture with RF/wireless.

Foundations of Data Structures Practical Session #13 Graphs Algorithms.

University “Ss. Cyril and Methodus” SKOPJE Cluster-based MDS Algorithm for Nodes Localization in Wireless Sensor Networks Ass. Biljana Stojkoska.

“Fault Tolerant Clustering Revisited” - - CCCG 2013 Nirman Kumar, Benjamin Raichel خوشه بندی مقاوم در برابر خرابی سپیده آقاملائی.

Joint Power and Channel Minimization in Topology Control: A Cognitive Network Approach J ORGE M ORI A LEXANDER Y AKOBOVICH M ICHAEL S AHAI L EV F AYNSHTEYN.

Union-Find  Application in Kruskal’s Algorithm  Optimizing Union and Find Methods.

LOCALIZED MINIMUM - ENERGY BROADCASTING IN AD - HOC NETWORKS Paper By : Julien Cartigny, David Simplot, And Ivan Stojmenovic Instructor : Dr Yingshu Li.

Aggregation and Secure Aggregation. Learning Objectives Understand why we need aggregation in WSNs Understand aggregation protocols in WSNs Understand.

Overview of Wireless Networks: Cellular Mobile Ad hoc Sensor.

Distributed Topology Control In Wireless Sensor Networks with Assymetric Links Presenter: Himali Saxena.

Connected Point Coverage in Wireless Sensor Networks using Robust Spanning Trees IEEE ICDCSW, 2011 Pouya Ostovari Department of Computer and Information.

Indian Institute of Technology Kharagpur PALLAB DASGUPTA Graph Theory: Trees Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering, IIT

Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.

Aggregation and Secure Aggregation. [Aggre_1] Section 12 Why do we need Aggregation? Sensor networks – Event-based Systems Example Query: –What is the.

Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network You-Chiun Wang, Chun-Chi Hu, and Yu-Chee Tseng IEEE Transactions on Mobile Computing.

Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.

Chapter 11. Chapter Summary  Introduction to trees (11.1)  Application of trees (11.2)  Tree traversal (11.3)  Spanning trees (11.4)

Simulation of K-Clustering in a Wireless Ad-Hoc Network using a decentralized Local Search Supervised by: Dr. Rachel Ben- Eliyahu Kirill Kazatsker Daniel.

5.6 Prefix codes and optimal tree Definition 31: Codes with this property which the bit string for a letter never occurs as the first part of the bit string.

Clustering In Mobile Networks Presented By: Assaf Mizrachi Shimrit Artzi Tutor: Dr. Michael Segal.

Motivation Analysis Definitions Decision Function Simulation Projects' Day 2008 WiMAX & WiFi Network Combination Ben Gurion University Department of Communication.

The (k, l) Coredian Tree for Ad-Hoc Networks Department of Communication Systems Engineering, Ben-Gurion University of the Negev, 2008 Vladimir Katz Alex.

Students: Yossi Turgeman Avi Deri Self-Stabilizing and Efficient Robust Uncertainty Management Instructor: Prof Michel Segal.

Location of mobile devices in the Ad Hoc Network

Prof. Yu-Chee Tseng Department of Computer Science

Video scheduling algorithm

NSF Faculty Career Award

Mayank Bhatt, Jayasi Mehar

Research: algorithmic solutions for networking

Robustness of wireless ad hoc network topologies

Department of Computer Science University of York

Robustness of wireless ad hoc network topologies

and 6.855J Dijkstra’s Algorithm

Implementing Multicast

Presentation transcript:

Efficient distribution of An infrastructure Cluster network under constraints Ben Gurion University, Communication System Engineering Department, Faculty of Engineering 2006 Presenting: Daniel Goldenstein Ohad Harel Supervisors: Dr. Michael Segal Mr. Amit Dvir

US Army to Deploy RFID “Listening Rocks” (Washington Times, May 27th, 2005) The Soldier’s perspective The devices are no larger than a golf ball Use of tiny silicon chips and radio frequency identification (RFID) So sensitive that it can detect the sound of a human footfall at 20ft to 30ft The Network Engineer’s perspective The “rocks” form an ad-hoc network. The main concern is how to choose the ‘best’ sites to set up certain facilities to serve the other sites.

Problem Definition A center of a graph is a vertex C such that the maximum distance from C to any other vertex is minimized. A median of a graph is a vertex M such that the maximum sum of distances from M to all other vertices is minimized. The tradeoff is between response speed (Center) and total communication cost (Median), and it is handeled in Centdian tree, which is a combination of the two. K and L parameters represent the tree’s diameter and number of leaves in the path.

The Project’s Flow Study of the existing algorithms which offer a solution to the problem Simulating the algorithms, one for each approach, using OMNET++ simulator and C++ programming language Gathering statistics, derived from the simulations

Simulating Tree Center algorithm in an ad-hoc network (K=3, L=8)

Statistics gathered from the tree center simulation The total Path Weight is 581 The total Distance from the path is 1026 The Farthest Leaf from the path is 15 and it's distance is 161 The Diameter of the path is 400

Simulating Tree Core algorithm in an ad-hoc network (K=3, L=8)

The total Path Weight is 409 The total Distance from the path is 560 The Farthest Leaf from the path is 21 and it's distance is 102 The Diameter is 270 Statistics gathered from the tree core simulation

Simulating Tree Centdian algorithm in an ad-hoc network (K=3, L=8, λ = 0.25)

The total Path Weight is 561 The total Distance from the path is 770 The Farthest Leaf from the path is 9 and it's distance is 181 The Diameter is 377 Statistics gathered from the tree centdian simulation

Open Cluster Ad-Hoc Network Issues Maintaining the selected path according to ad-hoc changes – a node’s failure, a node’s movement, etc. Finding trees under the constraint of Multicast leaves Finding trees under the constraint of the Cluster’s weight