August 17, 20151 Mobile Ad hoc Networks COE 549 Ad hoc Network Overview Tarek Sheltami KFUPM CCSE COE

Slides:



Advertisements
Similar presentations
June 2, Mobile Computing COE 446 Mobile Ad hoc Networks Tarek Sheltami KFUPM CCSE COE
Advertisements

Wide Area Wi-Fi Sam Bhoot. Wide Area Wi-Fi  Definition: Wi-Fi (Wireless Fidelity) n. – popular term for high frequency wireless local area networks operating.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
TDMA Scheduling in Wireless Sensor Networks
Routing Protocols for Sensor Networks Presented by Siva Desaraju Computer Science WMU An Application Specific Protocol Architecture for Wireless Microsensor.
CSE 6590 Department of Computer Science & Engineering York University 1 Introduction to Wireless Ad-hoc Networking 5/4/2015 2:17 PM.
802.11a/b/g Networks Herbert Rubens Some slides taken from UIUC Wireless Networking Group.
5/11/20151 Computer Networks COE 549 Random Access Tarek Sheltami KFUPM CCSE COE
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Fault Tolerant Routing in Tri-Sector Wireless Cellular Mesh Networks Yasir Drabu and Hassan Peyravi Kent State University Kent, OH
A Survey on Wireless Mesh Networks Sih-Han Chen 陳思翰 Department of Computer Science and Information Engineering National Taipei University of Technology.
Issues in ad-hoc networks Miguel Sanchez Nov-2000.
Wireless Ad Hoc Networks Mario Gerla CS 215, Winter 2001 Introduction to Ad Hoc networks Protocol Stack Physical and MAC Layer Clustering.
CMPE 80N - Introduction to Networks and the Internet 1 CMPE 80N Winter 2004 Lecture 9 Introduction to Networks and the Internet.
Di Wu 03/03/2011 Geographic Routing in Clustered Multi-layer Vehicular Ad Hoc Networks for Load Balancing Purposes.
Adaptive Self-Configuring Sensor Network Topologies ns-2 simulation & performance analysis Zhenghua Fu Ben Greenstein Petros Zerfos.
August 6, Mobile Computing COE 446 Network Planning Tarek Sheltami KFUPM CCSE COE Principles of.
1 Energy Efficient Communication in Wireless Sensor Networks Yingyue Xu 8/14/2015.
Network Topologies.
August 21, Mobile Computing COE 446 Network Planning Tarek Sheltami KFUPM CCSE COE Principles of.
Presented by Amira Ahmed El-Sharkawy Ibrahim.  There are six of eight turtle species in Ontario are listed as endangered, threatened or of special concern.
Profiles and Multi-Topology Routing in Highly Heterogeneous Ad Hoc Networks Audun Fosselie Hansen Tarik Cicic Paal Engelstad Audun Fosselie Hansen – Poster,
MobiQuitous 2004Kimaya Sanzgiri Leveraging Mobility to Improve Quality of Service in Mobile Networks Kimaya Sanzgiri and Elizabeth Belding-Royer Department.
Clustering in Mobile Ad hoc Networks. Why Clustering? –Cluster-based control structures provides more efficient use of resources for large dynamic networks.
Wireless Ad-Hoc Networks
10/6/20151 Mobile Ad hoc Networks COE 549 Power Control Tarek Sheltami KFUPM CCSE COE
1 Heterogeneity in Multi-Hop Wireless Networks Nitin H. Vaidya University of Illinois at Urbana-Champaign © 2003 Vaidya.
A novel approach of gateway selection and placement in cellular Wi-Fi system Presented By Rajesh Prasad.
Maulana Azad National Institute of Technology Bhopal (MP) AD-HOC NETWORKS Submitted By: Pradeep Ahirwar M Tech (CSE)
Wireless Mesh Network 指導教授:吳和庭教授、柯開維教授 報告:江昀庭 Source reference: Akyildiz, I.F. and Xudong Wang “A survey on wireless mesh networks” IEEE Communications.
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
1 Mobile ad hoc networking with a view of 4G wireless: Imperatives and challenges Myungchul Kim Tel:
Cognitive Radio Networks
Lan F.Akyildiz,Weilian Su, Erdal Cayirci,and Yogesh sankarasubramaniam IEEE Communications Magazine 2002 Speaker:earl A Survey on Sensor Networks.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
AD-HOC NETWORK SUBMITTED BY:- MIHIR GARG A B.TECH(E&T)/SEC-A.
1 Exploiting Diversity in Wireless Networks Nitin H. Vaidya University of Illinois at Urbana-Champaign Presentation at Mesh.
11/25/2015 Wireless Sensor Networks COE 499 Localization Tarek Sheltami KFUPM CCSE COE 1.
Multiuser Receiver Aware Multicast in CDMA-based Multihop Wireless Ad-hoc Networks Parmesh Ramanathan Department of ECE University of Wisconsin-Madison.
MANET: Introduction Reference: “Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations”; S. Corson and J.
Ad Hoc Network.
Security in Wireless Ad Hoc Networks. 2 Outline  wireless ad hoc networks  security challenges  research directions  two selected topics – rational.
AD HOC NETWORKS BY: Bhagyashree Fulzele 03 Sneha Ghosh 23 Yamini Kothe 27 Namrata Nitnawre 12.
THE IMPACT OF OSPF ROUTING ON MILITARY MANETS BY ROCCO LUPOI UNDER THE GUIDANCE OF DR. GRANT WIGLEY THESIS - BACHELOR OF COMPUTER SCIENCE (HONOURS) - LHIS.
Overview of Wireless Networks: Cellular Mobile Ad hoc Sensor.
1/29/2016 Mobile Ad hoc Network COE 549 Deployment of Ad hoc Sensor Networks Tarek Sheltami KFUPM CCSE COE
Wireless Mesh Networks Myungchul Kim
Overview of Cellular Networks Mobile Ad hoc Networks Sensor Networks.
UNIT-V Ad-hoc Networks
Intro Wireless vs. wire-based communication –Costs –Mobility Wireless multi hop networks Ad Hoc networking Agenda: –Technology background –Applications.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
Mobile Ad Hoc Networks Part 1: Overview
Wireless sensor and actor networks: research challenges Ian. F. Akyildiz, Ismail H. Kasimoglu
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Medium Access Control. MAC layer covers three functional areas: reliable data delivery access control security.
In the name of God.
2010 IEEE Global Telecommunications Conference (GLOBECOM 2010)
IMPROVING OF WIRELESS MESH NETWORKS.
Overview of Wireless Networks:
Lecture 28 Mobile Ad hoc Network Dr. Ghalib A. Shah
Ad-hoc Networks.
CHARACTERISTICS.
Wireless and Mobile Ad Hoc Networks
Net 435: Wireless sensor network (WSN)
Wireless Ad Hoc Network
Routing in Packet Networks Shortest Path Routing
Mobile ad hoc networking: imperatives and challenges
Routing in Mobile Ad-hoc Networks
Protocols.
Protocols.
Presentation transcript:

August 17, Mobile Ad hoc Networks COE 549 Ad hoc Network Overview Tarek Sheltami KFUPM CCSE COE

Overview August 17,  Introduction  Comparison with the cellular topology  Applications (military and civilian)  Deployment  Localization  Topology control  Mobility models  Capacity  Power control

August 17, Introduction- Conventional Wireless Communications

August 17, Cellular Subscribers

August 17, Cellular Subscribers..

August 17, Introduction 1. Infrastructure Network Topology: There is fixed (wired) infrastructure that supports communication between MT and fixed terminals It is often designed for large coverage areas and multiple BSs or APs BSs/APs serves as the hub of the network Any communication from one MT to another has to be sent through the BS/AP The hub station usually controls the MT and monitors what each station is transmitting

August 17, 20157

8 Introduction.. 2. Infrastructure-less Network Topology: Can operate without the need for a fixed infrastructure Best suited for conference meetings, lectures, crowd control, search and rescue, disaster recovery, on-the-fly conferencing applications, and automated battlefields. Typically such applications do not have infrastructure or central administration available Users have to cooperate in carrying messages through the network Ad hoc Network = multihop network

August 17, 20159

10 Comparison of Ad hoc and Infrastructure Network Topologies Scalability: To scale up a wireless infrastructure network, the number of BSs or APs is increased to expand the coverage area or to increase the capacity In ad hoc networks, it depends on the routing protocol Flexibility: Operation of infrastructure networks is very expensive Ad hoc network is very flexible Controllability: Infrastructure network centrally controlled and synchronized In ad hoc networks there is no centralized administration Therefore, infrastructure network is more controllable than ad hoc

August 17, Comparison of Ad hoc and Infrastructure Network Topologies.. Routing Complexity: In ad hoc network, each node must act a router. There is a need for routing algorithms that directs the info to the appropriate next hop This problem does not exist in infrastructure network Coverage: In WLANs, coverage of the network is an issue of concern The max distance between two MTs is the max transmission range of MTs In infrastructure network, two MTs communicate through BS/AP The max distance is twice range of the coverage of a single wireless modem

August 17, Reliability: Ad hoc network is resistance to failure Infrastructure network are “single failure point network. If the AP/BS fails, the entire communication network is destroyed Store and Forward Delay and Media Efficiency: In infrastructure topology, data is transmitted twice. Once from the source to the BS/AP and once from BS/AP to the destination The BS/AP should store the message and forward it later. This adds to the delay encountered by the data packets Ad hoc may have several transmissions and several store and forward delays Comparison of Ad hoc and Infrastructure Network Topologies..

August 17, Why Ad hoc Networks? No infrastructure needed Can be deployed quickly, where there is no wireless communication infrastructure present Can act as an extension to existing networks  enhances coverage Cost-effective – cellular spectrum costs $XX billion Adaptive computing and self-configuring Support for heterogeneous computational devices and OSs

