Occasionally Connected Wireless Sensor Networks for Search and Rescue and Wildlife Monitoring - PowerPoint PPT Presentation

Loading...

PPT – Occasionally Connected Wireless Sensor Networks for Search and Rescue and Wildlife Monitoring PowerPoint presentation | free to view - id: 1bca85-ZDc1Z



Loading


The Adobe Flash plugin is needed to view this content

Get the plugin now

View by Category
About This Presentation
Title:

Occasionally Connected Wireless Sensor Networks for Search and Rescue and Wildlife Monitoring

Description:

Occasionally Connected Wireless Sensor Networks for Search and Rescue and Wildlife Monitoring – PowerPoint PPT presentation

Number of Views:65
Avg rating:3.0/5.0
Slides: 37
Provided by: Jas3
Category:

less

Write a Comment
User Comments (0)
Transcript and Presenter's Notes

Title: Occasionally Connected Wireless Sensor Networks for Search and Rescue and Wildlife Monitoring


1
??????????????????????? - Occasionally Connected
Wireless Sensor Networks for Search and Rescue
and Wildlife Monitoring
  • ??? Jyh-How Huang
  • ???????? ????? ?????
  • Department of Computer Science
  • University of Colorado at Boulder

2
????
  • ????????????????
  • Cenwits ??????
  • ?????????????????
  • ?????????????
  • ??

3
??
  • ??????Wireless Sensor Networks(WSNs)
  • ?????????????,??CPU,???,??,???????????
  • ??????????????????,???????????????????????
  • ???????????Occasionally Connected Wireless Sensor
    Network(OCWSNs), Delay Tolerance Network(DTN)
  • ?????????,??????????????????????????
  • ????????????????
  • ???? ?????, ????
  • ???? ??????, ??????

4
???? ???????????????
5
Cenwits ??? ??????
  • ?? ????????,??????????????????????
  • ??,??,??
  • ?????????,????
  • ???????? ??????????????

6
?????
  • ?
  • GPS????????? ?,??
  • GPS???????????
  • ????? ???????
  • RFID ???? ?????????????
  • ????????,??,?????

7
??????
  • ????,???????,??????
  • ?,?(500??)
  • ???????????
  • ??????????
  • ??(??5002000)
  • ?????

8
Cenwits ?????? (I)
9
Cenwits ??????(II)
10
Cenwits ??????(III)
  • ???? 2359 ????? 6 ??

11
??1 ????????????
12
??? ????
  • MICA2 sensors
  • 900 MHz 4 KB SDRAM 128 KB flash and 4-512 KB
    EEPROM
  • Mantis OS 0.9.1b ????
  • MTS420CA GPS ???
  • ??????????????
  • ???????????????????????

13
??2 ?????????? ??? 1 A ? B ??? 2
????????????? ??? 3 C ? B
?????????2??????
14
???1?5?????,???6??????????????????????????6?????
15
Cenwits ??? ???????????
  • 20 ? 40 ????,???????????????????
  • ??????????????,????(Wi-Fi Internet Access),???
  • ??????????????????,????
  • ????????WiMax??????
  • ????????????,????????????,?????????????,?????????

16
??? ??????????
  • GPS ???,?,??,??????
  • ????? ?,?
  • ???????
  • VHF/UHF ??radio???
  • ?????
  • ?? ?,?
  • ???????????,????????????

17
GPS ??????????
  • ???????????50?
  • ?????????????????????
  • ??,?,???

18
??? ??????????
  • ??????????
  • ??????????,??,?,????
  • ???????????,??????????
  • ?????????????,??????????????

19
(No Transcript)
20
???????????
  • ?????? ??
  • ????????
  • ??,?,?
  • ????,??????????????
  • ?????????????????
  • ????????

21
??
  • ????????????
  • ????????,????
  • ??
  • ???????
  • ??
  • ????????????
  • ?????????????
  • ??????????????????
  • ??,????,????,??????????

22
  • ?
  • http//csel.cs.colorado.edu/huang/Cenwits/index.h
    tm
  • huangjh,mishras_at_colorado.edu

23
Possible Problems
  • Birds are fast, do we have enough time to
    transmit data?
  • Robust protocol for half transmitted data
  • When memory is full, how do we choose which
    records to overwrite?
  • If we have more than one carriers, how do we
    prevent misunderstanding?

24
(No Transcript)
25
????? ? RFID ??
332617
  • RFID ?????????ID???
  • ?????? ?????
  • ?????????
  • ???? DoS ??
  • ?????????????
  • ????????????
  • ???????
  • ????????????

26
Getting Info from AP
AP
a
Im AP Beacon AP Public Key Signed(Root CA)
IDAP_PKey Rnd AP_aSKey Mac(packet)AP_aMKey
Rnd 1 Dynamic ID Treadmill Table AP_aSKey
Mac(packet)AP_aMKey
27
Getting the Key Table
  • After verifying AP, the sensor node gets a keys
    list from AP, encrypted by symmetric key between
    them
  • The table contains which key to use when running
    into node with dynamic ID x

28
Getting the Weight Table
Weight Curve
  • Give the new node n entries that is on the field
    already and n to come
  • Dynamic IDs are assigned in inconsecutive order
  • Most important(Possibly Missing) Nodes Set

29
  • Beacon This is node 10
  • 8 Reply RndKey8_10 Mac(Packet)Key8_10
  • Rnd1 Rnd2 Record Vector 10Key_8_10
    Mac(Packet)Key8_10

10
8
  • Rnd21Key8_10
  • Record Vector 8
  • The list of what I want
  • Here are the records that you need
  • The list of what I want

There you go, records you want
30
????
  • ????
  • ????????????????????
  • ?????????????????????
  • 10 feet/sec Beacon period 10 seconds
  • 1 mile/hour Beacon period 1.7 minutes
  • No beacons during night time
  • Stay in receive or sleep mode depending on
    available power

31
Future Plans for Cenwits
  • Deployment in Yosemite NP summer 2006 with Shiv
    and Rick and Alberto
  • Security Implementation and conference paper
    summer 2006 with Shiv and John
  • Patent and larger scale experiment fall 2006
    with CU Tech Transfer Center

32
Future Plans for WildSense
  • Develop protocols for wildlife monitoring Fall
    2006 with Tom and Shiv
  • Implement prototype and simulate the birds and
    mammals with UAVs and R/C tanks Winter 2006
    with Tom and Shiv and Rick and Aerospace
    department
  • Tune the protocol and publish conference paper
    Spring 2007

33
Current Loosely Coupled Systems
  • ZebraNet
  • At each scan for neighbors
  • if node(I am) is within range of BS
  • send data to BS and delete this data
  • else send data to all neighbors

34
Memory Management
  • MAX RECORD COUNT
  • Replace the old record with new one of the same
    node and keep the total records of a node less
    than MAX_RECORD_COUNT
  • MAX HOP COUNT
  • Dont forward a packet that has high probability
    of reaching AP already
  • MIN RECORD GAP
  • When 2 records are recorded in a time gap lt
    MIN_RECORD_GAP, replace the old one with new one.

35
Exchanging Data Vectors Get only want you need
  • Each node is given a range of record IDs it can
    use
  • Whenever it fills up an empty record, it changes
    the index bit to 1
  • e.g. fills up record 1 100001 gt 110001
  • Two nodes exchange their record vectors and find
    out what they need from each other

36
Why using timestamp from GPS is inefficient?
  • There are 31536000 seconds in a year, needs 25
    bits to represent that
About PowerShow.com