Analysis of Hop Limit in Opportunistic Networks by
|
|
- Jessica Berry
- 6 years ago
- Views:
Transcription
1 Analysis of Hop Limit in Opportunistic Networks by Suzan Bayhan*, Esa Hyytiä, Jussi Kangasharju* and Jörg Ott *University of Helsinki and Aalto University, Finland, Bayhan et al., 17:15-18:00 IEEE ICC 2015 ICC Static and Capital Time-Aggregated Hall Graphs Interactive 2
2 Mobile opportunistic networks Many mobile devices with different types of content stored locally
3 Mobile opportunistic networks Carried by users
4 Mobile opportunistic networks Short range radio, e.g., Bluetooth, Wifi Direct
5 Opportunistic communication store-carry-forward Mobility is the enabler Opportunistic short-range transmission
6 Hop limitations are applied to keep routing scalable and resource-efficient. Source node Destination node Relaying nodes Hop limit
7 Hop limitations are applied to keep routing scalable and resource-efficient. Source node Destination node Relaying nodes Hop limit
8 Hop-Limited Routing A message can be forwarded to at most h hops Hop=1 Hop=2 Hop=h
9 Hop = 0 Destination Message created hop=0
10 Hop = 1 Message received by direct neighbors
11 Hop = 2 destination reached
12 Hop = 3 Other nodes may not be aware of the delivery of the message to the destination.
13 Hop = 10 Waste of resources
14 How does hop limit affect opportunistic routing? average time to send a packet fraction of nodes reachable delivery ratio
15 analysis approaches Static graph Time-aggregated graphs Simulations
16 Human contact trace Corresponding network topology Contact trace Static graph Time-aggregated graphs Capacity Analysis for h=1,,h or simulate!
17 Network topology generation A B C B C E D B T=0 t1 t2 t3 t4 T
18 Network topology generation A B C B C E D B T=0 t1 t2 t3 t4 T Approach 1: Aggregate all contacts in the trace, and create a static graph to represent network topology à Static graph A Observation point B D C E
19 Network topology generation A B C B C E D B T=0 t1 t2 t3 t4 T Approach 1: Aggregate all contacts in the trace, and create a static graph to represent network topology à Static graph Approach 2: Instead of one single graph, observe the network in several time points, and create the network topology à Time-aggregated graph C A Observation point B D C E Time interval 1 Time interval 2 A t1 D B E t2 C A t3 B t4 E D
20 Static vs. Time-Aggregated graphs Static graph A B D C E D! B! C! E in static graph
21 Static vs. Time-Aggregated graphs Static graph A B D C E D! B! C! E in static graph Time interval 1 Time interval 2 A B A B C D E C E Only D! B in this second graph B! C link is missing D
22 Static vs. Time-Aggregated graphs Static graph B A C D D! B! C! E in static graph E Time-aggregation results in loss of temporal dynamics but simplistic Static graph overestimates the connectivity and hence the capacity Time interval 1 Time interval 2 A B A B How much does it affect? C D E C E Only D! B in this second graph B! C link is missing D
23 AHOP All Hops Optimal Paths All Hops Optimal Path (AHOP) Problem: For a given source node and maximal hop count,, find, for each hop count value,, and destination node, an -hop constrained optimal path between and.
24 AHOP for capacity analysis Q1: Average time to send a packet s w1 w2 Path length w3 d Q2: Fraction of nodes reachable 2 3 Size of the connected component 1 s 4 Q3: Delivery ratio Probability of the existence of a path s w1 w2 w3 d
25 AHOP analysis w(a,b) w(b,c) w(c,d) A B C D p: A à B à C à D o Optimal path p* from A to D is the path with minimum w(p) among all paths from A to D. o Hop-limited optimal path p* is p h * where length(p h *) <= h o Given the edge weights, what is the weight of p, w(p)?
26 Edge weights o o w(p) = w(a,b) + w(b,c) + w(c,d) à Additive weights w(p) = max{w(a,b), w(b,c), w(c,d)} à Bottleneck weights Additive weight: Path weight = routing delay weight of an edge: inter-contact time between the corresponding nodes Bottleneck weight (capacity): A routing scheme should choose the paths that will highly probably exist à most probable paths. weight of an edge: the inverse of the number of encounters between the corresponding nodes
27 Human contact trace Corresponding network topology Contact trace Static graph Time-aggregated graphs AHOP for h=1,,h Bottleneck Additive or simulate!
28 Nume ical Evaluation R for graphs and AHOP (timeordered package Benjamin Blonder) ONE for simulations
29 TABLE I HUMAN CONTACT TRACES USED IN THE ANALYSIS. Trace Duration # of devices (n) Context Infocom05 3 days 41 Conference participants Cambridge 11 days 36 1st and 2nd year undergraduate students Infocom06 4 days 78 (and 20 stationary devices) Conference participants Community Resource for Archiving Wireless Data At Dartmouth
30 Static analysis: hop limit vs. capacity Normalized delivery success Normalized delay Bottleneck capacity Infocom05 Cambridge Infocom Hop count (h) Additive weight Infocom05 Cambridge Infocom Hop count (h)
31 Bottleneck capacity Static analysis: hop limit vs. capacity Normalized delivery success Infocom05 Cambridge Infocom Hop count (h) Additive weight Normalized delay Infocom05 Cambridge Infocom Hop count (h) Delivery ratio increases while delay decreases with increasing h
32 Bottleneck capacity Hop count (h) Static analysis: hop limit vs. capacity Normalized delivery success Marginal changes Infocom05 Cambridge after Infocom06 these points Additive weight Normalized delay Infocom05 Cambridge Infocom Hop count (h) Delivery ratio increases while delay decreases with increasing h
33 Static analysis: optimal hop Optimal hop (bottleneck) Infocom05 Cambridge Infocom Hop count (h) Optimal hop (additive) Infocom05 Cambridge Infocom Hop count (h)
34 Static analysis: optimal hop Optimal hop (bottleneck) Hop count (h) Infocom05 Cambridge Infocom06 Optimal hop (additive) Very low hop counts Infocom05 Cambridge Infocom Hop count (h)
35 Revisiting our research questions average time to send a packet o Nodes can be reached faster by relaxing hop count o Improvement vanishes after several hops o Optimal hop counts (total path delay): 2-3 hops fraction of nodes reachable The first two hops are sufficient to reach every node from every other node. delivery ratio increases significantly if at least two hops are allowed, and stabilizes after h approx. 4.
36 Time-aggregated graphs Three aggregation windows Short : 1 h Medium: 6 h Long: 24 h
37 Time-aggregated graphs Optimal hop count over time Infocom05, short Optimal hop count (bottleneck) Time aggregated, h=3 Time aggregated, h=8 Static, h=3 Static, h= Snapshot index
38 Optimal hop count (bottleneck) Time-aggregated graphs Optimal hop count over time Time aggregated, h=3 Time aggregated, h=8 Static, h=3 Static, h= Snapshot index Day Night Dependency on the time of the day Lower than static optimal hop count
39 Time-aggregated graphs Hop vs. reached fraction Reached fraction Short Medium Long Static Hop count (h) Larger time-window, higher reached fraction Acc. to static analysis, 2 hops are enough to reach all. But lower connectivity for others. Trend is the same (h=2 achieves most of the gains of multi-hop routing).
40 Network snapshots Hop count vs. capacity Bottleneck capacity Short Medium Long Static Hop count (h) Optimal hop count (bottleneck) Short Medium Long Static Simulation Hop count (h) Highest increase from h=1 to h=2 After h=4, vanishingly small gain
41 Network snapshots Hop count vs. capacity Bottleneck capacity Short Medium Long Static Hop count (h) Optimal hop count (bottleneck) Short Medium Long Static Simulation Hop count (h) 1 Highest increase from h=1 to h=2 2 After h=4, vanishingly small gain
42 Network snapshots Hop count vs. capacity Bottleneck capacity Short Medium Long Static Hop count (h) Optimal hop count (bottleneck) Short Medium Long Static Simulation Hop count (h) Short and medium aggregation windows closer to reality
43 Simulations AHOP analysis Delivery ratio Infocom05, ttl=1 hour Infocom06, ttl=1 hour Infocom05, ttl=6 hours Infocom06, ttl=6 hours Infocom05, ttl=24 hours Infocom06, ttl=24 hours Hop count (h) Bottleneck capacity Infocom05 Cambridge Infocom Hop count (h) Bottleneck capacity: inverse of number of encounters
44 Simulations Delivery ratio Infocom05, ttl=1 hour Infocom06, ttl=1 hour Infocom05, ttl=6 hours Infocom06, ttl=6 hours Infocom05, ttl=24 hours Infocom06, ttl=24 hours Hop count (h) Agrees our previous analysis Trend is the same h=2 highest improvement h>4 stability Bottleneck capacity Infocom05 Cambridge Infocom Hop count (h)
45 Simulations Delivery delay and path lengths AHOP analysis Delivery delay (s) Infocom05, ttl=1 hour Infocom06, ttl=1 hour Infocom05, ttl=6 hours Infocom06, ttl=6 hours Infocom05, ttl=24 hours Infocom06, ttl=24 hours Additive weight Infocom05 Cambridge Infocom Hop count (h) Hop count (h) Additive weight: inter-contact time
46 Summary Effect of hop count Capacity of the studied human contact networks increases significantly with h>=2 Improvement vanishes after h=4 Effect of analysis approach Static graph approach overestimates connectivity and performance Time window of the aggregation should be paid attention to
47 Source node Destination node Relaying nodes Hop limit Thank you
48 Reading list Guérin, Roch, and Ariel Orda, "Computing shortest paths for any number of hops." IEEE/ACM Transactions on Networking (TON) 10.5 (2002): M. Vojnovic and A. Proutiere, Hop limited flooding over dynamic networks, in Proceedings IEEE INFOCOM, 2011, pp M. Vojnovic and A. Proutiere, Hop limited flooding over dynamic networks, in Proceedings IEEE INFOCOM, 2011, pp B. Blonder, T. W. Wey, A. Dornhaus, R. James, and A. Sih, Temporal dynamics and network analysis, Methods in Ecology and Evolution, vol. 3, no. 6, pp , A. Casteigts, P. Flocchini, W. Quattrociocchi, and N. Santoro, Time-varying graphs and dynamic networks, Int. Journal of Parallel, Emergent and Distributed Systems, vol. 27, no. 5, pp , Burdakov, Oleg P., et al. Optimal placement of communications relay nodes. Department of Mathematics, Linköpings universitet, Available at
49 Analysis of Hop Limit in Opportunistic Networks by Suzan Bayhan*, Esa Hyytiä, Jussi Kangasharju* and Jörg Ott *University of Helsinki and Aalto University, Finland, Bayhan et al., 17:15-18:00 IEEE ICC 2015 ICC Static and Capital Time-Aggregated Hall Graphs Interactive 2
Analysis of Hop Limit in Opportunistic Networks by Static and Time-Aggregated Graphs
nalysis of op imit in Opportunistic Networks by Static and Time-ggregated Graphs Suzan ayhan, sa yytiä, ussi Kangasharju, and örg Ott Department of omputer Science, University of elsinki, inland mail:
More informationBUBBLE RAP: Social-Based Forwarding in Delay-Tolerant Networks
1 BUBBLE RAP: Social-Based Forwarding in Delay-Tolerant Networks Pan Hui, Jon Crowcroft, Eiko Yoneki Presented By: Shaymaa Khater 2 Outline Introduction. Goals. Data Sets. Community Detection Algorithms
More informationEmpirical Evaluation of Hybrid Opportunistic Networks
Empirical Evaluation of Hybrid Opportunistic Networks Pan Hui Joint work with Anders Lindgren and Jon Crowcroft (University of Cambridge) 1 Introduction Two trends observed Lots of work done on opportunistic
More informationOutline. Assumptions. Key Features. A Content-Based Networking Protocol For Sensor Networks (Technical Report 2004)
A Content-Based Networking Protocol For Sensor Networks (Technical Report 004) Presented by: Kyu-Wook Cho /0/05 Outline Assumptions Direct access only to neighbor nodes Resource-constrained nodes Many
More informationA Joint Replication-Migration-based Routing in Delay Tolerant Networks
A Joint -Migration-based Routing in Delay Tolerant Networks Yunsheng Wang and Jie Wu Dept. of Computer and Info. Sciences Temple University Philadelphia, PA 19122 Zhen Jiang Dept. of Computer Science West
More informationCenter for Networked Computing
Concept of mobile social networks (MSNs): People walk around with smartphones and communicate with each other via Bluetooth or Wi-Fi when they are within transmission range of each other. Characters: No
More informationOpportunistic Routing Algorithms in Delay Tolerant Networks
Opportunistic Routing Algorithms in Delay Tolerant Networks Eyuphan Bulut Rensselaer Polytechnic Institute Department of Computer Science and Network Science and Technology (NeST) Center PhD Thesis Defense
More informationHeterogeneous Community-based Routing in Opportunistic Mobile Social Networks
Heterogeneous Community-based Routing in Opportunistic Mobile Social Networks Yunsheng Wang Kettering University Jie Wu Temple University Mingjun Xiao University of Science and Tech. of China Daqiang Zhang
More informationDATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACES
DATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACES B.Poonguzharselvi 1 and V.Vetriselvi 2 1,2 Department of Computer Science and Engineering, College of Engineering Guindy, Anna University Chennai,
More informationCONSTRUCTION AND EVALUATION OF MESHES BASED ON SHORTEST PATH TREE VS. STEINER TREE FOR MULTICAST ROUTING IN MOBILE AD HOC NETWORKS
CONSTRUCTION AND EVALUATION OF MESHES BASED ON SHORTEST PATH TREE VS. STEINER TREE FOR MULTICAST ROUTING IN MOBILE AD HOC NETWORKS 1 JAMES SIMS, 2 NATARAJAN MEGHANATHAN 1 Undergrad Student, Department
More informationArchna Rani [1], Dr. Manu Pratap Singh [2] Research Scholar [1], Dr. B.R. Ambedkar University, Agra [2] India
Volume 4, Issue 3, March 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Performance Evaluation
More informationWireless Mesh Networks
Wireless Mesh Networks COS 463: Wireless Networks Lecture 6 Kyle Jamieson [Parts adapted from I. F. Akyildiz, B. Karp] Wireless Mesh Networks Describes wireless networks in which each node can communicate
More informationWaterChat: A Group Chat Application Based on Opportunistic Mobile Social Networks
WaterChat: A Group Chat Application Based on Opportunistic Mobile Social Networks Tzu-Chieh Tsai, Ting-Shen Liu, and Chien-Chun Han Department of Computer Science, National Chengchi University, Taipei,
More informationPerformance Analysis of Storage-Based Routing for Circuit-Switched Networks [1]
Performance Analysis of Storage-Based Routing for Circuit-Switched Networks [1] Presenter: Yongcheng (Jeremy) Li PhD student, School of Electronic and Information Engineering, Soochow University, China
More informationWireless Internet Routing. Learning from Deployments Link Metrics
Wireless Internet Routing Learning from Deployments Link Metrics 1 Learning From Deployments Early worked focused traditional routing issues o Control plane: topology management, neighbor discovery o Data
More informationImproving Cellular Capacity with White Space Offloading
Improving Cellular Capacity with White Space Offloading Suzan Bayhan*, Liang Zheng*, Jiasi Chen, Mario Di Francesco, Jussi Kangasharju, and Mung Chiang * equal contribution WiOPT, Paris, France, May 15-19,
More informationKeywords: Medium access control, network coding, routing, throughput, transmission rate. I. INTRODUCTION
Performance Analysis of Network Parameters, Throughput Optimization Using Joint Routing, XOR Routing and Medium Access Control in Wireless Multihop Network 1 Dr. Anuradha M. S., 2 Ms. Anjali kulkarni 1
More informationECE 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
More informationDelay Tolerant Networks
Delay Tolerant Networks DEPARTMENT OF INFORMATICS & TELECOMMUNICATIONS NATIONAL AND KAPODISTRIAN UNIVERSITY OF ATHENS What is different? S A wireless network that is very sparse and partitioned disconnected
More informationComprehensive Study and Review Various Routing Protocols in MANET
126 Comprehensive Study and Review Various Routing Protocols in MANET Prabhjot Kaur 1, Preet Bala 2 M-Tech Student(CSE), GZS PTU CAMPUS, Bathinda Prabhjot6996@gmail.com Dr. Shaveta Rani, Dr. Paramjeet
More informationCROSS LAYER PROTOCOL (APTEEN) USING WSN FOR REAL TIME APPLICATION
CROSS LAYER PROTOCOL (APTEEN) USING WSN FOR REAL TIME APPLICATION V. A. Dahifale 1, N. Y. Siddiqui 2 PG Student, College of Engineering Kopargaon, Maharashtra, India 1 Assistant Professor, College of Engineering
More informationThe 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
More informationComparative Study on Performance Evaluation of Ad-Hoc Network Routing Protocols Navpreet Chana 1, Navjot Kaur 2, Kuldeep Kumar 3, Someet Singh 4
Comparative Study on Performance Evaluation of Ad-Hoc Network Routing Protocols Navpreet Chana 1, Navjot Kaur 2, Kuldeep Kumar 3, Someet Singh 4 1 Research Scholar, Computer Science and Engineering, Lovely
More informationVaibhav Jain 2, Pawan kumar 3 2,3 Assistant Professor, ECE Deptt. Vaish College of Engineering, Rohtak, India. Rohtak, India
Volume 3, Issue 8, August 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Improved OLSR
More informationFloating Content: Information Sharing in Urban Areas
9/2/ Floating Content: Information Sharing in Urban Areas Jörg Ott Esa Hyytiä, Pasi Lassila Jussi Kangasharju Tobias Vaegs Infrastructure-less Content Sharing Ad-hoc local social network-style
More informationEfficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks
Efficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks Joo-Han Song, Vincent Wong and Victor Leung Department of Electrical and Computer Engineering The University of British Columbia 56
More informationReplica Distribution Scheme for Location-Dependent Data in Vehicular Ad Hoc Networks using a Small Number of Fixed Nodes
Replica Distribution Scheme for Location-Dependent Data in Vehicular d Hoc Networks using a Small Number of Fixed Nodes Junichiro Okamoto and Susumu Ishihara Graduate School of Engineering, Shizuoka University,
More informationClustering-Based Distributed Precomputation for Quality-of-Service Routing*
Clustering-Based Distributed Precomputation for Quality-of-Service Routing* Yong Cui and Jianping Wu Department of Computer Science, Tsinghua University, Beijing, P.R.China, 100084 cy@csnet1.cs.tsinghua.edu.cn,
More informationA Topology Based Routing Protocols Comparative Analysis for MANETs Girish Paliwal, Swapnesh Taterh
A Topology Based Routing Protocols Comparative Analysis for MANETs Girish Paliwal, Swapnesh Taterh Amity University Rajasthan, Jaipur, India Abstract MANET is a dynamic topology wireless network in which
More informationUsing Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks. Wang Wei Vikram Srinivasan Chua Kee-Chaing
Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wang Wei Vikram Srinivasan Chua Kee-Chaing Overview The motivation of mobile relay The performance analysis for mobile relay in the
More informationA Survey on Congestion Control and Maximization of Throughput in Wireless Networks
A Survey on Congestion Control and Maximization of Throughput in Wireless Networks K.Ravindra Babu Post graduate student V.R.Siddhartha Engineering College ravindra.bec2008@gmail.com J.Ranga Rao Assistant
More informationPerformance Improvement of Wireless Network Using Modern Simulation Tools
Performance Improvement of Wireless Network Using Modern Simulation Tools Ms. Nimisha Dinesh Deval 1, Prof. Mrs. S. P. Pawar 2 1ME student CSE Dept, SVERIs college of Engineering, Pandharpur, Maharashtra,
More informationEnd-To-End Delay Optimization in Wireless Sensor Network (WSN)
Shweta K. Kanhere 1, Mahesh Goudar 2, Vijay M. Wadhai 3 1,2 Dept. of Electronics Engineering Maharashtra Academy of Engineering, Alandi (D), Pune, India 3 MITCOE Pune, India E-mail: shweta.kanhere@gmail.com,
More informationEFFICIENT TRAJECTORY PROTOCOL FOR MULTICASTING IN VEHICULAR AD HOC NETWORKS
EFFICIENT TRAJECTORY PROTOCOL FOR MULTICASTING IN VEHICULAR AD HOC NETWORKS Nandhini P. 1 and Ravi G. 2 1 Department of Electronics and Communication Engineering, Communication Systems, Sona College of
More informationRouting in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14
Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14 Routing Algorithms Link- State algorithm Each node maintains a view of the whole network topology Find the shortest path
More informationRouting 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
More informationRouting Protocols in MANETs
Chapter 4 Routing Protocols in MANETs 4.1 Introduction The main aim of any Ad Hoc network routing protocol is to meet the challenges of the dynamically changing topology and establish a correct and an
More informationPrecomputation Schemes for QoS Routing
578 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 11, NO. 4, AUGUST 2003 Precomputation Schemes for QoS Routing Ariel Orda, Senior Member, IEEE, and Alexander Sprintson, Student Member, IEEE Abstract Precomputation-based
More informationDefending MANET against Blackhole Attackusing Modified AODV
IJSTE - International Journal of Science Technology & Engineering Volume 1 Issue 2 August 214 ISSN(online) : 2349-784X Defending MANET against Blackhole Attackusing Modified AODV Devang S. Patel P.G. Student
More informationA Survey - Energy Efficient Routing Protocols in MANET
, pp. 163-168 http://dx.doi.org/10.14257/ijfgcn.2016.9.5.16 A Survey - Energy Efficient Routing Protocols in MANET Jyoti Upadhyaya and Nitin Manjhi Department of Computer Science, RGPV University Shriram
More informationOn Exploiting Transient Contact Patterns for Data Forwarding in Delay Tolerant Networks
On Exploiting Transient Contact Patterns for Data Forwarding in Delay Tolerant Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering Pennsylvania State University Outline Introduction
More informationarxiv: v1 [cs.ni] 16 Nov 2015
Two Hops or More: On Hop-Limited Search in Opportunistic Networs Suzan Bayhan University of Helsini Finland bayhan@hiit.fi Esa Hyytiä Aalto University Finland esa@netlab.t.fi Jussi Kangasharju University
More informationCommunity-Based Adaptive Buffer Management Strategy in Opportunistic Network
Community-Based Adaptive Buffer Management Strategy in Opportunistic Network Junhai Zhou, Yapin Lin ( ), Siwang Zhou, and Qin Liu College of Computer Science and Electronic Engineering, Hunan University,
More informationUsing Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions
Using Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions R.Thamaraiselvan 1, S.Gopikrishnan 2, V.Pavithra Devi 3 PG Student, Computer Science & Engineering, Paavai College
More informationEfficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks
Efficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks Joo-Han Song, Vincent W. S. Wong and Victor C. M. Leung Department of Electrical and Computer Engineering The University of British
More informationMitigating Superfluous Flooding of Control Packets MANET
Mitigating Superfluous Flooding of Control Packets MANET B.Shanmugha Priya 1 PG Student, Department of Computer Science, Park College of Engineering and Technology, Kaniyur, Coimbatore, India 1 Abstract:
More informationTPSF+: A New Two-Phase Scatternet Formation Algorithm for Bluetooth Ad Hoc Networks
: A New Two-Phase Scatternet Formation Algorithm for Bluetooth Ad Hoc Networks Chu Zhang, Vincent W.S. Wong, and Victor C.M. Leung Department of Electrical and Computer Engineering The University of British
More informationModified ECMP Routing Using Adapted Cost Disjoint Multiple Paths ACDMP
Modified ECMP Routing Using Adapted Cost Disjoint Multiple Paths ACDMP Dr. Abbas A. Jasim Computer Engineering Department University of Basrah Basrah, Iraq abbas.a.jasim@ieee.org Abstract Computer network
More informationFigure 1. Clustering in MANET.
Volume 6, Issue 12, December 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Performance
More informationA Graph-based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks
A Graph-based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks Gunyoung Koh, Duyoung Oh 1 and Heekyoung Woo 2 1 School of Electrical Engineering and Computer Science Seoul National University,
More informationSimulation and Analysis of Opportunistic Routing Protocols
Simulation and Analysis of Opportunistic Routing Protocols 1 The Purpose The purpose of this assignment is to gain familiarity with a network simulation tool and to get experience in basic data analysis.
More informationInformation Brokerage
Information Brokerage Sensing Networking Leonidas Guibas Stanford University Computation CS321 Information Brokerage Services in Dynamic Environments Information Brokerage Information providers (sources,
More informationAn Iterative Greedy Approach Using Geographical Destination Routing In WSN
ISSN (Online) : 2319-8753 ISSN (Print) : 2347-6710 International Journal of Innovative Research in Science, Engineering and Technology Volume 3, Special Issue 3, March 2014 2014 International Conference
More informationShortcut Tree Routing using Neighbor Table in ZigBee Wireless Networks
Shortcut Tree Routing using Neighbor Table in ZigBee Wireless Networks Salmu K.P 1, Chinchu James 2 1,2 Department of Computer Science, IIET, Nellikuzhi Abstract- ZigBee is a worldwide standard for wireless
More informationSTUDY AND COMPARISION OF PROACTIVE AND REACTIVE ROUTING PROTOCOL FOR MULTICHANNEL WIRELESS AD-HOC NETWORK
STUDY AND COMPARISION OF PROACTIVE AND REACTIVE ROUTING PROTOCOL FOR MULTICHANNEL WIRELESS AD-HOC NETWORK 1 Arpita Singh, 2 Navendu Nitin, 3 Neelesh Agrawal, 4 Arvind Kumar Jaiswal 1 PG student, SHIATS-DU,
More informationInvestigation on the fisheye state algorithm in context with QoS routing. Author: Yi Zhou. Prof: Raimo Kantola Instructor: Dr.
Investigation on the fisheye state algorithm in context with QoS routing Author: Yi Zhou Prof: Raimo Kantola Instructor: Dr. Peng Zhang 1 Table of Contents 1. Overview of routing algorithms 2. Fisheye
More informationInter Domain QoS Routing using VS scheme
Inter Domain QoS Routing using VS scheme Bikramjit Walia and Girish P. Saraph, Member IEEE Department of Electrical Engineering, IIT Bombay, Powai, Mumbai-76, India Abstract Many real-time multimedia and
More informationUnicast Routing in Mobile Ad Hoc Networks. Dr. Ashikur Rahman CSE 6811: Wireless Ad hoc Networks
Unicast Routing in Mobile Ad Hoc Networks 1 Routing problem 2 Responsibility of a routing protocol Determining an optimal way to find optimal routes Determining a feasible path to a destination based on
More informationReliable and Energy Efficient Protocol for Wireless Sensor Network
Reliable and Energy Efficient Protocol for Wireless Sensor Network Hafiyya.R.M 1, Fathima Anwar 2 P.G. Student, Department of Computer Engineering, M.E.A Engineering College, Perinthalmanna, Kerala, India
More informationEnergy Consumption and Performance of Delay Tolerant Network Routing Protocols under Different Mobility Models
2016 7th International Conference on Intelligent Systems, Modelling and Simulation Energy Consumption and Performance of Delay Tolerant Network Routing Protocols under Different Mobility Models Bhed Bahadur
More informationComputation of Multiple Node Disjoint Paths
Chapter 5 Computation of Multiple Node Disjoint Paths 5.1 Introduction In recent years, on demand routing protocols have attained more attention in mobile Ad Hoc networks as compared to other routing schemes
More informationA Routing Protocol and Energy Efficient Techniques in Bluetooth Scatternets
A Routing Protocol and Energy Efficient Techniques in Bluetooth Scatternets Balakrishna J. Prabhu and A. Chockalingam Department of Electrical Communication Engineering Indian Institute of Science, Bangalore
More informationCSE 473 Introduction to Computer Networks. Final Exam. Your Name: 12/17/2014 PLEASE WRITE LEGIBLY NO POINTS FOR ILLEGIBLE ANSWERS
CSE 47 Introduction to Computer Networks Roch Guérin Final Exam Your Name: 12/17/2014 PLEASE WRITE LEGIBLY NO POINTS FOR ILLEGIBLE ANSWERS 1. [10 points] Bob has been provided with the following pair of
More informationEnhancement of Routing in Urban Scenario using Link State Routing Protocol and Firefly Optimization
Enhancement of Routing in Urban Scenario using Link State Routing Protocol and Firefly Optimization Dhanveer Kaur 1, Harwant Singh Arri 2 1 M.Tech, Department of Computer Science and Engineering, Lovely
More informationEfficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks
Efficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks Jayanta Biswas and Mukti Barai and S. K. Nandy CAD Lab, Indian Institute of Science Bangalore, 56, India {jayanta@cadl, mbarai@cadl,
More informationPerformance Analysis of CSI:T Routing in a Delay Tolerant Networks
Performance Analysis of CSI:T Routing in a Delay Tolerant Networks Hardika Kusuma Putri Telkom University Bandung, Indonesia Dkusuma007@gmail.com Leanna Vidya Yovita, and Ridha Muldina Negara Telkom University
More informationDynamics of Inter-Meeting Time in Human Contact Networks
Dynamics of Inter-Meeting Time in Human Contact Networks Eiko Yoneki, Dan Greenfield, and Jon Crowcroft Computer Laboratory University of Cambridge Cambridge, United Kingdom {eiko.yoneki, dan.greenfield,
More informationMobile and Sensor Systems. Lecture 3: Infrastructure, Ad-hoc and Delay Tolerant Mobile Networks Dr Cecilia Mascolo
Mobile and Sensor Systems Lecture 3: Infrastructure, Ad-hoc and Delay Tolerant Mobile Networks Dr Cecilia Mascolo In this lecture In this lecture we will describe the difference in infrastructure and ad
More informationPart I. Wireless Communication
1 Part I. Wireless Communication 1.5 Topologies of cellular and ad-hoc networks 2 Introduction Cellular telephony has forever changed the way people communicate with one another. Cellular networks enable
More informationAnalysis of GPS and Zone Based Vehicular Routing on Urban City Roads
Analysis of GPS and Zone Based Vehicular Routing on Urban City Roads Aye Zarchi Minn 1, May Zin Oo 2, Mazliza Othman 3 1,2 Department of Information Technology, Mandalay Technological University, Myanmar
More informationResearch Article MFT-MAC: A Duty-Cycle MAC Protocol Using Multiframe Transmission for Wireless Sensor Networks
Distributed Sensor Networks Volume 2013, Article ID 858765, 6 pages http://dx.doi.org/10.1155/2013/858765 Research Article MFT-MAC: A Duty-Cycle MAC Protocol Using Multiframe Transmission for Wireless
More informationSpray and forward: Efficient routing based on the Markov location prediction model for DTNs
. RESEARCH PAPER. SCIENCE CHINA Information Sciences February 2012 Vol. 55 No. 2: 433 440 doi: 10.1007/s11432-011-4345-1 Spray and forward: Efficient routing based on the Markov location prediction model
More informationMaximum Coverage Range based Sensor Node Selection Approach to Optimize in WSN
Maximum Coverage Range based Sensor Node Selection Approach to Optimize in WSN Rinku Sharma 1, Dr. Rakesh Joon 2 1 Post Graduate Scholar, 2 Assistant Professor, Department of Electronics and Communication
More informationTO DESIGN ENERGY EFFICIENT PROTOCOL BY FINDING BEST NEIGHBOUR FOR ZIGBEE PROTOCOL
TO DESIGN ENERGY EFFICIENT PROTOCOL BY FINDING BEST NEIGHBOUR FOR ZIGBEE PROTOCOL 1 Mr. Sujeet D. Gawande, Prof. Amit M. Sahu 2 1 M.E. Scholar, Department of Computer Science and Engineering, G.H.R.C.E.M.,
More informationAnalysis of Cluster-Based Energy-Dynamic Routing Protocols in WSN
Analysis of Cluster-Based Energy-Dynamic Routing Protocols in WSN Mr. V. Narsing Rao 1, Dr.K.Bhargavi 2 1,2 Asst. Professor in CSE Dept., Sphoorthy Engineering College, Hyderabad Abstract- Wireless Sensor
More informationOn Performance Evaluation of Reliable Topology Control Algorithms in Mobile Ad Hoc Networks (Invited Paper)
On Performance Evaluation of Reliable Topology Control Algorithms in Mobile Ad Hoc Networks (Invited Paper) Ngo Duc Thuan 1,, Hiroki Nishiyama 1, Nirwan Ansari 2,andNeiKato 1 1 Graduate School of Information
More informationCost Based Efficient Routing for Wireless Body Area Networks
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. 4, Issue. 8, August 2015,
More informationSensor Network Protocols
EE360: Lecture 15 Outline Sensor Network Protocols Announcements 2nd paper summary due March 7 Reschedule Wed lecture: 11-12:15? 12-1:15? 5-6:15? Project poster session March 15 5:30pm? Next HW posted
More informationPerformance Evaluation of DSDV, DSR AND ZRP Protocol in MANET
Performance Evaluation of, AND Protocol in MANET Zaiba Ishrat IIMT Engg college,meerut Meerut, India Pankaj singh Sidhi vinayak Group of College,Alwar Alwar,Rajasthan Rehan Ahmad IIMT Engg college,meerut
More informationAn Algorithm for Dynamic SDN Controller in Data Centre Networks
IOSR Journal of Engineering (IOSRJEN) ISSN (e): 2250-3021, ISSN (p): 2278-8719 PP 04-08 www.iosrjen.org An Algorithm for Dynamic SDN Controller in Data Centre Networks Nirmala 1, Oliveruth 2, Varun 3 1
More informationQoS-Aware Hierarchical Multicast Routing on Next Generation Internetworks
QoS-Aware Hierarchical Multicast Routing on Next Generation Internetworks Satyabrata Pradhan, Yi Li, and Muthucumaru Maheswaran Advanced Networking Research Laboratory Department of Computer Science University
More informationNetwork Routing Protocol using Genetic Algorithms
International Journal of Electrical & Computer Sciences IJECS-IJENS Vol:0 No:02 40 Network Routing Protocol using Genetic Algorithms Gihan Nagib and Wahied G. Ali Abstract This paper aims to develop a
More informationMobile Routing : Computer Networking. Overview. How to Handle Mobile Nodes? Mobile IP Ad-hoc network routing Assigned reading
Mobile Routing 15-744: Computer Networking L-10 Ad Hoc Networks Mobile IP Ad-hoc network routing Assigned reading Performance Comparison of Multi-Hop Wireless Ad Hoc Routing Protocols A High Throughput
More informationConnectivity, Energy and Mobility Driven Clustering Algorithm for Mobile Ad Hoc Networks
Connectivity, Energy and Mobility Driven Clustering Algorithm for Mobile Ad Hoc Networks Fatiha Djemili Tolba University of Haute Alsace GRTC Colmar, France fatiha.tolba@uha.fr Damien Magoni University
More informationA Multi-Copy Delegation Forwarding Based On Short-term and Long-Term Speed in DTNs
A Multi-Copy Delegation Forwarding Based On Short-term and Long-Term Speed in DTNs En Wang, 1,2 Yongjian Yang, 1 Jie Wu, 2 and Wenbin Liu 3 1 Department of Computer Science and Technology, Jilin University,
More informationQueuing Delay and Achievable Throughput in Random Access Wireless Ad Hoc Networks
Queuing Delay and Achievable Throughput in Random Access Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute Troy, NY bisnin@rpi.edu, abouzeid@ecse.rpi.edu
More informationBuffer Aware Routing in Interplanetary Ad Hoc Network
Buffer Aware Routing in Interplanetary Ad Hoc Network Kamal Mistry (Wipro Technologies, Bangalore) Sanjay Srivastava (DA-IICT, Gandhinagar) R. B. Lenin (DA-IICT, Gandhinagar) January 8, 2009 Buffer Aware
More informationADB: An Efficient Multihop Broadcast Protocol Based on Asynchronous Duty-Cycling in Wireless Sensor Networks
AD: An Efficient Multihop roadcast Protocol ased on Asynchronous Duty-Cycling in Wireless Sensor Networks Yanjun Sun* Omer Gurewitz Shu Du Lei Tang* David. Johnson* *Rice University en Gurion University
More informationMutually Exclusive Data Dissemination in the Mobile Publish/Subscribe System
Mutually Exclusive Data Dissemination in the Mobile Publish/Subscribe System Ning Wang and Jie Wu Dept. of Computer and Info. Sciences Temple University Road Map Introduction Problem and challenge Centralized
More informationIJREAT International Journal of Research in Engineering & Advanced Technology, Volume 1, Issue 2, April-May, 2013 ISSN:
Fast Data Collection with Reduced Interference and Increased Life Time in Wireless Sensor Networks Jayachandran.J 1 and Ramalakshmi.R 2 1 M.Tech Network Engineering, Kalasalingam University, Krishnan koil.
More informationPERFORMANCE EVALUATION OF TCP OVER ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS
PERFORMANCE EVALUATION OF TCP OVER ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS Md. Abdullah-Al-Mamun, M. Mahbubur Rahman Department of Information and Communication Engineering Islamic University Kushtia
More informationSUMMERY, CONCLUSIONS AND FUTURE WORK
Chapter - 6 SUMMERY, CONCLUSIONS AND FUTURE WORK The entire Research Work on On-Demand Routing in Multi-Hop Wireless Mobile Ad hoc Networks has been presented in simplified and easy-to-read form in six
More informationNode-Disjoint Multipath Routing with Group Mobility in MANETs
Node-Disjoint Multipath Routing with Group Mobility in MANETs Yun Ge 1,2, Guojun Wang 1,, and Jie Wu 3 1 School of Information Science and Engineering Central South University Changsha 410083, China 2
More informationComputing a Path subject to Multiple Constraints: Advances and Challenges
Computing a Path subject to Multiple Constraints: Advances and Challenges Guoliang (Larry) Xue Faculty of Computer Science and Engineering School of Computing, Informatics and Decision Systems Engineering
More informationEvaluating the Performance of Mobile Agent-Based Message Communication among Mobile Hosts in Large Ad Hoc Wireless Network
Evaluating the Performance of Mobile Agent-Based Communication among Mobile Hosts in Large Ad Hoc Wireless Network S. Bandyopadhyay Krishna Paul PricewaterhouseCoopers Limited Techna Digital Systems Sector
More informationA Highly Effective and Efficient Route Discovery & Maintenance in DSR
A Highly Effective and Efficient Route Discovery & Maintenance in DSR Shiva Prakash 1, Rajeev Kumar 2, Brijesh Nayak 3, Manindar Kumar Yadav 4 Department of Computer Science and Engineering, Madan Mohan
More informationDesign and Implementation of an Anycast Efficient QoS Routing on OSPFv3
Design and Implementation of an Anycast Efficient QoS Routing on OSPFv3 Han Zhi-nan Yan Wei Zhang Li Wang Yue Computer Network Laboratory Department of Computer Science & Technology, Peking University
More informationDistributed QoS Routing for Backbone Overlay Networks
Distributed QoS Routing for Backbone Overlay Networks Li Lao 1, Swapna S. Gokhale 2, and Jun-Hong Cui 2 1 Computer Science Dept., University of California, Los Angeles, CA 90095 2 Computer Science & Engineering
More informationKeywords Mobile Ad hoc Networks, Multi-hop Routing, Infrastructure less, Multicast Routing, Routing.
Volume 4, Issue 7, July 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Study on Various
More informationSecurity Enhancements for Mobile Ad Hoc Networks with Trust Management Using Uncertain Reasoning
Security Enhancements for Mobile Ad Hoc Networks with Trust Management Using Uncertain Reasoning Sapna B Kulkarni,B.E,MTech (PhD) Associate Prof, Dept of CSE RYM Engg.college, Bellari VTU Belgaum Shainaj.B
More information