Three-Dimensional Broadcasting with Optimized Transmission Efficiency in Wireless Networks Yung-Liang Lai and Jehn-Ruey Jiang National Central University.

Slides:



Advertisements
Similar presentations
8.1 Prisms, Area and Volume Prism – 2 congruent polygons lie in parallel planes corresponding sides are parallel. corresponding vertices are connected.
Advertisements

Advisor : Prof. Yu-Chee Tseng Student : Yi-Chen Lu 12009/06/26.
Chapter 12: Surface Area and Volume of Solids
Wireless Broadcasting with Optimized Transmission Efficiency Jehn-Ruey Jiang and Yung-Liang Lai National Central University, Taiwan.
1 Coverage and Connectivity in Three-Dimensional Networks Edited and Presented by: Ahmed Sobeih 19 th February 2007 S. M. Nazrul Alam, Zygmunt J. Haas.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
Globecom 2004 Energy-Efficient Self-Organization for Wireless Sensor Networks: A Fully Distributed approach Liang Zhao, Xiang Hong, Qilian Liang Department.
Layered Diffusion based Coverage Control in Wireless Sensor Networks Wang, Bang; Fu, Cheng; Lim, Hock Beng; Local Computer Networks, LCN nd.
Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha Presented by Ray Lam Oct 23, 2004.
Energy Aware Directed Diffusion for Wireless Sensor Networks Jisul Choe, 2Keecheon Kim Konkuk University, Seoul, Korea
Chapter 12 Surface Area and Volume. Topics We Will Discuss 3-D Shapes (Solids) Surface Area of solids Volume of Solids.
Chapter 12 Surface Area and Volume. Topics We Will Discuss 3-D Shapes (Solids) Surface Area of solids Volume of Solids.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 9.4 Volume and Surface Area.
Chapter 15: Geometric Solids Brian BarrDan Logan.
 A Polyhedron- (polyhedra or polyhedrons)  Is formed by 4 or more polygons (faces) that intersect only at the edges.  Encloses a region in space. 
Chapter 12 Notes.
Energy Saving In Sensor Network Using Specialized Nodes Shahab Salehi EE 695.
Department of Computer Science and Engineering The Ohio State University Key Student Collaborator: Xiaole Bai and Jin.
Fundamental Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks Yuanzhong Xu, Xinbing Wang Shanghai Jiao Tong University, China.
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
Decentralized Scattering of Wake-up Times in Wireless Sensor Networks Amy L. Murphy ITC-IRST, Trento, Italy joint work with Alessandro Giusti, Politecnico.
Surface Area and Volume Chapter 12. Exploring Solids 12.1 California State Standards 8, 9: Solve problems involving the surface area and lateral area.
How much deeper would oceans be if sponges didn’t live there?
Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha.
SPONTANEOUS TOPOLOGICAL TRANSITIONS IN BIDISPERSE CELLULAR FLUIDS Rafał Olejniczak and Waldemar Nowicki Department of Physical Chemistry, Faculty of Chemistry,
WMNL Sensors Deployment Enhancement by a Mobile Robot in Wireless Sensor Networks Ridha Soua, Leila Saidane, Pascale Minet 2010 IEEE Ninth International.
Three-Dimensional Broadcasting with Optimized Transmission Efficiency in Dense Wireless Networks Presented by Prof. Jehn-Ruey Jiang National Central University,
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
Patch Based Mobile Sink Movement By Salman Saeed Khan Omar Oreifej.
Energy-Optimal Online Algorithms for Broadcasting in Wireless Network Shay Kutten Hirotaka ono David Peleg Kunihiko Sadakane Masafumi Yamashita.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
1 Deterministic Collision-Free Communication Despite Continuous Motion ALGOSENSORS 2009 Saira Viqar Jennifer L. Welch Parasol Lab, Department of CS&E TEXAS.
A. Polyhedrons 1. Vocabulary of Polyhedrons 2. Building Polyhedrons a. Create a net from the Polyhedron b. Create the Polyhedron from the net B. Prisms.
Chapter 12 Section 1 Exploring Solids Using Properties of Polyhedra Using Euler’s Theorem Richard Resseguie GOAL 1GOAL 2.
1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.
KAIS T Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai, Santosh Kumar, Dong Xuan, Ziqiu Yun and Ten H.Lai MobiHoc 2006.
Efficient Energy Management Protocol for Target Tracking Sensor Networks X. Du, F. Lin Department of Computer Science North Dakota State University Fargo,
1.7: Three-Dimensional Figures.  Polyhedron - a solid with all flat surfaces that enclose a single region of space  Face – each flat surface  Edges-
Chapter 12.1 Notes Polyhedron – is a solid that is bounded by polygons, called faces, that enclose a single region of space. Edge – of a polygon is a line.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
4 Introduction Broadcasting Tree and Coloring System Model and Problem Definition Broadcast Scheduling Simulation 6 Conclusion and Future Work.
Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.
TESSELLATIONS A Tessellation (or Tiling) is a repeating pattern of figures that covers a plane without any gaps or overlaps.
Ch 12 and 13 Definitions. 1. polyhedron A solid with all flat surfaces that enclose a single region of space.
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
A Multi-Channel Cooperative MIMO MAC Protocol for Wireless Sensor Networks(MCCMIMO) MASS 2010.
Coverage and Energy Tradeoff in Density Control on Sensor Networks Yi Shang and Hongchi Shi University of Missouri-Columbia ICPADS’05.
A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networks Di Tian, and Nicolas D. Georanas ACM WSNA ‘ 02.
Ben Miller.   A distributed algorithm is a type of parallel algorithm  They are designed to run on multiple interconnected processors  Separate parts.
Section 12-1 Exploring Solids. Polyhedron Three dimensional closed figure formed by joining three or more polygons at their side. Plural: polyhedra.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
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.
/ 24 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai Santosh Kumar Dong Xuan Computer Science and Engineering The Ohio.
KAIS T Location-Aided Flooding: An Energy-Efficient Data Dissemination Protocol for Wireless Sensor Networks Harshavardhan Sabbineni and Krishnendu Chakrabarty.
Wireless sensor and actor networks: research challenges Ian. F. Akyildiz, Ismail H. Kasimoglu
Surface area and volume. Polyhedrons Polyhedron- a 3-dimensional object with all flat surfaces.
Mingze Zhang, Mun Choon Chan and A. L. Ananda School of Computing
2010 IEEE Global Telecommunications Conference (GLOBECOM 2010)
Polyhedra and Prisms.
Polyhedra Mikhilichenko Yelena-Maths teacher
Polyhedra Mikhаilichenko Yelena-Maths teacher
By: Ziji Song Advisor: Prof. J. Spinelli
Unit 11: 3-Dimensional Geometry
Section 9.4 Volume and Surface Area
Unit 11: 3-Dimensional Geometry
12-1 Properties of Polyhedra
Surface Area and Volume
Vertical Angles Vertical angles are across from each other and are created by intersecting lines.
Geometry Chapter : Exploring Solids.
14 Chapter Area, Pythagorean Theorem, and Volume
Presentation transcript:

