BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:Canada/Atlantic
BEGIN:DAYLIGHT
DTSTART:20180311T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0300
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZNAME:ADT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20181104T010000
TZOFFSETFROM:-0300
TZOFFSETTO:-0400
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZNAME:AST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20181112T173255Z
UID:82CCCF5C-7318-4B75-962D-D1F750188583
DTSTART;TZID=Canada/Atlantic:20180321T141500
DTEND;TZID=Canada/Atlantic:20180321T151500
DESCRIPTION:Coverage control is one of the most fundamental research issues
  for the deployment and performance of a wireless sensor network(WSN)\, re
 presenting the quality of surveillance that the network can provide. Due t
 o some unique characteristics of WSNs such as energy constraint and ad-hoc
  topology\, the coverage problems in sensor networks have many new scenari
 os and features that entitle them an important research issue in recent ye
 ars.\n\nFurthermore\, the sensor relocation problem (SR problem) is an imp
 ortant issue in coverage control. The main difference between SR problem a
 nd sensor deployment (SD) problem is that SR problem has a strict response
  time requirement. Because the SD problem occurs during network initializa
 tion\, so there is no strict response time requirement. The SD problem is 
 solved as long as the required coverage level is met. However\, the SR pro
 blem occurs during operation of WSNs\, we need to minimize the impact on t
 he surveillance task while replacing faulty sensors with redundant sensors
 .\n\nIn this talk\, sensor self-relocation problem based on confident info
 rmation coverage(CIC) model in WSNs is discussed. CIC model has many advan
 tages than disc coverage model\, so how to solve SR problem based on CIC m
 odel is a promising work. The proposed SR algorithm based on CIC model can
  achieve shorter response time and longer network lifetime by using cascad
 ed movement to move redundant sensors to faulty sensors and coverage holes
 .\n\nRoom: AX23A\, St Francis Xavier University\, Antigonish\, Nova Scotia
 \, Canada
LOCATION:Room: AX23A\, St Francis Xavier University\, Antigonish\, Nova Sco
 tia\, Canada
ORGANIZER:ltyang@gmail.com
SEQUENCE:1
SUMMARY:Sensor Self-Relocation in Mobile Wireless Sensor Networks
URL;VALUE=URI:https://events.vtools.ieee.org/m/170364
X-ALT-DESC:Description: <br /><p>Coverage control is one of the most fundam
 ental research issues for the deployment and performance of a wireless sen
 sor network(WSN)\, representing the quality of surveillance that the netwo
 rk can provide. Due to some unique characteristics of WSNs such as energy 
 constraint and ad-hoc topology\, the coverage problems in sensor networks 
 have many new scenarios and features that entitle them an important resear
 ch issue in recent years.</p>\n<p>Furthermore\, the sensor relocation prob
 lem (SR problem) is an important issue in coverage control. The main diffe
 rence between SR problem and sensor deployment (SD) problem is that SR pro
 blem has a strict response time requirement. Because the SD problem occurs
  during network initialization\, so there is no strict response time requi
 rement. The SD problem is solved as long as the required coverage level is
  met. However\, the SR problem occurs during operation of WSNs\, we need t
 o minimize the impact on the surveillance task while replacing faulty sens
 ors with redundant sensors.</p>\n<p>In this talk\, sensor self-relocation 
 problem based on confident information coverage(CIC) model in WSNs is disc
 ussed. CIC model has many advantages than disc coverage model\, so how to 
 solve SR problem based on CIC model is a promising work. The proposed SR a
 lgorithm based on CIC model can achieve shorter response time and longer n
 etwork lifetime by using cascaded movement to move redundant sensors to fa
 ulty sensors and coverage holes.</p>
END:VEVENT
END:VCALENDAR