Students:Ori Horin Michael Reznik Supervisor:Prof. Michael Segal Advisor:Mr. Erez Meital.

Slides:



Advertisements
Similar presentations
Communication Networks Recitation 3 Bridges & Spanning trees.
Advertisements

Scheduling in Wireless Systems. 2 CDMA2000: Overall Architecture Mobile Station.
TDMA Scheduling in Wireless Sensor Networks
Design and Implementation of the OLSR Protocol in an Ad Hoc Framework Juan Gutiérrez Plaza Supervisor: Raimo Kantola Instructor: José Costa Requena Networking.
Arsitektur Jaringan Terkini
Mesh Networks A.k.a “ad-hoc”. Definition A local area network that employs either a full mesh topology or partial mesh topology Full mesh topology- each.
Performance Comparison of Routing Protocols for Ad Hoc Networks PATTERN ENDIF Ferrara.
1 Computer Networks Internetworking Devices. 2 Repeaters Hubs Bridges –Learning algorithms –Problem of closed loops Switches Routers.
NCKU CSIE CIAL1 Principles and Protocols for Power Control in Wireless Ad Hoc Networks Authors: Vikas Kawadia and P. R. Kumar Publisher: IEEE JOURNAL ON.
Institute of Technology, Sligo Dept of Computing Semester 3, version Semester 3 Chapter 3 VLANs.
Special Topics on Algorithmic Aspects of Wireless Networking Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central.
Capacity of Wireless Mesh Networks: Comparing Single- Radio, Dual-Radio, and Multi- Radio Networks By: Alan Applegate.
LECTURE 9 CT1303 LAN. LAN DEVICES Network: Nodes: Service units: PC Interface processing Modules: it doesn’t generate data, but just it process it and.
Routing in mobile ad-hoc networks (MANETs). 1. WHAT IS A MANET ? A MANET can be defined as a system of autonomous mobile nodes A MANET can be defined.
Data Comm. & Networks Instructor: Ibrahim Tariq Lecture 3.
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
Wireless MAC Protocols for Ad-Hoc Networks Derek J Corbett Supervisor: Prof. David Everitt.
Project Idea #1 Project: Simulation in NS Learn how to use NS-2 Examine 2-3 papers that do benchmark studies Implement a simulation of the Drexel TAARP.
June 21, 2007 Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks Anand Prabhu Subramanian, Himanshu Gupta.
Chapter 15 The Addressing Structure in NS. The Default Address Format 32 lower bits for port-id, 1 higher bit for mcast and the rest 32 higher bits for.
SRI International 1 A Simulation Comparison of TBRPF, OLSR, and AODV Richard Ogier SRI International July 2002.
Group Management in Mobile Ad Hoc Networks Revathi Ranganathan Preeti Venkateswaran.
ICS 156: Networking Lab Magda El Zarki Professor, ICS UC, Irvine.
Rehab AlFallaj.  Network:  Nodes: Service units: PC Interface processing Modules: it doesn’t generate data, but just it process it and do specific task.
Active Message Application: CONNECT Presented by Xiaozhou David Zhu Oommen Regi July 6, 2001.
PeerNet: Pushing Peer-to-Peer Down the Stack Jakob Eriksson, Michalis Faloutsos, Srikanth Krishnamurthy University of California, Riverside.
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
The OSI Model An overview of the media layer (Physical, Data Link, Network) By Luke Shiffner.
15.1 Chapter 15 Connecting LANs, Backbone Networks, and Virtual LANs Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or.
Clustering In Mobile Networks Presented By: Assaf Mizrachi Shimrit Artzi Tutor: Dr. Michael Segal.
Mobile Ad Hoc Networking By Shaena Price. What is it? Autonomous system of routers and hosts connected by wireless links Can work flawlessly in a standalone.
2. Data Link Layer: Medium Access Control. Scheduling.
Realistic Mobility Models for Vehicular Ad hoc Network (VANET) Simulations ITST 高弘毅 洪佳瑜 蔣克欽.
Dzmitry Kliazovich, Fabrizio Granelli, University of Trento, Italy
WIMAX AND LTE.
Instructor & Todd Lammle
A Brief Talk on Mesh Routing
Dzmitry Kliazovich, Fabrizio Granelli, University of Trento, Italy
Delay-Tolerant Networks (DTNs)
Lab 7 – CSMA/CD (Data Link Layer Layer)
Connecting Network Components
CT301 LECTURE 8.
Lecture 28 Mobile Ad hoc Network Dr. Ghalib A. Shah
Congestion Control, Quality of Service, and Internetworking
Lab 2 – Hub/Switch Data Link Layer
Multiple Access Problem: When two or more nodes transmit at the same time, their frames will collide and the link bandwidth is wasted during collision.
MobileMAN Workshop 2 Cambridge 2 –
Channel Allocation (MAC)
Internet Networking recitation #4
Lab 2 – Hub/Switch Data Link Layer
A comparison of Ad-Hoc Routing Protocols
CT1303 LAN Rehab AlFallaj.
User Interference Effect on Routing of Cognitive Radio Ad-Hoc Networks
SWITCHING Switched Network Circuit-Switched Network Datagram Networks
Computer Networks 9/17/2018 Computer Networks.
Wireless NETWORKS NET 434 Topic No 7 Bluetooth-IEEE802.15
CS 457 – Lecture 7 Wireless Networks
Ad hoc Routing Protocols
Chapter 16 Connecting LANs, Backbone Networks, and Virtual LANs
BLUETOOTH Personal Area Networking [ PAN ] over Bluetooth
PRESENTATION COMPUTER NETWORKS
Chapter 3 VLANs Chaffee County Academy
Chapter 3 Part 3 Switching and Bridging
Dhruv Gupta EEC 273 class project Prof. Chen-Nee Chuah
Chapter 15. Connecting Devices
Routing in Mobile Ad-hoc Networks
Subject Name: Adhoc Networks Subject Code: 10CS841
EEL 6935 Wireless Ad Hoc Networks
Computer network technology
Naval Research Laboratory Dynamic Backbone Subnets
Presentation transcript:

Students:Ori Horin Michael Reznik Supervisor:Prof. Michael Segal Advisor:Mr. Erez Meital

2 Roadmap Ad-hoc Mobile Network Our project Motivation Main issues Maxtech networks protocol Routing in Ad-hoc Networks

3 Ad-hoc Mobile Network  No need for network infrastructure – base stations are not needed  Network nodes forward packets to and from each other  Built spontaneously as devices connect  Nodes can also function as a relay station to the other mobile stations

4 Motivation  Connection to Base station is impossible  No cellular infrastructure in a particular area  Cellular network is overload  Interference preventing the communication between a mobile station and a base station  inside a concrete structure for example  Very useful for  Search and rescue forces  Military forces  Law enforcements

5  Network structure  Choosing which nodes will function as relays Should I function as Relay ? Ad-hoc Networks – Main issues

6  Routing - which route to choose? Ad-hoc Networks – Main issues

7  Scheduling  Network resources allocation  QOS for Voice Ad-hoc Networks – Main issues 1. ____2. ____3. ____. 1. ____2. ____3. ____. 1. ____2. ____3. ____. 1. ____2. ____3. ____. 1. ____2. ____3. ____.

8  Provides mobile network devices  Implements mobile mesh network technology  Provides group of users with unprecedented mobile connectivity without the need for infrastructure support Maxtech Networks` product

9 Protocol Stack ApplicationApplication Data Management Transport Layer Data Management Transport Layer NetworkRoutingNetworkRoutingNetworkManagementNetworkManagement Link Management Link Control MMIMMI AudioManagementAudioManagementGatewayManagementGatewayManagement Serial Accessories Serial Driver RF Baseband AudioDriversAudioDriversLCDDriversLCDDrivers KeysKeys Link Control NetworkRoutingNetworkRoutingNetworkManagementNetworkManagement Link Management Fundamentals  MAC - TDMA  Connectivity – Proactive  Adjacency Matrix  Reach connectivity consensus  Relays selection  Building network backbone  Choosing Master  Allocate Resources

10 Management and Traffic  Frame types 1) Information about network structure 2) Requests for network resources and responses of resources allocation 3) Payload (Voice/Data)  TDMA cycle divided for each frame type

11 Connectivity Matrix  Rows and columns represent units  “0” – no link, “1” – bidirectional link  How to build and update matrices ?  Sender’s row is always first  Units sends rows with version number  Send changed rows first

12 Relays Selection – Building Backbone  Best connected units are chosen for RELAYS  Relays are the backbone of the network  How to select Relays ?  Each unit runs M.T.S. (Minimal Tree Search) algorithm on its matrix  Running up to predefined maximum number of relays  Choosing minimum number of relays  Try to reach same matrix in all units

13 M.T.S. – Minimal Tree Search At the end of the process all the units “see” the same network structure Separated Components Some Connected Components Single Connected Component All the units “see” the same network structure No Yes

14 Master  Master functions as the session control unit  Units request for network resources (through network backbone) from the master to send data or voice  Master makes the resource allocation decisions and sends them back to the units  How to select master ?  Master is the most central unit of the backbone

15 Allocate Resources  Master allocate criterions  Voice is at higher priority than data  One channel for voice Maximum channels for data  Allocate data for each source using greedy technique Master Request of voice Request of data Master Resources: Number of channels = 50 Allocate 1 channel voice – unit 1 Allocate 1 channel data - unit 2 Allocate 1 channel data - unit 9 Allocate 1 channel data - unit 2 Allocate 1 channel data - unit 9 Allocated: 1 channel – unit 1 25 channels – unit 2 24 channels – unit 9 Send allocation to all units Allocated: 1 channel – unit 1 25 channels – unit 2 24 channels – unit 9 Send allocation to all units Request of data Repeat until no allocations left

16 Management and Traffic  Frame types 1) Information about network structure 2) Requests for network resources and responses of resources allocation 3) Payload (Voice/Data)  TDMA cycle divided for each frame type

17 Project Goal  Simulate an ad-hoc network which utilizes the unique ad-hoc routing protocol that has been developed by Maxtech Networks  NS2 network simulator is used  Examine the performance of the protocol  Compare it to other known protocols in different network topologies – i.e. AODV, DSR, OLSR  Analyze the results

18  Ns-2 is an open source network simulator that runs under linux  It has a layers structure  Modules are written in C++  Network structure and parameters written in TCL  We are implementing the MAC and Network layer of Maxtech Networks protocol Simulation Routing LL IFq MAC NetIF Radio Propagation Model entry_ target_ Src/Sink Channel Port Demux ll_ ll_(0) uptarget_ downtarget_ uptarget_ propagation_ uptarget_ channel_

19 Questions