PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen.

Slides:



Advertisements
Similar presentations
Dynamic Source Routing (DSR) algorithm is simple and best suited for high mobility nodes in wireless ad hoc networks. Due to high mobility in ad-hoc network,
Advertisements

Robin Kravets Tarek Abdelzaher Department of Computer Science University of Illinois The Phoenix Project.
Mobility Entropy and Message Routing in Community-Structured Delay Tolerant Networks Hideya Ochiai Hiroshi Esaki The University of Tokyo / NICT Asia Future.
Review of Topology and Access Techniques / Switching Concepts BSAD 141 Dave Novak Sources: Network+ Guide to Networks, Dean 2013.
Supporting Cooperative Caching in Disruption Tolerant Networks
ROUTING IN INTERMITTENTLY CONNECTED MOBILE AD HOC NETWORKS AND DELAY TOLERANT NETWORKS: OVERVIEW AND CHALLENGES ZHENSHENG ZHANG.
Multicasting in Mobile Ad hoc Networks By XIE Jiawei.
- Paper By Yunfeng Lin, Baochun Li, Ben Liang. Outline Motivation Constraints in DTN Network coding Vs Replication Binary Spraying Vs Epidemic routing.
Contact quality based forwarding strategy for delay tolerant network Qaisar Ayub, Sulma Rashid, M.Soperi Mohd Zahid, Abdul Hanan Abdullah Adviser:Frank.
Review of Topology and Access Techniques / Switching Concepts BSAD 141 Dave Novak Sources: Network+ Guide to Networks, Dean 2013.
On Using Probabilistic Forwarding to Improve HEC-based Data Forwarding in Opportunistic Networks Ling-Jyh Chen 1, Cheng-Long Tseng 2 and Cheng-Fu Chou.
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
Multicasting in Mobile Ad-Hoc Networks (MANET)
By Libo Song and David F. Kotz Computer Science,Dartmouth College.
Three heuristics for transmission scheduling in sensor networks with multiple mobile sinks Damla Turgut and Lotzi Bölöni University of Central Florida.
DTNLite: Reliable Data Delivery in Sensornets Rabin Patra and Sergiu Nedevschi UCB Nest Retreat 2004.
May 14, Organization Design and Dynamic Resources Huzaifa Zafar Computer Science Department University of Massachusetts, Amherst.
Taming the Underlying Challenges of Reliable Multihop Routing in Sensor Networks.
Adaptive Self-Configuring Sensor Network Topologies ns-2 simulation & performance analysis Zhenghua Fu Ben Greenstein Petros Zerfos.
17/10/2003TCP performance over ad-hoc mobile networks. 1 LCCN – summer 2003 Uri Silbershtein Roi Dayagi Nir Hasson.
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
Enhancing TCP Fairness in Ad Hoc Wireless Networks Using Neighborhood RED Kaixin Xu, Mario Gerla University of California, Los Angeles {xkx,
Opportunistic Routing Based Scheme with Multi-layer Relay Sets in Cognitive Radio Networks Ying Dai and Jie Wu Department of Computer and Information Sciences.
ExOR: Opportunistic Multi-Hop Routing for Wireless Networks Sigcomm 2005 Sanjit Biswas and Robert Morris MIT Computer Science and Artificial Intelligence.
OPTIMAL SERVER PROVISIONING AND FREQUENCY ADJUSTMENT IN SERVER CLUSTERS Presented by: Xinying Zheng 09/13/ XINYING ZHENG, YU CAI MICHIGAN TECHNOLOGICAL.
Gathering Data in Wireless Sensor Networks Madhu K. Jayaprakash.
Deadline-sensitive Opportunistic Utility-based Routing in Cyclic Mobile Social Networks Mingjun Xiao a, Jie Wu b, He Huang c, Liusheng Huang a, and Wei.
Routing Protocol Evaluation David Holmer
CSE 6590 Fall 2010 Routing Metrics for Wireless Mesh Networks 1 4 October, 2015.
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
Patch Based Mobile Sink Movement By Salman Saeed Khan Omar Oreifej.
Authors: Ioannis Komnios Sotirios Diamantopoulos Vassilis Tsaoussidis ComNet Group.
1 Delay Tolerant Network Routing Sathya Narayanan, Ph.D. Computer Science and Information Technology Program California State University, Monterey Bay.
1 Mobility Increases the Capacity of Ad-hoc Wireless Networks Matthias Grossglauser, David Tse IEEE Infocom 2001 (Best paper award) Oct 21, 2004 Som C.
1 EnviroStore: A Cooperative Storage System for Disconnected Operation in Sensor Networks Liqian Luo, Chengdu Huang, Tarek Abdelzaher John Stankovic INFOCOM.
Sami Al-wakeel 1 Data Transmission and Computer Networks The Switching Networks.
On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing Argyrios Tasiopoulos MSc, student, AUEB Master Thesis presentation.
Link Estimation, CTP and MultiHopLQI. Learning Objectives Understand the motivation of link estimation protocols – the time varying nature of a wireless.
PPWEB: A Peer-to-Peer Approach for Web Surfing On the Go Ling-Jyh Chen, Ting-Kai Huang Institute of Information Science, Academia Sinica, Taiwan Guang.
Computer Networks with Internet Technology William Stallings
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Group 3 Sandeep Chinni Arif Khan Venkat Rajiv. Delay Tolerant Networks Path from source to destination is not present at any single point in time. Combining.
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
Research into the hybridization of the PRoPHET and ERP network routing algorithms George Mason University INFS 612 (Spring 2013) Project Group 4: Richard.
KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.
An Evaluation of Routing Reliability in Non-Collaborative Opportunistic Networks Ling-Jyh Chen, Che-Liang Chiou, and Yi-Chao Chen Institute of Information.
UCLA ENGINEERING Computer Science RobustGeo: a Disruption-Tolerant Geo-routing Protocol Ruolin Fan, Yu-Ting Yu *, Mario Gerla UCLA, Los Angeles, CA, USA.
Social-Aware Stateless Forwarding in Pocket Switched Networks Soo-Jin SHIN
An Adaptive Routing Protocol with Congestion Avoidance for Opportunistic Networks 王冉茵.
Joint Replication-Migration-based Routing in Delay Tolerant Networks Yunsheng Wang and Jie Wu Temple University Zhen Jiang Feng Li West Chester Unveristy.
Evaluating Mobility Support in ZigBee Networks
© SITILabs, University Lusófona, Portugal1 Chapter 2: Social-aware Opportunistic Routing: the New Trend 1 Waldir Moreira, 1 Paulo Mendes 1 SITILabs, University.
Dynamic Control of Coding for Progressive Packet Arrivals in DTNs.
Using Ant Agents to Combine Reactive and Proactive strategies for Routing in Mobile Ad Hoc Networks Fredrick Ducatelle, Gianni di caro, and Luca Maria.
Routing in Delay Tolerant Network Qing Ye EDIFY Group of Lehigh University.
Movement-Based Check-pointing and Logging for Recovery in Mobile Computing Systems Sapna E. George, Ing-Ray Chen, Ying Jin Dept. of Computer Science Virginia.
Chien-Shiu Lin, Wei-Shyh Chang, Ling-Jyh Chen, Cheng-Fu Chou, and Ting-Kai Huang.
PAC: Perceptive Admission Control for Mobile Wireless Networks Ian D. Chakeres Elizabeth M. Belding-Royer.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Routing Protocols to Maximize Battery Efficiency
Enabling QoS Multipath Routing Protocol for Wireless Sensor Networks
Delay-Tolerant Networks (DTNs)
1 Exploiting Friendship Relations for Efficient Routing in Mobile Social Networks Eyuphan Bulut, Student Member, IEEE, and Boleslaw K Szymanski, Fellow,
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
Kevin Lee & Adam Piechowicz 10/10/2009
Improving Opportunistic Data Dissemination via Known Vector
Ling-Jyh Chen and Ting-Kai Huang
PPWEB: A Peer-to-Peer Approach for Web Surfing On the Go
Presentation transcript:

PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen

What is Opportunistic Network Delay-Tolerant Network Ad-hoc like structure without fully connected path Situations: Mobile Sensors Military Operations Rural Areas

Routing Protocols in Intermittently Connected Network Epidemic Routing Deliver data to all encountered nodes Limit resources by hop counts Disconnected Transitive Communication Utility function to determine connected node that is closest to destination. Interrogation-Based Relay Routing Topology based.

Prophet Probabilistic Routing Protocol using History of Encounters and Transitivity for Intermittently Connected Network Improve delivery rate of messages by keeping buffer usage and communication overhead at a low level. Assumes that nodes move in a predictable behavior. Transfers data when Delivery Predictability Value is higher at other node.

Shortcomings of Prophet Data may be lost when Data node fails (out of power w/ no recharging opportunity)‏ Buffer size full (Prophet uses FIFO)‏ Short duration contact Data to destination may be delayed due to Transmitting to nodes that does not visit the location of the destination node often

Motivation Why improve Prophet Most popular routing protocol in Opportunistic Network. What to improve in Prophet Reduce Data loss Reduce Single Point of Failures Reduce Transmission Delays

Prophet+ Deliverability value based on Prophet's predictability value in addition to: Remaining Buffer/Storage Remaining power Bandwidth Popularity When a node wants to send data Determine data size. Query all connected nodes for log files. Calculates deliverability value using log files.

Buffer/Storage Motivation Main Motivation Reduce chance of data loss from FIFO Too much incoming data Self generated data Side Benefit May reduce chance of single point of failure Data sent to other nodes as data begins to fill.

Buffer/Storage All nodes define a threshold B thresh Sender Node receives: B remain :buffer/storage size remaining till B thresh Perform: The lesser the storage space remaining, the lesser the score.

Determining Threshold Nodes log an arbitrary amount of time of storage usage average. Set the threshold so that self generated data does not cause storage/buffer to become full.

Power Motivation Main Motivation Nodes w/ no recharge Increase uptime of specific nodes. Increase success of delivery. Side Benefit Reduce Single Point of failure

Remaining Power/Power Consumption – No Recharge Sender receives A ratio value: Potential receiver does The computation of

Bandwidth Motivation Reduce chance of corrupt packet during transmission due to contact time. Reduce chance of power wasting

Bandwidth Sender Compute score Values > 1 are set to 1.

Popularity Motivation Load balancing Decrease burden on specific nodes. Longevity of nodes Heavily related to Buffer/Power issue but Buffer and Power ensure minimal data loss. Popularity is an independent property when Buffer/Power are not issues. Longer time to transmit due to more data in queue. Single point of failure.

Popularity Potential Receiver Logs number of times it has received and transmitted data in a certain amount of time Sender Receives popularity log The greater the P, the lesser the score.

Simulation Test each property individually  Compare (property+prophet) to prophet Evaluate results to determine weights for each property Run a comparison between Prophet and the (combined weight of each property + prophet) ‏

Simulation Extension of DTNSIM  Java Based  Discrete event simulator for DTN environment Performance metrics  Successful data delivery ratio  Delay performance Scenarios  Real world wireless traces Haggle(Infocom’ 05) ‏‏

Simulation Trace Name Haggle DeviceiMote Network TypeBluetooth Duration (days)4 Devices Participating274 Number of Contacts28,250 Avg # Contacts/pair/day0.27

Parameter Settings Number of sender-receiver pairs: 20 pairs Number of Packets/Pair: First 40% of simulation time with a Poisson rate of 900 sec/packet generated. iMote ~150 packets Packet size: 10MB Deliverability= 0.5 property Prophet

Results: Prophet +Power

Results: Prophet +Buffer

Results: Prophet + Bandwidth

Results: Prophet + Popularity

Prophet v.s. Scores (initial weight)

Results: Prophet + Popularity

Conclusion PRoPHET+: Design a score function, which consider buffer, power, bandwidth, popularity and predictability. Has lower delay and higher successful delivery rate.

Thank You!