Emulatore di Protocolli di Routing per reti Ad-hoc Alessandra Giovanardi DI – Università di Ferrara Pattern Project Area 3: Problematiche di instradamento.

Slides:



Advertisements
Similar presentations
Network II.5 simulator ..
Advertisements

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,
IP Forwarding Relates to Lab 3.
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
CLUSTERING IN WIRELESS SENSOR NETWORKS B Y K ALYAN S ASIDHAR.
Network Coding Testbed Using Software-Defined Radio Abstract In current generation networks, network nodes operate by replicating and forwarding the packets.
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
By Libo Song and David F. Kotz Computer Science,Dartmouth College.
KUASAR An efficient and light-weight protocol for routing and data dissemination in ad hoc wireless sensor networks David Andrews Aditya Mandapaka Joe.
Performance Comparison of Routing Protocols for Ad Hoc Networks PATTERN ENDIF Ferrara.
Chapter 15 – Part 2 Networks The Internal Operating System The Architecture of Computer Hardware and Systems Software: An Information Technology Approach.
OSI Model.
Chapter 10 Introduction to Wide Area Networks Data Communications and Computer Networks: A Business User’s Approach.
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
1 CCNA 2 v3.1 Module 8. 2 TCP/IP Suite Error and Control Messages CCNA 2 Module 8.
ECS 152A 1. Introduction. A Communications Model Source —generates data to be transmitted Transmitter —Converts data into transmittable signals Transmission.
IEEE Wireless Communication Magazine Design and Performance of an Enhanced IEEE MAC Protocol for Multihop Coverage Extension Frank H.P. Fitzek, Diego.
1 IP Forwarding Relates to Lab 3. Covers the principles of end-to-end datagram delivery in IP networks.
QualNet 2014/05/ 尉遲仲涵. Outline Directory Structure QualNet Basic Message & Event QualNet simulation architecture Protocol Model Programming.
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
COGNITIVE RADIO FOR NEXT-GENERATION WIRELESS NETWORKS: AN APPROACH TO OPPORTUNISTIC CHANNEL SELECTION IN IEEE BASED WIRELESS MESH Dusit Niyato,
Wave Relay System and General Project Details. Wave Relay System Provides seamless multi-hop connectivity Operates at layer 2 of networking stack Seamless.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
Page 19/13/2015 Chapter 8 Some conditions that must be met for host to host communication over an internetwork: a default gateway must be properly configured.
VIRTUAL ROUTER Kien A. Hua Data Systems Lab School of EECS University of Central Florida.
1 IP Forwarding Relates to Lab 3. Covers the principles of end-to-end datagram delivery in IP networks.
Routing Protocol Evaluation David Holmer
1 BitHoc: BitTorrent for wireless ad hoc networks Jointly with: Chadi Barakat Jayeoung Choi Anwar Al Hamra Thierry Turletti EPI PLANETE 28/02/2008 MAESTRO/PLANETE.
© 2002, Cisco Systems, Inc. All rights reserved..
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
Energy-Efficient Protocol for Cooperative Networks IEEE/ACM Transactions on Networking, Apr Mohamed Elhawary, Zygmunt J. Haas Yong Zhou
Data and Computer Communications Chapter 10 – Circuit Switching and Packet Switching (Wide Area Networks)
TELE202 Lecture 5 Packet switching in WAN 1 Lecturer Dr Z. Huang Overview ¥Last Lectures »C programming »Source: ¥This Lecture »Packet switching in Wide.
 Circuit Switching  Packet Switching  Message Switching WCB/McGraw-Hill  The McGraw-Hill Companies, Inc., 1998.
Data and Computer Communications Circuit Switching and Packet Switching.
Tufts University. EE194-WIR Wireless Sensor Networks. March 3, 2005 Increased QoS through a Degraded Channel using a Cross-Layered HARQ Protocol Elliot.
25-Oct-15Network Layer Connecting Devices Networks do not normally operate in isolation.They are connected to one another using connecting devices. The.
Dynamic Source Routing (DSR) Sandeep Gupta M.Tech - WCC.
Chapter 15 – Part 2 Networks The Internal Operating System The Architecture of Computer Hardware and Systems Software: An Information Technology Approach.
Power Control in Wireless Ad Hoc Networks Background An ad hoc network is a group of self configuring wireless nodes that lack infrastructure. Motivation—Power.
William Stallings Data and Computer Communications
Interconnect simulation. Different levels for Evaluating an architecture Numerical models – Mathematic formulations to obtain performance characteristics.
A Scalable Routing Protocol for Ad Hoc Networks Eric Arnaud Id:
Routing Security in Wireless Ad Hoc Networks Chris Zingraf, Charisse Scott, Eileen Hindmon.
A Wakeup Scheme for Sensor Networks: Achieving Balance between Energy Saving and End-to-end Delay Xue Yang, Nitin H.Vaidya Department of Electrical and.
Support for Multimedia Traffic in Mobile, Distributed, Multiple-Hop Wireless Networks Steven Boyd S.U.R.E. Program 2003.
Active Message Application: CONNECT Presented by Xiaozhou David Zhu Oommen Regi July 6, 2001.
THE NETWORKS Theo Chakkapark. Open System Interconnection  The tower of power!  The source of this power comes from the model’s flexibility.
© N. Ganesan, Ph.D., All rights reserved. Chapter Formatting of Data for Transmission.
Energy-Efficient Protocol for Cooperative Networks.
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
Efficient Geographic Routing in Multihop Wireless Networks Seungjoon Lee*, Bobby Bhattacharjee*, and Suman Banerjee** *Department of Computer Science University.
Computer Network Lab. 1 3 장 OSI 기본 참조 모델 n OSI : Open System Interconnection n Basic Reference Model : ISO-7498 n Purpose of OSI Model ~ is to open communication.
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, 鄭宇辰
AN EFFICIENT TDMA SCHEME WITH DYNAMIC SLOT ASSIGNMENT IN CLUSTERED WIRELESS SENSOR NETWORKS Shafiq U. Hashmi, Jahangir H. Sarker, Hussein T. Mouftah and.
DETECTION OF WORMHOLE ATTACK IN MANET
CCNA 2 Router and Routing Basics Module 8 TCP/IP Suite Error and Control Messages.
Speaker: Ju-Mei Li Virtual Paths Routing: A Highly Dynamic Routing Protocol for Ad Hoc Wireless Networks Abdulrahman H. Altalhi and Golden G. Richard Computer.
GeoTORA: A Protocol for Geocasting in Mobile Ad Hoc Networks
The OSI Model Prof. Choong Seon HONG.
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Chapter 3: Open Systems Interconnection (OSI) Model
Pong: Diagnosing Spatio-Temporal Internet Congestion Properties
Network Coding Testbed
Chapter 15 – Part 2 Networks The Internal Operating System
Network Models CCNA Instructor Training Course October 12-17, 2009
Protocols & Packet Switching
Presentation transcript:

