Athanasios Kinalis ∗, Sotiris Nikoletseas ∗, Dimitra Patroumpa ∗, Jose Rolim† ∗ University of Patras and Computer Technology Institute, Patras, Greece.

Slides:



Advertisements
Similar presentations
Min Song 1, Yanxiao Zhao 1, Jun Wang 1, E. K. Park 2 1 Old Dominion University, USA 2 University of Missouri at Kansas City, USA IEEE ICC 2009 A High Throughput.
Advertisements

Dynamic Object Tracking in Wireless Sensor Networks Tzung-Shi Chen 1, Wen-Hwa Liao 2, Ming-De Huang 3, and Hua-Wen Tsai 4 1 National University of Tainan,
SELF-ORGANIZING MEDIA ACCESS MECHANISM OF A WIRELESS SENSOR NETWORK AHM QUAMRUZZAMAN.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Decentralized Reactive Clustering in Sensor Networks Yingyue Xu April 26, 2015.
An Energy Efficient Routing Protocol for Cluster-Based Wireless Sensor Networks Using Ant Colony Optimization Ali-Asghar Salehpour, Babak Mirmobin, Ali.
Source-Location Privacy Protection in Wireless Sensor Network Presented by: Yufei Xu Xin Wu Da Teng.
IEEE MASS 2007, Pisa, Italy9 Oct An Adaptive Delay-Minimized Route Design for Wireless Sensor-Actuator Networks Edith C.-H. Ngai 1, Jiangchuan Liu.
1 On Handling QoS Traffic in Wireless Sensor Networks 吳勇慶.
1 A Delay-Aware Reliable Event Reporting Framework for Wireless Sensor-Actuator Networks Presented by Edith Ngai Supervised by Prof. Michael R. Lyu Term.
Self Organization and Energy Efficient TDMA MAC Protocol by Wake Up For Wireless Sensor Networks Zhihui Chen; Ashfaq Khokhar ECE/CS Dept., University of.
1 TTS: A Two-Tiered Scheduling Algorithm for Effective Energy Conservation in Wireless Sensor Networks Nurcan Tezcan & Wenye Wang Department of Electrical.
LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.
Layered Diffusion based Coverage Control in Wireless Sensor Networks Wang, Bang; Fu, Cheng; Lim, Hock Beng; Local Computer Networks, LCN nd.
Mechanical Transport of Bits - Part II Jue Wang and Runhe Zhang EE206A In-class presentation May 5, 2004.
Prepared By Eda Baykan Supervisors Jun Luo, Jean-Pierre Hubaux, Jacques Panchard ROUTING TOWARDS A MOBILE SINK.
Energy Aware Directed Diffusion for Wireless Sensor Networks Jisul Choe, 2Keecheon Kim Konkuk University, Seoul, Korea
Delay-aware Routing in Low Duty-Cycle Wireless Sensor Networks Guodong Sun and Bin Xu Computer Science and Technology Department Tsinghua University, Beijing,
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
LPT for Data Aggregation in Wireless Sensor Networks Marc Lee and Vincent W.S. Wong Department of Electrical and Computer Engineering, University of British.
A Sweeper Scheme for Localization and Mobility Prediction in Underwater Acoustic Sensor Networks K. T. DharanC. Srimathi*Soo-Hyun Park VIT University Vellore,
A Framework for Energy- Saving Data Gathering Using Two-Phase Clustering in Wireless Sensor Networks Wook Chio, Prateek Shah, and Sajal K. Das Center for.
The Chinese Univ. of Hong Kong Dept. of Computer Science & Engineering POWER-SPEED A Power-Controlled Real-Time Data Transport Protocol for Wireless Sensor-Actuator.
SoftCOM 2005: 13 th International Conference on Software, Telecommunications and Computer Networks September 15-17, 2005, Marina Frapa - Split, Croatia.
Patch Based Mobile Sink Movement By Salman Saeed Khan Omar Oreifej.
Efficient Deployment Algorithms for Prolonging Network Lifetime and Ensuring Coverage in Wireless Sensor Networks Yong-hwan Kim Korea.
1 An Adaptive Energy-Efficient and Low-Latency MAC for Data Gathering in Wireless Sensor Network Gang Lu, Bhaskar Krishnamachari, and Cauligi Raghavendra.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Multi-Resolution Spatial and Temporal Coding in a Wireless Sensor Network for Long-Term Monitoring Applications You-Chiun Wang, Member, IEEE, Yao-Yu Hsieh,
Presentation of Wireless sensor network A New Energy Aware Routing Protocol for Wireless Multimedia Sensor Networks Supporting QoS 王 文 毅
Collision-free Time Slot Reuse in Multi-hop Wireless Sensor Networks
Reducing Energy Consumption in Human- centric Wireless Sensor Networks The 2012 IEEE International Conference on Systems, Man, and Cybernetics October.
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
Efficient Energy Management Protocol for Target Tracking Sensor Networks X. Du, F. Lin Department of Computer Science North Dakota State University Fargo,
A SURVEY OF MAC PROTOCOLS FOR WIRELESS SENSOR NETWORKS
Bounded relay hop mobile data gathering in wireless sensor networks
Dr. Sudharman K. Jayaweera and Amila Kariyapperuma ECE Department University of New Mexico Ankur Sharma Department of ECE Indian Institute of Technology,
MMAC: A Mobility- Adaptive, Collision-Free MAC Protocol for Wireless Sensor Networks Muneeb Ali, Tashfeen Suleman, and Zartash Afzal Uzmi IEEE Performance,
Comparison of Tarry’s Algorithm and Awerbuch’s Algorithm Mike Yuan CS 6/73201 Advanced Operating Systems Fall 2007 Dr. Nesterenko.
Maximizing Lifetime per Unit Cost in Wireless Sensor Networks
Murat Demirbas Onur Soysal SUNY Buffalo Ali Saman Tosun U. San Antonio Data Salmon: A greedy mobile basestation protocol for efficient data collection.
Comparison of Tarry’s Algorithm and Awerbuch’s Algorithm CS 6/73201 Advanced Operating System Presentation by: Sanjitkumar Patel.
Ching-Ju Lin Institute of Networking and Multimedia NTU
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
Delivery ratio-maximized wakeup scheduling for ultra-low duty-cycled WSNs under real-time constraints Fei Yang, Isabelle Augé-Blum National Institute of.
Data Gathering in Wireless Sensor Networks with Mobile Collectors Ming Ma and Yuanyuan Yang State University of New York, Stony Brook 1 IEEE Parallel and.
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
An Enhanced Cross-Layer Protocol for Energy Efficiency in Wireless Sensor Networks Jaehyun Kim, Dept. of Electrical & Electronic Eng., Yonsei University;
A Load-Balanced Guiding Navigation Protocol in Wireless Sensor Networks Wen-Tsuen Chen Department of Computer Science National Tsing Hua University Po-Yu.
2016/2/19 H igh- S peed N etworking L ab. Using Soft-line Recursive Response to Improve Query Aggregation in Wireless Sensor Networks High-Speed Networking.
FERMA: An Efficient Geocasting Protocol for Wireless Sensor Networks with Multiple Target Regions Young-Mi Song, Sung-Hee Lee and Young- Bae Ko Ajou University.
Grid-Based Energy-Efficient Routing from Multiple Sources to Multiple Mobile Sinks in Wireless Sensor Networks Kisuk Kweon, Hojin Ghim, Jaeyoung Hong and.
“LPCH and UDLPCH: Location-aware Routing Techniques in WSNs”. Y. Khan, N. Javaid, M. J. Khan, Y. Ahmad, M. H. Zubair, S. A. Shah.
Toward Reliable and Efficient Reporting in Wireless Sensor Networks Authors: Fatma Bouabdallah Nizar Bouabdallah Raouf Boutaba.
Connected Point Coverage in Wireless Sensor Networks using Robust Spanning Trees IEEE ICDCSW, 2011 Pouya Ostovari Department of Computer and Information.
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
EASE: An Energy-Efficient In-Network Storage Scheme for Object Tracking in Sensor Networks Jianliang Xu Department of Computer Science Hong Kong Baptist.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
Deploying Sensors for Maximum Coverage in Sensor Network Ruay-Shiung Chang Shuo-Hung Wang National Dong Hwa University IEEE International Wireless Communications.
Wireless Access and Networking Technology (WANT) Lab. An Efficient Data Aggregation Approach for Large Scale Wireless Sensor Networks Globecom 2010 Lutful.
1 Hierarchical Data Dissemination Scheme for Large Scale Sensor Networks Anand Visvanathan and Jitender Deogun Department of Computer Science and Engg,
AN EFFICIENT TDMA SCHEME WITH DYNAMIC SLOT ASSIGNMENT IN CLUSTERED WIRELESS SENSOR NETWORKS Shafiq U. Hashmi, Jahangir H. Sarker, Hussein T. Mouftah and.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
MAC Protocols for Sensor Networks
Efficient Route Update Protocol for Wireless Sensor Networks Xuhui Hu, Yong Liu, Myung J. Lee, Tarek N. Saadawi City University of New York, City College.
MAC Protocols for Sensor Networks
2010 IEEE Global Telecommunications Conference (GLOBECOM 2010)
Intelligent Fluid infrastructure for Embedded Networks Aman Kansal, Arun A Somasundara, David D Jea, Mani B Srivastava, Deborah Estrin. University of California,
ABSTRACT   Recent work has shown that sink mobility along a constrained path can improve the energy efficiency in wireless sensor networks. Due to the.
Presentation transcript:

Athanasios Kinalis ∗, Sotiris Nikoletseas ∗, Dimitra Patroumpa ∗, Jose Rolim† ∗ University of Patras and Computer Technology Institute, Patras, Greece †Centre Universitaire d’ Informatique, Geneva, Switzerland IEEE Globecom2009 Biased Sink Mobility with Adaptive Stop Times for Low Latency Data Collection in Sensor Networks

Outline Introduction Network model The proposed scheme Simulation Conclusion

Introduction As the sensed data are forwarded to the sink node in the WSN Settings have increased implementation complexity Sensor devices consume significant amounts of energy Sensor node Sink node

Introduction A approach has been introduced that shifts the burden of acquiring the data, from the sensor nodes to the sink. Help conserve energy since data is transmitted over fewer hops. Many apparent difficulties arise as well since traversing the network in a timely and efficient way is critical. high density of sensors in an area some sensors have recorded a significant amount of data

Introduction High delivery delays Even data loss A B

Goal They propose biased sink mobility with adaptive stop times, as a method for efficient data collection in wireless sensor networks. reduces latency delivery success rate

Network model The sink can accurately calculate its position The sink can aware of the dimensions and boundaries of the network area The sensor of sensing range R D D j j Sensor node Sink node

Scheme Network Traversal Deterministic Walk Biased Random Walk Calculation of Stop Time

