1/17 DIANE Project Betreuer: Birgitta König-Ries, Michael Klein An approach to Support Service Discovery in Mobile.

Slides:



Advertisements
Similar presentations
MONET Problem Scope and Requirements draft-kniveton-monet-requirements-00 T.J. Kniveton Alper Yegin IETF March 2002.
Advertisements

Node Lookup in Peer-to-Peer Network P2P: Large connection of computers, without central control where typically each node has some information of interest.
The Chord P2P Network Some slides have been borowed from the original presentation by the authors.
Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications Speaker: Cathrin Weiß 11/23/2004 Proseminar Peer-to-Peer Information Systems.
DIANE Project Michael Klein, Birgitta König-Ries Multi-Layer Clusters in Ad-hoc Networks - An Approach to Service.
1 Michael Klein Questions for the First AKT Workshop on Semantic Web Services Birgitta König-Ries, Michael Klein DIANE Project ICS, University of Jena,
Multicasting in Mobile Ad-Hoc Networks (MANET)
Skills: none Concepts: Web client (browser), Web server, network connection, URL, mobile client, protocol This work is licensed under a Creative Commons.
Progress Report Wireless Routing By Edward Mulimba.
Situation Aware Mobile Computing (SAMC) CPSC 608 Project Spring 2002 Project Members: Brent Dinkle Hemant Mahawar Marco Morales Sreekanth R. Sambavaram.
Effects of Applying Mobility Localization on Source Routing Algorithms for Mobile Ad Hoc Network Hridesh Rajan presented by Metin Tekkalmaz.
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.
User Interface. The Protocol Interface The service we have tested is a clock: the control point sends a request to the device (demo device in this case)
ARPAM: Ad-hoc Routing Protocol for Aeronautical Mobile Ad-Hoc Networks Michael Iordanakis, Dimitrios Yannis, Kimon Karras, Georgios Bogdos, Georgios Dilintas.
1/16 DIANE Project Philipp Obreiter, Michael Klein Vertical Integration of Incentives for Cooperation Universität.
Title put our names here. General Problem Statement Ability to give customized information to a user based on the user’s current location, the current.
A Review of Current Routing Potocols for Ad-Hoc Mobile Wireless Networks Yibo Sun
1/17 DIANE Project Birgitta König-Ries, Michael Klein Information Services to Support E-Learning in Ad-hoc Networks.
1 A Novel Mechanism for Flooding Based Route Discovery in Ad hoc Networks Jian Li and Prasant Mohapatra Networks Lab, UC Davis.
1 Michael Klein, Universität Karlsruhe, Germany Integrating Preferences into Service Requests to Automate Service Usage First AKT Workshop on Semantic.
P2P Course, Structured systems 1 Introduction (26/10/05)
Draft-li-rtgwg-cc-igp-arch-00IETF 88 RTGWG1 An Architecture of Central Controlled Interior Gateway Protocol (IGP) draft-li-rtgwg-cc-igp-arch-00 Zhenbin.
Boyu Chen Yulin Xia Haoyu Xu Viterbi School of Engineering University of Southern California P2P file sharing system with a central server.
NETWORK TOPOLOGY.
Company/Product Overview. You have lots of files all over the place.
Wireless Ad Hoc VoIP Thesis by: Patrick Stuedi & Gustavo Alonso Presentation by: Anil Kumar Marukala & Syed Khaja Najmuddin Ahmed.
Effizientes Routing in P2P Netzwerken Chord: A Scalable Peer-to- peer Lookup Protocol for Internet Applications Dennis Schade.
Home Automation Console Publish/Subscribe Server for interoperability and reduction of complexity at end devices.
DEMIGUISE STORAGE An Anonymous File Storage System VIJAY KUMAR RAVI PRAGATHI SEGIREDDY COMP 512.
1 Plaxton Routing. 2 Introduction Plaxton routing is a scalable mechanism for accessing nearby copies of objects. Plaxton mesh is a data structure that.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment Dewan Tanvir Ahmed and Shervin Shirmohammadi Distributed & Collaborative Virtual.
Project Introduction 이 상 신 Korea Electronics Technology Institute.
Lyon, June 26th 2006 ICPS'06: IEEE International Conference on Pervasive Services 2006 Routing and Localization Services in Self-Organizing Wireless Ad-Hoc.
Networks QUME 185 Introduction to Computer Applications.
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
NEARBY: HYBRID NETWORK MOBILE APPLICATION Shuai Zhang, Ziwen Zhang, Jikai Yin.
UbiStore: Ubiquitous and Opportunistic Backup Architecture. Feiselia Tan, Sebastien Ardon, Max Ott Presented by: Zainab Aljazzaf.
Recommendation system MOPSI project KAROL WAGA
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
Planning and Implementing Multimedia Messaging Service (MMS) in General Packet Radio Service (GPRS) Network Master’s Thesis Presentation Student: Li Tan.
Efficient Overlay Multicast Protocol in Mobile Ad hoc Networks Hochoong Cho, Sang-Ho Lee Mobile Telecommunication Research Division, ETRI, KOREA Younghwan.
Node Lookup in P2P Networks. Node lookup in p2p networks In a p2p network, each node may provide some kind of service for other nodes and also will ask.
NGMAST 2008 A Proactive and Distributed QoS Negotiation Approach for Heterogeneous environments Anis Zouari, Lucian Suciu, Jean Marie Bonnin, and Karine.
Rendezvous Regions: A Scalable Architecture for Service Location and Data-Centric Storage in Large-Scale Wireless Sensor Networks Karim Seada, Ahmed Helmy.
A Membership Management Protocol for Mobile P2P Networks Mohamed Karim SBAI, Emna SALHI, Chadi BARAKAT.
DHT-based unicast for mobile ad hoc networks Thomas Zahn, Jochen Schiller Institute of Computer Science Freie Universitat Berlin 報告 : 羅世豪.
Content Routing Protocol Design Karthikeyan Ganesan Shruti Venkatesh Rafay Zamir.
Scatternet Formation of Bluetooth Ad Hoc Networks Bin Zhen, Jonghun Park, Yongsuk Kim HICSS 2003.
ECE 544 Project3 Group 9 Brien Range Sidhika Varshney Sanhitha Rao Puskuru.
LOOKING UP DATA IN P2P SYSTEMS Hari Balakrishnan M. Frans Kaashoek David Karger Robert Morris Ion Stoica MIT LCS.
Two Peer-to-Peer Networking Approaches Ken Calvert Net Seminar, 23 October 2001 Note: Many slides “borrowed” from S. Ratnasamy’s Qualifying Exam talk.
Sebastian Ortiz 10th Omega. What is a network topology? In communication networks, a topology is a usually schematic description of the arrangement of.
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
SECURE MANET ROUTING WITH TRUST INTRIGUE Prepared By: Aditya Kiran R.S Mangipudi Srikanth Gadde Varun Mannar.
Verein Konstantin Melnik Svetlana
Clustering In Mobile Networks Presented By: Assaf Mizrachi Shimrit Artzi Tutor: Dr. Michael Segal.
Chapter 29 Peer-to-Peer Paradigm Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
The Chord P2P Network Some slides taken from the original presentation by the authors.
Ahoy: A Proximity-Based Discovery Protocol Robbert Haarman.
IMPROVEMENT OF NETWORK LIFETIME BY IMPROVING ROUTE DISCOVERY PHASE IN MULTI-PATH DSR USING HYBRID ANT COLONY OPTIMIZATION.
MZR: A Multicast Protocol based on Zone Routing
The Chord P2P Network Some slides have been borrowed from the original presentation by the authors.
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
GPSR Greedy Perimeter Stateless Routing
Chapter 5: Dynamic Routing
Net 431: ADVANCED COMPUTER NETWORKS
ECE 544 Protocol Design Project 2016
Dewan Tanvir Ahmed and Shervin Shirmohammadi
Survivable Real-Time Network Services (G409/J175)
Presentation transcript:

1/17 DIANE Project Betreuer: Birgitta König-Ries, Michael Klein An approach to Support Service Discovery in Mobile Ad-hoc Networks - Concept and Simulation - Universität Karlsruhe Institute for Program Structures and Data Organization Universität Karlsruhe Diplomarbeitsvortrag Eduardo Ponz

2/17 Introduction Mobile devices are becoming very popular We want to link these devices in mobile ad-hoc networks and offer services How do we search for a service in such a network? Summary Implementation Concept - Information - Protocols Scenario Introduction Mobile phonePDALaptop

3/17 Problems with Mobile Ad-hoc Networks Highly dynamic topology due to - node movement - node fluctuation - appearing obstacles No dedicated server, no physical infrastructure Summary Implementation Concept - Information - Protocols Scenario Introduction

4/17 Service Ring (1) Group nodes offering similar services into a Service Ring (SR) DIANE Approach: Service Rings One node of the ring becomes the Service Access Point (SAP) This node has the description of all the services of the ring Summary Implementation Concept - Information - Protocols Scenario Introduction

5/17 Service Ring Model Service Ring (2) Many aspects have to be considered in the service ring model: Service description Service integration Motivation Summary Implementation Concept - Information - Protocols Scenario Introduction Service discovery

6/17 Service Discovery Initialization Protocol - How is a service ring built? Ring Routing Protocol - How do we find the proper service ring? Node Routing Protocol - How do we find the proper service inside a service ring? Actualization Protocol - How should the system react to device movement and fluctuations? Service discovery implies many different aspects Ring and Service Information - What information should be stored in the nodes? Summary Implementation Concept - Information - Protocols Scenario Introduction

