2. Clustering In Mobile Networks Presented By: Assaf Mizrachi Shimrit Artzi Tutor: Dr. Michael Segal

3. Background And Motivation Problem: Today ’ s mobile networks consumes large amount of money for base-stations ’ construction and maintenance. Solution: Let go of base stations. Problem: How will the customers communicate? Solution: Make the mobile devices able to communicate between themselves. Each one of them can function as a “ mini ” base station itself.

4. Background And Motivation – Cont ’ d Q: What is the infrastructure of such network? A: It is composed of groups of nodes called “ clusters ”. The process is called “ clustering ”. Lets view the differences … The clustering determines the infrastructure of the network, which is called Ad-Hoc network. Each cluster has the attributes of a cell in cellular network.

5. Background And Motivation – Cont ’ d Cellular 1 2 A A A B C B B C C A A BB CC A1A2 wireless networkAd-Hoc

6. Proposed Algorithm For Clustering Requirements: Should be dynamic (i.e. adapts to the mobility of the nodes). Fast recovering from structure changes (events). Assumptions: Each node is represented as a disc with radius of its communication range (all has same radius). Each disc is able to detect whether it intersect another discs.

7. Algorithm For Clustering – Description Definitions: When two discs intersect, we say that one of them is piercing the other. We refer them as piercing and normal discs respectively. Define D – Group of all unpierced discs (initially they are all normal and unpierced). Lets see how it works …

8. P N N N P N N P N N N P Algorithm For Clustering - SET-UP Stage: 1. Randomly choose a disc d from D.2. Mark d as “ piercing ” disc.4. Remove d and all its neighbors from D.5. Repeat until D={ };3. Mark all its neighbors as normal. P

9. P N N N P N N P P N N N P NP PNN Algorithm For Clustering - UPDATE Stage: 1. If the boundary of one piercing disc d meets that of a another piercing disc, then Unmark d and all its neighbors. 2. If a normal disc d ’ meets no boundary of a piercing disc d, then unmark d ’. 3. Invoke Set-up.

10. P N N N P N N P P N N N P N P P N N Proposed Algorithm For Routing:

11. The Application We simulated the algorithm in C++. We created an interactive user interface which allows him to edit (i.e. enter/delete/remove) discs. We left space for him to enter applications which will run on the created network. We offered a routing protocol which is also a matter of future work.

12. Future Work Adding topography to the application. Motion prediction options. Improved routing protocol. Channel distribution.

13. The End