Three-Dimensional Broadcasting with Optimized Transmission Efficiency in Wireless Networks Yung-Liang Lai and Jehn-Ruey Jiang National Central University

Outline  Introduction  Related Work  Our solution: Hexagonal Prism Ring Pattern 3D Optimized Broadcasting Protocol (3DOBP)  Performance Comparisons  Conclusion 2

Outline  Introduction  Related Work  Our solution: Hexagonal Prism Ring Pattern 3D Optimized Broadcasting Protocol (3DOBP)  Performance Comparisons  Conclusion 3

 3D wireless networks are deployed in Multi-storey building (or warehouse) Outer space (gravity-free factory) Ocean (underwater sensor network)  3D broadcasting A source node disseminates a broadcast message (e.g., control signal or reprogramming code) to every node in a specified 3D space Broadcasting in 3D Wireless Networks 4

 A simple protocol for broadcasting The source node sends out the broadcast message Every other node rebroadcasts the message once It is likely that every node gets the message  Drawbacks: Broadcast storm problem (too many collisions) Low transmission efficiency due to a lot of redundant rebroadcast spaceFlooding 5 Redundant rebroadcast space

Transmission Efficiency The theoretical upper bound of transmission efficiency is 0.61 for the 2D plane, and 0.84 for the 3D space. 6 COST BENEFIT

 We focus on the problem of selecting rebroadcast nodes to fully span all nodes in the network (coverage) to keep all rebroadcast nodes connected (connectivity) to achieve the optimized transmission efficiency for minimizing the number of rebroadcast nodes –to save energy –to reduce collision Optimized Transmission Efficiency 7 Selecting 4 (out of 8) nodes to rebroadcast can span all nodes. Is this good enough?

3D Covering Problem in Geometry  Transmission range of a node is assumed as a sphere.  The problem can be modeled as the 3D Covering Problem in Geometry.  “How to place a minimum number of connected spheres to fully cover a 3D space” 8 Cube Hexagonal Prism Truncated octahedron Rhombic Dodecahedron

Outline  Introduction  Related Work  Our solution: Hexagonal Prism Ring Pattern 3D Optimized Broadcasting Protocol (3DOBP)  Performance Comparisons  Conclusion 9

 Most are Polyhedron Space-Filling Approaches: Transmission range of a node is reduced to a polyhedron Trying to activate the minimum number of nodes to cover the given space with a regular polyhedron arrangement Existing Work in 3D broadcasting Sphere Cube Transmission Range to fill space is reduced to 10

11 Space-Filling Polyhedron (1/5)  Polyhedron is a 3D shape consisting of a finite number of polygonal faces E.g., cube, hexagonal prism, …  Space-Filling Polyhedron is a polyhedron that can be used to fill a space without any overlap or gap (a.k.a, tessellation or tiling) Cube (6{4}) is space-filling

