Computer Networks Group Universität Paderborn Ad hoc and Sensor Networks Chapter 3: Network architecture Holger Karl.

Slides:



Advertisements
Similar presentations
Multicasting in Mobile Ad hoc Networks By XIE Jiawei.
Advertisements

COS 461 Fall 1997 Routing COS 461 Fall 1997 Typical Structure.
Cs/ee 143 Communication Networks Chapter 6 Internetworking Text: Walrand & Parekh, 2010 Steven Low CMS, EE, Caltech.
Decentralized Reactive Clustering in Sensor Networks Yingyue Xu April 26, 2015.
Introduction to Wireless Sensor Networks
Sensor Network 教育部資通訊科技人才培育先導型計畫. 1.Introduction General Purpose  A wireless sensor network (WSN) is a wireless network using sensors to cooperatively.
A Transmission Control Scheme for Media Access in Sensor Networks Lee, dooyoung AN lab A.Woo, D.E. Culler Mobicom’01.
Computer Networks Group Universität Paderborn Ad hoc and Sensor Networks Chapter 9: Localization & positioning Holger Karl.
Sogang University ICC Lab Using Game Theory to Analyze Wireless Ad Hoc networks.
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 25th Lecture Christian Schindelhauer.
1 Next Century Challenges: Scalable Coordination in sensor Networks MOBICOMM (1999) Deborah Estrin, Ramesh Govindan, John Heidemann, Satish Kumar Presented.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 2nd Lecture Christian Schindelhauer.
1 On Handling QoS Traffic in Wireless Sensor Networks 吳勇慶.
Aggregation in Sensor Networks NEST Weekly Meeting Sam Madden Rob Szewczyk 10/4/01.
ITIS 6010/8010 Wireless Network Security Dr. Weichao Wang.
The Impact of Spatial Correlation on Routing with Compression in WSN Sundeep Pattem, Bhaskar Krishnamachri, Ramesh Govindan University of Southern California.
Autonomic Wireless Sensor Networks: Intelligent Ubiquitous Sensing G.M.P. O’Hare, M.J. O’Grady, A. Ruzzelli, R. Tynan Adaptive Information Cluster (AIC)
CS 672 Paper Presentation Presented By Saif Iqbal “CarNet: A Scalable Ad Hoc Wireless Network System” Robert Morris, John Jannotti, Frans Kaashoek, Jinyang.
Extending Network Lifetime for Precision-Constrained Data Aggregation in Wireless Sensor Networks Xueyan Tang School of Computer Engineering Nanyang Technological.
Adaptive Self-Configuring Sensor Network Topologies ns-2 simulation & performance analysis Zhenghua Fu Ben Greenstein Petros Zerfos.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Computer Networks Group Universität Paderborn Ad hoc and Sensor Networks Chapter 1: Motivation & Applications Holger Karl.
Spring Routing & Switching Umar Kalim Dept. of Communication Systems Engineering 06/04/2007.
Chapter 19 Binding Protocol Addresses (ARP) Chapter 20 IP Datagrams and Datagram Forwarding.
Chapter 23: ARP, ICMP, DHCP IS333 Spring 2015.
Computer Networks Group Universität Paderborn Ad hoc and Sensor Networks Chapter 12: Data-centric and content-based networking Holger Karl.
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.
Lecture 3a Mobile IP 1. Outline How to support Internet mobility? – by Mobile IP. Our discussion will be based on IPv4 (the current version). 2.
Network Components 101 Travis Hill.
Network Kernel Architectures and Implementation ( ) Naming and Addressing Chaiporn Jaikaeo Department of Computer Engineering.
Lecture 8 Page 1 Advanced Network Security Review of Networking Basics: Internet Architecture, Routing, and Naming Advanced Network Security Peter Reiher.
MobiQuitous 2004Kimaya Sanzgiri Leveraging Mobility to Improve Quality of Service in Mobile Networks Kimaya Sanzgiri and Elizabeth Belding-Royer Department.
WSN Done By: 3bdulRa7man Al7arthi Mo7mad AlHudaib Moh7amad Ba7emed Wireless Sensors Network.
1 Wireless Sensor Networks Sensor Network Architectures Mario Čagalj FESB, 26/3/2014. Based on “Protocols and Architectures for Wireless.
1 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #3 Mobile Ad-Hoc Networks AODV Routing.
Architectures and Applications for Wireless Sensor Networks ( ) Network Architecture Chaiporn Jaikaeo Department of Computer.
© 2002, Cisco Systems, Inc. All rights reserved..
Network Kernel Architectures and Implementation ( ) Network Architecture Chaiporn Jaikaeo Department of Computer Engineering.
Data and Computer Communications Chapter 2 – Protocol Architecture, TCP/IP, and Internet-Based Applications.
1 Heterogeneity in Multi-Hop Wireless Networks Nitin H. Vaidya University of Illinois at Urbana-Champaign © 2003 Vaidya.
Mohmmad Khalily Dermany Islamic Azad University. Goal Apart from routing protocols that use a direct identifier of nodes (either unique id or position.
Dynamic Source Routing in ad hoc wireless networks Alexander Stojanovic IST Lisabon 1.
MANETS Justin Champion Room C203, Beacon Building Tel 3292,
Computer Networks Group Universität Paderborn TANDEM project meeting Protocols, oversimplification, and cooperation or: Putting wireless back into WSNs.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Lecture 6 Page 1 Advanced Network Security Review of Networking Basics Advanced Network Security Peter Reiher August, 2014.
William Stallings Data and Computer Communications
Network Kernel Architectures and Implementation ( ) Data-Centric and Content-Based Networking Chaiporn Jaikaeo Department of.
Multiuser Receiver Aware Multicast in CDMA-based Multihop Wireless Ad-hoc Networks Parmesh Ramanathan Department of ECE University of Wisconsin-Madison.
DHT-based unicast for mobile ad hoc networks Thomas Zahn, Jochen Schiller Institute of Computer Science Freie Universitat Berlin 報告 : 羅世豪.
Computer Networks Group Universität Paderborn Ad hoc and Sensor Networks Chapter 7: Naming & Addressing Holger Karl.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,
PeerNet: Pushing Peer-to-Peer Down the Stack Jakob Eriksson, Michalis Faloutsos, Srikanth Krishnamurthy University of California, Riverside.
Energy-Efficient Protocol for Cooperative Networks.
Ben Miller.   A distributed algorithm is a type of parallel algorithm  They are designed to run on multiple interconnected processors  Separate parts.
Toward Reliable and Efficient Reporting in Wireless Sensor Networks Authors: Fatma Bouabdallah Nizar Bouabdallah Raouf Boutaba.
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)
Structure-Free Data Aggregation in Sensor Networks.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Powerpoint Templates Data Communication Muhammad Waseem Iqbal Lecture # 07 Spring-2016.
Wireless Sensor Network Architectures
Introduction to Wireless Sensor Networks
Net 435: Wireless sensor network (WSN)
Wireless Mesh Networks
Data-Centric Networking
Protocols.
Lecture 4a Mobile IP 1.
Protocols.
Presentation transcript:

