Viral Video Spread Over Human Space Maruf Hasan Zaber, Mehrab Bin Morshed, Md Habibullah Bin Ismail Department of Computer Science and Engineering (CSE),

Slides:



Advertisements
Similar presentations
Ranveer Chandra Ramasubramanian Venugopalan Ken Birman
Advertisements

Supporting Cooperative Caching in Disruption Tolerant Networks
Mobile Communication Networks Vahid Mirjalili Department of Mechanical Engineering Department of Biochemistry & Molecular Biology.
Roma 17/10/08 WORLD Project KO Meeting Laura Galluccio WORLD Project – KO Meeting University of Catania.
Wireless Computing & Tracking Geri Gay Professor Department of Communication, Computing and Information Science October 11, 2005.
IN-NETWORK VS CENTRALIZED PROCESSING FOR LIGHT DETECTION SYSTEM USING WIRELESS SENSOR NETWORKS Presentation by, Desai, Bhairav Solanki, Arpan.
Gossip algorithms : “infect forever” dynamics Low-level objectives: – One-to-all: Disseminate rumor from source node to all nodes of network – All-to-all:
Beyond Trilateration: On the Localizability of Wireless Ad Hoc Networks Reported by: 莫斌.
What’s the Problem Web Server 1 Web Server N Web system played an essential role in Proving and Retrieve information. Cause Overloaded Status and Longer.
PROMISE: Peer-to-Peer Media Streaming Using CollectCast Mohamed Hafeeda, Ahsan Habib et al. Presented By: Abhishek Gupta.
1 Next Century Challenges: Scalable Coordination in sensor Networks MOBICOMM (1999) Deborah Estrin, Ramesh Govindan, John Heidemann, Satish Kumar Presented.
Chien-Hao Chien, Shun-Yun Hu, Jehn-Ruey Jiang Adaptive Computing and Networking (ACN) Laboratory Department of Computer Science and Information Engineering.
1 Epidemic Spreading in Real Networks: an Eigenvalue Viewpoint Yang Wang Deepayan Chakrabarti Chenxi Wang Christos Faloutsos.
Matching Data Dissemination Algorithms to Application Requirements John Heidermann, Fabio Silva, Deborah Estrin Presented By: Bryan Wong.
Vivaldi Coordinate Service Justin Ma, Patrick Verkaik, Michael Vrable Department of Computer Science And Engineering UCSD CSE222A, Winter 2005.
1 Placement of Continuous Media in Wireless Peer-to-Peer Networks Shahram Ghadeharizadeh, Bhaskar Krishnamachari, Shanshan Song, IEEE Transactions on Multimedia,
Placement of Continuous Media in Wireless Peer-to-Peer Network Shahramram Ghandeharizadeh, Bhaskar Krishnamachari, and Shanshan Song IEEE Transactions.
Peer-to-Peer Based Multimedia Distribution Service Zhe Xiang, Qian Zhang, Wenwu Zhu, Zhensheng Zhang IEEE Transactions on Multimedia, Vol. 6, No. 2, April.
Building Efficient Wireless Sensor Networks with Low-Level Naming Presented by Ke Liu CS552, Fall 2002 Binghamton University J. Heidemann, F. Silva, C.
Quality-Aware Segment Transmission Scheduling in Peer-to-Peer Streaming Systems Cheng-Hsin Hsu Senior Research Scientist Deutsche Telekom R&D Lab USA Los.
Matching Data Dissemination Algorithms to Application Requirements John Heidermann, Fabio Silva, Deborah Estrin Presented by Cuong Le (CPSC538A)
1 TTS: A Two-Tiered Scheduling Algorithm for Effective Energy Conservation in Wireless Sensor Networks Nurcan Tezcan & Wenye Wang Department of Electrical.
Opportunistic Packet Scheduling and Media Access Control for Wireless LANs and Multi-hop Ad Hoc Networks Jianfeng Wang, Hongqiang Zhai and Yuguang Fang.
7DS: Node Cooperation in Mostly Disconnected Networks Henning Schulzrinne (joint work with Arezu Moghadan, Maria Papadopouli, Suman Srinivasan and Andy.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
Boyu Chen Yulin Xia Haoyu Xu Viterbi School of Engineering University of Southern California P2P file sharing system with a central server.
Spreading of Epidemic Based on Human and Animal Mobility Pattern
Ad Hoc Networking via Named Data Michael Meisel, Vasileios Pappas, and Lixia Zhang UCLA, IBM Research MobiArch’10, September 24, Shinhaeng.
Exploring VoD in P2P Swarming Systems By Siddhartha Annapureddy, Saikat Guha, Christos Gkantsidis, Dinan Gunawardena, Pablo Rodriguez Presented by Svetlana.
Energy Efficient Routing and Self-Configuring Networks Stephen B. Wicker Bart Selman Terrence L. Fine Carla Gomes Bhaskar KrishnamachariDepartment of CS.
1 Contact Prediction, Routing and Fast Information Spreading in Social Networks Kazem Jahanbakhsh Computer Science Department University of Victoria August.
Challenged Networking An Experimental Study of New Protocols and Architectures Erik Nordström.
Your Friends Have More Friends Than You Do: Identifying Influential Mobile Users Through Random Walks Bo Han, Aravind Srinivasan University of Maryland.
1 BitHoc: BitTorrent for wireless ad hoc networks Jointly with: Chadi Barakat Jayeoung Choi Anwar Al Hamra Thierry Turletti EPI PLANETE 28/02/2008 MAESTRO/PLANETE.
Runtime Authentication in Highly-Secured Network Systems Iftakhar Ahmad Department of Computer Science and Engineering.
Scheduling P2P Multimedia Streams: Can We Achieve Performance and Robustness? Luca Abeni, Csaba Kiraly, Renato Lo Cigno DISI – University of Trento, Italy.
Tracking with Unreliable Node Sequences Ziguo Zhong, Ting Zhu, Dan Wang and Tian He Computer Science and Engineering, University of Minnesota Infocom 2009.
V5 Epidemics on networks
Multicast Algorithms for Multi- Channel Wireless Mesh Networks Guokai Zeng, Bo Wang, Yong Ding, Li Xiao, Matt Mutka Department of Computer Science and.
CODE RED WORM PROPAGATION MODELING AND ANALYSIS Cliff Changchun Zou, Weibo Gong, Don Towsley.
Balanced k-Coverage in Visual Sensor Networks Md. Muntakim Sadik, Sakib Md. Bin Malek { mms, Department.
Martin-1 CSE 5810 CSE 5810 Individual Research Project: Integration of Named Data Networking for Improved Healthcare Data Handling Robert Martin Computer.
1 Delay Tolerant Network Routing Sathya Narayanan, Ph.D. Computer Science and Information Technology Program California State University, Monterey Bay.
Effects of P2P Streaming on Video Quality Csaba Kiraly, Luca Abeni, Renato Lo Cigno DISI – University of Trento, Italy
Off By One Power-Save Protocols Corey Andalora Keith Needels.
University of Stuttgart Institute of Parallel and Distributed Systems (IPVS) Breitwiesenstraße D Stuttgart An Epidemic Model for Information.
PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen.
Wireless communications and mobile computing conference, p.p , July 2011.
Most of contents are provided by the website Introduction TJTSD66: Advanced Topics in Social Media Dr.
Complex Network Theory – An Introduction Niloy Ganguly.
Multiuser Receiver Aware Multicast in CDMA-based Multihop Wireless Ad-hoc Networks Parmesh Ramanathan Department of ECE University of Wisconsin-Madison.
Complex Network Theory – An Introduction Niloy Ganguly.
Towards a Reference Quality Model for Digital Libraries Maristella Agosti Nicola Ferro Edward A. Fox Marcos André Gonçalves Bárbara Lagoeiro Moreira.
On Reducing Mesh Delay for Peer- to-Peer Live Streaming Dongni Ren, Y.-T. Hillman Li, S.-H. Gary Chan Department of Computer Science and Engineering The.
Knowledge sharing and creation in a teachers’ professional virtual community Presenter: Che-Yu Lin Advisor: Min-Puu Chen Date: August 5, Lin, F.,
ASSIGNMENT, DISTRIBUTION AND QOS PROVISIONING IN COMMUNICATION NETWORKS.
Enhanced MAC Protocol to reduce latency in Wireless Sensor Network Myungsub Lee 1, Changhyeon Park 2 1 Department of Computer Technology, Yeungnam College.
Brief Announcement : Measuring Robustness of Superpeer Topologies Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,
Evaluating Mobility Support in ZigBee Networks
Simple Ant Routing Algorithm Strategies for MANET Fernando Correia and Teresa Vazão Portuguese Naval Academy, 葡萄牙海軍學院 Ad Hoc Networks 2010.
A Deafness Free MAC Protocol for Ad Hoc Networks Using Directional Antennas Jia Feng, Pinyi Ren, and Shuangcheng Yan Department of Electronic Engineering.
Unit 19 Computer Music Systems 1 Examine the hardware options available for the composition and production of music using computer technology assess the.
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
Reliable Mobicast via Face- Aware Routing Qingfeng Huang,Chenyang Lu and Gruia-Catalin Roman Department of Computer Science and Engineering Washington.
Nuno Salta Supervisor: Manuel Ricardo Supervisor: Ricardo Morla
Extending wireless Ad-Hoc
Through University Faculty
Cloud-Assisted VR.
Cloud-Assisted VR.
Information Sciences and Systems Lab
Presentation transcript:

Viral Video Spread Over Human Space Maruf Hasan Zaber, Mehrab Bin Morshed, Md Habibullah Bin Ismail Department of Computer Science and Engineering (CSE), BUET Problem Definition: The ubiquitous nature of mobile phone has allowed it to be one of the major media of disseminating awareness information. Due to resource and compatibility constraint and low bandwidth availability, awareness information like Government Info are largely spread via text format. In this poster, we propose a novel approach of disseminating rich media content via peer to peer communication. Dissemination Protocol Dissemination protocol addresses which chunks to be disseminated to which node.  A set of initial nodes are selected who are given the full media content from a central source.  The file is divided into constituent chunks depending on the size of the content. Figure 2: Interchange of chunks between two connected nodes  The chunks to be selected can be retrieved in three fashions – i. Random. ii. Least Disseminated Content First iii. Round Robin Fashion  The node β, to be disseminated is selected at Random from set Figure 3: A hypothetical dissemination scenario References: [1] Kermack, W. O. McKendrick, A. G. (1927). "A Contribution to the Mathematical Theory of Epidemics". Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences115 (772): 700 [2] Agarwal, S.K., Kumar, A., Nanavati, A.A., and Rajput, N., Content Creation and Dissemination by-and-for Users in Rural Areas. ICTD, Doha, Qatar, Apr [3] John Heidemann, Fabio Silva, and Deborah Estrin Matching Data Dissemination Algorithms to Application Requirements. SenSys '03. Result Analysis: Our proposed dissemination protocol was simulated in Opportunistic Network Environment (ONE) simulator. Below we present the evaluation of one simulation instance in which random chunk selection was used. The parameters are as following – Simulation Time- 2300s, Node Number- 21, Chunk Size- 1MB, Movement- Random Walk Figure 3.1: Topology Figure 3.2: Graph Simulation was conducted with different data transmission rate. Background: Rich media content provides more effective way of learning than traditional text based content. Dissemination of rich media content to a targeted community via wireless technology is an interesting research direction. Our proposed dissemination technique is analogous to Susceptible, Infected & removed (SIR) Epidemic Model[1] which divides the file into constituent chunks and tends to spread them. Various disseminating techniques can be found in literature. Agarwal et al[2] showed that contents created and disseminated by users increased over time. John et al [3] adapted two new diffusion algorithms for many receivers to few senders and few receivers to many senders. Conclusion and Future Work: In this poster, we attempted to analyze a novel way of disseminating rich media files containing awareness information to a large population. We focused to the dissemination model and protocol. The three strategies we propose here need more robust investigation to prove their fruitfulness. Also the selection of initial seed peer is still largely unaddressed. In our future work, we look forward to focus in these issues.