12 Space-Filling Polyhedron (2/5)  Finding a space-filling polyhedron is difficult In 350 BC, Aristotle claimed that the tetrahedron is space-filling The claim was incorrect. The mistake remained unnoticed until the 16th century! tetrahedron (4{3})

 In 1887, Lord Kelvin asked: “What is the optimal way to fill a 3D space with cells of equal volume, so that the surface area is minimized?” Kelvin’s conjecture: 14-sided truncated octahedron is the best way  Kelvin’s conjecture has not been proven yet.  The Optimization problem in 3D is very difficult! 13 Space-Filling Polyhedron (3/5) Lord Kelvin ( ) Truncated Octahedron

Space-Filling Polyhedron (4/5)  What polyhedrons can be used to fill space ? Cubes, Hexagonal prisms, Rhombic dodecahedrons, and Truncated octahedrons 14

Space-Filling Polyhedron (5/5)  What polyhedrons can be used to fill space ? Cubes, Hexagonal prisms, Rhombic dodecahedrons, and Truncated octahedrons Rhombic dodecahedrons Truncated octahedrons 15

 In polyhedron space-filling approaches, the transmission radius should be large to reach neighboring nodes, which leads high redundancy and low transmission efficiency Observation A B transmission radius A B Redundant region Can we have better arrangement ? 16

Outline  Introduction  Related Work  Our solution: Hexagonal Prism Ring Pattern 3D Optimized Broadcasting Protocol (3DOBP)  Performance Comparisons  Conclusion 17

OUR SOLUTION: 3DOBP USING HEXAGONAL PRISM RING PATTERN 18 S

Hexagonal Prism Ring Pattern (1/4)  The network space is divided into N layers, each of which is of the hexagonal prism ring pattern  Layer 1 is covered by a set activated nodes … Layer N is covered by a set activated nodes Layer 1 Layer 2 How to activate nodes to cover a layer ? 19

Hexagonal Prism Ring Pattern (2/4) Hexagonal Prism Ring Pattern (2/4)  Reducing spheres to hexagonal prisms The size of hexagonal prisms is determined by R t  Basic procedures to cover a layer of prisms: (1) Source node initially sends out the broadcast message (2) Nodes are activated to form hexagonal prism rings (3) Repeat steps (1) and (2) until the entire layer is covered ● R t : Transmission Radius Center (Initial) Node 20

Hexagonal Prism Ring Pattern (3/4) To activate nodes to rebroadcast ring by ring (in 2D view) Nodes on centers of hexagons Nodes on vertexes of hexagons ssss Step.1 (1 node) Step.2 (3 nodes) Step.3 (6 nodes) 21

HEXAGONAL PRISM RING PATTERN (4/4) 22

3DOBP: 3D Optimized Broadcasting Protocol  Mechanisms of 3DOBP (1) Contention Control (2) Intralayer Activation (3) Interlayer Activation 23

3DOBP : Activation Structure  3DOBP is based on the hexagonal prism ring pattern S 24 S S

3DOBP : Contention Control  (1) Contention Control Location-based contention control 25 Packet P 2 67 Sender: 1.Sends a packet with destination Receiver: 1.Calculates distance from itself to destination 2.Set backoff-timer : Shorter distance  Shorter backoff 3.Wait for backoff-timer to expire to rebroadcast ***The nodes with the shortest distance will win

3DOBP : Intralayer Activation  Intralayer activation at layer t 26 S S Packet P S V t,1,0 V t,1,1 V t,1,2 Packet P   

3DOBP: Interlayer Activation Layer 1 Layer -1 Layer 0 Start Node S 0 Interlayer Node I 1 Start Node S 1 Interlayer Node I -1 Start Node S -1 ◎  ◎  ◎ 27

Outline  Introduction  Related Work  Our solution: Hexagonal Prism Ring Pattern 3D Optimized Broadcasting Protocol (3DOBP)  Performance Comparisons  Conclusion 28

Transmission Efficiency  Transmission Radius : R t  Transmission Efficiency: Cube: Truncated Octahedron Details are all in the paper N  29 N 

Comparisons of Transmission Efficiency  Transmission Efficiency ApproachTransmission Efficiency Truncated Octahedron-based3/8π ≈ Hexagonal Prism-based3/( ) ≈ Rhombic Dodecahedron-based3/( ) ≈ Cube-based3/4π ≈ Hexagonal Prism Ring-based1/π ≈ Upper Bound

Simulation Result 31 Node Density (nodes per transmission area on a layer plane)

Conclusion  We study the problem about how to optimize the transmission efficiency in 3D wireless networks  We propose Hexagonal Prism Ring Pattern (HPRP) and 3D Optimized Broadcast Protocol (3DOBP) to solve the problem  HPRP is the best solution so far  The HPRP is also useful for other applications, such as convergecast. 32

Thank You! 33