August 17, Ad hoc Constraints Dynamic topologies Bandwidth-constrained Constraints on Tx power Infrastructure-less property, no central coordinators  hidden terminal, exposed terminal No QoS preservation Load balancing Energy-constrained operation Limited physical security

History August 17, Research started in the 70’s  ARPA Project initiated in December ’72 at Stanford University meeting 2.Interest cooled off in the 80’s. 3.Renewed interest in the 90’s, still going strong.  Wireless communications are very popular.  Today’s powerful technology makes ad hoc networks feasible and practical  Different names for the same thing:  Packet radio networks (70’s), multihop wireless networks (80’s), wireless ad hoc networks (90’s)

August 17, Mobility Models Cellular Network  The area is divided into independent cells  The exact position of the node is irrelevant  Mobility models used for simulating handover  There are not necessarily fixed stations  ‌Network routes are created dynamically  Dynamic network topology  The level of mobility determines the dynamic of the network topology ‌  Examples: random walk, random waypoint, random direction Ad hoc Networks

August 17, Structured vs Randomized deployment The randomized deployment approach is appealing for futuristic applications of a large scale Many MTs are likely to be deployed in a structured manner In both cases, the cost and availability of equipment will often be a significant constraint

August 17, Capacity of the network Why capacity? If we know the theoretical limits, we can compare them with the performance of protocols we design and know how much we could improve If we know how the theoretical limits are achieved, we can improve our protocols Unfortunately, we still do not have any good answers

Topology Control August 17, Are many small hops better than a big one? Power equation in ad hoc: u(d) = ad α + c  Let us assume that the source S can reach the destination D directly. Let us further assume that there is a middle node between the source and the destination. Let |SA| = x and |SD| = d as in the below Figure d > (c/(a(1-2 1-α )))1/α  If d > (c/(a(1-2 1-α )))1/α, then there is an intermediate node A between the source and destination such that the retransmission of the packet through A will save the energy. Moreover, the greatest saving is achieved when A in the middle of SD

August 17, Network Topology.. Different deployment topologies: (a) a star-connected single-hop topology, (b) flat multi-hop mesh, (c) structured grid, and (d) two-tier hierarchical cluster topology

August 17, Localization Each individual node observation can be characterized essentially as a tuple of the form, where S is the spatial location of the measurement, T the time of the measurement, and M the measurement itself. The location needed for the following reasons: 1. To provide location stamps 2. To locate and track point objects 3. To monitor the spatial evolution of a diffuse phenomenon 4. To determine the quality of coverage. 5. To achieve load balancing 6. To form clusters 7. To facilitate routing 8. To perform efficient spatial querying However, localization is only important in random deployment

What is a good topology? August 17,

What is a good topology (Cont’d) August 17,  Range must be large enough to ensure connectivity and connectivity must be robust with respect to node movements  If range is too large some capacity is lost  A common range for everyone is conceptually simple but not a good idea  In real life nodes tend to cluster

Power Control August 17, Once nodes decide who will transmit (with the MAC protocol), they need to decide with how much power they will transmit. This is the task of the power control protocol.  Nodes interfere with each other.  Each node has a target S/N  Fundamental questions:  Is there a power P i can achieve this ?  Can they be found in a distributed manner?  All transmissions are with rate W.

If the problem is feasible, DPC will find the best solution: 1. The S/N will converge to the target values. 2. The transmitter powers will be the minimum possible. August 17, Distributed Power Control

August 17, Distributed Power Control (Cont’d) If the problem is not feasible: 1. The transmitters powers will go to infinity. 2. The S/N will converge to unacceptable values.

References August 17, [1] I. F. Akyildiz, W. Su, Y. Sankarasubramanian, and E. Cayirci, “Wireless sensor networks: a survey,” Computer Networks (Elsevier) Journal, vol. 38, no. 4, pp. 393–422, Mar [2] R. Ramanathan and J. Redi, “A brief overview of ad hoc networks: Challenges and directions,” IEEE Commun. Mag., vol. 40, no. 5, pp. 20–22, May [3] Z. J. Haas, M. Gerla, D. B. Johnson, C. E. Perkins, M. B. Pursley, M. Steenstrup, and C.-K. Toh, Eds., IEEE J. Select. Areas Commun., Special Issue on Wireless Ad Hoc Networks, vol. 17, no. 8, Aug [4] J. E. Wieselthier, E. Altman, A. Ephremides, J. P. Macker, H. B. Russell, M. Steenstrup, S. B. Wicker, and A. Segall, Eds., IEEE J. Select. Areas Commun., Special Issue on Wireless Ad Hoc Networks, vol. 23, no. 1, Jan [5] Power-aware localized routing in wireless networks Stojmenovic, I.; Lin, X.; Parallel and Distributed Systems, IEEE Transactions on Volume 12, Issue 11, Nov Page(s):1122 – 1133