1 / 17

Distributed System Final presentation

Benoit Starck Ho Namkoong Honoré Mahler. Distributed System Final presentation. Caching ressource states in MANET. I. Related works II. Design Considerations III. Proposed scheme IV. Implementation V. Results evaluation Conclusion References. Introduction.

heidi
Download Presentation

Distributed System Final presentation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Benoit Starck Ho Namkoong Honoré Mahler Distributed System Final presentation

  2. Caching ressource states in MANET I. Relatedworks II. Design Considerations III. Proposedscheme IV. Implementation V. Resultsevaluation Conclusion References

  3. Introduction • MANET : Mobile Adhoc Network • Work in clustering scheme : • Claimed node reports their state to HEAD node periodically, and they query to HEAD node if some resource states are necessary. => Overhead • Our purpose is reducing the overhead of the cluster head while not increasing overall overhead.

  4. Related Works • Left one is proposed by C. Tuduce and T. Gross • Only cluster header can answer to query. • If target node is located in outer cluster, query/reply mechanism takes place between cluster heads. • Right one is proposed by K. Kwak, G. Huerta, Y. Ko, D. Lee and S. Hyun • It adopted clustering algorithm from left one. • This scheme inserts important group semantics and makes topology based on those semantics. • Group coordinator collects group information by sending join request (JREQ) message, and other member query to group coordinator to get the group information.

  5. Design Consideration • Allowing claimed node to treat the query: • Queries  go from cluster head to cluster head, using in-between intermediate nodes (gateways) • Inprevious scheme, only cluster head can answer to query because claimed node does not have enough information about routing path and topology. • If claimed node can answer, it does not have to forward packet to cluster head, and its overhead may decrease.

  6. DesignConsideration (cont. ) • Piggybacking RS in queries, along with RS cache • Queries without piggybacking • Total broadcast = (packet header + message) x n • n is the amount of message sent. • Queries with piggybacking • Total broadcast = (packet header + message x p) x m • p is the number of message which will be consolidated into one packet, m is the number of total hop distance.

  7. ProposedScheme A D C H B E G F Piggybacking all the cached RS in queries.

  8. Proposed Scheme (cont. ) C[B,D,F] J A[B] D[C,E,F,I,H] I F B[A,C] H E • Allow intermediate nodes to answer the queries, if their up-to-date data match the request • A wants to know I & H state :

  9. Implementation : Process • 1. If resource request happens, it forwards query to the destination. • 2. WHILE packet is forwarding • 2.1 Merge piggybacked data with my saved data • 2.2 IF we go to destination and current node contains a valid resource (TTL is not outdated) • THEN go to source • ELSE (step 2)

  10. Implementation : Overview • Main classes : • Network : All the nodes of our application. They receive the messages and replies. • Node : represented by a unique id, coordinates, the cluster it belong to, list of cached resources states • Message : Contains the piggybacked data and the requested resources state. • ResourceState : object with the id of the node it belongs, a TTL (Time To Leave), a type of data, and the data itself • Request : Manage the message forwarding, contains the path from destination to source. • Simulator : launch the request according to a time-table

  11. Implementation : Choices • Own made Java Simulator • Use discrete time, like token mechanism • Keeptrack of Network’s bandwidth, message number • TTL based on nowadays standards, our utilization • Battery : 5h=300min => TTL:3min (1% of precision) • Disk Space : 2min

  12. Results

  13. Results

  14. Results

  15. Resultsevaluation - Our scheme leads to inconvenient results and is inexploitable. • The use of cache wastebandwidth and the trade-off between number of message and their size is wrong balanced. • Further improvement could be achieved by a more precise selection of cached data. • Use of a real simulator like NS2 to enhance reliability of the simulation.

  16. Thank you for your attention ! Questions ?

  17. References [1] H. Calituiro-Monge, K. Almeroth, M. Alvarez-Rohena, “Friend Relay: a Resource Sharing Framework for Mobile wireless Devices,” in Proceedings of the 4th international Workshop on Wireless Mobile Applications and Services on WLAN Hotspots, 2006, pp 20~29. [2] C. Tuduce and T. Gross, “Resource Monitoring Issues in Ad Hoc Networks,” in International Workshop on Wireless Ad-hoc Networks, 2004, pp 259~264. [3] K. Kwak, G. Huerta-Canepa, Y. Ko, D. Lee and S. Hyun, “An Overlay-based Resource Monitoring Scheme for Social Applications in MANET”, in 2009 33rd Annual IEEE International Computer Software and Applications Conference, 2009. [4] P. Gupta and P. R. Kumar, “The Capacity of Wireless Networks,” in IEEE Trans. Inf. Theory, vol. 46, pp. 388-404, March 2000. [5] J. Li, C. Blake, D. S. J. D. Couto, H. I. Lee, and R. Morris, “Capacity of Ad Hoc Wireless Networks,” in Mobile Comp. Net., pp 61~69, 2001. [6] M. Gerla, T. J. Kwon, and G. Pei, “On-demand routing in large ad hoc wireless networks with passive clustering,” In Proc. Wireless Comm. And Networking Conf., vol 1, pp 23~28, Sept. 2000 [7] A Selective Push Algorithm for Cooperative Cache Consistency Maintenance over MANETsYu Huang1,2, Beihong Jin3, Jiannong Cao4, Guangzhong Sun5, Yulin Feng3 [8] MANET: An Alternative Approach to ReduceFlooding by PropagatingNeighborhood InformationBalakrishnan C1, Sudarsun S2, Bharathi Mani3, Srinivasa Ragavan4 [9] KaixinXu, Mario Gerla and Sang Bae: Effectiveness of RTS/CTS handshake in IEEE 802.11 based ad hoc networks 

More Related