KAIS T Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua MobiCom ‘05 Presentation by.

Slides:



Advertisements
Similar presentations
Advisor : Prof. Yu-Chee Tseng Student : Yi-Chen Lu 12009/06/26.
Advertisements

Multirate adaptive awake-sleep cycle in hierarchical heterogeneous sensor network BY HELAL CHOWDHURY presented by : Helal Chowdhury Telecommunication laboratory,
A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks Hwee-Xian TAN and Mun Choon CHAN Department of Computer Science, School of Computing.
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,
POWER EFFICIENCY ROUTING ALGORITHMS OF WIRELESS SENSOR NETWORKS
An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Network
Delay-Minimized Route Design for Wireless Sensor-Actuator Networks Edith C.-H. Ngai 1, Jiangchuan Liu 2, and Michael R. Lyu 1 1 Department of Computer.
IEEE MASS 2007, Pisa, Italy9 Oct An Adaptive Delay-Minimized Route Design for Wireless Sensor-Actuator Networks Edith C.-H. Ngai 1, Jiangchuan Liu.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
1 Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
1 On Handling QoS Traffic in Wireless Sensor Networks 吳勇慶.
Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.
Efficient Hop ID based Routing for Sparse Ad Hoc Networks Yao Zhao 1, Bo Li 2, Qian Zhang 2, Yan Chen 1, Wenwu Zhu 3 1 Lab for Internet & Security Technology,
Layered Diffusion based Coverage Control in Wireless Sensor Networks Wang, Bang; Fu, Cheng; Lim, Hock Beng; Local Computer Networks, LCN nd.
1-1 CMPE 259 Sensor Networks Katia Obraczka Winter 2005 Routing Protocols II.
Load Balancing Routing Scheme in Mars Sensor Network CS 215 Winter 2001 Term Project Prof : Mario Gerla Tutor: Xiaoyan Hong Student : Hanbiao Wang & Qingying.
Talha Naeem Qureshi Joint work with Tauseef Shah and Nadeem Javaid
Yanyan Yang, Yunhuai Liu, and Lionel M. Ni Department of Computer Science and Engineering, Hong Kong University of Science and Technology IEEE MASS 2009.
An Energy Efficient WSN for a Video Surveillance System (Timeline for Literature Review) By Pakpoom Hoyingcharoen 3 November 2008 (2/2551)
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
LPT for Data Aggregation in Wireless Sensor Networks Marc Lee and Vincent W.S. Wong Department of Electrical and Computer Engineering, University of British.
Miao Zhao, Ming Ma and Yuanyuan Yang
SoftCOM 2005: 13 th International Conference on Software, Telecommunications and Computer Networks September 15-17, 2005, Marina Frapa - Split, Croatia.
1 Heterogeneity in Multi-Hop Wireless Networks Nitin H. Vaidya University of Illinois at Urbana-Champaign © 2003 Vaidya.
Scalable Data Aggregation for Dynamic Events in Sensor Networks Kai-Wei Fan Kai-Wei Fan, Sha Liu, and Prasun.
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
Boundary Recognition in Sensor Networks by Topology Methods Yue Wang, Jie Gao Dept. of Computer Science Stony Brook University Stony Brook, NY Joseph S.B.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
A Power Saving MAC Protocol for Wireless Networks Technical Report July 2002 Eun-Sun Jung Texas A&M University, College Station Nitin H. Vaidya University.
Lan F.Akyildiz,Weilian Su, Erdal Cayirci,and Yogesh sankarasubramaniam IEEE Communications Magazine 2002 Speaker:earl A Survey on Sensor Networks.
Multipath Routing for Wireless Sensor Networks: a Hybrid between Source Routing and Diffusion Techniques Mohamed Ebada Systems Science Program University.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
Bounded relay hop mobile data gathering in wireless sensor networks
A Dead-End Free Topology Maintenance Protocol for Geographic Forwarding in Wireless Sensor Networks IEEE Transactions on Computers, vol. 60, no. 11, November.
Network and Systems Laboratory nslab.ee.ntu.edu.tw Branislav Kusy, Christian Richter, Wen Hu, Mikhail Afanasyev, Raja Jurdak, Michael Brunig, David Abbott,
On the Topology of Wireless Sensor Networks Sen Yang, Xinbing Wang, Luoyi Fu Department of Electronic Engineering, Shanghai Jiao Tong University, China.
By Naeem Amjad 1.  Challenges  Introduction  Motivation  First Order Radio Model  Proposed Scheme  Simulations And Results  Conclusion 2.
1 VISA: Virtual Scanning Algorithm for Dynamic Protection of Road Networks IEEE Infocom’09, Rio de Janeiro, Brazil Jaehoon Jeong (Paul), Yu Gu, Tian He.
S& EDG: Scalable and Efficient Data Gathering Routing Protocol for Underwater Wireless Sensor Networks 1 Prepared by: Naveed Ilyas MS(EE), CIIT, Islamabad,
Node Reclamation and Replacement for Long-lived Sensor Networks Bin Tong, Wensheng Zhang, and Chuang Wang Department of Computer Science, Iowa State University.
Maximization of System Lifetime for Data-Centric Wireless Sensor Networks 指導教授:林永松 博士 具資料集縮能力無線感測網路 系統生命週期之最大化 研究生:郭文政 國立臺灣大學資訊管理學研究所碩士論文審查 民國 95 年 7 月.
A Wakeup Scheme for Sensor Networks: Achieving Balance between Energy Saving and End-to-end Delay Xue Yang, Nitin H.Vaidya Department of Electrical and.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
Node failure tolerance in wireless sensor networks CS 2310 Seminar Mengsi Lou.
Ching-Ju Lin Institute of Networking and Multimedia NTU
Energy-Efficient Wake-Up Scheduling for Data Collection and Aggregation Yanwei Wu, Member, IEEE, Xiang-Yang Li, Senior Member, IEEE, YunHao Liu, Senior.
Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
Delivery ratio-maximized wakeup scheduling for ultra-low duty-cycled WSNs under real-time constraints Fei Yang, Isabelle Augé-Blum National Institute of.
Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,
U of Minnesota DIWANS'061 Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and.
Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
Prolonging the Lifetime of Wireless Sensor Networks via Unequal Clustering Stanislava Soro Wendi B. Heinzelman University of Rochester IPDPS 2005.
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.
GholamHossein Ekbatanifard, Reza Monsefi, Mohammad H. Yaghmaee M., Seyed Amin Hosseini S. ELSEVIER Computer Networks 2012 Queen-MAC: A quorum-based energy-efficient.
“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.
4 Introduction Carrier-sensing Range Network Model Distributed Data Collection Simulation 6 Conclusion 2.
Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime Z. Maria Wang, Emanuel Melachrinoudis Department of Mechanical and Industrial Engineering.
Abstract 1/2 Wireless Sensor Networks (WSNs) having limited power resource report sensed data to the Base Station (BS) that requires high energy usage.
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)
Unpredictable Software-based Attestation Solution for Node Compromise Detection in Mobile WSN Xinyu Jin 1 Pasd Putthapipat 1 Deng Pan 1 Niki Pissinou 1.
Wireless Access and Networking Technology (WANT) Lab. An Efficient Data Aggregation Approach for Large Scale Wireless Sensor Networks Globecom 2010 Lutful.
Wireless sensor and actor networks: research challenges Ian. F. Akyildiz, Ismail H. Kasimoglu
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Energy Efficiency Energy consumption is the most important factor to determine the life of sensor network. since sensors networks has low power resources,
Providing Application QoS through Intelligent Sensor Management
Distributed Energy Efficient Clustering (DEEC) Routing Protocol
On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks High-Speed Networking Lab. Dept. of CSIE,
Distributed Minimum-Cost Clustering for Underwater Sensor Networks
Presentation transcript:

