Proposals for Research Directions

Slides:



Advertisements
Similar presentations
DCS Lecture how to solve it Patrick Prosser. Put a different number in each circle (1 to 8) such that adjacent circles cannot take consecutive numbers.
Advertisements

Mitigating Routing Misbehavior in Mobile Ad-Hoc Networks Reference: Mitigating Routing Misbehavior in Mobile Ad Hoc Networks, Sergio Marti, T.J. Giuli,
CompAPO: A complete version of the APO Algorithm Tal Grinshpoun and Amnon Meisels Department of Computer Science Ben-Gurion University of the Negev.
1 Finite Constraint Domains. 2 u Constraint satisfaction problems (CSP) u A backtracking solver u Node and arc consistency u Bounds consistency u Generalized.
Sec-TEEN: Secure Threshold sensitive Energy Efficient sensor Network protocol Ibrahim Alkhori, Tamer Abukhalil & Abdel-shakour A. Abuznied Department of.
Mitigating Routing Misbehavior in Mobile Ad Hoc Networks By Sergio Marti, T.J. Giuli, Kevin Lai, & Mary Baker Department of Computer Science Stanford University.
NGMAST- WMS workshop17/09/2008, Cardiff, Wales, UK A Simulation Analysis of Routing Misbehaviour in Mobile Ad hoc Networks 2 nd International Conference.
Diagnosis on Computational Grids for Detecting Intelligent Cheating Nodes Felipe Martins Rossana M. Andrade Aldri L. dos Santos Bruno SchulzeJosé N. de.
Mitigating routing misbehavior in ad hoc networks Mary Baker Departments of Computer Science and.
The Meraka Indoor wireless mesh test bed A new multi hop routing benchmarking tool David Johnson Senior Researcher Wireless Africa Programme Meraka CSIR.
Flash Crowds And Denial of Service Attacks: Characterization and Implications for CDNs and Web Sites Aaron Beach Cs395 network security.
Security of wireless ad-hoc networks. Outline Properties of Ad-Hoc network Security Challenges MANET vs. Traditional Routing Why traditional routing protocols.
Developing a Deterministic Patrolling Strategy for Security Agents Nicola Basilico, Nicola Gatti, Francesco Amigoni.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 13th Lecture Christian Schindelhauer.
Wireless Sensor Network for Tracking the Traffic in INTERNET Network Routers Part 2 Supervisor:Mark Shifrin Students:Yuri Kipnis Nir Bar-Or Date:30 September.
Adaptive Playout Scheduling Using Time- scale Modification in Packet Voice Communications Yi J. Liang, Nikolaus Farber, Bernd Girod Information Systems.
1 TDMA Scheduling in Competitive Wireless Networks Mario CagaljHai Zhan EPFL - I&C - LCA February 9, 2005.
Distributed Scheduling. What is Distributed Scheduling? Scheduling: –A resource allocation problem –Often very complex set of constraints –Tied directly.
Key management in wireless sensor networks Kevin Wang.
A Vehicular Ad Hoc Networks Intrusion Detection System Based on BUSNet.
Transfer Graph Approach for Multimodal Transport Problems
Routing Security in Wireless Ad Hoc Networks Chris Zingraf, Charisse Scott, Eileen Hindmon.
Copyright R. Weber Search in Problem Solving ISYS 370 Dr. R. Weber.
LPT for Data Aggregation in Wireless Sensor Networks Marc Lee and Vincent W.S. Wong Department of Electrical and Computer Engineering, University of British.
Joint Channel Assignment and Routing in Real Time Wireless Mesh Network Xiaoguang Li †, Changqiao Xu ‡ † College of Software Engineering, Southeast University,
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.
SMUCSE 8344 Wireless Mesh. SMUCSE 8344 The Premise.
Building “ Problem Solving Engines ” for Combinatorial Optimization Toshi Ibaraki Kwansei Gakuin University (+ M. Yagiura, K. Nonobe and students, Kyoto.
EAACK—A Secure Intrusion-Detection System for MANETs
ANNA UNIVERSITY, CHENNAI PROJECT VIVA FINAL YEAR MCA( ) 04/07/2013.
Expanding the CASE Framework to Facilitate Load Balancing of Social Network Simulations Amara Keller, Martin Kelly, Aaron Todd.
Embedding Constraint Satisfaction using Parallel Soft-Core Processors on FPGAs Prasad Subramanian, Brandon Eames, Department of Electrical Engineering,
Energy-Efficient Shortest Path Self-Stabilizing Multicast Protocol for Mobile Ad Hoc Networks Ganesh Sridharan
1 Protocols for the Wireless Paranoid Nitin Vaidya University of Illinois Slightly revised version of slides used for.
Project guide Asst.Prof(Sr) T.Shankar I.V.L Raghavendra (08BEC134) Energy optimisation in cluster based wireless Ad-Hoc networks.
Secure In-Network Aggregation for Wireless Sensor Networks
Mohamed Elhawary Computer Science Department Cornell University PERCOM 2008 Zygmunt J. Haas Electrical and Computer Engineering Department Cornell University.
Foundations of Data Structures Practical Session #13 Graphs Algorithms.
Nurse scheduling problem 25 nurses （ Team A:13, B:12 ） Experienced nurses and new nurses 3 shifts （ day, evening, night ）, meetings, days off Time span.
Lecture 1 – Operations Research
1 RealProct: Reliable Protocol Conformance Testing with Real Nodes for Wireless Sensor Networks Junjie Xiong, Edith C.-Ngai, Yangfan Zhou, Michael R. Lyu.
Mitigating Routing Misbehavior in Mobile Ad Hoc Networks Sergio Marti, T.J. Giuli, Kevin.
Security and Cooperation in Ad Hoc Networks Gaia Maselli IIT - CNR
Routing Security in Wireless Ad Hoc Networks Chris Zingraf, Charisse Scott, Eileen Hindmon.
Sonali Bhargava and Dharma P. Agrawal Center for Distributed & Mobile Computing Dept of ECECS, University of Cincinnati Security Enhancements in AODV protocol.
Troubleshooting Mesh Networks Lili Qiu Joint Work with Victor Bahl, Ananth Rao, Lidong Zhou Microsoft Research Mesh Networking Summit 2004.
Systems design for scheduling: Open Tools Patrick De Causmaecker, Peter Demeester, Greet Vanden Berghe and Bart Verbeke KaHo Sint-Lieven, Gent, Belgium.
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
CS 351/ IT 351 Modeling and Simulation Technologies Review ( ) Dr. Jim Holten.
Constraint Satisfaction Problems/Programming ZUI 2012/2013.
A Maximum Fair Bandwidth Approach for Channel Assignment in Wireless Mesh Networks Bahador Bakhshi and Siavash Khorsandi WCNC 2008.
Simulation of K-Clustering in a Wireless Ad-Hoc Network using a decentralized Local Search Supervised by: Dr. Rachel Ben- Eliyahu Kirill Kazatsker Daniel.
Efficient distribution of An infrastructure Cluster network under constraints Ben Gurion University, Communication System Engineering Department, Faculty.
MAC Protocols for Sensor Networks
Suhankar Mishra1, Thang N. Dinh2, My T. Thai1, and Incheol Shin3
Trusted Routing in IoT Dr Ivana Tomić In collaboration with:
CprE 458/558: Real-Time Systems
Optical Networks & Smart Grid Lab.
Liang Chen Advisor: Gagan Agrawal Computer Science & Engineering
FlowMap Algorithm Perform clustering on the following 2-bounded network Intra-cluster and node delay = 0, inter-cluster = 1 Pin constraint = 3 Practical.
Dynamic Ordering for Asynchronous Backtracking on DisCSPs
Technical University of Cluj-Napoca
Chapter 3: Finite Constraint Domains
ITIS 6010/8010 Wireless Network Security
Graph-Based Anomaly Detection
Hemant Kr Rath1, Anirudha Sahoo2, Abhay Karandikar1
Advisor: Frank Yeong-Sung Lin, Ph.D. Presented by Yu-Jen Hsieh 謝友仁
REED : Robust, Efficient Filtering and Event Detection
Advisor: Yeong-Sung, Lin, Ph.D. Presented by Yu-Ren, Hsieh
Presentation transcript:

Proposals for Research Directions Tal Grinshpoun Department of Industrial Engineering and Management Ariel University

Distributed Constraint Reasoning

The nurses example Three Shifts: Three Nurses: Constraints: S1 8:00 – 16:00, S2 16:00 – 24:00, S3 24:00 – 8:00 Three Nurses: Nurses: Anna, Bella, Clarissa Constraints: Personal: Anna can’t work between 8:00 – 9:00 Bella Can’t work between 17:00 – 20:00 Clarissa Can’t work nights System: One nurse for every shift

Constraint Satisfaction Problem NP-complete problem, relevant for real-world problems such as timetabling, scheduling, verification... Structure: [V,D,R] (Variablesshifts , Domains of Valuesnurses, Constraints) V1, V2, … Vn [val1,val2,val3] [val1,val2] [val1,val2,val3]

A Distributed CSP example Two wards in a Hospital Nurses – ward 1: Diana, Emilia, Flora ward 2: Anna, Bella, Clarissa Anna, Bella, Diana are ‘Senior’ nurses In every shift there should be at least one senior nurse Local Constraint Inter Constraint One senior nurse S1 S1 S2 S2 S3 S3 Second ward First ward

The Project I am interested in: What happens when the variables in the constraint graph are not clustered according to the agents they belong to? Implications on performance Implications on privacy What needs to be done: Implementation on the AgentZero simulator (Java) Algorithmic work on the solution to the clustering problem

Secure Wireless Routing

A Wireless Mesh Network D

Routing misbehavior Misbehaving nodes Packets can be… Overloaded Selfish Malicious Packets can be… Delayed Dropped Corrupted Replayed 3 1 2

Watchdog [Mar’2000] B C A H G E F D L Wraf! J K I S M N O

AVOMIN – detecting misbehavior Detected Misbehavior C A H G E F D L J K I S M N O

AVOMIN – suspect list definition B C A H G E F D L J K I S M N O

The Project I am interested in: What is the performance of the algorithm in highly dynamic settings? What needs to be done: Implementation on some network simulator (ns2?) Experimentation on dynamic settings Algorithmic work on adjusting the algorithm to dynamic settings

Thank you for your attention! Email: talgr@ariel.ac.il

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2025 SlidePlayer.com. Inc. All rights reserved.