CHAPTER 7 COMPARISON OF DIFFERENT ROUTING SCHEMES

Size: px
Start display at page:

Download "CHAPTER 7 COMPARISON OF DIFFERENT ROUTING SCHEMES"

Transcription

1 80 CHAPTER 7 COMPARISON OF DIFFERENT ROUTING SCHEMES 7.1 PERFORMANCE METRICS In the preceding chapters data delivery rate, buffer space, node density and message delay, average hop count, average buffer time have been considered for evaluating the performance. Data delivery rate is defined as the ratio of number of successfully delivered messages to the total number messages generated. The average end-to-end delay is defined as the average delay time between the time a message is generated at the source and the time the message is received at the destination. Average hop count is defined as average number of hop counts between the source node and the destination node. Overhead ratio can be calculated using the formula: (Number of packets relayed Number of packets delivered)/number of packets delivered. These metrics reflect how efficiently the data are delivered. In epidemic routing, multiple copies may be delivered to the destination. So the delay is computed based on the time the first copy is delivered. 7.2 SIMULATION SETUP The simulation period for each scenario is 20,000 seconds and the simulated mobility network area is 5400 m 5500 m rectangle. Similarly, the network area is divided into three disconnected clusters. Nodes can move anywhere in the cluster. This section analyses the results of simulations, by comparing the performance of the proposed protocols with epidemic routing

2 81 protocol. Next, the performance is analyzed with varying node density, buffer space, mobility speed, transmission range, transmit speed and the number of messages. 7.3 COMPARISON OF DIFFERENT PROPOSED ROUTING PROTOCOLS WITH EPIDEMIC ROUTING PROTOCOL Table 7.1 depicts a comparison of different routing schemes with varying parameter values. In the following pages, Figures 7.1 to 7.5 there is a comparison of performance of epidemic routing protocol and different proposed techniques with different node densities with 10, 25, 50, 75, 100, 125, 150, 200, 250 and 300 hosts. In all the cases, the buffer size of the nodes is set as 50 MB and Ferry is 250 MB, transmission range is 50 m, mobility speed is ~1meter/second, transmit speed of 250 kbps and infinite message TTL. Figure 7.1 Number of nodes vs Delivery probability

3 82

4 83

5 84 Figure 7.2 Number of nodes vs Overhead ratio Figure 7.3 Number of nodes vs Average latency Figure 7.4 Number of nodes vs Average buffer time

6 85 Figure 7.5 Number of nodes vs Average hop-count Figures 7.6 to 7.10 make a comparison of different routing protocols with different node mobilities of 0.1 to 0.5 m, 0.5 to 1 m, 1 to 2 m, 2 to 3 m, 4 to 5 m, 10 to 15 m, 20 to 25 m and 30 to 40 m. In all these cases, buffer size of the nodes is set as 50 MB and Ferry is 250 MB, transmission range is 50 m, total number of nodes 75 nodes (25 nodes per cluster), transmit speed of 250 kbps and infinite message TTL. Speed (m/s) Figure 7.6 Mobility speed vs Delivery probability

7 86 Speed (m/s) Figure 7.7 Mobility speed vs Overhead ratio Speed (m/s) Figure 7.8 Mobility speed vs Average latency Speed (m/s) Figure 7.9 Mobility speed vs Average buffer Time

8 87 Speed (m/s) Figure 7.10 Mobility speed vs Average hop-count Figures 7.11 to 7.15 represent a comparison with varying transmission ranges of 10 m, 25 m, 50 m, 75 m, 100 m, 200 m and 300 m. In all the cases, the buffer size of the nodes is set as 50MB and Ferry is 250 MB, node mobility is ~1 meter/second, total number of nodes 75 nodes (25 nodes per cluster), transmit speed of 250 kbps and infinite message TTL. Figure 7.11 Transmission range vs Delivery probability

9 88 Figure 7.12 Transmission range vs Overhead ratio Figure 7.13 Transmission range vs Average latency Figure 7.14 Transmission range vs Average buffer time

10 89 Figure 7.15 Transmission range vs Average hop-count Figures 7.16 to 7.20 show a comparison with varying number of messages with 50, 100, 250, 500, 1000, 1500 and 2000 messages. In all these cases, the buffer size of the nodes is set as 50 MB and Ferry is 250 MB, node mobility is ~1 meter/second, total number of nodes 75 nodes (25 nodes per cluster), transmit speed of 250 kbps, transmission range is 50 meters and infinite message TTL. Figure 7.16 Number of messages vs Delivery probability

11 90 Figure 7.17 Number of messages vs Overhead ratio Figure 7.18 Number of messages vs Average latency Figure 7.19 Number of messages vs Average buffer time

12 91 Figure 7.20 Number of messages vs Average hop-count From Figure 7.21 to 7.25, comparison is done with varying buffer space of the nodes with ten different buffer spaces: 10 MB, 20 MB, 30 MB, 40 MB, 50 MB, 60 MB, 70 MB, 80 MB, 90 MB, 100 MB. In all the cases, the buffer size of the Ferry is 250 MB, node mobility is ~1 meter/second, total number of nodes 75 nodes (25 nodes per cluster), transmission range is 50 meters, transmit speed of 250 kbps and infinite message TTL. Figure 7.21 Buffer size vs Delivery probability

13 92 Figure 7.22 Buffer size vs Overhead ratio Figure 7.23 Buffer size vs Average latency Figure 7.24 Buffer size vs Average buffer time