KAIS T Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua MobiCom ‘05 Presentation by Mrinalini Sawhney Network & Security Lab (Dept of Computer Science, KAIST)

2 Using mobile relays to prolong the lifetime of WSNs Contents Introduction & Motivation Use of mobile nodes as relays or sinks Related works Energy conservation methods with mobile relay Static routing Dynamic routing Network lifetime comparison Lifetime upper bounds using Mobile relay Proposed algorithms Aggregation Routing Algorithm (ARA) Aggregation Routing Algorithm with Limited Nodes (ARALAN) Performance Evaluations Conclusions

3 Using mobile relays to prolong the lifetime of WSNs Introduction [1/4] [1] – Yang et al, How to prolong the lifetime of Wireless Sensor Network. Investigate the benefits of a heterogeneous architecture for WSN composed of a few resource rich mobile nodes and a large number of simple static nodes and a large number of simple static nodes Mobile Relays or Mobile Sinks

4 Using mobile relays to prolong the lifetime of WSNs Motivation [1/2] Scenario 2 -> very economical What about performance improvement from mobile node and the tradeoffs associated ?? Scenario 1 Deploy a million static nodes 15 cents per node Total deployment cost = $150,000 Scenario 2 Few expensive resource rich mobile nodes and many simple static nodes 10 $100 each 100,000 static 15 cents/node Total deployment cost = $16,000 VS

