scholarly journals Elements of Hyperstructure Theory in UWSN Design and Data Aggregation

Symmetry ◽  
2019 ◽  
Vol 11 (6) ◽  
pp. 734 ◽  
Author(s):  
Michal Novák ◽  
Štepán Křehlík ◽  
Kyriakos Ovaliadis
Keyword(s):  
Mathematical Model ◽  
Data Aggregation ◽  
Algebraic Theory ◽  
Memory Capacity ◽  
Point Of View ◽  
Wireless Sensor ◽  
Aggregation Process ◽  
Underwater Wireless Sensor Networks ◽  
Quasi Order ◽  
Algebraic Hyperstructure

In our paper we discuss how elements of algebraic hyperstructure theory can be used in the context of underwater wireless sensor networks (UWSN). We present a mathematical model which makes use of the fact that when deploying nodes or operating the network we, from the mathematical point of view, regard an operation (or a hyperoperation) and a binary relation. In this part of the paper we relate our context to already existing topics of the algebraic hyperstructure theory such as quasi-order hypergroups, E L -hyperstructures, or ordered hyperstructures. Furthermore, we make use of the theory of quasi-automata (or rather, semiautomata) to relate the process of UWSN data aggregation to the existing algebraic theory of quasi-automata and their hyperstructure generalization. We show that the process of data aggregation can be seen as an automaton, or rather its hyperstructure generalization, with states representing stages of the data aggregation process of cluster protocols and describing available/used memory capacity of the network.

scholarly journals Hierarchical classification of time series data aggregation in underwater wireless sensor networks

2020 ◽  
Vol 37 (2) ◽  
pp. 53-64
Author(s):  
Durairaj Ruby ◽  
Jayachandran Jeyachidra
Keyword(s):  
Time Series ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Error Rate ◽  
Data Aggregation ◽  
Hierarchical Classification ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks

Environmental fluctuations are continuous and provide opportunities for further exploration, including the study of overground, as well as underground and submarine, strata. Underwater wireless sensor networks (UWSNs) facilitate the study of ocean-based submarine and marine parameters details and data. Hardware plays a major role in monitoring marine parameters; however, protecting the hardware deployed in water can be difficult. To extend the lifespan of the hardware, the inputs, processing and output cycles may be reduced, thus minimising the consumption of energy and increasing the lifespan of the devices. In the present study, time series similarity check (TSSC) algorithm is applied to the real-time sensed data to identify repeated and duplicated occurrences of data for reduction, and thus improve energy consumption. Hierarchical classification of ANOVA approach (HCAA) applies ANOVA (analysis of variance) statistical analysis model to calculate error analysis for realtime sensed data. To avoid repeated occurrences, the scheduled time to read measurements may be extended, thereby reducing the energy consumption of the node. The shorter time interval of observations leads to a higher error rate with lesser accuracy. TSSC and HCAA data aggregation models help to minimise the error rate and improve accuracy.

scholarly journals Collision Avoidance and Dynamic Sleep Scheduling Technique for Cluster Based Underwater Wireless Sensor Networks (UWSN)

2021 ◽  
Author(s):  
D. Anuradha ◽  
S. Suresh ◽  
P. Muneeshwari
Keyword(s):  
Data Aggregation ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Sleep Scheduling ◽  
Underwater Wireless Sensor Networks ◽  
Data Packets ◽  
Scheduling Scheme ◽  
Design Protocol ◽  
To Receive ◽  
Scheduling Technique

Abstract In UWSN, during clustering, there may be occurrence of intra cluster collision. In order to overcome this issue, in this paper, we propose to design protocol to efficiently handle the intra-cluster collisions and to design sleep-wake up scheduling scheme for the data aggregation. In this case, the cluster head coordinates with its cluster members to transmit (append) their data packets with partially overlapping transmission times. After the CH finishes transmitting its packets to the courier nodes, it starts to receive incoming appended packets from its members. It then sends the packet to its parent CH towards the sink applying data fusion and sending the aggregated packet in TDMA period based on the receiver oriented sleep scheduling scheme. By simulation results, we show that the proposed technique minimizes collision and transmission delay.

Sign in / Sign up

Export Citation Format

Share Document