Wireless Ad-Hoc Networks

Slides:



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

Costas Busch Louisiana State University CCW08. Becomes an issue when designing algorithms The output of the algorithms may affect the energy efficiency.
Mesh Networking Emily Bates | Joe Garrow Andreas Gillberg | Al Godin.
Multicasting in Mobile Ad hoc Networks By XIE Jiawei.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
802.11a/b/g Networks Herbert Rubens Some slides taken from UIUC Wireless Networking Group.
Chapter VI Data Communication: Delivering Information Anywhere and Anytime By: AP CHEN P. JOVER BSIT - III.
Fault Tolerant Routing in Tri-Sector Wireless Cellular Mesh Networks Yasir Drabu and Hassan Peyravi Kent State University Kent, OH
1/14 Ad Hoc Networking, Eli M. Gafni and Dimitri P. Bertsekas Distributed Algorithm for Generating Loop-free Routes in Networks With Frequently.
Multicasting in Mobile Ad-Hoc Networks (MANET)
Wireless Mesh Networks 1. Architecture 2 Wireless Mesh Network A wireless mesh network (WMN) is a multi-hop wireless network that consists of mesh clients.
Arsitektur Jaringan Terkini
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #4 Mobile Ad-Hoc Networks AODV Routing.
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.
Security & Efficiency in Ad- Hoc Routing Protocol with emphasis on Distance Vector and Link State. Ayo Fakolujo Wichita State University.
CMPE 80N - Introduction to Networks and the Internet 1 CMPE 80N Winter 2004 Lecture 9 Introduction to Networks and the Internet.
Networks “Each time you use the telephone you use the world’s largest computer network – the telephone system”
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks Ranveer Chandra (joint work with Venugopalan Ramasubramanian and Ken Birman)
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #5 Mobile Ad-Hoc Networks TBRPF.
1 Internet Networking Spring 2006 Tutorial 3 Ad-hoc networks TBRPF (based on IETF tutorials on TBRPF)
6: Wireless and Mobile Networks Wireless LANs.
Mario Čagalj supervised by prof. Jean-Pierre Hubaux (EPFL-DSC-ICA) and prof. Christian Enz (EPFL-DE-LEG, CSEM) Wireless Sensor Networks:
5-1 Data Link Layer r What is Data Link Layer? r Wireless Networks m Wi-Fi (Wireless LAN) r Comparison with Ethernet.
August 6, Mobile Computing COE 446 Network Planning Tarek Sheltami KFUPM CCSE COE Principles of.
Term 2, 2011 Week 1. CONTENTS Network communications standards – Ethernet – TCP/IP Other network protocols – The standard – Wireless application.
1 Wireless and Mobile Networks EECS 489 Computer Networks Z. Morley Mao Monday March 12, 2007 Acknowledgement:
Wireless MESH network Tami Alghamdi. Mesh Architecture – Mesh access points (MAPs). – Mesh clients. – Mesh points (MPs) – MP uses its Wi-Fi interface.
Network Topologies.
1 Wide Area Network. 2 What is a WAN? A wide area network (WAN ) is a data communications network that covers a relatively broad geographic area and that.
ENHANCING AND EVALUATION OF AD-HOC ROUTING PROTOCOLS IN VANET.
Mobile IP Performance Issues in Practice. Introduction What is Mobile IP? –Mobile IP is a technology that allows a "mobile node" (MN) to change its point.
Adapted from: Computer Networking, Kurose/Ross 1DT066 Distributed Information Systems Chapter 6 Wireless, WiFi and mobility.
Copyright © 2006, Dr. Carlos Cordeiro and Prof. Dharma P. Agrawal, All rights reserved. 1 Carlos Cordeiro Philips Research North America Briarcliff Manor,
Hamida SEBA - ICPS06 June 26 th -29 th Lyon France 1 ARMP: an Adaptive Routing Protocol for MANETs Hamida SEBA PRISMa Lab. – G2Ap team
MOBILE AD-HOC NETWORK(MANET) SECURITY VAMSI KRISHNA KANURI NAGA SWETHA DASARI RESHMA ARAVAPALLI.
WSN Done By: 3bdulRa7man Al7arthi Mo7mad AlHudaib Moh7amad Ba7emed Wireless Sensors Network.
1 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #3 Mobile Ad-Hoc Networks AODV Routing.
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
+ Mayukha Bairy Disk Intersection graphs and CDS as a backbone in wireless ad hoc networks.
6: Wireless and Mobile Networks6-1 Chapter 6 Wireless and Mobile Networks Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition.
Computer Networks. Why Create Networks? Communication Communication technologies such as , sms, video-conference can be used Makes communication.
Maulana Azad National Institute of Technology Bhopal (MP) AD-HOC NETWORKS Submitted By: Pradeep Ahirwar M Tech (CSE)
Computer network  A network consists of multiple computers connected to each other to share data and resources.
1 3 Computing System Fundamentals 3.4 Networked Computer Systems.
Wireless and Mobility The term wireless is normally used to refer to any type of electrical or electronic operation which is accomplished without the use.
AD-HOC NETWORK SUBMITTED BY:- MIHIR GARG A B.TECH(E&T)/SEC-A.
Ad Hoc Network.
Security in Wireless Ad Hoc Networks. 2 Outline  wireless ad hoc networks  security challenges  research directions  two selected topics – rational.
WEBMASTER 3224 PHYSICAL VS LOGICAL COMPONENTS OF THE INTERNET AND NETWORKS.
Routing Security in Wireless Ad Hoc Networks Chris Zingraf, Charisse Scott, Eileen Hindmon.
Computer Network Compiled by: GF Kalumuna January 2015.
Overview of Wireless Networks: Cellular Mobile Ad hoc Sensor.
Wireless Networks Instructor: Fatima Naseem Computer Engineering Department, University of Engineering and Technology, Taxila.
Overview of Cellular Networks Mobile Ad hoc Networks Sensor Networks.
Fundamentals of Computer Networks ECE 478/578
Computer Networks.  Which is the best definition of a circuit switched network?  An electric circuit where the connections get switched based on who.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
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.
IMPROVING OF WIRELESS MESH NETWORKS.
Ad-hoc Networks.
MOBILE AD-HOC NETWORKS
Ad-hoc On-demand Distance Vector
Ad Hoc and Sensor Networks
by Saltanat Mashirova & Afshin Mahini
Mobile ad hoc networking: imperatives and challenges
Improving Routing & Network Performances using Quality of Nodes
Types of topology. Bus topology Bus topology is a network type in which every computer and network device is connected to single cable. When it has exactly.
Protocols.
Protocols.
Presentation transcript:

Wireless Ad-Hoc Networks Iyad Kanj School of CTI, DePaul University

The Internet infrastructure The Internet provides an infrastructure for communication: Email, WWW, Online games, etc… The infrastructure consists of fixed, existing cables and hardware routers, etc…

Wireless devices and the Internet Wireless devices such as your cell phone or PDA make use of the Internet by connecting to its fixed and wired infrastructure through fixed antennas Wireless devices can then take full advantage of the Internet infrastructure for communication and other applications

No infrastructure? What if no infrastructure is available? Emergency/rescue operations in deserts, mountains, seas, … Battlefields In all of these cases, a fixed, wired infrastructure does not exist

A Solution A wireless ad hoc network is a decentralized network of mobile devices connected using wireless channels

Wireless Ad Hoc Networks 1

How do devices communicate? Devices in each others transmission range, i.e. neighbors in the network, communicate directly What if two distant devices (non-neighbors in the network) need to communicate with each other? Non-neighbors communicate through messages relayed by intermediate neighbors

How do non-neighbors communicate? Receiver Sender

How is a message routed? It is not obvious how a message should be routed in a wireless ad-hoc network: For each message the sending device will consume power proportional to its distance to the receiver device Each wireless device is typically battery powered and has limited power capacity Messages between non-neighbors should travel along “shortest paths” in the wireless ad hoc network

Goal Devise a way to route messages in the network so minimal power is used In other words, we would like to route messages between sending and receiving devices along “short paths” in the network Easily done on a fixed, wired Internet Not so easy on wireless ad-hoc networks because no fixed infrastructure and centralized server exists

Problems It is unclear how messages should be routed in the wireless ad-hoc network the network topology should be planar because it is then amenable to guaranteed and efficient routing. Radio interference issues; devices have limited communication capacities each device should maintain links to only a few devices in its transmission range planar Not planar

The need for a “sub-network” Need to construct a bounded-degree planar sub-network of the original network The sub-network topology should be energy efficient The construction of the sub-network should be distributed and localized The sub-network topology should be robust

Other “sub-network” requirements In a military environment, preservation of security, reliability, and recovery from failure are significant concerns Military networks are designed to maintain a low probability of intercept and/or a low probability of detection Hence, nodes prefer to radiate as little power as necessary and transmit as infrequently as possible, thus decreasing the probability of detection or interception

Current work at CTI At CTI, Prof. Kanj and Prof. Perkovic are investigating the problem of topology control of wireless ad-hoc networks We have obtained highly efficient algorithms for constructing (near-optimal, in some cases) robust, planar, bounded-degree sub-networks of wireless ad-hoc networks