Computer Networks Group Universität Paderborn Ad hoc and Sensor Networks Chapter 3: Network architecture Holger Karl

SS 05Ad hoc & sensor networs - Ch 3: Network architecture2 Goals of this chapter  Having looked at the individual nodes in the previous chapter, we look at general principles and architectures how to put these nodes together to form a meaningful network  We will look at design approaches to both the more conventional ad hoc networks and the non-standard WSNs

SS 05Ad hoc & sensor networs - Ch 3: Network architecture3 Outline  Network scenarios  Optimization goals  Design principles  Service interface  Gateway concepts

SS 05Ad hoc & sensor networs - Ch 3: Network architecture4 Basic scenarios: Ad hoc networks  (Mobile) ad hoc scenarios  Nodes talking to each other  Nodes talking to “some” node in another network (Web server on the Internet, e.g.)  Typically requires some connection to the fixed network  Applications: Traditional data (http, ftp, collaborative apps, …) & multimedia (voice, video) ! humans in the loop © J. Schiller

SS 05Ad hoc & sensor networs - Ch 3: Network architecture5 Basic scenarios: sensor networks  Sensor network scenarios  Sources: Any entity that provides data/measurements  Sinks: Nodes where information is required  Belongs to the sensor network as such  Is an external entity, e.g., a PDA, but directly connected to the WSN  Main difference: comes and goes, often moves around, …  Is part of an external network (e.g., internet), somehow connected to the WSN  Applications: Usually, machine to machine, often limited amounts of data, different notions of importance Source Sink Inte rnet Sink Source Sink Source

SS 05Ad hoc & sensor networs - Ch 3: Network architecture6 Single-hop vs. multi-hop networks  One common problem: limited range of wireless communication  Essentially due to limited transmission power, path loss, obstacles  Option: multi-hop networks  Send packets to an intermediate node  Intermediate node forwards packet to its destination  Store-and-forward multi-hop network  Basic technique applies to both WSN and MANET  Note: Store&forward multi- hopping NOT the only possible solution  E.g., collaborative networking, network coding  Do not operate on a per- packet basis Source Sink Obstacle

SS 05Ad hoc & sensor networs - Ch 3: Network architecture7 Energy efficiency of multi-hopping?  Obvious idea: Multi-hopping is more energy-efficient than direct communication  Because of path loss  > 2, energy for distance d is reduced from cd  to 2c(d/2)   c some constant  However: This is usually wrong, or at least very over- simplified  Need to take constant offsets for powering transmitter, receiver into account  Details see exercise, chapter 2 ! Multi-hopping for energy savings needs careful choice

