Message Dissemination Techniques in Opportunistic Underwater Sensor Networks

✍ Scribed by Linfeng Liu, Ran Wang, Jiagao Wu

• Publisher: Springer
• Year: 2020
• Tongue: English
• Leaves: 176
• Category: Library

✦ Synopsis

This book investigates the architectures and characteristics of OUSNs, the mobility models of OUSN nodes, the challenges of message dissemination, and some evaluation indexes of message dissemination. Then, this book provides some message dissemination techniques in OUSNs from the viewpoints of nodes and data messages, respectively. The proposed message dissemination techniques and their conclusions can provide some useful insights to improve the performance of data message dissemination and promote the future applications of OUSNs. Researchers and engineers in the field of underwater sensor networks can benefit from the book.

✦ Table of Contents

Acknowledgments
Contents
List of Figures
List of Tables
1 Introduction
1.1 Background
1.1.1 OUSNs
1.1.2 Message Dissemination Problem in OUSNs
1.2 Research Focus
1.3 Organization of This Book
References
2 Literature Review
2.1 Message Dissemination in DTNs and MSNs
2.2 Message Dissemination in OUSNs
2.3 Some Related Issues
2.3.1 Mobility Prediction
2.3.2 Network Throughput Optimization
2.3.3 Markov Decision Process in Message Dissemination
2.4 Conclusions
References
3 Message Dissemination in OUSNs with Mobility-Irregular Nodes
3.1 OUSN Model
3.1.1 Nodes
3.1.2 Links
3.1.3 Irregular Mobility Model
3.1.4 Problem Objectives
3.2 Message Dissemination Algorithm Based on Irregular Mobility
3.3 OFAIM Analysis
3.3.1 Complexity
3.3.2 Contacting Period and Separation Period
3.3.3 Delivery Ratio of OFAIM
3.4 Simulation Results and Discussions
3.4.1 Time Slot
3.4.2 Number of Disseminated Copies
3.4.3 µ1 and µ2
3.4.4 δ1 and δ2
3.4.5 Comparision with Other Algorithms
3.5 Conclusion
References
4 Message Dissemination in OUSNs with GPS-Free Nodes
4.1 OUSN Model
4.1.1 Underwater Mobility Model
4.1.2 Distribution Uniformity of Message Holders
4.1.3 Problem Objectives
4.2 Three Metrics Affecting the Accidental Encounters Between Nodes
4.2.1 Dynamical Percolation Model
4.2.2 Movement Speed
4.2.3 Time Slot Sequence
4.2.4 Distribution Uniformity
4.3 Message Dissemination Algorithm Based on GPS-free Nodes
4.4 GDFA Analysis
4.4.1 Complexity
4.4.2 Heterogeneity of Communication Ranges
4.5 Simulation Results and Discussions
4.5.1 Distribution Uniformity of Message Holders
4.5.2 Settings of α and β
4.5.3 Movement Range and Communication Range
4.5.4 Adaptability of GDFA to Delay Constraints
4.6 Conclusions
References
5 Propagation Control of Data Messages in OUSNs
5.1 Topology Determined Model
5.2 Dynamical Percolation Analysis
5.3 Proactive Opportunistic Forwarding Mechanism
5.4 POFM Analysis
5.4.1 Algorithm Complexity
5.4.2 Energy Consumption
5.5 Simulation Results and Discussions
5.5.1 Impacts of α and δ
5.5.2 Impacts of ε, β and γ
5.5.3 Communication Range
5.5.4 Comparisons with Other Algorithms
5.6 Conclusions
References
6 Freshness-Cost Ratio Optimization of Message Dissemination in OUSNs
6.1 Message Freshness and Problem Objectives
6.1.1 Message Freshness
6.1.2 Problem Objectives
6.2 Time-Inhomogeneous Ergodic Markov Chain for Message Dissemination
6.2.1 States Transitions Due to Node Movement
6.2.2 State Transitions Due to Message Dissemination
6.2.3 Time-Inhomogeneous Markov Chain
6.3 Message Dissemination Solutions
6.3.1 Markov Decision Process and Centralized Solution
6.3.2 Distributed Solution
6.4 MDM Analysis
6.4.1 Complexity
6.4.2 Expected Action
6.4.3 Approximation Ratio
6.5 Simulation Results and Discussions
6.5.1 MDM and Centralized MDP
6.5.2 Impacts of γ, N and K
6.5.3 Impacts of Rc, Rm and Ls
6.5.4 Algorithm Comparisons
6.6 Conclusions
References
7 Message Dissemination in Hybrid OUSNs with Storage-Limited Nodes
7.1 Hybrid OUSN Model
7.1.1 Mobility of Anchored Nodes
7.1.2 Problem Objectives
7.2 Problem Analysis
7.2.1 Case I: Network Throughput Without Storage Overflows
7.2.2 Case II: Network Throughput with Storage Overflows
7.2.3 Some Deductions
7.3 Message Dissemination Approach for Storage- Limited OUSNs
7.4 MDA-SL Analysis
7.4.1 Complexity
7.4.2 Impact of Node Storage Capacity
7.4.3 Approximation Ratio of Network Throughput
7.4.4 Variable Time Slot
7.5 Simulation Results and Discussions
7.5.1 Impacts of ε and ε
7.5.2 Impacts of Rc and Rm
7.5.3 Impacts of S, Na and Dlupp
7.5.4 Settings of overlineK and
7.5.5 Comparison with Centralized Method
7.5.6 Comparisons with Other Algorithms
7.6 Conclusions
References
8 Message Dissemination Based on Spatial-Temporal Common Neighbours in Hybrid OUSNs
8.1 Problem Formulation
8.1.1 Nomadic Community Mobility
8.1.2 Spatial-Temporal Common Neighbours
8.1.3 Measurement Deviation
8.2 Message Dissemination Algorithm Based on Spatial-Temporal Common Neighbours
8.3 MDA-SCN Analysis
8.3.1 Number of Neighbours of Nodes in the Same Nomadic Group
8.3.2 Number of Neighbours of Nodes in Different Nomadic Groups
8.3.3 Delivery Ratio and Delivery Delay
8.4 Simulation Results and Discussions
8.4.1 AUC and Precision
8.4.2 Impact of M on Delivery Ratio
8.4.3 Impacts of N
8.5 Conclusions
References
9 Summary and Future Work
9.1 Summary of Contributions
9.2 Future Work
9.2.1 Message Dissemination in OUSNs with Signal Irregularity
9.2.2 Message Dissemination in OUSNs with Other Mobility of Anchored Nodes
9.2.3 Trajectory Mining Based Message Dissemination in OUSNs
9.2.4 Secure Message Dissemination in OUSNs
References
Appendix A Main Notations Used in This Book
Appendix B Transmission Delay and Energy Consumption
B.1 Transmission Delay
B.2 Energy Consumption
Appendix C Expressions of dis(τ) and hop(τ)
Appendix D Underwater Force Vector, Settings of α and β in GDFA
D.1 Underwater Force Vector
D.2 Settings of α and β in GDFA
Appendix E CSMA Mechanism in POFM
Appendix F Probability of One Message Copy Disseminated into the 1st Inner Layer
Appendix G Expression of Rh("4262304 DluppTs"5263305 ) and Setting of overlineK
G.1 Expression of Rh("4262304 DluppTs"5263305 )
G.2 Setting of overlineK