7/17 Service Description Out of the scope of the Diploma Thesis Service Discovery Ring and Service Information Information about the service ring has to be locally stored in the nodes Service Information Ring Information Node Information - Ring ID - Service Type of the SR - Node ID, Cycle ID - Reachable nodes - Predecessor and Successor - Services offered by the node Ring Routing Protocol Node Routing Protocol Summary Implementation Concept - Information - Protocols Scenario Introduction

8/17 Initialization Protocol We ask if there is any SR nearby Service Ring? How to build a service ring from scratch else SET node as SAP If SR then CONNECT to SR CONNECT: If there is only one node of the SR reachable then Build a bridge If there are more nodes of the SR reachable then Insert into SR between the two closest linked nodes - A second node appears - A third node appears - One node appears SR? SAP Summary Implementation Concept - Information - Protocols Scenario Introduction

9/17 Node Routing Protocol (1) How to find the proper service inside a SR Routing in a simple SR is trivial Each node has one successor and one predecessor Service D? Service D Service A Service B Service C How do we deal with intricate rings? Thanks! No Yes, but NOT me No YES but... We only have to route the message to the successor node D Node X X‘s Predecessor X‘s Successor Summary Implementation Concept - Information - Protocols Scenario Introduction

10/17 Node Routing Protocol (2) Service rings may be intricate Some nodes have more than one successor and predecessor Some nodes have twice the same successor or predecessor To properly route a message: - A message traveling along the SR will keep track of which cycles are already visited C1 C2 C3 C4 C5 - We divide the service ring into cycles Summary Implementation Concept - Information - Protocols Scenario Introduction

11/17 Node Routing Protocol (3) Example of routing a message: Algorithm for nodes with many successors: Continue in the same cycle Service D? - If we have twice the same successor - If the other cycles have been partially visited Jump to another cycle - If the other cycle is a not visited bridge - If the other cycle is a not visited cycle Routing complete! Summary Implementation Concept - Information - Protocols Scenario Introduction C1 C2 C3 C4 C5

12/17 Ring Routing Protocol How do we find the proper SR? We have many different service rings that offer different services Yellow service Blue service Green service Indigo service The SAPs are connected with each other Ring of SRs The SAPs store the information about ring routing Summary Implementation Concept - Information - Protocols Scenario Introduction A message can now jump to other SRs

13/17 Actualization Protocol (1) Reactions to device movements and fluctuations Typical node fluctuations are: Movement Logging - Into a SR - Login into a SR - Out of a SR - Logout of a SR - Sudden disconnection Summary Implementation Concept - Information - Protocols Scenario Introduction

14/17 Actualization Protocol (2) Example of sudden disconnection algorithm: - Node B vanishes C B D E F A - Node A needs to link with C C is not reachable! Backward routing - Node C looks for reachable nodes - Node C requests information - Reachable nodes send info I I I - C processes the info and chooses the best node - X marks C as successor - A marks X as successor X - The SR is successfully closed - C sends control message to X - X sends control message to A Note: Backward routing should be only used if everything else fails Summary Implementation Concept - Information - Protocols Scenario Introduction

15/17 Implementation A simulation of the Node Routing Protocol in a service ring is currently under development QualNet is the network simulator used for this purpose Summary Implementation Concept - Information - Protocols Scenario Introduction - Custom protocols can be developed - There are pre-written protocol models - QualNet models complex wireless networks

16/17 Summary and Future Work Summary: A basic mechanism to service discovery has been proposed DevelopedConceptSimulation Ring and Node Information- Initialization Protocol- Node Routing Protocol in progress Ring Routing Protocol in progress Actualization Protocol- Future Work: Optimization to the proposed protocols Implementation of all the protocols in QualNet Prototype in a real scenario Summary Implementation Concept - Information - Protocols Scenario Introduction

17/17 Thank you! More information on our project web page: Are there any questions? Thank you for your attention!