What Is an Ad Hoc Network?

Slides:



Advertisements
Similar presentations
Mobility Entropy and Message Routing in Community-Structured Delay Tolerant Networks Hideya Ochiai Hiroshi Esaki The University of Tokyo / NICT Asia Future.
Advertisements

A feedback–based scheme for improving TCP performance in Ad Hoc Wireless Networks Group : Manish Mehta Aditya Barve.
1 A Real-Time Communication Framework for Wireless Sensor-Actuator Networks Edith C.H. Ngai 1, Michael R. Lyu 1, and Jiangchuan Liu 2 1 Department of Computer.
ROUTING IN INTERMITTENTLY CONNECTED MOBILE AD HOC NETWORKS AND DELAY TOLERANT NETWORKS: OVERVIEW AND CHALLENGES ZHENSHENG ZHANG.
Mobile Ad-hoc Network Simulator: mobile AntNet R. Hekmat * (CACTUS TermiNet - TU Delft/EWI/NAS) and Radovan Milosevic (MSc student) Mobile Ad-hoc networks.
Distributed Assignment of Encoded MAC Addresses in Sensor Networks By Curt Schcurgers Gautam Kulkarni Mani Srivastava Presented By Charuka Silva.
SELF-ORGANIZING MEDIA ACCESS MECHANISM OF A WIRELESS SENSOR NETWORK AHM QUAMRUZZAMAN.
Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with ZebraNet Presented by Eric Arnaud Makita
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.
Mobile Routing protocols MANET Lecture: 4. DIALOGUE CONTROL In any communication there are two types of user dialogues. –long session-oriented transactions.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Secure Routing and Intrusion Detection For Mobile Ad Hoc Networks Secure Routing and Intrusion Detection For Mobile Ad Hoc Networks Anand Patwardhan Jim.
Arsitektur Jaringan Terkini
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #4 Mobile Ad-Hoc Networks AODV Routing.
Parking Space Finder Lucia Wiguno Thursday, April
MOBILITY SUPPORT IN IPv6
InVANET(Intelligent Vehicular Ad Hoc Network
TORA : Temporally Ordered Routing Algorithm Invented by Vincent Park and M.Scott Corson from University of Maryland. TORA is an on-demand routing protocol.
Geographic Routing Without Location Information A. Rao, C. Papadimitriou, S. Shenker, and I. Stoica In Proceedings of the 9th Annual international Conference.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.
1 Wireless and Mobile Networks EECS 489 Computer Networks Z. Morley Mao Monday March 12, 2007 Acknowledgement:
CECS 5460 – Assignment 3 Stacey VanderHeiden Güney.
Adapted from: Computer Networking, Kurose/Ross 1DT066 Distributed Information Systems Chapter 6 Wireless, WiFi and mobility.
Lecture 1 Wireless Networks CPE 401/601 Computer Network Systems slides are modified from Jim Kurose & Keith Ross All material copyright J.F.
Chapter 4. After completion of this chapter, you should be able to: Explain “what is the Internet? And how we connect to the Internet using an ISP. Explain.
MOBILE AD-HOC NETWORK(MANET) SECURITY VAMSI KRISHNA KANURI NAGA SWETHA DASARI RESHMA ARAVAPALLI.
1 / 18 Fariba alamshahi Secure Routing and Intrusion Detection in Ad Hoc Networks Supervisor: Mr.zaker Translator: fariba alamshahi.
1 Seminar Algorithms for ad hoc networking: Patrik Floréen Seminar Introduction.
Bluetooth Kirthika Parmeswaran Telcordia Technologies OOPSLA’2000.
1 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #3 Mobile Ad-Hoc Networks AODV Routing.
Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.
6: Wireless and Mobile Networks6-1 Chapter 6 Wireless and Mobile Networks Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition.
Sami Al-wakeel 1 Data Transmission and Computer Networks The Switching Networks.
MARCH : A Medium Access Control Protocol For Multihop Wireless Ad Hoc Networks 성 백 동
Chapter Overview Bridging Switching Routing.
The Destination Sequenced Distance Vector (DSDV) protocol
Hybrid Cellular-Ad hoc Data Network Shuai Zhang, Ziwen Zhang, Jikai Yin.
Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols ► Acts as denial of service by disrupting the flow of data between a source and.
WIRELESS AD-HOC NETWORKS Dr. Razi Iqbal Lecture 6.
AD-HOC NETWORK SUBMITTED BY:- MIHIR GARG A B.TECH(E&T)/SEC-A.
AODV: Introduction Reference: C. E. Perkins, E. M. Royer, and S. R. Das, “Ad hoc On-Demand Distance Vector (AODV) Routing,” Internet Draft, draft-ietf-manet-aodv-08.txt,
Implementation of Collection Tree Protocol in QualNet
Ad Hoc Network.
An Efficient Wireless Mesh Network A New Architecture 指導教授:許子衡 教授 學生:王志嘉.
IEEE j Relay-Based Wireless Access Networks VASKEN GENC, SEAN MURPHY, YANG YU, AND JOHN MURPHY, UNIVERSITY COLLEGE DUBLIN SCHOOL OF COMPUTER SCIENCE.
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
1 An Interleaved Hop-by-Hop Authentication Scheme for Filtering of Injected False Data in Sensor Networks Sencun Zhu, Sanjeev Setia, Sushil Jajodia, Peng.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
Mobility Increases the Connectivity of K-hop Clustered Wireless Networks Qingsi Wang, Xinbing Wang and Xiaojun Lin.
Fundamentals of Computer Networks ECE 478/578
On Multihop Communications For In-Vehicle Internet Access Based On a TDMA MAC Protocol Hassan Aboubakr Omar ∗, Weihua Zhuang ∗, and Li Li† ∗ Department.
Asstt. Professor Adeel Akram. Other Novel Routing Approaches Link reversal Aimed for highly dynamic networks Goal: to identify some path, as opposed.
Mobile IP for Mobile Ad hoc Networks
IMPROVING OF WIRELESS MESH NETWORKS.
Ad-hoc Networks.
VANET.
Wireless Sensor Network Architectures
Internet Networking recitation #4
Lifetime Elongation in Wireless Sensor Networks Using Heterogeneity
CHARACTERISTICS.
Wireless and Mobile Ad Hoc Networks
ECE 544 Protocol Design Project 2016
Wireless Ad-Hoc Networking
Mobile ad hoc networking: imperatives and challenges
Effective Replica Allocation
Detect and Prevent Rogue Traffic in Mobile Ad Hoc Networks
Presentation transcript:

What Is an Ad Hoc Network? An ad hoc wireless network is a collection of two or more devices equipped with wireless communications and networking capability. Such devices can communicate with another node that is immediately within their radio range or one that is outside their radio range. For the latter scenario, an intermediate node is used to relay or forward the packet from the source toward the destination.

An ad hoc wireless network is self-organizing and adaptive An ad hoc wireless network is self-organizing and adaptive. This means that a formed network can be de-formed on-the-fly without the need for any system administration. The term "ad hoc" tends to imply "can take different forms" and "can be mobile, standalone, or networked." Ad hoc nodes or devices should be able to detect the presence of other such devices and to perform the necessary handshaking to allow communications and the sharing of information and services

Since ad hoc wireless devices can take different forms (for example, palmtop, laptop, Internet mobile phone, etc.), the computation, storage, and communications capabilities of such devices will vary tremendously. Ad hoc devices should not only detect the presence of connectivity with neighboring devices/nodes, but also identify what type the devices are and their corresponding attributes

A wireless sensor network is one form of an ad hoc wireless network. Sensors are wirelessly connected and they, at appropriate times, relay information back to some selected nodes. These selected nodes then perform some computation based on the collected data (a process commonly known as data fusion) to derive an ultimate statistic (that reflects an assessment of the environment and tactical conditions) to allow critical decisions to be made.

Traffic Profiles Ad hoc wireless communications can occur in several different forms. For a pair of ad hoc wireless nodes, communications will occur between them over a period of time until the session is finished or one of the nodes has moved away. This resembles a peer-to-peer communication scenario.

Another form occurs when two or more devices are communicating among themselves and they are migrating in groups. The traffic pattern is, therefore, one where communications occur over a longer period of time. This resembles the scenario of remote-to-remote communication.

Finally, we can have a scenario where devices communicate in a non-coherent fashion and their communication sessions are, therefore, short, abrupt, and undeterministic.

Types of Ad Hoc Mobile Communications Mobile hosts in an ad hoc mobile network can communicate with their immediate peers, that is, peer-to-peer, that are a single radio hop away.

if three or more nodes are within range of each other (but not necessarily a single hop away from one another), then remote-to-remote mobile node communications exist. remote-to-remote communications are associated with group migrations.        

Types of Mobile Host Movements An ad hoc route comprises the source (SRC), destination (DEST), and/or a number of intermediate nodes (INs). Movement by any of these nodes will affect the validity of the route. An SRC node in a route has a downstream link, and when it moves out of its downstream neighbor's radio coverage range, the existing route will immediately become invalid.

Hence, all downstream nodes may have to be informed so they can erase their invalid route entries. Likewise, when a DEST node moves out of the radio coverage of its upstream neighbor, the route becomes invalid. However, unlike the earlier case, here, the upsteam nodes will have to be informed so they can erase their invalid route entries. Lastly, similar to SRC and DEST node movement, any movement by an IN supporting an existing route may cause the route to be invalid.