14 93 Figure 7.25 Buffer size vs Average hop-count Figures 7.26 to 7.30 exhibit a comparison with varying transmit speeds of the nodes with six different transmit speed of 50, 100, 150, 200, 250, 300 KBps. In these cases, the buffer size of the node is 50 MB and Ferry is 250 MB, node mobility is ~1 meter/second, total number of nodes 75 nodes (25 nodes per cluster), transmission range is 50 meters and infinite message TTL. Figure 7.26 Transmit speed vs Delivery probability

15 94 Figure 7.27 Transmit speed vs Overhead ratio Figure 7.28 Transmit speed vs Average latency Figure 7.29 Transmit speed vs Average buffer time

16 95 Figure 7.30 Transmit speed vs Average hop-count Figures 7.31 to 7.35 represent a comparison with varying buffer space of the global ferry with ten different buffer spaces: 10 MB, 20 MB, 30 MB, 40 MB, 50 MB, 60 MB, 70 MB, 80 MB, 90 MB, 100 MB. In all these cases, the buffer size of the regular node is 50 MB, node mobility is ~1 meter/second, total number of nodes 75 nodes (25 nodes per cluster), transmission range 50 meters, transmit speed of 250 kbps and infinite message TTL. Figure 7.31 Buffer size (Global Ferry) vs Delivery probability

17 96 Figure 7.32 Buffer size (Global Ferry) vs Overhead ratio Figure 7.33 Buffer size (Global Ferry) vs Average latency Figure 7.34 Buffer size (Global Ferry) vs Average buffer time

18 97 Figure 7.35 Buffer size (Global Ferry) vs Average hop-count Figures 7.36 to 7.40 involve a comparison with varying buffer space of the local ferry with ten different buffer spaces: 10 MB, 20 MB, 30 MB, 40 MB, 50 MB, 60 MB, 70 MB, 80 MB, 90 MB, 100 MB. In all these cases, the buffer size of the regular node is 50 MB, node mobility is ~1 meter/second, total number of nodes 75 nodes (25 nodes per cluster), transmission range 50 meters, transmit speed of 250 kbps and infinite message TTL. Figure 7.36 Buffer size (Local Ferry) vs Delivery probability

19 98 Figure 7.37 Buffer size (Local Ferry) vs Overhead ratio Figure 7.38 Buffer size (Local Ferry) vs Average latency Figure 7.39 Buffer size (Local Ferry) vs Average buffer time

20 99 Figure 7.40 Buffer size (Local Ferry) vs Average hop-count Figures 7.41 to 7.45 denote a comparison with varying buffer space of the gateway node with ten different buffer spaces: 10 MB, 20 MB, 30 MB, 40 MB, 50 MB, 60 MB, 70 MB, 80 MB, 90 MB, 100 MB. In all these cases, the buffer size of the regular node is 50 MB, node mobility is ~1 meter/second, total number of nodes 75 nodes (25 nodes per cluster), transmission range 50 meters, transmit speed of 250 kbps and infinite message TTL. Figure 7.41 Buffer size (Gateway) vs Delivery probability

21 100 Figure 7.42 Buffer size (Gateway) vs Overhead ratio Figure 7.43 Buffer size (Gateway) vs Average latency Figure 7.44 Buffer size (Gateway) vs Average buffer time

22 101 Figure 7.45 Buffer size (Gateway) vs Average hop-count 7.4 CONCLUSION The simulation results show that CMF and SMFGW produce good delivery ratio only when connectivity exists between nodes within the cluster. If partition occur between nodes in the cluster, then, routing schemes with multiple ferries like MMF, MMFGWFR and MMFGWDR produce a higher delivery ratio than other techniques.

Delay Tolerant Networks

Delay 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 information

IMPROVING QoS IN DELAY TOLERANT MOBILE AD HOC NETWORK USING MULTIPLE MESSAGE FERRIES

IMPROVING QoS IN DELAY TOLERANT MOBILE AD HOC NETWORK USING MULTIPLE MESSAGE FERRIES IMPROVING QoS IN DELAY TOLERANT MOBILE AD HOC NETWORK USING MULTIPLE MESSAGE FERRIES R. C. Suganthe Professor Department of Computer Science and Engineering Kongu Engineering College, Perundurai-638 052,

More information

MobilityFirst GSTAR: Generalized Storage Aware Routing

MobilityFirst GSTAR: Generalized Storage Aware Routing MobilityFirst GSTAR: Generalized Storage Aware Routing Samuel Nelson MobilityFirst Design Goals Design a future internet architecture that supports: Host and network mobility Diverse communication devices/entities/paradigms

More information

Center for Networked Computing

Center 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 information

Epidemic Routing for Partially-Connected Ad Hoc Networks

Epidemic Routing for Partially-Connected Ad Hoc Networks Epidemic Routing for Partially-Connected Ad Hoc Networks Presented By- Kannan Chandrasekaran MS Computer Science, EECS, University of Kansas, Lawrence. Email: kannanc@ku.edu Amin Vahdat and David Becker,

More information

Chapter 7 CONCLUSION

Chapter 7 CONCLUSION 97 Chapter 7 CONCLUSION 7.1. Introduction A Mobile Ad-hoc Network (MANET) could be considered as network of mobile nodes which communicate with each other without any fixed infrastructure. The nodes in

More information

Heterogeneous Community-based Routing in Opportunistic Mobile Social Networks

Heterogeneous 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 information

ROUTING ALGORITHMS Part 2: Data centric and hierarchical protocols

ROUTING ALGORITHMS Part 2: Data centric and hierarchical protocols ROUTING ALGORITHMS Part 2: Data centric and hierarchical protocols 1 Negative Reinforcement Time out Explicitly degrade the path by re-sending interest with lower data rate. Source Gradient New Data Path

