ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai,...
-
Upload
agatha-hodge -
Category
Documents
-
view
213 -
download
0
Transcript of ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai,...
![Page 1: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/1.jpg)
ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks
Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin
IEEE INFOCOM 2009
![Page 2: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/2.jpg)
Outline Introduction Related Work ST-MAC Framework Performance Evaluation Conclusion
![Page 3: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/3.jpg)
Introduction Similar to terrestrial sensors, energy efficienc
y is critical considerations in UWSNs unlike terrestrial sensor utilize acoustic waves propagation is slower than RF
In UWSNs, must consider the locations of the receiver and potential interferers “Spatial-Temporal Uncertainty”
![Page 4: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/4.jpg)
Spatial-Temporal Uncertainty
![Page 5: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/5.jpg)
TDMA-based MAC protocols To utilize time slots efficiently, the vertex
coloring scheme is used for scheduling Propose a novel heuristic algorithm, called
Traffic-based + One-Step Trial Approach (TOTA)
Model the scheduling problem as a Mixed Integer Linear Programming (MILP) model
![Page 6: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/6.jpg)
ST-MAC Framework Most of underwater sensors are deployed to
get data of interest periodically Each node can estimate signal-to-noise-ratio
determining interference relationships measuring the propagation delay
ST-MAC is to compute the schedule each sensor nodes knows when to switch to
sleeping mode
![Page 7: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/7.jpg)
ST-GG Construction Base station can acquire the routing topology
G(V,E), V is a set of sensors E denotes a set of transmission links
Define PD(vi, vj) as the propagation delay between node vi and vj
![Page 8: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/8.jpg)
Spatial-Temporal Conflict Graph Spatial-Temporal Conflict Graph (ST-CG), a
directed graph G(V ,E) V = E and E is the set of conflict relationships bet
ween any two transmissions Conflict relation Conflict(u → v),
exists if transmission of link u affects reception of link v
![Page 9: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/9.jpg)
Example of Conflict
![Page 10: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/10.jpg)
Two Links With Common Node Case 1.1: u.dst = v.dst
Case 1.2: u.src = v.src
Case 1.3: u.src = v.dst
![Page 11: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/11.jpg)
Two Links Without Common Nodes
![Page 12: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/12.jpg)
Two Links Without Common Nodes Case 2.1: ONLY one of INTER(u, v) and INT
ER(v, u) is TRUE cc,d = −3
Case 2.2: both INTER(u, v) and INTER(v, u) are TRUE conflict delays cb,c = −4 and cc,b = −2
![Page 13: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/13.jpg)
Traffic-based One-step Trial ApproachS
MReal
MTest
![Page 14: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/14.jpg)
Traffic-based One-step Trial Approach
MReal
MTest
S
![Page 15: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/15.jpg)
Theoretical Analysis Propose mixed Integer Linear Programming
model solve the new type of the vertex-coloring problem
in ST-CG optimally as a benchmark to quantitatively evaluate the
performance of existing heuristic methods
![Page 16: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/16.jpg)
Propagation Delay Constraint
Modified equations by using the Big-M method
binary variable used to transform disjunction
![Page 17: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/17.jpg)
Inter-frame Constraint Transmission of link j in next frame must not
conflict with the reception of link I
Transmission of link i in the next frame must not conflict with the reception of link j
![Page 18: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/18.jpg)
Minimize Problem
![Page 19: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/19.jpg)
Performance Evaluation All simulations are implemented in NS2 Two different scales
the small topology case: 6 - 12 nodes the large-topology case: 81 - 144 nodes
![Page 20: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/20.jpg)
Small Central-Sink Topology
![Page 21: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/21.jpg)
Large Central-Sink Topology
![Page 22: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/22.jpg)
Large Cluster-Sink Topology
![Page 23: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/23.jpg)
Energy Cost
![Page 24: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/24.jpg)
Unknown Traffic Scenarios
![Page 25: ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks Chih-Cheng Hsu, Kuang-Fu Lai, Cheng-Fu Chou, Kate Ching-Ju Lin IEEE INFOCOM 2009.](https://reader035.fdocuments.us/reader035/viewer/2022070415/5697bfd01a28abf838caabac/html5/thumbnails/25.jpg)
Conclusion Proposes a TDMA-based scheduling to solve
Spatial-Temporal Uncertainty in UWSNs Construct ST-CG that includes the propagatio
n delay information present TOTA, to solve more effectively
Derive a MILP formulation solving the optimal solution of the vertex-colorin
g problem in ST-CG graph