COMSOC Talk:Collaborative Mobile Charging and Coverage in Wireless Sensor Networks

#COMSOC #Talk: #Collaborative #Mobile #Charging #and #Coverage #in #Wireless #Sensor #Networks #by #Jie #Wu #Laura #H. #Carnell #Professor #Temple #University
Share

COMSOC Talk: Collaborative Mobile Charging and Coverage in Wireless Sensor Networks by Jie Wu, Laura H. Carnell Professor, Temple University

  Date and Time

  Location

  Hosts

  Registration



  • Add_To_Calendar_icon Add Event to Calendar
  • New Jersey Institute of Technology
  • Newark, New Jersey
  • United States 07102
  • Building: Electrical and Computer Engineering
  • Room Number: 202
  • Click here for Map

  • Contact Event Host
  • For more information contact Nirwan Ansari (973)596-3670 and Amit Patel (a.j.patel@ieee.org). Check http://web.njit.edu/~ieeenj/comm.html for latest updates. Directions to NJIT can be found at: http://www.njit.edu/about/visit/gettingtonjit.php.
  • Starts 11 November 2013 09:15 PM UTC
  • Ends 15 November 2013 03:25 PM UTC
  • No Admission Charge


  Speakers

Prof. Jie Wu Prof. Jie Wu of Temple University

Topic:

Collaborative Mobile Charging and Coverage in Wireless Sensor Networks

About the Talk The limited battery capacity of sensor nodes has become the biggest impediment to wireless sensor networks (WSNs) applications over the years. Recent breakthroughs in wireless energy transfer provide a promising application of mobile vehicles. These mobile vehicles act as mobile chargers to transfer energy wirelessly to static sensors in an efficient way. In this talk, we discuss some of our recent results on several charging and coverage problems involving multiple mobile chargers. In collaborative mobile charging, a fixed charging location, called base station (BS), provides source of energy to mobile\ chargers, which in turn are allowed to recharge each other while collaboratively charge static sensors. The objective is to ensure sensor coverage while maximizing the ratio of the amount of payload energy (used to charge sensors) to overhead energy (used to move mobile chargers from one location to another), such that none of the sensors will run out of battery. Here, sensor coverage spans both dimensions of time and space. We first consider the uniform case, where all sensors consume energy at the same rate, and propose an optimal scheduling scheme that can cover a one-dimensional (1-D) WSN with infinite length. Then, we present several greedy scheduling solutions to 1-D WSNs with non-uniform sensors and 2-D WSNs, both of which are NP-hard. Finally, we study another variation, in which all mobile chargers have batteries of unlimited capacity without resorting to a BS for recharging. The objective is then to deploy and schedule a minimum number of mobile chargers that can cover all sensors. Again, we provide an optimal solution to this problem in a 1-D WSN with uniform sensors and a greedy solution with a competitive approximation ratio to the problem setting of a 1-D WSN with non-uniform sensors.

Biography: Jie Wu is the chair and a Laura H. Carnell Professor in the Department of Computer and Information Sciences at Temple University. Prior to joining Temple University, he was a program director at the National Science Foundation and Distinguished Professor at Florida Atlantic University. His current research interests include mobile computing and wireless networks, routing protocols, cloud and green computing, network trust and security, and social network applications. Dr. Wu regularly published in scholarly journals, conference proceedings, and books. He serves on several editorial boards, including IEEE Transactions on Computers, IEEE Transactions on Service Computing, and Journal of Parallel and Distributed Computing. Dr. Wu was general co-chair/chair for IEEE MASS 2006 and IEEE IPDPS 2008 and program co-chair for IEEE INFOCOM 2011. Currently, he is serving as general chair for IEEE ICDCS 2013 and ACM MobiHoc 2014, and program chair for CCF CNCC 2013. He was an IEEE Computer Society Distinguished Visitor, ACM Distinguished Speaker, and chair for the IEEE Technical Committee on Distributed Processing (TCDP). Dr. Wu is a CCF Distinguished Speaker and a Fellow of the IEEE. He is the recipient of the 2011 China Computer Federation (CCF) Overseas Outstanding Achievement Award.

Address:Pennsylvania, United States

Prof. Jie Wu of Temple University

Topic:

Collaborative Mobile Charging and Coverage in Wireless Sensor Networks

Biography:

Address:Pennsylvania, United States






Agenda

About the Talk

The limited battery capacity of sensor nodes has become the biggest impediment to wireless sensor networks (WSNs) applications over the years. Recent breakthroughs in wireless energy transfer provide a promising application of mobile vehicles. These mobile vehicles act as mobile chargers to transfer energy wirelessly to static sensors in an efficient way. In this talk, we discuss some of our recent results on several charging and coverage problems involving multiple mobile chargers. In collaborative mobile charging, a fixed charging location, called base station (BS), provides source of energy to mobile\ chargers, which in turn are allowed to recharge each other while collaboratively charge static sensors. The objective is to ensure sensor coverage while maximizing the ratio of the amount of payload energy (used to charge sensors) to overhead energy (used to move mobile chargers from one location to another), such that none of the sensors will run out of battery. Here, sensor coverage spans both dimensions of time and space. We first consider the uniform case, where all sensors consume energy at the same rate, and propose an optimal scheduling scheme that can cover a one-dimensional (1-D) WSN with infinite length. Then, we present several greedy scheduling solutions to 1-D WSNs with non-uniform sensors and 2-D WSNs, both of which are NP-hard. Finally, we study another variation, in which all mobile chargers have batteries of unlimited capacity without resorting to a BS for recharging. The objective is then to deploy and schedule a minimum number of mobile chargers that can cover all sensors. Again, we provide an optimal solution to this problem in a 1-D WSN with uniform sensors and a greedy solution with a competitive approximation ratio to the problem setting of a 1-D WSN with non-uniform sensors.