Emulatore di Protocolli di Routing per reti Ad-hoc Alessandra Giovanardi DI – Università di Ferrara Pattern Project Area 3: Problematiche di instradamento

Scenario Campus: student informations, group studies, game activities

Research activities Phase 1: Studies, theoretical and simulative (SAM), to investigate energy efficient routing protocols Phase 2: Emulation approach to investigate routing protocols for ad hoc networks and to give preliminary results on energy efficiency  interface with SAM

Test Environments Emulates any degree of "real-world badness" in a small, lab - environment network Involves hardware or firmware components of the systems Provides a means for simulations to interact with a live environment Emulation Simulation Cheap and quick to assemble, can do large-scale tests, tests are controlled and reproducible May only be possible very late in development cycle Live tests Can be very slow, its implementation may differ considerably from real one Can give a controlled, reproducible environment for running live code It is often difficult or too expensive to create a real test environment of any significant size Real environment tests also tend not to be reproducible

Emulator Structure Developed in the user space. Can check the performance of any kind of routing protocol, in a wireless environment. Created an interface to the SAM simulator, where many kinds of ad hoc routing protocols are implemented. Based on the libpcap library and on the use of RAW sockets. Integrated with a statistic module (performance indexes). Two logical modules: send packet generation and transmission analyzer packet dump and forwarding (router) Developed and tested on a cluster of Linux hosts with same filesystem Hosts connected by an Ethernet network, but the framework is general (IEEE )

Emulator Structure con’td

Network Organization N hosts identified by logical number n Packet generation can be activated in all hosts in the network or in a subset of them (Na < N) All N hosts have router functions Na ns nd N

Analyzer Module cont’d Packet dump Type 0x0020 ? no ns, nd, TTL, Timestamp and nlast-hop evaluation Channel test ok ? Packet drop  statistics no yes Packet forwarding ? no yes TTL=TTL-1 TTL=0 ? Error message + packet drop yes no Packet reaching final target  statistics Next hop evaluation (Routing block) + packet transmission  statistics

Send Module Selection of Na transmitting hosts Generation of the frame: -arrival time (Poisson distribution or deterministic) -destination nd (uniform distribution) -timestamp (collection of the generation time) -TTL -payload Evaluation of the next-hop (Routing block) Creation of the frame and insertion on the network (RAW sockets) Collection of statistics on packets effectively sent or dropped

Implementation problems Host synchronization (delivery time) Kernel and interface packet drop Transparent interface with SAM centralized structure (packet conversion, routing informations management, Temporization..)...

Synchronization To collect the delivery times, hosts must be synchronized NetworkTime Protocol (NTP) can gain in some cases an accuracy of 1ms, often it can cause a mismatch in the time synchronization up to 0.5s We decided to compute the delivery time at the host having generated the timestamp, i.e., at the source node ns Time accuracy growths with the number of nodes relaying the packet Time signalling packet (ns=0) nsnd

Statistics Each node can be involved in the collection of parameters needed to evaluate final performance Many output files are created, characterized by a prefix identifying the logical number n of the node Performance indexes: -average success probability Psucc (correctly delivered packet fraction) -delivery time Tacc (end-to-end time) -average number of hops in the path Hop -number of isolated nodes Output files collect information on: -packets sent or dropped at the source -packets sent or dropped at each relaying node -packets correctly received or not (channel errors) by the destination

Conclusions Proposal of a general emulation framework for routing protocols in wireless environment Work in progress: tests with a simple routing protocol (Dijkstra) without mobility Future works: -investigation and emulation of ad hoc network routing protocols (DSR,AODV) -attention to energy efficiency, network life time etc.