Performance Improvement in Ad hoc Wireless Networks with Consideration to Packet Duplication Takayuki Yamamoto Department of Informatics and Mathematical.

Slides:



Advertisements
Similar presentations
24-1 Chapter 24. Congestion Control and Quality of Service (part 1) 23.1 Data Traffic 23.2 Congestion 23.3 Congestion Control 23.4 Two Examples.
Advertisements

Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
Explicit and Implicit Pipelining in Wireless MAC Nitin Vaidya University of Illinois at Urbana-Champaign Joint work with Xue Yang, UIUC.
DSR The Dynamic Source Routing Protocol Students: Mirko Gilioli Mohammed El Allali.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
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.
Low Delay Marking for TCP in Wireless Ad Hoc Networks Choong-Soo Lee, Mingzhe Li Emmanuel Agu, Mark Claypool, Robert Kinicki Worcester Polytechnic Institute.
Denial of Service Resilience in Ad Hoc Networks Imad Aad, Jean-Pierre Hubaux, and Edward W. Knightly Designed by Yao Zhao.
The Impact of Multihop Wireless Channel on TCP Throughput and Loss Zhenghua Fu, Petros Zerfos, Haiyun Luo, Songwu Lu, Lixia Zhang, Mario Gerla INFOCOM2003,
Does the IEEE MAC Protocol Work Well in Multihop Wireless Ad Hoc Networks? Shugong Xu Tark Saadawi June, 2001 IEEE Communications Magazine (Adapted.
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
Performance Enhancement of TFRC in Wireless Ad Hoc Networks Mingzhe Li, Choong-Soo Lee, Emmanuel Agu, Mark Claypool and Bob Kinicki Computer Science Department.
Performance Analysis of Reputation-based Mechanisms for Multi-hop Wireless Networks Fabio Milan Dipartimento di Elettronica Politecnico di Torino Turin,
1 Expected Data Rate (EDR): An Accurate High-Throughput Path Metric For Multi- Hop Wireless Routing Jun Cheol Park Sneha Kumar Kasera.
Empirical Analysis of Transmission Power Control Algorithms for Wireless Sensor Networks CENTS Retreat – May 26, 2005 Jaein Jeong (1), David Culler (1),
MAC Reliable Broadcast in Ad Hoc Networks Ken Tang, Mario Gerla University of California, Los Angeles (ktang,
CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.
Sep 12, 2002Wireless Networking Seminar1 Does IEEE Work Well in Multi-hop Wireless Network? Author: Shugong Xu, Tarek Saadawi City University of.
Layer-3 Routing Natawut Nupairoj, Ph.D. Department of Computer Engineering Chulalongkorn University.
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.
RTS/CTS-Induced Congestion in Ad Hoc Wireless LANs Saikat Ray, Jeffrey B. Carruthers, and David Starobinski Department of Electrical and Computer Engineering.
Performance Evaluation and Improvement of an Ad Hoc Wireless Network Takayuki Yamamoto Graduate School of Engineering Science, Osaka University, Japan.
Does Packet Replication Along Multipath Really Help ? Swades DE Chunming QIAO EE Department CSE Department State University of New York at Buffalo Buffalo,
Qian Zhang Department of Computer Science HKUST Advanced Topics in Next- Generation Wireless Networks Transport Protocols in Ad hoc Networks.
EAIT, February 2006 A Pragmatic Approach towards the Improvement of Performance of Ad Hoc Routing ProtocolsOptimizations To Multipath Routing Protocols.
2008/2/191 Customizing a Geographical Routing Protocol for Wireless Sensor Networks Proceedings of the th International Conference on Information.
10/1/2015 9:14 PM1 TCP in Mobile Ad-hoc Networks ─ Split TCP CSE 6590.
Reducing Traffic Congestion in ZigBee Networks: Experimental Results th International Wireless Communications and Mobile Computing Conference (IWCMC)
CSE 6590 Fall 2010 Routing Metrics for Wireless Mesh Networks 1 4 October, 2015.
An End-to-end Approach to Increase TCP Throughput Over Ad-hoc Networks Sarah Sharafkandi and Naceur Malouch.
Presented by Fei Huang Virginia Tech April 4, 2007.
A Study of Live Video Streaming over Highway Vehicular Ad hoc Networks Meenakshi Mittal ©2010 International Journal of Computer Applications ( )Volume.
TCP PERFORMANCE OVER AD HOC NETWORKS Presented by Vishwanee Raghoonundun Assisted by Maheshwarnath Behary MSc Computer Networks Middlesex University.
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
Wireless Sensor Networks COE 499 Energy Aware Routing
Influence of Transmission Power on the Performance of Ad Hoc Networks Crystal Jackson SURE 2004.
Tonghong Li, Yuanzhen Li, and Jianxin Liao Department of Computer Science Technical University of Madrid, Spain Beijing University of Posts & Telecommunications.
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
MARCH : A Medium Access Control Protocol For Multihop Wireless Ad Hoc Networks 성 백 동
Link Estimation, CTP and MultiHopLQI. Learning Objectives Understand the motivation of link estimation protocols – the time varying nature of a wireless.
November 4, 2003APOC 2003 Wuhan, China 1/14 Demand Based Bandwidth Assignment MAC Protocol for Wireless LANs Presented by Ruibiao Qiu Department of Computer.
Dynamic Source Routing (DSR) Sandeep Gupta M.Tech - WCC.
Power Control in Wireless Ad Hoc Networks Background An ad hoc network is a group of self configuring wireless nodes that lack infrastructure. Motivation—Power.
CSE 6590 Fall 2009 Routing Metrics for Wireless Mesh Networks 1 12 November, 2015.
Collision-free Time Slot Reuse in Multi-hop Wireless Sensor Networks
Providing End-to-End Delay Guarantees for Multi-hop Wireless Sensor Networks I-Hong Hou.
A Reservation-based TDMA Protocol Using Directional Antennas (RTDMA-DA) For Wireless Mesh Networks Amitabha Das and Tingliang Zhu, Nanyang Technological.
An Adaptive Energy-Efficient and Low- Latency MAC for Data Gathering in Wireless Sensor Networks Gang Lu, Bhaskar Krishnamachari, and Cauligi S. Raghavendra.
Chih-Min Chao and Yao-Zong Wang Department of Computer Science and Engineering National Taiwan Ocean University, Taiwan IEEE WCNC 2010 A Multiple Rendezvous.
Self Organization and Energy Efficient TDMA MAC Protocol by Wake Up for Wireless Sensor Networks Zhihui Chen and Ashfaq Khokhar ECE Department, University.
Multi-channel Wireless Sensor Network MAC protocol based on dynamic route.
Introduction to Wireless Networks Dina Katabi & Sam Madden MIT – – Spring 2014.
Low Power, Low Delay: Opportunistic Routing meets Duty Cycling Olaf Landsiedel 1, Euhanna Ghadimi 2, Simon Duquennoy 3, Mikael Johansson 2 1 Chalmers University.
A Wakeup Scheme for Sensor Networks: Achieving Balance between Energy Saving and End-to-end Delay Xue Yang, Nitin H.Vaidya Department of Electrical and.
A Multi-Channel CSMA MAC Protocol with Receiver Based Channel Selection for Multihop Wireless Networks Nitin Jain, Samir R. Das Department of Electrical.
Multi-Channel MAC Protocol for Multi-Hop Wireless Networks: Handling Multi-Channel Hidden Node Problem Using Snooping Myunghwan Seo, Yonggyu Kim, and Joongsoo.
Turkmen Canli ± and Ashfaq Khokhar* Electrical and Computer Engineering Department ± Computer Science Department* The University of Illinois at Chicago.
Optimization Problems in Wireless Coding Networks Alex Sprintson Computer Engineering Group Department of Electrical and Computer Engineering.
On Multihop Communications For In-Vehicle Internet Access Based On a TDMA MAC Protocol Hassan Aboubakr Omar ∗, Weihua Zhuang ∗, and Li Li† ∗ Department.
Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks Wei LiuXiang Chen Yuguang Fang WING Dept. of ECE University.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
1 Ad-hoc Transport Layer Protocol (ATCP) EECS 4215.
Routing Metrics for Wireless Mesh Networks
TCP and MAC interplay in Wireless Ad Hoc Networks
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
TCP in Mobile Ad-hoc Networks
TCP in Wireless Ad-hoc Networks
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
Presentation transcript:

Performance Improvement in Ad hoc Wireless Networks with Consideration to Packet Duplication Takayuki Yamamoto Department of Informatics and Mathematical Science, Graduate School of Engineering Science, Osaka University, Japan

Sep APCC Contents Packet Duplication Problem Process of the duplication Methods to improve the performance Performance evaluation through simulations Conclusion and Future Work Introduction of target system Flexible Radio Network

Sep APCC Flexible Radio Network Wireless data collection system developed by Fuji Electric Co., Ltd. Multi-hop network organized by stationary terminals Application examples Power consumption collection in manufacturing plants Sales account of vending machines Usage data collection from ski lift gates

Sep APCC System Description Network configuration table Periodic route data exchange Each node maintains multiple routes to all nodes in the same network Route data = (Neighbor ID, Hop count to destination) A E B D C ‥ (B,3)(C,4) 2 ::: ‥ (C,2)(B,1) 1 ‥ EB Destinaton Node ID routes Network configuration table at node A

Sep APCC Protocol Description Fixed time divided slot Slot based maximum lifetime of packets Relay echo acknowledgement Slot Node A Node B send forward relay echo The forwarded packet by node B can be received by all neighbor nodes. This “ relay echo ” is used as an ACK at node A. After receiving the relay echo, node A deletes the packet in its buffer. relay echo

Sep APCC Protocol Description Restransmission control Slot Node A Node B resend transmission failure × Node A retransmits the packet after pre-specified time when it cannot receive a relay echo from node B.

Sep APCC Packet Duplication Problem Packet retransmission caused by relay echo receipt failure Packet Duplication Additive network load and performance degradation

Sep APCC Packet Duplication Process Slot Node A Node B Node C send forward × echo miss resend Missing only an echo ↓ Node A considers that as its transmission failure ↓ Retransmission makes a duplicated packet echo forward Normal relay Need to prevent an echo loss Left in a buffer due to an echo miss

Sep APCC Policy of Suggestions Packet duplication is caused by an echo loss Nodes cannot differentiate a transmission failure and the echo loss Focus on the echo loss due to packet collisions Preventing packet collisions leads to decreasing the number of duplicated packets Synergy effect for packet collisions and packet duplications improves the performance

Sep APCC Suggestions 1. Random delay time before packet retransmission 2. Drop a packet that lacks lifetime to reach its destination to reduce the probability of continuous echo loss caused by the retransmission feature to prevent network congestion and packet collisions

Sep APCC Detail of Suggestion 1 1. Random delay time before packet retransmission Slot Node X Node A Node B send forward collisio n × echo loss send × echo resend forward × echo loss resend × collisio n echo Packet collision repeats due to fixed delay time Case 1: Fixed delay time (3 slots)

Sep APCC Slot Node X Node A Node B send forward collisio n × echo loss send × echo resend forward echo resend echo Detail of Suggestion 1 Probability of repeated echo loss can be reduced by random delay time 1. Random delay time before packet retransmission Case 2: Random delay time

Sep APCC Detail of Suggestion 2 2. Drop a packet that lacks lifetime to reach its destination (X, D, 2) (source, destination, lifetime) Packet : ABC D (X, D, 1)(X, D, 0) Reject the packet whose lifetime is shorter than the minimum hop count to its destination which is maintained in the configuration table ( )

Sep APCC Simulation Environment The Network Simulator - ns-2 Random node allocation with three packet generating nodes shown in the below figure Performance measures are throughput packet loss rate (PLR) duplication rate

Sep APCC Simulation Environment Two kinds of the maximum lifetime, 8 and 128 See the relationship between the maximum lifetime and each suggestion Compared systems under these lifetimes are the original system the systems with each improvement the system with both improvements

Sep APCC Throughput much effectivea little effectiveboth ineffectivea little effectivedrop much effectiveineffectiverandom lifetime 128lifetime 8 Explanation of labels original ・・・ original system random ・・・ only suggestion 1 drop ・・・ only suggestion 2 both ・・・ both suggestions Throughput improvements Maximum lifetime is 8 Maximum lifetime is 128

Sep APCC Packet Loss Rate (PLR) PLR degradation much effectivea little effectiveboth ineffectivea little effectivedrop much effectiveineffectiverandom lifetime 128lifetime 8 Maximum lifetime is 8 Maximum lifetime is 128 Explanation of labels original ・・・ original system random ・・・ only suggestion 1 drop ・・・ only suggestion 2 both ・・・ both suggestions

Sep APCC Duplication Rate Duplication Rate (packets/sec) much effectivea little effectiveboth ineffectivea little effectivedrop much effectiveineffectiverandom lifetime 128lifetime 8 Explanation of labels original ・・・ original system random ・・・ only suggestion 1 drop ・・・ only suggestion 2 both ・・・ both suggestions Maximum lifetime is 8 Maximum lifetime is 128

Sep APCC Conclusion and Future Work Our suggestions are capable to prevent an echo loss and a packet duplication The system with both improvements always shows the good performance regardless of the maximum lifetime value Future Works Effective method to decide the maximum lifetime based on a route length Another evaluation on a system with end-to-end upper layer protocol such as TCP