Using Pattern of Social Dynamics in the Design of Social Networks of Sensors - Marello Tomasini, Franco Zambonelli, Ronaldo Menezes 한국기술교육대학교 전기전자통신 공학부.

Slides:



Advertisements
Similar presentations
Cooperative Transmit Power Estimation under Wireless Fading Murtaza Zafer (IBM US), Bongjun Ko (IBM US), Ivan W. Ho (Imperial College, UK) and Chatschik.
Advertisements

Mobile Communication Networks Vahid Mirjalili Department of Mechanical Engineering Department of Biochemistry & Molecular Biology.
On the Coverage Problem in Video- based Wireless Sensor Networks Stanislava Soro Wendi Heinzelman University of Rochester.
The Mobile MIMO Channel and Its Measurements
Optimal Jamming Attacks and Network Defense Policies in Wireless Sensor Networks Mingyan Li, Iordanis Koutsopoulos, Radha Poovendran (InfoComm ’07) Presented.
Computer Science 1 CSC 774 Advanced Network Security Enhancing Source-Location Privacy in Sensor Network Routing (ICDCS ’05) Brian Rogers Nov. 21, 2005.
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
COMMUNICATION IN MULTIROBOT TEAMS - BARATH CHRISTOPHER PETIT.
1 School of Computing Science Simon Fraser University, Canada PCP: A Probabilistic Coverage Protocol for Wireless Sensor Networks Mohamed Hefeeda and Hossein.
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.
Differentiated Surveillance for Sensor Networks Ting Yan, Tian He, John A. Stankovic CS294-1 Jonathan Hui November 20, 2003.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
1 Efficient Retrieval of User Contents in MANETs Marco Fiore, Claudio Casetti, Carla-Fabiana Chiasserini Dipartimento di Elettronica, Politecnico di Torino,
A Hierarchical Energy-Efficient Framework for Data Aggregation in Wireless Sensor Networks IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 55, NO. 3, MAY.
Avoiding Energy Holes in Wireless Sensor Network with Nonuniform Node Distribution Xiaobing Wu, Guihai Chen and Sajal K. Das Parallel and Distributed Systems.
1 TTS: A Two-Tiered Scheduling Algorithm for Effective Energy Conservation in Wireless Sensor Networks Nurcan Tezcan & Wenye Wang Department of Electrical.
Extending Network Lifetime for Precision-Constrained Data Aggregation in Wireless Sensor Networks Xueyan Tang School of Computer Engineering Nanyang Technological.
1 Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network Prof. Yu-Chee Tseng Department of Computer Science National Chiao-Tung University.
Adaptive Self-Configuring Sensor Network Topologies ns-2 simulation & performance analysis Zhenghua Fu Ben Greenstein Petros Zerfos.
Speed and Direction Prediction- based localization for Mobile Wireless Sensor Networks Imane BENKHELIFA and Samira MOUSSAOUI Computer Science Department.
Fundamental Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks Yuanzhong Xu, Xinbing Wang Shanghai Jiao Tong University, China.
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
Decentralized Scattering of Wake-up Times in Wireless Sensor Networks Amy L. Murphy ITC-IRST, Trento, Italy joint work with Alessandro Giusti, Politecnico.
Lifetime and Coverage Guarantees Through Distributed Coordinate- Free Sensor Activation ACM MOBICOM 2009.
07/21/2005 Senmetrics1 Xin Liu Computer Science Department University of California, Davis Joint work with P. Mohapatra On the Deployment of Wireless Sensor.
Demo. Overview Overall the project has two main goals: 1) Develop a method to use sensor data to determine behavior probability. 2) Use the behavior probability.
Mutual Exclusion in Wireless Sensor and Actor Networks IEEE SECON 2006 Ramanuja Vedantham, Zhenyun Zhuang and Raghupathy Sivakumar Presented.
1 Heterogeneity in Multi-Hop Wireless Networks Nitin H. Vaidya University of Illinois at Urbana-Champaign © 2003 Vaidya.
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
Patch Based Mobile Sink Movement By Salman Saeed Khan Omar Oreifej.
DARP: Distance-Aware Relay Placement in WiMAX Mesh Networks Weiyi Zhang *, Shi Bai *, Guoliang Xue §, Jian Tang †, Chonggang Wang ‡ * Department of Computer.
Efficient Deployment Algorithms for Prolonging Network Lifetime and Ensuring Coverage in Wireless Sensor Networks Yong-hwan Kim Korea.
Minimum Average Routing Path Clustering Problem in Multi-hop 2-D Underwater Sensor Networks Presented By Donghyun Kim Data Communication and Data Management.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Selfishness, Altruism and Message Spreading in Mobile Social Networks September 2012 In-Seok Kang
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
1 Virtual Patrol : A New Power Conservation Design for Surveillance Using Sensor Networks Prasant Mohapatra, Chao Gui Computer Science Dept. Univ. California,
A Distributed Coordination Framework for Wireless Sensor and Actor Networks Tommaso Melodia, Dario Pompili, Vehbi C.Gungor, Ian F.Akyildiz (MobiHoc 2005)
Selection and Navigation of Mobile sensor Nodes Using a Sensor Network Atul Verma, Hemjit Sawant and Jindong Tan Department of Electrical and Computer.
REECH ME: Regional Energy Efficient Cluster Heads based on Maximum Energy Routing Protocol Prepared by: Arslan Haider. 1.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
A new Ad Hoc Positioning System 컴퓨터 공학과 오영준.
Preserving Location Privacy in Wireless LANs Jiang, Wang and Hu MobiSys 2007 Presenter: Bibudh Lahiri.
Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.
Trade-offs Between Mobility and Density for Coverage in Wireless Sensor Networks Wei Wang, Vikram Srinivasan and Kee-Chaing Chua National University of.
11/25/2015 Wireless Sensor Networks COE 499 Localization Tarek Sheltami KFUPM CCSE COE 1.
MMAC: A Mobility- Adaptive, Collision-Free MAC Protocol for Wireless Sensor Networks Muneeb Ali, Tashfeen Suleman, and Zartash Afzal Uzmi IEEE Performance,
By Naeem Amjad 1.  Challenges  Introduction  Motivation  First Order Radio Model  Proposed Scheme  Simulations And Results  Conclusion 2.
Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.
Performance Evaluation of Mobile Hotspots in Densely Deployed WLAN Environments Presented by Li Wen Fang Personal Indoor and Mobile Radio Communications.
KAIS T Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua MobiCom ‘05 Presentation by.
Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,
Sporadic model building for efficiency enhancement of the hierarchical BOA Genetic Programming and Evolvable Machines (2008) 9: Martin Pelikan, Kumara.
Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks Ming Ma and Yuanyuan Yang Department of Electrical & Computer Engineering.
Mobility Increases the Connectivity of K-hop Clustered Wireless Networks Qingsi Wang, Xinbing Wang and Xiaojun Lin.
Toward Reliable and Efficient Reporting in Wireless Sensor Networks Authors: Fatma Bouabdallah Nizar Bouabdallah Raouf Boutaba.
Communications Range Analysis Simulation Set Up –Single Biological Threat placed in Soldier Field –Communication range varied from meters –Sensor.
Strong Barrier Coverage of Wireless Sensor Networks Benyuan Liu, Olivier Dousse, Jie Wang and Anwar Saipulla University of Massachusetts Lowell and Deutsche.
Black Holes. Escape Velocity The minimum velocity needed to leave the vicinity of a body without ever being pulled back by the body’s gravity is the escape.
Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network You-Chiun Wang, Chun-Chi Hu, and Yu-Chee Tseng IEEE Transactions on Mobile Computing.
KAIS T Sensor Deployment Based on Virtual Forces Reference: Yi Zou and Krishnendu Chakarabarty, “Sensor Deployment and Target Localization Based on Virtual.
A Coverage-Preserving and Hole Tolerant Based Scheme for the Irregular Sensing Range in WSNs Azzedine Boukerche, Xin Fei PARADISE Research Lab Univeristy.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
DYNAMICS OF CITY BIKE SHARING NETWORKS Kasia Samson & Claudio Durastanti.
Wireless sensor and actor networks: research challenges Ian. F. Akyildiz, Ismail H. Kasimoglu
Privacy Vulnerability of Published Anonymous Mobility Traces Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip (Purdue University) Nageswara S. V. Rao (Oak.
SEP routing protocol in WSN
Leach routing protocol in WSN
Leach routing protocol in WSN
Presentation transcript:

Using Pattern of Social Dynamics in the Design of Social Networks of Sensors - Marello Tomasini, Franco Zambonelli, Ronaldo Menezes 한국기술교육대학교 전기전자통신 공학부 CIS LAB 지선호

Outline Ⅰ Ⅰ II III Ⅳ Ⅳ Ⅴ Ⅴ

What is the issue? Issue Model features - Mobile sensors are carried by people - The human mobility patterns have been modeled based on the most common social mobility pattern for urban. - Static sensors are assumed to be deploy uniformly around the environment. Elucidated the relationship between detection and report time in SNoS. the existence of a lower and a higher threshold in the percentage of mobile sensors Evaluate the performance of urban SNoS Social Network of Sensors(SNoS) de facto ; sensor networks Social Dynamics - carried by people. - SNoS can be mobile without requiring any energy to achieve mobility. Mobile node in SNoS - patrolling and monitoring environment - wireless sensor node is not be possible or economically feasible - improve network efficiency - eliminate “blind spot of coverage”

The Model Benchmarking of two issues in sensor networkMain GoalRepresentation of environment Static Sensors Mobile Sensors Sensor Distributed along the regular lattice Distributed based on a negative exponential probability from the center of the city

The Model Representation of environment Static Sensors Mobile Sensors Distributed along the regular lattice sink event the sink is the place to report the event (e.g., a police station) The event is the item we want to detect (e.g., a fire, an explosion) Distributed based on a negative exponential probability from the center of the city

The Model Representation of environment Mobile Sensor s placed the sink and the event in the environment at a distance D = 60 from each other approximately 80% of mobile sensors are included within this circle Fig. 1. Setup of a simulation with 441 static nodes (violet triangles) and 220 mobile nodes (green people). The event is marked with a red cross and the sink with a blue flag. Symbols are just for display convenience and they do not reflect the real size of a sensor.

The Simulation NetLogo fully parameterized and supports many spatial distributions of sensors and different kinds of walks A simulation starts in a given configuration and while time is passing, mobile sensors move accordingly to the specified model, exploring the environment. A sensor will detect the event. From that point the information spread to other sensors when they are within communication range. The simulation stops when one of the sensors with the information about the event finds the sink node. Start and Stop Simul

The Simulation Assume a boolean sensor network with fixed sensor radius r both for mobile and static sensors (Routing Condition) It is hard to synchronize a tick to real - world units (e.g. seconds), so the wait-time cutoff has been arbitrarily set to k2 = 5 ticks Value setting

The Expreimental Result Assume A network made of only static sensors Value setting -the simulator reaches tick number 5 -Cost problem : decrease the radius of the sensors so that r = 2.5 then tsim 10 ticks which is 2 times longer than the reference setup : the number of sensors would have to quadruple to a minimum of ns = 1681 Result

The Expreimental Result Assume Add an increasing percentage of mobile sensors - 10% (44), 20% (88), 30%(132), 40% (176), 50% (220), 60% (265) Value setting -the detection time of static sensors is always 0 if none of them can see the event or 1 if at least one can see the event. Result

The Expreimental Result Assume A hybrid sensor network is using normalized values - values according to the worst-case with (tD10% and tR10%) representing the scenario where only 10% of mobile sensors are present. -The normalized values clearly show that detection time drops very quickly to a little fraction of tD10%, while report time improves but more slowly. -This leads to another observation that detection time becomes less relevant with the increase in the number of mobile sensors and the bottleneck is the time to report the event to the sink -Preferential return pattern : asymmetry between detection time and report time Result

The Expreimental Result Assume -SPEEDUP RELATIVE THE SLOWEST CONFIGURATION WITH 10% OF MOBILE SENSORS -a scenario where all nodes are mobile. -we can set a lower bound as tmin = tDmin +tRmin that must be respected. -The weights ωD = 1− ωR and ωR = tR/(tD + tR) of tD and tR to calculate the general speedup as Sp = ωDSD + ωRSR. -a limited amount of mobile sensors the mixed configuration is faster. -Lower detection time is a consequence of the better coverage of the periphery and the high sensor density allows a quick spreading of the event till the sink. Result

The Expreimental Result -they move, they are able to “see” areas of the environment that would not otherwise be seen. -With this in mind the total time of the simulation, tsim = tD + tR, decreases rapidly, as shown in Figs. 3 and 4, which tells us that adding more mobile sensors may not help after some saturation point -it should be noted that the performances both of a fully mobile or a mixed network cannot be compared to an ideal fully connected static network because a fully connected network is fast (although expensive). Result

Conclusion Since most of mobile sensors are near the center of the city, it is worthless to have static sensors in that place because it is already well covered. Due to the urban population density distribution and the greater relevance of report time over detection time, to maximize performances the best sink deployment is in the center of the city. There are two thresholds. A lower-bound threshold that ensures that mobile sensors achieve a high enough density and a higher-bound threshold over which it is not worth the addition of more mobile sensors because they do not provide a significant improvement in the performance. The human mobility model may not be the best to patrol an area; this is because the preferential return should lead to a strong overlapping of areas, which in a real environment is only partially mitigated by the different locations different users visit.