SS 05Ad hoc & sensor networs - Ch 3: Network architecture8 WSN: Multiple sinks, multiple sources

SS 05Ad hoc & sensor networs - Ch 3: Network architecture9 Different sources of mobility  Node mobility  A node participating as source/sink (or destination) or a relay node might move around  Deliberately, self-propelled or by external force; targeted or at random  Happens in both WSN and MANET  Sink mobility  In WSN, a sink that is not part of the WSN might move  Mobile requester  Event mobility  In WSN, event that is to be observed moves around (or extends, shrinks)  Different WSN nodes become “responsible” for surveillance of such an event

SS 05Ad hoc & sensor networs - Ch 3: Network architecture10 WSN sink mobility Request Movement direction Propagation of answers

SS 05Ad hoc & sensor networs - Ch 3: Network architecture11 WSN event mobility: Track the pink elephant Here: Frisbee model as example

SS 05Ad hoc & sensor networs - Ch 3: Network architecture12 Outline  Network scenarios  Optimization goals  Design principles  Service interface  Gateway concepts

SS 05Ad hoc & sensor networs - Ch 3: Network architecture13 Optimization goal: Quality of Service  In MANET: Usual QoS interpretation  Throughput/delay/jitter  High perceived QoS for multimedia applications  In WSN, more complicated  Event detection/reporting probability  Event classification error, detection delay  Probability of missing a periodic report  Approximation accuracy (e.g, when WSN constructs a temperature map)  Tracking accuracy (e.g., difference between true and conjectured position of the pink elephant)  Related goal: robustness  Network should withstand failure of some nodes

SS 05Ad hoc & sensor networs - Ch 3: Network architecture14 Optimization goal: Energy efficiency  Umbrella term!  Energy per correctly received bit  Counting all the overheads, in intermediate nodes, etc.  Energy per reported (unique) event  After all, information is important, not payload bits!  Typical for WSN  Delay/energy tradeoffs  Network lifetime  Time to first node failure  Network half-life (how long until 50% of the nodes died?)  Time to partition  Time to loss of coverage  Time to failure of first event notification

SS 05Ad hoc & sensor networs - Ch 3: Network architecture15 Optimization goal: Scalability  Network should be operational regardless of number of nodes  At high efficiency  Typical node numbers difficult to guess  MANETs: 10s to 100s  WSNs: 10s to 1000s, maybe more (although few people have seen such a network before…)  Requiring to scale to large node numbers has serious consequences for network architecture  Might not result in the most efficient solutions for small networks!  Carefully consider actual application needs before looking for n ! 1 solutions!

SS 05Ad hoc & sensor networs - Ch 3: Network architecture16 Outline  Network scenarios  Optimization goals  Design principles  Service interface  Gateway concepts

SS 05Ad hoc & sensor networs - Ch 3: Network architecture17 Distributed organization  Participants in a MANET/WSN should cooperate in organizing the network  E.g., with respect to medium access, routing, …  Centralistic approach as alternative usually not feasible – hinders scalability, robustness  Potential shortcomings  Not clear whether distributed or centralistic organization achieves better energy efficiency (when taking all overheads into account)  Option: “limited centralized” solution  Elect nodes for local coordination/control  Perhaps rotate this function over time

SS 05Ad hoc & sensor networs - Ch 3: Network architecture18 In-network processing  MANETs are supposed to deliver bits from one end to the other  WSNs, on the other end, are expected to provide information, not necessarily original bits  Gives addition options  E.g., manipulate or process the data in the network  Main example: aggregation  Apply composable aggregation functions to a convergecast tree in a network  Typical functions: minimum, maximum, average, sum, …  Not amenable functions: median

SS 05Ad hoc & sensor networs - Ch 3: Network architecture19 In-network processing: Aggregation example  Reduce number of transmitted bits/packets by applying an aggregation function in the network

SS 05Ad hoc & sensor networs - Ch 3: Network architecture20 In-network processing: signal processing  Depending on application, more sophisticated processing of data can take place within the network  Example edge detection: locally exchange raw data with neighboring nodes, compute edges, only communicate edge description to far away data sinks  Example tracking/angle detection of signal source: Conceive of sensor nodes as a distributed microphone array, use it to compute the angle of a single source, only communicate this angle, not all the raw data  Exploit temporal and spatial correlation  Observed signals might vary only slowly in time ! no need to transmit all data at full rate all the time  Signals of neighboring nodes are often quite similar ! only try to transmit differences (details a bit complicated, see later)