5 Using mobile relays to prolong the lifetime of WSNs Introduction [3/4] Sample network Two components are connected via sensor nodes A & B Lifetime of these two nodes is T Both A & B are the critical bottleneck nodes in the network Use of a mobile node doubles network lifetime Shuttles between node A & B Inherits the responsibility of the node with which its co-located

6 Using mobile relays to prolong the lifetime of WSNs Introduction [4/4] Mobile Node could be either Mobile relay or, Mobile Sink Analyze the lifetime for 3 different cases using different routing algorithms When the network is all static When there is one mobile sink When there is one mobile relay

7 Using mobile relays to prolong the lifetime of WSNs Related Works Shah et al., “Data Mules: Modeling a three-tier architecture for sparse sensor networks”, in proceedings of the IEEE Wkshp, on Sensor network Protocols and Applications (SNPA) 2003 Charkabarti et al., “Using Predictable Observer Mobility for Power Efficient Design of Sensor Network” The 2 nd Int’l Wkshp on Information Processing in Sensor Networks (IPSN), 2003 Gandham et al., “Energy Efficient schemes for wireless sensor networks with multiple mobile base stations” in proceedings of IEEE GLOBECOM, DEC 2003 Shankar et al., “Maximum lifetime routing in in wireless ad-hoc networks,”, in proceedings of 23 rd IEEE INFOCOM, Mar 2004 ….. Disadvantages Mobile sink needs to roam around the network All nodes in the network need to be aware of the current location of the mobile sink

8 Using mobile relays to prolong the lifetime of WSNs Energy Conservation Methods with Mobile Relays Static Routing Sensors know the location of mobile relays and redirect their packets through them Lifetime extended by u i time units Sort the original lifetime of static nodes in increasing order {( l 1, u 1 ), ( l 2, u 2 ), …., ( l n, u n )} Stays in a sleep mode for duration u i

9 Using mobile relays to prolong the lifetime of WSNs Energy Conservation Methods with Mobile Relays Dynamic Routing Routes to the sink depend upon the position of the mobile relay Focus of this paper S S

10 Using mobile relays to prolong the lifetime of WSNs Lifetime Improvement by using a Mobile Relay

11 Using mobile relays to prolong the lifetime of WSNs Lifetime Upper Bounds Without mobile relay, the lifetime upper bound is in the network With one mobile relay, the lifetime upper bound is With m mobile relays, the lifetime upper bound is A mobile relay needs to stay only within a two hop radius of the sink in order to maximize the lifetime

12 Using mobile relays to prolong the lifetime of WSNs Aggregation Routing Algorithm (ARA) [1/2] Routing Algorithm -> set of all nodes which can reach the sink with 2 hops -> set of all nodes outside the range Q2 O M

13 Using mobile relays to prolong the lifetime of WSNs Aggregation Routing Algorithm (ARA) [2/2] The # of nodes in a 3 is always greater than the sum of that in area a 1 and a 2 There are 4ρ candidates for aggregate node

14 Using mobile relays to prolong the lifetime of WSNs Another Proposed Algorithm Merits of ARA Efficient upper bound of Drawbacks of ARA algorithm Every node needs to know the position of the mobile This is a huge overhead Aggregation Routing Algorithm with Limited Nodes (ARALAN) Only a limited number of nodes in the network need to know the location of the mobile relay The upper bound is maintained

15 Using mobile relays to prolong the lifetime of WSNs Aggregation Routing Algorithm with Limited Nodes (ARALAN) Use of shortest path routing Once the information reaches Ps Relay it to the aggregation ring – Ring s,r Information reaches aggregation rings Travels through a series of aggregation rings before it reaches the aggregation node When the traffic reaches OM, its routed hop by hop

16 Using mobile relays to prolong the lifetime of WSNs Performance Performance of Mobile Sink Approach Lifetime would be atleast O(R) times better than static approach Mobile relay Approach Need to use O(R) nodes to achieve the same performance

17 Using mobile relays to prolong the lifetime of WSNs Performance Evaluations With one mobile relay Scenario Radius = 4 density = 4 # of nodes = % improvement

18 Using mobile relays to prolong the lifetime of WSNs Performance Evaluations

19 Using mobile relays to prolong the lifetime of WSNs Conclusions Investigates the possibility of Using the mobile node as a relay Using the mobile node as a sink Mobile sink always beneficial but application scenario is not feasible With one mobile relay lifetime improvement of up to four times over the static approach One static rich resource can improve the lifetime by 60% One mobile relay can increase by almost 300%