Hongchao Zhou, Xiaohong Guan, Chengjie Wu

Slides:



Advertisements
Similar presentations
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Advertisements

1 689 Lecture 2 Review of Last Lecture Networking basics TCP/UDP review.
1 TCP Transport Control Protocol Reliable In-order delivery Flow control Responds to congestion “Nice” Protocol.
EEC-484/584 Computer Networks Lecture 6 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
Error Checking continued. Network Layers in Action Each layer in the OSI Model will add header information that pertains to that specific protocol. On.
SEPT, 2005CSI Part 2.2 Protocols and Protocol Layering Robert Probert, SITE, University of Ottawa.
1 Transport Layer Computer Networks. 2 Where are we?
1 Chapter 16 Protocols and Protocol Layering. 2 Protocol  Agreement about communication  Specifies  Format of messages (syntax)  Meaning of messages.
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
TCP1 Transmission Control Protocol (TCP). TCP2 Outline Transmission Control Protocol.
Transport over Wireless Networks Myungchul Kim
Transport Control Protocol (TCP) Features of TCP, packet loss and retransmission, adaptive retransmission, flow control, three way handshake, congestion.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Presentation of Wireless sensor network A New Energy Aware Routing Protocol for Wireless Multimedia Sensor Networks Supporting QoS 王 文 毅
Chapter 24 Transport Control Protocol (TCP) Layer 4 protocol Responsible for reliable end-to-end transmission Provides illusion of reliable network to.
Improving TCP Performance over Wireless Networks
UNIT 2 LESSON 5 CS PRINCIPLES. OBJECTIVES Students will be able to: Explain why protocols are necessary to overcome the underlying unreliability of the.
Tufts University. EE194-WIR Wireless Sensor Networks. February 17, 2005 Increased QoS through a Degraded Channel using a Cross-Layered HARQ Protocol Elliot.
RM-MAC: A Routing-Enhanced Multi-Channel MAC Protocol in Duty-Cycle Sensor Networks Ye Liu, Hao Liu, Qing Yang, and Shaoen Wu In Proceedings of the IEEE.
Transport Protocols.
FERMA: An Efficient Geocasting Protocol for Wireless Sensor Networks with Multiple Target Regions Young-Mi Song, Sung-Hee Lee and Young- Bae Ko Ajou University.
1 Protocols and Protocol Layering. 2 Protocol Agreement about communication Specifies –Format of messages –Meaning of messages –Rules for exchange –Procedures.
Reliable Adaptive Lightweight Multicast Protocol Ken Tang, Scalable Network Technologies Katia Obraczka, UC Santa Cruz Sung-Ju Lee, Hewlett-Packard Laboratories.
2005/12/14 1 Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross-Layer Information Awareness Xin Yu Department of Computer Science.
BASICS Gabriella Paolini (GARR) 27/05/11 - ICCU Roma 1 How INTERNET works !
Protocols and layering Network protocols and software Layered protocol suites The OSI 7 layer model Common network design issues and solutions.
1 Chapter 24 Internetworking Part 4 (Transport Protocols, UDP and TCP, Protocol Port Numbers)
9. Principles of Reliable Data Transport – Part 1
Fast Retransmit For sliding windows flow control we waited for a timer to expire before beginning retransmission of a packet TCP uses an additional mechanism.
Sliding Window Protocol | Go-Back-N
Internet Networking recitation #9
Satellite TCP Lecture 19 04/10/02.
COMP 431 Internet Services & Protocols
Transport layer.
Packet Switching Datagram Approach Virtual Circuit Approach
Algorithms for Big Data Delivery over the Internet of Things
Ad-hoc Transport Layer Protocol (ATCP)
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
SEMINAR ON Optical Burst Switching
Transport Layer Unit 5.
Transport Layer Our goals:
Sarah Diesburg Operating Systems COP 4610
William Stallings Data and Computer Communications
Process-to-Process Delivery:
TCP in Mobile Ad-hoc Networks
Tarun Banka Department of Computer Science Colorado State University
IT351: Mobile & Wireless Computing
TCP in Wireless Ad-hoc Networks
Congestion Control (from Chapter 05)
Switching Techniques.
CS4470 Computer Networking Protocols
Internet Networking recitation #10
Congestion Control (from Chapter 05)
Andy Wang Operating Systems COP 4610 / CGS 5765
CPEG514 Advanced Computer Networkst
Distributed Systems CS
Congestion Control (from Chapter 05)
Protocols and Protocol Layering
Computer Networks Topic :User datagram protocol Transmission Control Protocol -Hemashree S( )
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Process-to-Process Delivery: UDP, TCP
Congestion Control (from Chapter 05)
Computer Networks Protocols
Protocols and Protocol Layering
Hongchao Zhou, Fei Liu, Xiaohong Guan
Error Checking continued
Distributed Systems CS
Presentation transcript:

Hongchao Zhou, Xiaohong Guan, Chengjie Wu RTMC: Reliable Transport with Memory Consideration in Wireless Sensor Networks Hongchao Zhou, Xiaohong Guan, Chengjie Wu

Reliable Transport with Memory Consideration Experiments Outline Background Reliable Transport with Memory Consideration Experiments Simulation and Comparison 2019/5/19