More information

Wei Gao, Qinghua Li, Bo Zhao and Guohong Cao The Pennsylvania State University From: MobiHoc Presentor: Mingyuan Yan Advisor: Dr.

Wei Gao, Qinghua Li, Bo Zhao and Guohong Cao The Pennsylvania State University From: MobiHoc Presentor: Mingyuan Yan Advisor: Dr. Wei Gao, Qinghua Li, Bo Zhao and Guohong Cao The Pennsylvania State University From: MobiHoc 2009 Presentor: Mingyuan Yan Advisor: Dr. Yingshu Li 1 2 3 4 5 Introduction Problem definition Single-data multicast

More information

CHAPTER 4 SINGLE LAYER BLACK HOLE ATTACK DETECTION

CHAPTER 4 SINGLE LAYER BLACK HOLE ATTACK DETECTION 58 CHAPTER 4 SINGLE LAYER BLACK HOLE ATTACK DETECTION 4.1 INTRODUCTION TO SLBHAD The focus of this chapter is to detect and isolate Black Hole attack in the MANET (Khattak et al 2013). In order to do that,

More information

DTN Interworking for Future Internet Presented by Chang, Dukhyun

DTN Interworking for Future Internet Presented by Chang, Dukhyun DTN Interworking for Future Internet 2008.02.20 Presented by Chang, Dukhyun Contents 1 2 3 4 Introduction Project Progress Future DTN Architecture Summary 2/29 DTN Introduction Delay and Disruption Tolerant

More information

A ROUTING MECHANISM BASED ON SOCIAL NETWORKS AND BETWEENNESS CENTRALITY IN DELAY-TOLERANT NETWORKS

A ROUTING MECHANISM BASED ON SOCIAL NETWORKS AND BETWEENNESS CENTRALITY IN DELAY-TOLERANT NETWORKS A ROUTING MECHANISM BASED ON SOCIAL NETWORKS AND BETWEENNESS CENTRALITY IN DELAY-TOLERANT NETWORKS ABSTRACT Zhang Huijuan and Liu Kai School of Software Engineering, Tongji University, Shanghai, China

More information

I. INTRODUCTION. Keywords-disruption tolerant networks; custody transfer; route discovery; message ferry

I. INTRODUCTION. Keywords-disruption tolerant networks; custody transfer; route discovery; message ferry Performance Comparison of Unicast Routing Schemes in DTNs Mooi Choo Chuah, Peng Yang, Brian D. Davison, Liang Cheng {chuah, pey204, davison, cheng}@cse.lehigh.edu Lehigh University Abstract Delay and disruption

More information

APPENDIX 1 SIMULATORS

APPENDIX 1 SIMULATORS 113 APPENDIX 1 SIMULATORS The Network Simulator-2 (NS-2) and Opportunistic Network Environment (ONE) Simulators are used for simulation purpose. Movement report of ONE generates suitable movement data

More information

Routing Performance Analysis in Delay Tolerant Networks

Routing Performance Analysis in Delay Tolerant Networks Routing Performance Analysis in Delay Tolerant Networks Presenter: Hao Liang Main References: [1] G. Resta and P. Santi, A framework for routing performance analysis in delay tolerant networks with application

More information

Circuit Switching and Packet Switching

Circuit Switching and Packet Switching Chapter 10: Circuit Switching and Packet Switching CS420/520 Axel Krings Page 1 Switching Networks Long distance transmission is typically done over a network of switched nodes Nodes not concerned with

More information

DATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACES

DATA 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 information

ITTC A Geographical Routing Protocol for Highly-Dynamic Aeronautical Networks

ITTC A Geographical Routing Protocol for Highly-Dynamic Aeronautical Networks A Geographical Routing Protocol for Highly-Dynamic Aeronautical Networks Kevin Peters, Abdul Jabbar, Egemen K. Çetinkaya, James P.G. Sterbenz Department of Electrical Engineering & Computer Science Information

More information

Some Routing Challenges in Dynamic Networks

Some Routing Challenges in Dynamic Networks Some Routing Challenges in Dynamic Networks Jie Wu Dept. of Computer and Information Sciences Temple University Overview 1. Current State of Networking More Wireless Mobile and Opportunistic Applications

More information

Arvind Krishnamurthy Fall 2003

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

More information

Internet Architecture and Protocol

Internet Architecture and Protocol Internet Architecture and Protocol Set# 04 Wide Area Networks Delivered By: Engr Tahir Niazi Wide Area Network Basics Cover large geographical area Network of Networks WANs used to be characterized with

More information

Figure 1. Clustering in MANET.

Figure 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 information

Routing Protocols in MANETs

Routing 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 information

Comparing Delay Tolerant Network Routing Protocols for Optimizing L-Copies in Spray and Wait Routing for Minimum Delay

Comparing Delay Tolerant Network Routing Protocols for Optimizing L-Copies in Spray and Wait Routing for Minimum Delay Conference on Advances in Communication and Control Systems 2013 (CAC2S 2013) Comparing Delay Tolerant Network Routing Protocols for Optimizing L-Copies in Spray and Wait Routing for Minimum Delay Anjula

More information

CSE 123: Computer Networks

CSE 123: Computer Networks CSE 123: Computer Networks Homework 3 Out: 11/19 Due: 11/26 Instructions 1. Turn in a physical copy at the beginning of the class on 11/26 2. Ensure the HW cover page has the following information clearly

More information

Spray and forward: Efficient routing based on the Markov location prediction model for DTNs