Deterministic Walk j j A Sensor node Sink node

Biased Random Walk The probability p(f) v of visiting a neighboring vertex v AB C D E 2 Sensor node Sink node

E total is the total initial energy of all the sensors in the network T total_stop represents the maximum total amount of time the sink can remain stationary. n is the number of sensors of the network Calculation of Stop Time ε i the initial energy of each sensor i. T sim is the total time that the experiment is performed E total the maximum amount of energy consumed when sending a message the average event generation rate the energy spent when the sensors remain idle

T total_stop_round is the maximum amount of time that the sink will remain static in each round. represents the maximum total amount of time the sink can remain stationary Calculation of Stop Time the algorithm evolves in r rounds

Constant stop time. Adaptive stop time. the maximum amount of time that the sink will remain static in each round Calculation of Stop Time the density in cell i

Calculation of Stop Time Example AB C D d = 1 d A = 1.5 d B = 1.2 d C = 0.5 d D =

The maximum time the sink can stay in cell i is T adapi. If the sensors empty their memory before T adapi expires, the sink leaves the cell Otherwise, it leaves at the end of T adapi, even if there exist more data to be sent. The sink waits for messages to arrive for a submultiple of T adapi if no messages arrive during that time, it leaves the cell. Calculation of Stop Time

Simulation Simulatorns − 2 the size of the network area200m × 200m sensor nodes300 the speed of the mobile sink s ∈ {4, 8, 10, 20}m/s The initial energy reserves of the nodes5.5 Joules The data is generated at an average rate1 message/10 sec

Simulation SCD (Stop to Collect Data), one of the algorithms proposed in [6]. In SCD, the mobile sink stops when receiving new data. A. Kansal, A. Somasundara, D. Jea, M. Srivastava, and D. Estrin, “Intelligent fluid infrastructure for embedded networks,” in 2nd ACM/USENIX International Conference on Mobile Systems, Applications, and Services (MobiSys04), 2004.

Simulation SCD (Stop to Collect Data), one of the algorithms proposed in [6]. In SCD, the mobile sink stops when receiving new data. A. Kansal, A. Somasundara, D. Jea, M. Srivastava, and D. Estrin, “Intelligent fluid infrastructure for embedded networks,” in 2nd ACM/USENIX International Conference on Mobile Systems, Applications, and Services (MobiSys04), 2004.

Conclusion They propose both randomized mobility and deterministic traversals. They adaptive stop times lead to significantly reduced latency and keeping the delivery success rate.

Thank you ~