Wireless sensor networks Wireless sensor networks (WSN) consist of many resource constrained sensor nodes with limited computational capability, communication radius and memory space. The availability of low-cost hardware such as CMOS cameras and microphones enables sensor nodes to capture images or audio from environment, and increases the requirement of reliable file transport. Image Audio Video 2019/5/19

Problems and Challenges Requirement: the files to be transmitted generally divided into multiple segments to avoid high packet error rate. Problem: How to send all the multiple segments from a source to the sink via multiple unreliable hops? Challenges unreliable links in WSN and conflict in transmissions from different nodes may cause packet loss limited memory of relay sensor nodes with possible overflow may also cause packets loss. 2019/5/19

Existing Methods Node-by-node: One relay node receives all the segments and then re-transmit all the segments to the next hop. Possible large delivery latency Significant memory requirement TCP is widely used to provide end-to-end reliability and congestion control in Internet. End-to-end retransmission is not appropriate in wireless systems with high packet-loss rate. End-to-end congestion control may have a tardy response and cannot adapt to the rapid change of channel capacity in WSN. Control Messages may lost. 2019/5/19

A reliable transport protocol: A reliable transport protocol in WSN should hop-by-hop retransmission hop-by-hop congestion control 100% reliability (some segments may very important) make good use of bandwidth Reliable Transport with Memory Consideration (RTMC) 2019/5/19

Reliable Transport with Memory Consideration Experiments Outline Background Reliable Transport with Memory Consideration Experiments Simulation and Comparison 2019/5/19

RTMC Basic Ideas: If the local node knows that its next hop can store m extra segments, then it can send m segments without any negotiations. If the local node does not know whether one segment is received by the next hop, it can not remove this segment. Variable Definition segment_length : the number of segments to transport BL :maximal number of segments (small integer) local_free :extra segments can be stored in the local node next_free :extra segments can be stored in the next hop rec_segments : the IDs of the received last BL segments 2019/5/19

RTMC Packets: Initial Packet: Ask the next hop to participate into the current transport. local_free, rec_segments, segment_length Data Packet: … Send a segment to the next hop local_free, rec_segments, segment_id, content Requiring Packet: Ask the last hop to send a data packet. local_free, rec_segments I 1 2 R 2019/5/19

RTMC An instance to demonstrate that how RTMC works. BL=3 segment_length=9 hops =3 2019/5/19

Example by RTMC Beginning Send initial packets 1 1 2 2 3 3 4 4 5 5 6 6 7 4 7 5 8 5 8 9 6 6 9 source sink A B I 2019/5/19

RTMC instance Beginning If A does not receive any response from B, an initial message should be retransmitted. 1 1 2 2 3 3 4 4 5 5 6 6 4 4 7 7 5 8 5 8 9 6 6 9 source sink A B I I 2019/5/19

RTMC instance Transporting Receive a data packet from the last hop node. local_free rec_segments 1 2 2 6-4-3 7-6-4 7-6-4 5 1 6 2 2 2 7 3 6 2 2 8 4 2 6 7 7 9 source sink A B 7 2019/5/19

RTMC instance Transporting Hear a data packet from the next hop node. local_free rec_segments 1 2 7-6-4 7-6-4 5 next_free=2 1 6 ready to transmit 2 2 2 7 3 6 2 2 8 4 2 6 7 7 9 source sink A B 7 2019/5/19

RTMC instance Transporting Special case: A is empty but source thinks that A is full, due to packets loss. A should send Requiring packets to source periodically until memory is not empty. next_free=0 next_free=2 1 3 7-6-4 7-6-4 5 1 6 ready to transmit 2 2 2 7 3 2 7 2 8 4 2 6 2 9 source sink A B R 2019/5/19

RTMC instance Ending For a node, if (1) its memory is empty and (2) it has received all of the segments, then the transport is finished of this node. 2019/5/19

Reliable Transport with Memory Consideration Experiments Outline Background Reliable Transport with Memory Consideration Experiments Simulation and Comparison 2019/5/19

Experiment Scenario Mica2, 19.2kbps, 10K image file, 100segments 2019/5/19

Experiment result without congestion Time (s) Segment sequence No. 2019/5/19

Experiment result with congestion G was turned on 20seconds later 2019/5/19

Experiment result with congestion Time (s) Segment sequence No. 2019/5/19

Reliable Transport with Memory Consideration Experiments Outline Background Reliable Transport with Memory Consideration Experiments Simulation and Comparison 2019/5/19

Comparison SEA A receiver sends back an acknowledge after receiving a packet. The sender retransmits the packet if it does not receive the acknowledge. Each node can store no more than 10 segments RTMC Each node can store 5 segments Simulation 5 nodes, TDMA (one message for RTMC, one message and one acknowledge for SEA). p p p p source sink 2019/5/19

Simulation Result Transport time (periods) Packet success rate p 2019/5/19

Simulation Result Packets transmitted Packet success rate p 2019/5/19

Conclusions RTMC can get 100% reliability due to hop-by-hop retransmission and congestion control mechanism. RTMC can use channel effectively and has low delivery latency, since the transmission rate can quickly change with the traffic change in the network. RTMC costs less energy, since the number of retransmission packets is reduced. Both experiment and simulation results support these conclusions 2019/5/19

Thank you 2019/5/19