Spray 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 information

TCP/IP protocol suite

TCP/IP protocol suite TCP/IP protocol suite The TCP/IP protocol suite was developed prior to the OSI model. Therefore, the layers in the TCP/IP protocol suite do not match exactly with those in the OSI model. The original TCP/IP

More information

Delay Tolerant Networking. Thomas Plagemann Distributed Multimedia Systems Group Department of Informatics University of Oslo.

Delay Tolerant Networking. Thomas Plagemann Distributed Multimedia Systems Group Department of Informatics University of Oslo. Delay Tolerant Networking Thomas Plagemann Distributed Multimedia Systems Group Department of Informatics University of Oslo Outline Background, motivation, overview Epidemic routing Message ferrying Mobility/density

More information

Issues of Long-Hop and Short-Hop Routing in Mobile Ad Hoc Networks: A Comprehensive Study

Issues of Long-Hop and Short-Hop Routing in Mobile Ad Hoc Networks: A Comprehensive Study Issues of Long-Hop and Short-Hop Routing in Mobile Ad Hoc Networks: A Comprehensive Study M. Tarique, A. Hossain, R. Islam and C. Akram Hossain Dept. of Electrical and Electronic Engineering, American

More information

Allows IGRP or Enhanced IGRP exterior routes to be advertised in updates.

Allows IGRP or Enhanced IGRP exterior routes to be advertised in updates. IGRP Commands Use the commands in this chapter to configure and monitor Internet Gateway Routing Protocol (IGRP). For IGRP configuration information and examples, refer to the Configuring IGRP chapter

More information

A Joint Replication-Migration-based Routing in Delay Tolerant Networks

A 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 information

Some Ad Hoc Network Characteristics Effects on the Performance of On-Demand Routing Protocols

Some Ad Hoc Network Characteristics Effects on the Performance of On-Demand Routing Protocols Inf. Sci. Lett. 2, No. 2, 69-75 (2013) 69 Information Sciences Letters An International Journal http://dx.doi.org/10.12785/isl/020204 Some Ad Hoc Network Characteristics Effects on the Performance On-Demand

More information