SS 05Ad hoc & sensor networs - Ch 3: Network architecture21 Adaptive fidelity  Adapt the effort with which data is exchanged to the currently required accuracy/fidelity  Example event detection  When there is no event, only very rarely send short “all is well” messages  When event occurs, increase rate of message exchanges  Example temperature  When temperature is in acceptable range, only send temperature values at low resolution  When temperature becomes high, increase resolution and thus message length

SS 05Ad hoc & sensor networs - Ch 3: Network architecture22 Data centric networking  In typical networks (including ad hoc networks), network transactions are addressed to the identities of specific nodes  A “node-centric” or “address-centric” networking paradigm  In a redundantly deployed sensor networks, specific source of an event, alarm, etc. might not be important  Redundancy: e.g., several nodes can observe the same area  Thus: focus networking transactions on the data directly instead of their senders and transmitters ! data-centric networking  Principal design change

SS 05Ad hoc & sensor networs - Ch 3: Network architecture23 Implementation options for data-centric networking  Overlay networks & distributed hash tables (DHT)  Hash table: content-addressable memory  Retrieve data from an unknown source, like in peer-to-peer networking – with efficient implementation  Some disparities remain  Static key in DHT, dynamic changes in WSN  DHTs typically ignore issues like hop count or distance between nodes when performing a lookup operation  Publish/subscribe  Different interaction paradigm  Nodes can publish data, can subscribe to any particular kind of data  Once data of a certain type has been published, it is delivered to all subscribes  Subscription and publication are decoupled in time; subscriber and published are agnostic of each other (decoupled in identity)  Databases

SS 05Ad hoc & sensor networs - Ch 3: Network architecture24 Further design principles  Exploit location information  Required anyways for many applications; can considerably increase performance  Exploit activity patterns  Exploit heterogeneity  By construction: nodes of different types in the network  By evolution: some nodes had to perform more tasks and have less energy left; some nodes received more solar energy than others; …  Cross-layer optimization of protocol stacks for WSN  Goes against grain of standard networking; but promises big performance gains  Also applicable to other networks like ad hoc; usually at least worthwhile to consider for most wireless networks

SS 05Ad hoc & sensor networs - Ch 3: Network architecture25 Outline  Network scenarios  Optimization goals  Design principles  Service interface  Gateway concepts

SS 05Ad hoc & sensor networs - Ch 3: Network architecture26 Interfaces to protocol stacks  The world’s all-purpose network interface: sockets  Good for transmitting data from one sender to one receiver  Not well matched to WSN needs (ok for ad hoc networks)  Expressibility requirements  Support for simple request/response interactions  Support for asynchronous event notification  Different ways for identifying addressee of data  By location, by observed values, implicitly by some other form of group membership  By some semantically meaningful form – “room 123”  Easy accessibility of in-network processing functions  Formulate complex events – events defined only by several nodes  Allow to specify accuracy & timeliness requirements  Access node/network status information (e.g., battery level)  Security, management functionality, …  No clear standard has emerged yet – many competing, unclear proposals

SS 05Ad hoc & sensor networs - Ch 3: Network architecture27 Outline  Network scenarios  Optimization goals  Design principles  Service interface  Gateway concepts

SS 05Ad hoc & sensor networs - Ch 3: Network architecture28 Gateway concepts for WSN/MANET  Gateways are necessary to the Internet for remote access to/from the WSN  Same is true for ad hoc networks; additional complications due to mobility (change route to the gateway; use different gateways)  WSN: Additionally bridge the gap between different interaction semantics (data vs. address-centric networking) in the gateway  Gateway needs support for different radios/protocols, …

SS 05Ad hoc & sensor networs - Ch 3: Network architecture29 Gateway nodes Alice‘s desktop Alice‘s PDA Alert Alice Internet WSN to Internet communication  Example: Deliver an alarm message to an Internet host  Issues  Need to find a gateway (integrates routing & service discovery)  Choose “best” gateway if several are available  How to find Alice or Alice’s IP?

SS 05Ad hoc & sensor networs - Ch 3: Network architecture30 Internet to WSN communication  How to find the right WSN to answer a need?  How to translate from IP protocols to WSN protocols, semantics? Gateway nodes Remote requester Internet Gateway

SS 05Ad hoc & sensor networs - Ch 3: Network architecture31 Gateway nodes Internet Gateway WSN tunneling  Use the Internet to “tunnel” WSN packets between two remote WSNs

SS 05Ad hoc & sensor networs - Ch 3: Network architecture32 Summary  Network architectures for ad hoc networks are – in principle – relatively straightforward and similar to standard networks  Mobility is compensated for by appropriate protocols, but interaction paradigms don’t change too much  WSNs, on the other hand, look quite different on many levels  Data-centric paradigm, the need and the possibility to manipulate data as it travels through the network opens new possibilities for protocol design  The following chapters will look at how these ideas are realized by actual protocols