BROADCAST WITH NETWORK CODING: DRAGONCAST (DRAFT-ADJIH-DRAGONCAST-00)
|
|
|
- Estella Williams
- 6 years ago
- Views:
Transcription
1 BROADCAST WITH NETWORK CODING: DRAGONCAST (DRAFT-ADJIH-DRAGONCAST-00) Cédric Adjih, SongYean Cho, Emmanuel Baccelli IETF 87 BERLIN
2 Robust Wireless Broadcast Problem Statement: Robust Network Broadcast? Context: Wireless multi-hop networks, packet networks (IP) Single source broadcast Applicability/Requirements Time-variation in topology, mobility Unreliability of wireless communications Source: (wikipedia: Felin)
3 Standard Broadcast Solutions RFC 6206 : Trickle (ROLL, sensor networks) RFC 6621 : Simplified Multicast Forwarding (SMF), (MANET, ad hoc networks) We can achieve more robustness with network coding Natural FEC Reduced signaling
4 DRAGONCAST Single source robust broadcast leveraging network coding Simple, dynamic, generic and modular Simple: Only information of neighbor state Simplified control plane (headers) Dynamic: Allows: topology change, transient losses, Generic: No assumptions (interference, mobility, loss probability ) Not specific to MAC/Phy layers
5 Overview of Proposed Protocol DRAGONCAST key aspects: Wireless Network Coding, with intra-flow coding Gen. Coded packets with random linear coding Distributed functioning Primitive: wireless transmission (received by neigh.) Neighborcast: ALL_MANET_ROUTERS Applicability: Operation below capacity = congestion control unneeded
6 DRAGONCAST Modular Arch. DRAGON Packet Rate Selection SEW Real-Time Decoding DRAGONCAST Protocol DRAS Signaling DRALIB Local Information Base IETF 87
7 DRAGONCAST Modular Arch. When to send packets How to code/decode packets DRAGON Packet Rate Selection SEW Real-Time Decoding Protocol Logic DRAGONCAST Protocol DRAS Signaling DRALIB Local Information Base How to signal node state How to store information about neighbor nodes IETF 87
8 DRAGONCAST Modular Arch. When to send packets DRAGON Packet Rate Selection SEW Real-Time Decoding DRAGONCAST Protocol DRAS Signaling DRALIB Local Information Base IETF 87
9 Packet Rate Policy: DRAGON Policy module: when to send packets? Principle: Every node retransmits with a given packet rate Packet rate is adjusted with a feedback control Proposed heuristic D.R.A.G.O.N. 龍 : Dynamic Rate Adaptation from Gap with Other Nodes Robust Heuristics: Higher packet rate when a neighbor is falling behind Nodes cooperate to help node Based on Neighbor Information Set (in DRALIB) For every neighbor: rank, number of neighbors [CA08a] Cho, S-Y. and C. Adjih, "Wireless Broadcast with Network Coding: Dynamic Rate Selection", Conference MedHocNet 2008, June 2008
10 Packet Rate Policy: DRAGON Documented in draft-adjih-dragoncast Local Received Rate total packet rate of from neighbors Greater than: K x avg. gap Gap closed in time 1/ K Running code + proof of convergence Modular architecture allows other approaches Static networks: linear program Better control algorithms, back-pressure, v 2 v 1 t v 3 v 4
11 DRAGONCAST Modular Arch. DRAGON Packet Rate Selection SEW Real-Time Decoding DRAGONCAST Protocol DRAS Signaling How to signal node state DRALIB Local Information Base How to store information about neighbor nodes IETF 87
12 DRAS: Packet format ! ! ! Packet size! !! Protocol Message Element (PME)! !! !! :... :!! !! !! Protocol Message Element (PME)! !! ! IETF 87
13 Protocol Overview (1/3) Source Node U State of node U (DRALIB) Decoding Information Base Q 1 = P 1 +2 P 2 +4 P 3 Q 2 = P 1 +2 P 2 +P 3 Q 3 = P 2 +P 3 (rank=3 ) [ ] IETF 87
14 Protocol Overview (2/3) Node W Source Node U State of node U (DRALIB) Node V Decoding Information Base Q 1 = P 1 +2 P 2 +4 P 3 Q 2 = P 1 +2 P 2 +P 3 Q 3 = P 2 +P 3 (rank=3 ) [ ] (RLC: Q 1 +Q 3 ) Coded Packet (w/ DRAS) Rank=3 Known neigh.=2 Encoding vector=(1,3,5,0, ) Content = [P 1 +3 P 2 +5 P 4 ] Header for DRAGON IETF 87
15 Protocol Overview (3/3) Node W State of node V (DRALIB) Source Node U State of node U (DRALIB) Node V Decoding Information Base [ ] Q k = P 1 +3 P 2 +5 P 4 Neighbor Information Set [ ] Decoding Information Base Q 1 = P 1 +2 P 2 +4 P 3 Q 2 = P 1 +2 P 2 +P 3 Q 3 = P 2 +P 3 (rank=3 ) [ ] (RLC: Q 1 +Q 3 ) Coded Packet (w/ DRAS) Rank=3 Known neigh.=2 Encoding vector=(1,3,5,0, ) Content = [P 1 +3 P 2 +5 P 4 ] Node U: rank = 3, #neigh =2 IETF 87
16 DRAGONCAST Modular Arch. When to send packets How to code/decode packets DRAGON Packet Rate Selection SEW Real-Time Decoding Protocol Logic DRAGONCAST Protocol DRAS Signaling DRALIB Local Information Base How to signal node state How to store information about neighbor nodes IETF 87
17 SEW: Sliding Encoding Window Principle: real-time robust decoding Variant of Gauss-Jordan elimination in packet set Decoded Unseen P 1 P 3 x.p 4 + y.p 5 + P 6 P 1 P 2 P 3 P 4 P 5 P 6 P 7 P 8 P 9 P 10 P ?? ?? ?? 0 0?? 1 0 [CA08b] Cho, S-Y. and C. Adjih, "Wireless Broadcast with Network Coding: DRAGONCAST", Inria RR-6569, July 2008.
18 SEW: Sliding Encoding Window Macroscopic view: Decoded Being Decoded Unseen P 3 P 4 P 23 P 24 Lowest index Highest index
19 SEW: Sliding Encoding Window Macroscopic view: Decoded Being Decoded Unseen P 3 P 4 P 23 P 24 Lowest index Highest index Any linear combination of packets with indices < Highest index will help decoding
20 SEW: Real-Time Decoding Idea of SEW: Add a header with lowest index, highest index -> Neighbor Information Set Distributed cooperation: Only send coded packets that will help the most lagging neighbor If L = lowest index of neighbor Send packets with indices [L, L+1, L+2,. L+W] Window size W, tradeoff: Efficiency vs- decoding delay
21 Conclusion Draft in -00 state Generic modular architecture defined Some TBDs within modules Interest of the RG for: This type of problem statement/application? This type of architecture? Ready for input of wg On different modules On the architecture
22 THANK YOU
23 WNC Broadcast Basic broadcast protocol with random linear coding: Sources generates P 1, P 2, P 3,. with fixed rate Every retransmission in the network is a linear combination of source packets: Q = a 1 P 1 + a 2 P a k P k Every node keeps a set of coded packets Every node regularily retransmits packets with a given rate: Create random linear combination Send coded packets, with associated combination Decoding: linear algebra IETF 87
Network coding in military wireless ad hoc and sensor networks: Experimentation with GardiNet
Network coding in military wireless ad hoc and sensor networks: Experimentation with GardiNet Ichrak Amdouni, Cédric Adjih, Thierry Plesse To cite this version: Ichrak Amdouni, Cédric Adjih, Thierry Plesse.
Near Optimal Broadcast with Network Coding in Large Sensor Networks
in Large Sensor Networks Cédric Adjih, Song Yean Cho, Philippe Jacquet INRIA/École Polytechnique - Hipercom Team 1 st Intl. Workshop on Information Theory for Sensor Networks (WITS 07) - Santa Fe - USA
Lecture 10: Link layer multicast. Mythili Vutukuru CS 653 Spring 2014 Feb 6, Thursday
Lecture 10: Link layer multicast Mythili Vutukuru CS 653 Spring 2014 Feb 6, Thursday Unicast and broadcast Usually, link layer is used to send data over a single hop between source and destination. This
XORs in the Air: Practical Wireless Network Coding
XORs in the Air: Practical Wireless Network Coding S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, J. Crowcroft MIT & University of Cambridge Can we use 3 transmissions to send traffic? 1 2 4 3 Can we
Mobile Communications. Ad-hoc and Mesh Networks
Ad-hoc+mesh-net 1 Mobile Communications Ad-hoc and Mesh Networks Manuel P. Ricardo Faculdade de Engenharia da Universidade do Porto Ad-hoc+mesh-net 2 What is an ad-hoc network? What are differences between
ECE 333: Introduction to Communication Networks Fall 2001
ECE : Introduction to Communication Networks Fall 00 Lecture : Routing and Addressing I Introduction to Routing/Addressing Lectures 9- described the main components of point-to-point networks, i.e. multiplexed
TOPOLOGY CONTROL IN MOBILE AD HOC NETWORKS WITH COOPERATIVE COMMUNICATIONS
IEEE 2012 Transactions on Wireless Communications, Volume: 9, Issue: 2 TOPOLOGY CONTROL IN MOBILE AD HOC NETWORKS WITH COOPERATIVE COMMUNICATIONS Abstract Cooperative communication has received tremendous
The Open System Interconnect model
The Open System Interconnect model Telecomunicazioni Undergraduate course in Electrical Engineering University of Rome La Sapienza Rome, Italy 2007-2008 1 Layered network design Data networks are usually
Routing in the Internet of Things (IoT) Rolland Vida Convergent Networks and Services
Routing in the Internet of Things (IoT) Rolland Vida Convergent Networks and Services Spring 05. IoT challenges IoT nodes are heterogeneous Some have important resources Smart phones, cars, coke machines
Internet Research Task Force (IRTF) Request for Comments: 8406 Category: Informational ISSN:
Internet Research Task Force (IRTF) Request for Comments: 8406 Category: Informational ISSN: 2070-1721 B. Adamson NRL C. Adjih INRIA J. Bilbao Ikerlan V. Firoiu BAE Systems F. Fitzek TU Dresden S. Ghanem
FECFRAME extension Adding convolutional FEC codes support to the FEC Framework
FECFRAME extension Adding convolutional FEC codes support to the FEC Framework Vincent Roca, Inria, France Ali Begen, Networked Media, Turkey https://datatracker.ietf.org/doc/draft-roca-tsvwg-fecframev2/
Wireless networks. Wireless Network Taxonomy
Wireless networks two components to be considered in deploying applications and protocols wireless links ; mobile computing they are NOT the same thing! wireless vs. wired links lower bandwidth; higher
Connectivity Aware Routing in Ad-Hoc Networks
Connectivity Aware Routing in Ad-Hoc Networks Jérémie Leguay PWC 05 With: Timur Friedman (LIP6), Vania Conan(Thales), Serge Fdida (LIP6), André Cotton(Thales) Corporate Communications Context Ad-Hoc Networks
IPv6 Operation for WAVE - Wireless Access in Vehicular Environments
IPv6 Operation for WAVE - Wireless Access in Vehicular Environments Emmanuel Baccelli INRIA, France Email: Emmanuel.Baccelli@inria.fr Thomas Clausen Hipercom@LIX Ecole Polytechnique, France Email: thomas@thomasclausen.org
Comparative Study of RPL-Enabled Optimized Broadcast in Wireless Sensor Networks
Comparative Study of RPL-Enabled Optimized Broadcast in Wireless Sensor Networks Thomas Clausen, Ulrich Herberg Laboratoire d Informatique (LIX) Ecole Polytechnique, France Thomas@ThomasClausen.org, Ulrich@Herberg.name
Network Coding Taxonomy
Network Coding Taxonomy Victor Firoiu, Brian Adamson, Vincent Roca, Cédric Adjih, Josu Bilbao, Frank Fitzek, Antonia Masucci, Marie-Jose Montpetit To cite this version: Victor Firoiu, Brian Adamson, Vincent
GATEWAY MULTIPOINT RELAYS AN MPR-BASED BROADCAST ALGORITHM FOR AD HOC NETWORKS. Ou Liang, Y. Ahmet Şekercioğlu, Nallasamy Mani
GATEWAY MULTIPOINT RELAYS AN MPR-BASED BROADCAST ALGORITHM FOR AD HOC NETWORKS Ou Liang, Y. Ahmet Şekercioğlu, Nallasamy Mani Centre for Telecommunication and Information Engineering Monash University,
olsr.org 'Optimized Link State Routing' and beyond December 28th, 2005 Elektra mesh.net
olsr.org 'Optimized Link State Routing' and December 28th, 2005 Elektra www.open mesh.net Introduction Olsr.org is aiming to an efficient opensource routing solution for wireless networks Work is currently
CE693: Adv. Computer Networking
CE693: Adv. Computer Networking L-10 Wireless Broadcast Fall 1390 Acknowledgments: Lecture slides are from the graduate level Computer Networks course thought by Srinivasan Seshan at CMU. When slides are
Routing Protocols in MANET: Comparative Study
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 7, July 2014, pg.119
' INRIA Rocquencourt, Domaine de Voluceau
OPTIMIZED FLOODING AND INTERFERENCE-AWARE QOS ROUTING IN OLSR* Dang Quan ~ ~ u ~ and e n Pascale ' ~inet' ' INRIA Rocquencourt, Domaine de Voluceau Rocquencourt - B.P 105 78153 Le Chesnay Cedex, France
Routing: Collection Tree Protocol. Original slides by Omprakash Gnawal
Routing: Collection Tree Protocol Original slides by Omprakash Gnawal Collection Anycast route to the sink(s) collects data from the network to a small number of sinks network primitive for other protocols
Ad Hoc Networks: Issues and Routing
Ad Hoc Networks: Issues and Routing Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse574-08/
Fast, Efficient, and Robust Multicast in Wireless Mesh Networks
fast efficient and robust networking FERN Fast, Efficient, and Robust Multicast in Wireless Mesh Networks Ian Chakeres Chivukula Koundinya Pankaj Aggarwal Outline IEEE 802.11s mesh multicast FERM algorithms
Alcatel-Lucent 4A Alcatel-Lucent Scalable IP Networks. Download Full Version :
Alcatel-Lucent 4A0-100 Alcatel-Lucent Scalable IP Networks Download Full Version : https://killexams.com/pass4sure/exam-detail/4a0-100 Answer: B QUESTION: 216 Which of the following statements best characterize
Lec 19 - Error and Loss Control
ECE 5578 Multimedia Communication Lec 19 - Error and Loss Control Zhu Li Dept of CSEE, UMKC Office: FH560E, Email: lizhu@umkc.edu, Ph: x 2346. http://l.web.umkc.edu/lizhu slides created with WPS Office
OSPF Protocol Overview on page 187. OSPF Standards on page 188. OSPF Area Terminology on page 188. OSPF Routing Algorithm on page 190
Chapter 17 OSPF Protocol Overview The Open Shortest Path First (OSPF) protocol is an interior gateway protocol (IGP) that routes packets within a single autonomous system (AS). OSPF uses link-state information
The P2P-RPL Routing Protocol for IPv6 Sensor Networks: Testbed Experiments
The P2P-RPL Routing Protocol for IPv6 Sensor Networks: Testbed Experiments Emmanuel Baccelli, Matthias Philipp INRIA Saclay, France E-mail: name.lastname@inria.fr Mukul Goyal UWM, USA E-mail: mukul@uwm.edu
Collection Tree Protocol. A look into datapath validation and adaptive beaconing. Speaker: Martin Lanter
Collection Tree Protocol A look into datapath validation and adaptive beaconing. Speaker: Martin Lanter Collection Protocols Why do we need collection protocols? Collecting data at a base station is a
A Reference Model for Autonomic Networking draft-behringer-anima-reference-model-00.txt
A Reference Model for Autonomic Networking 92 nd IETF, 27 Mar 2015 Michael Behringer Brian Carpenter Toerless Eckert 1 Background History A Framework for Autonomic Networking Jun 2012 draft-behringer-autonomic-network-framework-00.txt
MBC. Auto. Address. Networks. Mesh. uto- configuration for Wireless. Keecheon Kim. Konkuk University Seoul, Korea
Address Auto uto- configuration for Wireless Mesh Networks Keecheon Kim Konkuk University Seoul, Korea kckim@konkuk.ac.kr Contents Wireless Mesh Networks Auto- configuration Topics In Autoconf WG Proposed
A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET
ISSN: 2278 1323 All Rights Reserved 2016 IJARCET 296 A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET Dr. R. Shanmugavadivu 1, B. Chitra 2 1 Assistant Professor, Department of Computer
An Efficient Scheme for Detecting Malicious Nodes in Mobile ad Hoc Networks
An Efficient Scheme for Detecting Malicious Nodes in Mobile ad Hoc Networks December 1. 2006 Jong Oh Choi Department of Computer Science Yonsei University jochoi@emerald.yonsei.ac.kr Contents Motivation
Critique #2. Ø Due on 2/13 (Tuesday)
Critique #2 Ø M. Sha, G. Hackmann and C. Lu, Real-world Empirical Studies on Multi- Channel Reliability and Spectrum Usage for Home-Area Sensor Networks, IEEE Transactions on Network and Service Management,
PRIORITY-BASED BROADCASTING OF SENSITIVE DATA IN ERROR-PRONE WIRELESS NETWORKS
PRIORITY-BASED BROADCASTING OF SENSITIVE DATA IN ERROR-PRONE WIRELESS NETWORKS Pouya Ostovari, Jie Wu, and Ying Dai Center for Networked Computing http://www.cnc.temple.edu Agenda 2 Introduction Motivation
PRESENTED BY SARAH KWAN NETWORK CODING
PRESENTED BY SARAH KWAN NETWORK CODING NETWORK CODING PRESENTATION OUTLINE What is Network Coding? Motivation and Approach Network Coding with Lossless Networks Challenges in Developing Coding Algorithms
MANET Architecture and address auto-configuration issue
MANET Architecture and address auto-configuration issue Namhi Kang Catholic University E-mail: kang@catholic.ac.kr Contents Background Information Overview Common MANET misperception Multilink subnet issue
Mobile Ad-hoc Networks. Intended status: Informational July 16, 2012 Expires: January 17, 2013
Mobile Ad-hoc Networks H. Rogge Internet-Draft Fraunhofer FKIE Intended status: Informational July 16, 2012 Expires: January 17, 2013 Abstract Stateless RFC5444-based Dynamic Link Exchange Protocol (DLEP)
Realistic and Efficient Multi-Channel Communications in WSN
Realistic and Efficient Multi-Channel Communications in WSN Miji Kim Andreas Schädeli Silvia Dorotheea Rus Cievoloth Gilber Coca Olmos Content Introduction Problem description Interference problems Time
Wireless Sensor Networks Module 2: Routing
Wireless Sensor Networks Module 2: Routing Dr.-Ing. Koojana Kuladinithi, TZI, University of Bremen koo@comnets.uni-bremen.de Contents Module 2: Routing in WSNs Introduction L2 Forwarding (Mesh-Under) vs
Performance Evaluation of Various Routing Protocols in MANET
208 Performance Evaluation of Various Routing Protocols in MANET Jaya Jacob 1,V.Seethalakshmi 2 1 II MECS,Sri Shakthi Institute of Science and Technology, Coimbatore, India 2 Associate Professor-ECE, Sri
Study and Comparison of Mesh and Tree- Based Multicast Routing Protocols for MANETs
Study and Comparison of Mesh and Tree- Based Multicast Routing Protocols for MANETs Rajneesh Gujral Associate Proffesor (CSE Deptt.) Maharishi Markandeshwar University, Mullana, Ambala Sanjeev Rana Associate
Chapter 16 Networking
Chapter 16 Networking Outline 16.1 Introduction 16.2 Network Topology 16.3 Network Types 16.4 TCP/IP Protocol Stack 16.5 Application Layer 16.5.1 Hypertext Transfer Protocol (HTTP) 16.5.2 File Transfer
Mobile Ad-hoc Networks
Mobile Ad-hoc Networks Fred Baker 1 The manet problem Mobile Random and perhaps constantly changing Ad-hoc Not engineered Networks Elastic data applications which use networks to communicate 2 Examples
IPv6 Stack. 6LoWPAN makes this possible. IPv6 over Low-Power wireless Area Networks (IEEE )
Reference: 6LoWPAN: The Wireless Embedded Internet, Shelby & Bormann What is 6LoWPAN? 6LoWPAN makes this possible - Low-power RF + IPv6 = The Wireless Embedded Internet IPv6 over Low-Power wireless Area
Ad Hoc Networks: Introduction
Ad Hoc Networks: Introduction Module A.int.1 Dr.M.Y.Wu@CSE Shanghai Jiaotong University Shanghai, China Dr.W.Shu@ECE University of New Mexico Albuquerque, NM, USA 1 Ad Hoc networks: introduction A.int.1-2
A CDCA-TRACE MAC PROTOCOL FRAMEWORK IN MOBILE AD-HOC NETWORK
Research Manuscript Title A CDCA-TRACE MAC PROTOCOL FRAMEWORK IN MOBILE AD-HOC NETWORK Jaichitra.I, Aishwarya.K, P.G Student, Asst.Professor, CSE Department, Arulmigu Meenakshi Amman College of Engineering,
Wireless Sensornetworks Concepts, Protocols and Applications. Chapter 5b. Link Layer Control
Wireless Sensornetworks Concepts, Protocols and Applications 5b Link Layer Control 1 Goals of this cha Understand the issues involved in turning the radio communication between two neighboring nodes into
Performance Analysis and Enhancement of Routing Protocol in Manet
Vol.2, Issue.2, Mar-Apr 2012 pp-323-328 ISSN: 2249-6645 Performance Analysis and Enhancement of Routing Protocol in Manet Jaya Jacob*, V.Seethalakshmi** *II MECS, Sri Shakthi Institute of Engineering and
Data Link Layer (1) Networked Systems 3 Lecture 6
Data Link Layer (1) Networked Systems 3 Lecture 6 Purpose of Data Link Layer Arbitrate access to the physical layer Structure and frame the raw bits Provide flow control Detect and correct bit errors Perform
draft-begen-fecframe-interleaved-fec-scheme-00 IETF 72 July 2008 Ali C. Begen
1-D Interleaved Parity FEC draft-begen-fecframe-interleaved-fec-scheme-00 IETF 72 July 2008 Ali C. Begen abegen@cisco.com Introduction 1-D interleaved parity code Is a systematic FEC code of decent complexity
ECE 544 Protocol Design Project Team Member Names Aneesh Abhyankar Satakshi Tiwari Vishalsingh Hajeri
ECE 544 Protocol Design Project 2016 Team Member Names Aneesh Abhyankar Satakshi Tiwari Vishalsingh Hajeri Network Architecture & Topology Assumptions Service Objective: k-out-of-n packet datagram multicast
6.9 Summary. 11/20/2013 Wireless and Mobile Networks (SSL) 6-1. Characteristics of selected wireless link standards a, g point-to-point
Chapter 6 outline 6.1 Introduction Wireless 6.2 Wireless links, characteristics CDMA 6.3 IEEE 802.11 wireless LANs ( wi-fi ) 6.4 Cellular Internet Access architecture standards (e.g., GSM) Mobility 6.5
TCP Congestion Control Evolution
TCP Congestion Control Evolution (from Steven Low presentation) Junho Suh (jhsuh@mmlab.snu.ac.kr) MMLAB 1 Overview Internet History TCP basics & history Some trends in the Internet Implication from some
Chapter 5 (Week 9) The Network Layer ANDREW S. TANENBAUM COMPUTER NETWORKS FOURTH EDITION PP BLM431 Computer Networks Dr.
Chapter 5 (Week 9) The Network Layer ANDREW S. TANENBAUM COMPUTER NETWORKS FOURTH EDITION PP. 343-396 1 5.1. NETWORK LAYER DESIGN ISSUES 5.2. ROUTING ALGORITHMS 5.3. CONGESTION CONTROL ALGORITHMS 5.4.
Routing in packet-switching networks
Routing in packet-switching networks Circuit switching vs. Packet switching Most of WANs based on circuit or packet switching Circuit switching designed for voice Resources dedicated to a particular call
6LoWPAN (IPv6 based Low Power WPAN)
6LoWPAN (IPv6 based Low Power WPAN) Kyung Hee University Nov. 19. 2007 Choong Seon Hong, cshong@khu.ac.kr Outline 2 Overview of 6LoWPAN Transmission of IPv6 Packets over IEEE 802.15.4 WPAN Networks 6LoWPAN
Fairness Example: high priority for nearby stations Optimality Efficiency overhead
Routing Requirements: Correctness Simplicity Robustness Under localized failures and overloads Stability React too slow or too fast Fairness Example: high priority for nearby stations Optimality Efficiency
On Inter-layer Assumptions
On Inter-layer Assumptions (A View from the Transport Area) Mark Handley ACIRI/ICSI mjh@aciri.org Ping The Internet Hourglass FTP HTTP NNTP SMTP NFS DNS Applications TCP UDP ICMP IP 802.x PPP SLIP RS232
Error Control Techniques for Interactive Low-bit Rate Video Transmission over the Internet.
Error Control Techniques for Interactive Low-bit Rate Video Transmission over the Internet. Injong Rhee Department of Computer Science North Carolina State University Video Conferencing over Packet- Switching
TCP Modifications for Congestion Exposure
TCP Modifications for Congestion Exposure ConEx 87. IETF Berlin July 27, 2013 draft-ietf-conex-tcp-modifications-04 Mirja Kühlewind Richard Scheffenegger
Transport Layer TCP & UDP Week 7. Module : Computer Networks Lecturers : Lucy White Office : 324
Transport Layer TCP & UDP Week 7 Module : Computer Networks Lecturers : Lucy White lbwhite@wit.ie Office : 324 1 Purpose of the Transport Layer The Transport layer provides for the segmentation of data
Energy-Efficient Forwarding Strategies for Geographic Routing in Lossy Wireless Sensor Networks
Energy-Efficient Forwarding Strategies for Geographic Routing in Lossy Wireless Sensor Networks K. Seada, M.Zuniga, A. Helmy and B. Krishnamachari Department of Electrical Engineering University of Southern
Effect of SCTP Multistreaming over Satellite Links
Effect of SCTP Multistreaming over Satellite Links Mohammed Atiquzzaman (Co-author: William Ivancic (NASA)) School of Computer Science University of Oklahoma. Email: atiq@ieee.org Web: www.cs.ou.edu/~atiq
CS 457 Networking and the Internet. What is Routing. Forwarding versus Routing 9/27/16. Fall 2016 Indrajit Ray. A famous quotation from RFC 791
CS 457 Networking and the Internet Fall 2016 Indrajit Ray What is Routing A famous quotation from RFC 791 A name indicates what we seek An address indicates where it is A route indicates how we get there
Wireless Sensor Networks, energy efficiency and path recovery
Wireless Sensor Networks, energy efficiency and path recovery PhD dissertation Anne-Lena Kampen Trondheim 18 th of May 2017 Outline Introduction to Wireless Sensor Networks WSN Challenges investigated
WiMAX Application Performance Testing Guidelines
WiMAX Application Performance Testing Guidelines Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 USA jain@cse.wustl.edu WiMAX Forum Meeting, Orlando, FL, February 5-9, 2009 These slides
Introduction to Networked Multimedia An Introduction to RTP p. 3 A Brief History of Audio/Video Networking p. 4 Early Packet Voice and Video
Preface p. xi Acknowledgments p. xvii Introduction to Networked Multimedia An Introduction to RTP p. 3 A Brief History of Audio/Video Networking p. 4 Early Packet Voice and Video Experiments p. 4 Audio
15-441: Computer Networking. Lecture 24: Ad-Hoc Wireless Networks
15-441: Computer Networking Lecture 24: Ad-Hoc Wireless Networks Scenarios and Roadmap Point to point wireless networks (last lecture) Example: your laptop to CMU wireless Challenges: Poor and variable
PERFORMANCE COMPARISON OF TCP VARIANTS FOR WIRELESS SENSOR NETWORKS
PERFORMANCE COMPARISON OF TCP VARIANTS FOR WIRELESS SENSOR NETWORKS Nutan Bhati, Dr. Ashish Bansal Abstract: Mobile Ad hoc Networks (MANETs) are a collection of mobile nodes forming a dynamic autonomous
A SURVEY OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS
Journal homepage: www.mjret.in ISSN:2348-6953 A SURVEY OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Ms. Amruta Kodole 1, Prof. P. M. Agarkar 2 Computer Engineering Dr. D. Y. Patil School Of Engineering
INF5071 Performance in Distributed Systems. October 01, 2010
INF5071 Performance in Distributed Systems October 01, 2010 On demand Streaming Applications Stable bandwidth problem UDP The classical solution Send data at playout speed Write loss-tolerant audio-video
Proposed Node and Network Models for M2M Internet
2009-2012 NTT CORPORATION. All Rights Reserved. Proposed Node and Network Models for M2M Internet Yuminobu Igarashi NTT Information Sharing Platform Laboratories 2012 NTT Information Sharing Platform Laboratories
Outline. Multi-Channel Reliability and Spectrum Usage in Real Homes Empirical Studies for Home-Area Sensor Networks. Smart Grid
Multi-Channel Reliability and Spectrum Usage in Real Homes Empirical Studies for Home-Area Sensor Networks Experimental methodology Empirical study in homes Spectrum study of existing wireless signals
A COMPARISON STUDY OF DSDV AND SEAD WIRELESS AD HOC NETWORK ROUTING PROTOCOLS
A COMPARISON STUDY OF DSDV AND SEAD WIRELESS AD HOC NETWORK ROUTING PROTOCOLS M.S.R.S Prasad 1, S.S. Panda 2, MNM Prasad 3, S.T.V.S.Kumar 4 1 Assistant Professor (SG), Dept. of CSE., Regency Institute
Fountain Codes with XOR of Encoded Packets for Broadcasting and source independent backbone in Multi-hop Networks using Network Coding
Fountain Codes with XOR of Encoded Packets for Broadcasting and source independent backbone in Multi-hop Networks using Network Coding Khaldoun Al Agha LRI, Paris XI University, Orsay, France Email: alagha@lri.fr
QUALITY OF SERVICE EVALUATION IN IEEE NETWORKS *Shivi Johri, **Mrs. Neelu Trivedi
QUALITY OF SERVICE EVALUATION IN IEEE 802.15.4 NETWORKS *Shivi Johri, **Mrs. Neelu Trivedi *M.Tech. (ECE) in Deptt. of ECE at CET,Moradabad, U.P., India **Assistant professor in Deptt. of ECE at CET, Moradabad,
Routing over Low Power and Lossy Networks
outing over Low Power and Lossy Networks Analysis and possible enhancements of the IETF PL routing protocol Enzo Mingozzi Associate Professor @ University of Pisa e.mingozzi@iet.unipi.it outing over LLNs
Minimizing Energy Consumption for Cooperative Network and Diversity Coded Sensor Networks
Minimizing Energy Consumption for Cooperative Network and Diversity Coded Sensor Networks Gabriel E. Arrobo and Richard D. Gitlin Department of Electrical Engineering University of South Florida Tampa,
Multiple Network Coded TCP Sessions in Disruptive Wireless Scenarios
Multiple Network Coded TCP Sessions in Disruptive Wireless Scenarios Chien-Chia Chen Cliff Chen Joon-Sang Park Soon Oh Mario Gerla M.Y. Sanadidi Network Research Lab, 1 Problem Statement Communication
CS 268: Computer Networking. Taking Advantage of Broadcast
CS 268: Computer Networking L-12 Wireless Broadcast Taking Advantage of Broadcast Opportunistic forwarding Network coding Assigned reading XORs In The Air: Practical Wireless Network Coding ExOR: Opportunistic
Messaging Protocol. White paper. Harmonization of IEEE WSMP with ISO FNTP. 1 Abstract
1 Abstract White paper Messaging Protocol Harmonization of IEEE WSMP with ISO FNTP 1 2014-Nov-25 Editor: Hans-Joachim Fischer / ISO TC204 WG16 The EU-US ITS Task Force, Standards Harmonization Working
Minimizing Energy Consumption for Cooperative Network and Diversity Coded Sensor Networks
Minimizing Energy Consumption for Cooperative Network and Diversity Coded Sensor Networks WTS 2014 April 9-11, 2014 Washington, DC Gabriel E. Arrobo and Richard D. Gitlin Department of Electrical Engineering
C13b: Routing Problem and Algorithms
CISC 7332X T6 C13b: Routing Problem and Algorithms Hui Chen Department of Computer & Information Science CUNY Brooklyn College 11/20/2018 CUNY Brooklyn College 1 Acknowledgements Some pictures used in
Study of RPL DODAG Version Attacks
Study of RPL DODAG Version Attacks Anthéa Mayzaud anthea.mayzaud@inria.fr Rémi Badonnel Isabelle Chrisment Anuj Sehgal s.anuj@jacobs-university.de Jürgen Schönwälder IFIP AIMS 2014 Brno, Czech Republik
6.033 Computer Systems Engineering: Spring Quiz II THIS IS AN OPEN BOOK, OPEN NOTES QUIZ. NO PHONES, NO COMPUTERS, NO LAPTOPS, NO PDAS, ETC.
Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.033 Computer Systems Engineering: Spring 2005 Quiz II There are 17 questions and 10 pages in this quiz
Computing connected dominated sets with multipoint relays
INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Computing connected dominated sets with multipoint relays Cedric Adjih Philippe Jacquet Laurent Viennot N 4597 Octobre 2002 THÈME 1 ISSN
Computer Networking. Intra-Domain Routing. RIP (Routing Information Protocol) & OSPF (Open Shortest Path First)
Computer Networking Intra-Domain Routing RIP (Routing Information Protocol) & OSPF (Open Shortest Path First) IP Forwarding The Story So Far IP addresses are structured to reflect Internet structure IP
Implementation of an Algorithmic To Improve MCDS Based Routing In Mobile Ad-Hoc Network By Using Articulation Point
International Journal of Computational Engineering Research Vol, 03 Issue5 Implementation of an Algorithmic To Improve MCDS Based Routing In Mobile Ad-Hoc Network By Using Articulation Point Shalu Singh
Study of Multipoint-to-Point and Broadcast Tra c Performance in the IPv6 Routing Protocol for Low Power and Lossy Networks
Study of Multipoint-to-Point and Broadcast Tra c Performance in the IPv6 Routing Protocol for Low Power and Lossy Networks Ulrich Herberg, Thomas Clausen Laboratoire d Informatique (LIX) Ecole Polytechnique,
A Survey of Current Directions in Service Placement in Mobile Ad-hoc Networks
A Survey of Current Directions in Service Placement in Mobile Ad-hoc Networks Georg Wittenburg and Jochen Schiller Freie Universität Berlin Middleware Support for Pervasive Computing Workshop (PerWare
ASM. Engineering Workshops
1 ASM 2 ASM Allows SPTs and RPTs RP: Matches senders with receivers Provides network source discovery Typically uses RPT to bootstrap SPT RPs can be learned via: Static configuration recommended Anycast-RP
Lecture 13: Link-state Routing. CSE 123: Computer Networks Alex C. Snoeren
Lecture 3: Link-state Routing CSE 23: Computer Networks Alex C. Snoeren Lecture 3 Overview Routing overview Intra vs. Inter-domain routing Link-state routing protocols 2 Router Tasks Forwarding Move packet
Arvind Krishnamurthy Fall 2003
Ad-hoc Routing Arvind Krishnamurthy Fall 2003 Ad Hoc Routing Create multi-hop connectivity among set of wireless, possibly moving, nodes Mobile, wireless hosts act as forwarding nodes as well as end systems
Evaluation of Routing Protocols for Mobile Ad hoc Networks
International Journal of Soft Computing and Engineering (IJSCE) Evaluation of Routing Protocols for Mobile Ad hoc Networks Abstract Mobile Ad hoc network is a self-configuring infrastructure less network
Wireless and Mobile Networks Reading: Sections 2.8 and 4.2.5
Wireless and Mobile Networks Reading: Sections 2.8 and 4.2.5 Acknowledgments: Lecture slides are from Computer networks course thought by Jennifer Rexford at Princeton University. When slides are obtained
ECE 598HH: Special Topics in Wireless Networks and Mobile Systems
ECE 598HH: Special Topics in Wireless Networks and Mobile Systems Lecture 21: Opportunistic Routing Haitham Hassanieh *These slides are courtesy of Dina Katabi 1 Lecture Outline Single Path Routing Opportunistic
WSN NETWORK ARCHITECTURES AND PROTOCOL STACK
WSN NETWORK ARCHITECTURES AND PROTOCOL STACK Sensing is a technique used to gather information about a physical object or process, including the occurrence of events (i.e., changes in state such as a drop
AN ABSTRACT OF THE THESIS OF
AN ABSTRACT OF THE THESIS OF Richard Edgecombe for the degree of Master of Science in Computer Science presented on March 17, 2008. Title: An Implementation of a Reliable Broadcast Scheme for 802.11 using
How to develop and validate a scalable mesh routing solution for IEEE sensor networks Altran Benelux
How to develop and validate a scalable mesh routing solution for IEEE 802.15.4 sensor networks Altran Benelux Leuven, 29 October 2015 Daniele Lacamera picotcp The reference