What is the difference between unicast and multicast? (P# 114)

What is the difference between unicast and multicast? (P# 114) 1 FINAL TERM FALL2011 (eagle_eye) CS610 current final term subjective all solved data by eagle_eye MY paper of CS610 COPUTER NETWORKS There were 30 MCQs Question no. 31 (Marks2) Find the class in 00000001.001011.1001.111

More information

Peculiarities of Delay Tolerant Networks

Peculiarities of Delay Tolerant Networks On the Effects of Cooperation in DTNs Antonis Panagakis, Athanasios Vaios, Ioannis Stavrakakis E-mail: {apan{ apan, avaios, ioannis}@di.uoa.gr Reference: http://cgi.di.uoa.gr cgi.di.uoa.gr/~ioannis/publications/2007comsware.pvs.pdf

More information

CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS

CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS 28 CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS Introduction Measurement-based scheme, that constantly monitors the network, will incorporate the current network state in the

More information

Mobile-Gateway Routing for Vehicular Networks 1

Mobile-Gateway Routing for Vehicular Networks 1 Mobile-Gateway Routing for Vehicular Networks 1 Hsin-Ya Pan, Rong-Hong Jan 2, Andy An-Kai Jeng, and Chien Chen Department of Computer Science National Chiao Tung University Hsinchu, 30010, Taiwan {hypan,

More information

Routing in Delay Tolerant Networks (2)

Routing in Delay Tolerant Networks (2) Routing in Delay Tolerant Networks (2) Primary Reference: E. P. C. Jones, L. Li and P. A. S. Ward, Practical Routing in Delay-Tolerant Networks, SIGCOMM 05, Workshop on DTN, August 22-26, 2005, Philadelphia,

More information

OSI Network Layer. Network Fundamentals Chapter 5. Version Cisco Systems, Inc. All rights reserved. Cisco Public 1

OSI Network Layer. Network Fundamentals Chapter 5. Version Cisco Systems, Inc. All rights reserved. Cisco Public 1 OSI Network Layer Network Fundamentals Chapter 5 Version 4.0 1 Objectives Identify the role of the Network Layer, as it describes communication from one end device to another end device. Examine the most

More information

Glasgow eprints Service

Glasgow eprints Service Yassein, M. B. and Ould-Khaoua, M. and Papanastasiou, S. (25) On the performance of probabilistic flooding in mobile ad hoc networks. In, th International Conference on Parallel and Distributed Systems,

More information

Routing in a Delay Tolerant Network

Routing in a Delay Tolerant Network Routing in a Delay Tolerant Network Vladislav Marinov Jacobs University Bremen March 31st, 2008 Vladislav Marinov Routing in a Delay Tolerant Network 1 Internet for a Remote Village Dial-up connection

More information

William Stallings Data and Computer Communications 7 th Edition. Chapter 10 Circuit Switching and Packet Switching

William Stallings Data and Computer Communications 7 th Edition. Chapter 10 Circuit Switching and Packet Switching William Stallings Data and Computer Communications 7 th Edition Chapter 10 Circuit Switching and Packet Switching Switching Networks Long distance transmission is typically done over a network of switched

More information

Narra, et al. Performance Analysis of AeroRP with Ground Station Advertisements. Hemanth Narra, Egemen K. Çetinkaya, and James P.G.

Narra, et al. Performance Analysis of AeroRP with Ground Station Advertisements. Hemanth Narra, Egemen K. Çetinkaya, and James P.G. Performance Analysis of AeroRP with Ground Station Advertisements Hemanth Narra, Egemen K. Çetinkaya, and James P.G. Sterbenz Department of Electrical Engineering & Computer Science Information Technology

More information

Review of Communication Protocols for Smart Grid AMI Systems. Coalton Bennett

Review of Communication Protocols for Smart Grid AMI Systems. Coalton Bennett Review of Communication Protocols for Smart Grid AMI Systems Coalton Bennett 1 Outline I. Introduction II. Motivation III. C12.22 & C12.19 Overview IV. Potential Routing Protocols V. Use Case(s) VI. Conclusion

More information

Presenting a multicast routing protocol for enhanced efficiency in mobile ad-hoc networks

Presenting a multicast routing protocol for enhanced efficiency in mobile ad-hoc networks Presenting a multicast routing protocol for enhanced efficiency in mobile ad-hoc networks Mehdi Jalili, Islamic Azad University, Shabestar Branch, Shabestar, Iran mehdijalili2000@gmail.com Mohammad Ali

More information

Performance Analysis of CSI:T Routing in a Delay Tolerant Networks

Performance 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 information

ChitChat: An Effective Message Delivery Method in Sparse Pocket-Switched Networks

ChitChat: An Effective Message Delivery Method in Sparse Pocket-Switched Networks ChitChat: An Effective Message Delivery Method in Sparse Pocket-Switched Networks Douglas McGeehan Dan Lin Sanjay Madria Department of Computer Science Missouri University of Science and Technology Rolla,

More information

Wide area networks: packet switching and congestion

Wide area networks: packet switching and congestion Wide area networks: packet switching and congestion Packet switching ATM and Frame Relay Congestion Circuit and Packet Switching Circuit switching designed for voice Resources dedicated to a particular

More information

Density-Aware Routing in Highly Dynamic DTNs: The RollerNet Case

Density-Aware Routing in Highly Dynamic DTNs: The RollerNet Case Density-Aware Routing in Highly Dynamic DTNs: The RollerNet Case Pierre-Ugo Tournoux, Student Member, IEEE, Je re mie Leguay, Farid Benbadis, John Whitbeck, Student Member, IEEE, Vania Conan, and Marcelo

More information

CHAPTER 3 CONTEXT-AWARE ADAPTIVE ROUTING PROTOCOL

CHAPTER 3 CONTEXT-AWARE ADAPTIVE ROUTING PROTOCOL 48 CHAPTER 3 CONTEXT-AWARE ADAPTIVE ROUTING PROTOCOL 3.1 INTRODUCTION Broadcasting is a common operation in the MANET for route establishment and sending control and emergency messages. A reliable broadcasting

More information

Content. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5.

Content. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5. Rahem Abri Content 1. Introduction 2. The Ad-hoc On-Demand Distance Vector Algorithm Path Discovery Reverse Path Setup Forward Path Setup Route Table Management Path Management Local Connectivity Management

More information

Combined Mobile Ad-hoc and Delay/Disruption-tolerant Routing

Combined Mobile Ad-hoc and Delay/Disruption-tolerant Routing This is an authors' version of the manuscript. Final version published in Proc. 13th International Conference on Ad-Hoc Networks and Wireless (ADHOC-NOW '14). Springer LNCS 8487, pp. 1-14, 2014. The final

More information

Available online at ScienceDirect. Procedia Computer Science 85 (2016 )

Available online at   ScienceDirect. Procedia Computer Science 85 (2016 ) Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 85 (2016 ) 891 898 International Conference on Computational Modeling and Security (CMS 2016) Analysis of routing and forwarding

More information

WPAN/WBANs: ZigBee. Dmitri A. Moltchanov kurssit/elt-53306/

WPAN/WBANs: ZigBee. Dmitri A. Moltchanov    kurssit/elt-53306/ WPAN/WBANs: ZigBee Dmitri A. Moltchanov E-mail: dmitri.moltchanov@tut.fi http://www.cs.tut.fi/ kurssit/elt-53306/ IEEE 802.15 WG breakdown; ZigBee Comparison with other technologies; PHY and MAC; Network

More information

Performance Evaluation of ASMR with QRS and RZLSR Routing Scheme in Mobile Ad-hoc and Sensor Networks

Performance Evaluation of ASMR with QRS and RZLSR Routing Scheme in Mobile Ad-hoc and Sensor Networks , pp. 43-50 http://dx.doi.org/10.14257/ijfgcn.2014.7.6.05 Performance Evaluation of ASMR with QRS and RZLSR Routing Scheme in Mobile Ad-hoc and Sensor Networks Anna Saro Vijendran 1 and J. Viji Gripsy

More information

Ad Hoc Routing. Ad-hoc Routing. Problems Using DV or LS. DSR Concepts. DSR Components. Proposed Protocols

Ad Hoc Routing. Ad-hoc Routing. Problems Using DV or LS. DSR Concepts. DSR Components. Proposed Protocols d oc Routing d-hoc Routing rvind Krishnamurthy all 2003 Create multi-hop connectivity among set of wireless, possibly moving, nodes Mobile, wireless hosts act as forwarding nodes as well as end systems

More information

An Ant-Based Routing Algorithm to Achieve the Lifetime Bound for Target Tracking Sensor Networks

An Ant-Based Routing Algorithm to Achieve the Lifetime Bound for Target Tracking Sensor Networks An Ant-Based Routing Algorithm to Achieve the Lifetime Bound for Target Tracking Sensor Networks Peng Zeng Cuanzhi Zang Haibin Yu Shenyang Institute of Automation Chinese Academy of Sciences Target Tracking

More information

AN ADAPTIVE GATEWAY DISCOVERY IN HYBRID MANETS

AN ADAPTIVE GATEWAY DISCOVERY IN HYBRID MANETS AN ADAPTIVE GATEWAY DISCOVERY IN HYBRID MANETS F. D. Trujillo, A. Triviño, E. Casilari and A. Díaz-Estrella Department of Electronic Technology University of Malaga A. J. Yuste Department of Telecommunication

More information

Broadcasting Techniques for Mobile Ad Hoc Networks

Broadcasting Techniques for Mobile Ad Hoc Networks Broadcasting Techniques for Mobile Ad Hoc Networks Broadcasting: It is the process in which one node sends a packet to all other nodes in the network. 1 Usefulness of broadcasting Broadcasting of net-wide

More information

Performance Evaluations of Data-Centric Information Retrieval Schemes for DTNs

Performance Evaluations of Data-Centric Information Retrieval Schemes for DTNs Computer Networks Vol x, Issue y 1 Performance Evaluations of Data-Centric Information Retrieval Schemes for DTNs P. Yang, Member, IEEE M. Chuah 1, Senior Member, IEEE Abstract Mobile nodes in some challenging

More information

COMPARATIVE ANALYSIS OF DIFFERENT ROUTING PROTOCOLS IN DELAY TOLERANT NETWORKS

COMPARATIVE ANALYSIS OF DIFFERENT ROUTING PROTOCOLS IN DELAY TOLERANT NETWORKS COMPARATIVE ANALYSIS OF DIFFERENT ROUTING PROTOCOLS IN DELAY TOLERANT NETWORKS Chintan B. Desai PG Student, Electronics and Communication Department, Charotar University of Science & Technology, Changa,

More information

Teletraffic theory (for beginners)

Teletraffic theory (for beginners) Teletraffic theory (for beginners) samuli.aalto@hut.fi teletraf.ppt S-38.8 - The Principles of Telecommunications Technology - Fall 000 Contents Purpose of Teletraffic Theory Network level: switching principles

More information

Intra and Inter Cluster Synchronization Scheme for Cluster Based Sensor Network

Intra and Inter Cluster Synchronization Scheme for Cluster Based Sensor Network Intra and Inter Cluster Synchronization Scheme for Cluster Based Sensor Network V. Shunmuga Sundari 1, N. Mymoon Zuviria 2 1 Student, 2 Asisstant Professor, Computer Science and Engineering, National College

More information

Performance Evaluation of Routing Protocols in Wireless Mesh Networks. Motlhame Edwin Sejake, Zenzo Polite Ncube and Naison Gasela

Performance Evaluation of Routing Protocols in Wireless Mesh Networks. Motlhame Edwin Sejake, Zenzo Polite Ncube and Naison Gasela Performance Evaluation of Routing Protocols in Wireless Mesh Networks Motlhame Edwin Sejake, Zenzo Polite Ncube and Naison Gasela Department of Computer Science, North West University, Mafikeng Campus,

More information

ECE 4450:427/527 - Computer Networks Spring 2017

ECE 4450:427/527 - Computer Networks Spring 2017 ECE 4450:427/527 - Computer Networks Spring 2017 Dr. Nghi Tran Department of Electrical & Computer Engineering Lecture 6.1: Internetworking Dr. Nghi Tran (ECE-University of Akron) ECE 4450:427/527 Computer

More information

On-Demand Routing in Wireless Ad-Hoc Networks with Wide Levels of Network Density

On-Demand Routing in Wireless Ad-Hoc Networks with Wide Levels of Network Density On-Demand Routing in Wireless Ad-Hoc Networks with Wide Levels of Network Density Presented by Wei-Cheng Xiao Advisor: David B. Johnson 2015/03/30 Wireless Network Infrastructure Mode Internet access point

More information

WP-PD Wirepas Mesh Overview

WP-PD Wirepas Mesh Overview WP-PD-123 - Wirepas Mesh Overview Product Description Version: v1.0a Wirepas Mesh is a de-centralized radio communications protocol for devices. The Wirepas Mesh protocol software can be used in any device,

More information

Point-to-Point Network Switching. Computer Networks Term B10

Point-to-Point Network Switching. Computer Networks Term B10 Point-to-Point Network Switching Computer Networks Term B10 Network Switching Outline Circuit Switching, Message Switching, Packet Switching, Cell Switching Connection-Oriented versus Connectionless Protocols

More information

Presenter: Wei Chang4

Presenter: Wei Chang4 Quan Yuan1, Ionut Cardei2, Jing Chen3, and Jie Wu4 Presenter: Wei Chang4 University of Texas-Permian Basin1, Florida Atlantic University2 Wuhan University3,Temple University4 } Background } Motivation

More information

Energy aware geographic routing in wireless sensor networks with anchor nodes. Mircea Cretu Stancu Utrecht University Computing Science May 2013

Energy aware geographic routing in wireless sensor networks with anchor nodes. Mircea Cretu Stancu Utrecht University Computing Science May 2013 Energy aware geographic routing in wireless sensor networks with anchor nodes Mircea Cretu Stancu Utrecht University Computing Science May 2013 Overview Introduction Current paradigm EAGR preliminaries

More information

A Location-based Predictive Route Caching Scheme for Pure Reactive Zone-based Routing Protocol in Mobile Ad Hoc Networks Abstract Introduction

A Location-based Predictive Route Caching Scheme for Pure Reactive Zone-based Routing Protocol in Mobile Ad Hoc Networks Abstract Introduction A Location-based Predictive Route Caching Scheme for Pure Reactive Zone-based Routing Protocol in Mobile Ad Hoc Networks Weibo Chen 1, Kun Yang 1 and Xueqi Cheng 2 1. University of Essex, School of Computer

More information

EXAM TCP/IP NETWORKING Duration: 3 hours With Solutions

EXAM TCP/IP NETWORKING Duration: 3 hours With Solutions SCIPER: First name: Family name: EXAM TCP/IP NETWORKING Duration: 3 hours With Solutions Jean-Yves Le Boudec January 2016 INSTRUCTIONS 1. Write your solution into this document and return it to us (you

More information

Performance Analysis of MANET Using Efficient Power Aware Routing Protocol (EPAR)

Performance Analysis of MANET Using Efficient Power Aware Routing Protocol (EPAR) Performance Analysis of MANET Using Efficient Power Aware Routing Protocol (EPAR) Amandeep Kaur 1, Jasmeet Kaur 2, Nishu Kansal 3 1, 2, 3 (ECE, Guru Nanak Dev Engineering College Ludhiana, India) ABSTRACT:

More information

Delay Tolerant Networking. Thomas Plagemann Distributed Multimedia Systems Group Department of Informatics University of Oslo.

Delay Tolerant Networking. Thomas Plagemann Distributed Multimedia Systems Group Department of Informatics University of Oslo. Delay Tolerant Networking Thomas Plagemann Distributed Multimedia Systems Group Department of Informatics University of Oslo Outline Background, motivation, overview Epidemic routing Message ferrying Mobility/density

More information

Capacity-Aware Routing Using Throw-Boxes

Capacity-Aware Routing Using Throw-Boxes Capacity-Aware Routing Using Throw-Boxes Bo Gu, Xiaoyan Hong Department of Computer Science University of Alabama, Tuscaloosa, AL 35487 {bgu,hxy}@cs.ua.edu Abstract Deploying the static wireless devices

More information

LTE and IEEE802.p for vehicular networking: a performance evaluation

LTE and IEEE802.p for vehicular networking: a performance evaluation LTE and IEEE802.p for vehicular networking: a performance evaluation Zeeshan Hameed Mir* Fethi Filali EURASIP Journal on Wireless Communications and Networking 1 Presenter Renato Iida v2 Outline Introduction

More information

Sharing Location Dependent Experiences in MANET

Sharing Location Dependent Experiences in MANET Sharing Location Dependent Experiences in MANET Kihwan Kim Ying Cai Wallapak Tavanapong Department of Computer Science Iowa State University Ames, IA 511-14, USA Email: {khkim,yingcai,tavanapo}@cs.iastate.edu

More information

Performance Enhancement of AOMDV with Energy Efficient Routing Based On Random Way Point Mobility Model

Performance Enhancement of AOMDV with Energy Efficient Routing Based On Random Way Point Mobility Model Performance Enhancement of AOMDV with Energy Efficient Routing Based On Random Way Point Mobility Model Geetha.S, Dr.G.Geetharamani Asst.Prof, Department of MCA, BIT Campus Tiruchirappalli, Anna University,

More information

A 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 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 information

An Efficient Scheme for Detecting Malicious Nodes in Mobile ad Hoc Networks

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

More information

Lab 6.7.1: Ping and Traceroute

Lab 6.7.1: Ping and Traceroute Topology Diagram Addressing Table Device Interface IP Address Subnet Mask Default Gateway R1-ISP R2-Central Eagle Server S0/0/0 10.10.10.6 255.255.255.252 N/A Fa0/0 192.168.254.253 255.255.255.0 N/A S0/0/0

More information

Architecture and Evaluation of an Unplanned b Mesh Network

Architecture and Evaluation of an Unplanned b Mesh Network Architecture and Evaluation of an Unplanned 802.11b Mesh Network John Bicket, Daniel Aguayo, Sanjit Biswas, and Robert Morris MIT CSAIL (MobiCom 05) slides by Jong-Kwon Lee, presented by Fallon Chen May

More information

Peer-to-Peer Systems Exercise Winter Term 2014/2015

Peer-to-Peer Systems Exercise Winter Term 2014/2015 Peer-to-Peer Systems Exercise Published: 3..4 Presentation date: 3..4 Peer-to-Peer Systems Exercise Winter Term 4/5 General Remarks Welcome to the exercise for the lecture Peer-to-Peer Systems. Please

More information

Timely Information Dissemination with Distributed Storage in Delay Tolerant Mobile Sensor Networks

Timely Information Dissemination with Distributed Storage in Delay Tolerant Mobile Sensor Networks 27 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS): 27 IEEE Infocom MiseNet Workshop Timely Information Dissemination with Distributed Storage in Delay Tolerant Mobile Sensor Networks

More information

Protection Schemes for 4G Multihop wireless Networks

Protection Schemes for 4G Multihop wireless Networks Protection Schemes for 4G Multihop wireless Networks Sridevi, Assistant Professor, Department of Computer Science, Karnatak University, Dharwad Abstract:-This paper describes the relay node protection

More information

Integrated Buffer and Route Management in a DTN with Message Ferry

Integrated Buffer and Route Management in a DTN with Message Ferry Integrated Buffer and Route Management in a DTN with Message Ferry Mooi Choo Chuah Wen-Bin Ma chuah@cse.lehigh.edu wem2@.lehigh.edu Department of Computer Science and Engineering 19 Memorial Drive West,

More information

Buffer Aware Network Coded Routing Protocol for Delay Tolerant Networks

Buffer Aware Network Coded Routing Protocol for Delay Tolerant Networks Middle-East Journal of Scientific Research 23 (Sensing, Signal Processing and Security): 291-296, 2015 ISSN 1990-9233 IDOSI Publications, 2015 DOI: 10.5829/idosi.mejsr.2015.23.ssps.111 Buffer Aware Network

More information

CHAPTER 5 MULTICAST GEOGRAPHY BASED ROUTING IN AD HOC NETWORKS

CHAPTER 5 MULTICAST GEOGRAPHY BASED ROUTING IN AD HOC NETWORKS 89 CHAPTER 5 MULTICAST GEOGRAPHY BASED ROUTING IN AD HOC NETWORKS 5.1 INTRODUCTION Efficient routing in MANET is a tough task due to their highly dynamic network topology, bandwidth controlled links and

More information

Buffer Management in Delay Tolerant Networks

Buffer Management in Delay Tolerant Networks Buffer Management in Delay Tolerant Networks Rachana R. Mhatre 1 And Prof. Manjusha Deshmukh 2 1,2 Information Technology, PIIT, New Panvel, University of Mumbai Abstract Delay tolerant networks (DTN)

More information

Chapter 10. Circuits Switching and Packet Switching 10-1

Chapter 10. Circuits Switching and Packet Switching 10-1 Chapter 10 Circuits Switching and Packet Switching 10-1 Content Switched communication networks Circuit switching networks Circuit-switching concepts Packet-switching principles X.25 (mentioned but not

More information

A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols

A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols By Josh Broch, David A. Maltz, David B. Johnson, Yih- Chun Hu, Jorjeta Jetcheva Presentation by: Michael Molignano Jacob

More information

Anil Saini Ph.D. Research Scholar Department of Comp. Sci. & Applns, India. Keywords AODV, CBR, DSDV, DSR, MANETs, PDF, Pause Time, Speed, Throughput.

Anil Saini Ph.D. Research Scholar Department of Comp. Sci. & Applns, India. Keywords AODV, CBR, DSDV, DSR, MANETs, PDF, Pause Time, Speed, Throughput. Volume 6, Issue 7, July 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Performance Analysis

More information

Chapter 6: Network Layer. Introduction to Networks v5.1

Chapter 6: Network Layer. Introduction to Networks v5.1 Chapter 6: Network Layer Introduction to Networks v5.1 6.0 Introduction 6.1 Network Layer Protocols 6.2 Routing 6.3 Routers 6.4 Configure a Cisco Router 6.5 Summary 2013 Cisco and/or its affiliates. All

More information

Duke University CompSci 356 Midterm Spring 2016

Duke University CompSci 356 Midterm Spring 2016 Duke University CompSci 356 Midterm Spring 2016 Name (Print):, (Family name) (Given name) Student ID Number: Date of Exam: Feb 25, 2016 Time Period: 11:45am-1pm Number of Exam Pages: 15 (including this

More information

6. Node Disjoint Split Multipath Protocol for Unified. Multicasting through Announcements (NDSM-PUMA)

6. Node Disjoint Split Multipath Protocol for Unified. Multicasting through Announcements (NDSM-PUMA) 103 6. Node Disjoint Split Multipath Protocol for Unified Multicasting through Announcements (NDSM-PUMA) 6.1 Introduction It has been demonstrated in chapter 3 that the performance evaluation of the PUMA

More information

Chapter 6: Network Layer

Chapter 6: Network Layer Chapter 6: Network Layer Introduction to Networks v5.1 6.0 Introduction 6.1 Network Layer Protocols 6.2 Routing 6.3 Routers 6.4 Configure a Cisco Router 6.5 Summary 2 Upon completion of this section, you

More information

Improvement of Buffer Scheme for Delay Tolerant Networks

Improvement of Buffer Scheme for Delay Tolerant Networks Improvement of Buffer Scheme for Delay Tolerant Networks Jian Shen 1,2, Jin Wang 1,2, Li Ma 1,2, Ilyong Chung 3 1 Jiangsu Engineering Center of Network Monitoring, Nanjing University of Information Science

More information

LECTURE 9. Ad hoc Networks and Routing

LECTURE 9. Ad hoc Networks and Routing 1 LECTURE 9 Ad hoc Networks and Routing Ad hoc Networks 2 Ad Hoc Networks consist of peer to peer communicating nodes (possibly mobile) no infrastructure. Topology of the network changes dynamically links

More information

Why EIGRP Is Considered As the Best Routing Protocol

Why EIGRP Is Considered As the Best Routing Protocol Why EIGRP Is Considered As the Best Routing Protocol Anurag Misra Training Specialist Higher Institute of Plastic Fabrication Riyadh, Saudi Arabia anuraag2u4u@gmail.com ABSTRACT This paper concentrates

More information

PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS FOR DELAY TOLERANT NETWORKS

PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS FOR DELAY TOLERANT NETWORKS PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS FOR DELAY TOLERANT NETWORKS Sanjay Kumar, K. Suraj and Sudhakar Pandey Department of Information Technology, National Institute of Technology Raipur, India E-Mail:

More information

Lecture 9. Reminder: Homework 3, Programming Project 2 due today. Questions? Thursday, September 22 CS 475 Networks - Lecture 9 1

Lecture 9. Reminder: Homework 3, Programming Project 2 due today. Questions? Thursday, September 22 CS 475 Networks - Lecture 9 1 Lecture 9 Reminder: Homework 3, Programming Project 2 due today. Questions? Thursday, September 22 CS 475 Networks - Lecture 9 1 Outline Chapter 3 - Internetworking 3.1 Switching and Bridging 3.2 Basic

More information