2015 12th International Symposium on Programming and Systems (ISPS) 2015
DOI: 10.1109/isps.2015.7244965
|View full text |Cite
|
Sign up to set email alerts
|

Energy efficient routing for Mobile underwater wireless sensor networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
6
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 21 publications
0
6
0
Order By: Relevance
“…Furthermore, we consider homogeneous sensor nodes and non-clustered networks. Many previous works on SONs for UWSNs have also adopted a clustered architecture where the whole network is divided into several smaller groups for saving energy consumption during data gathering [ 7 , 8 , 9 , 10 , 11 ]. Huang et al proposed a clustering head selection algorithm (CHSA) [ 9 ] that reduces overall energy consumption by organizing direction-sensitive clusters.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Furthermore, we consider homogeneous sensor nodes and non-clustered networks. Many previous works on SONs for UWSNs have also adopted a clustered architecture where the whole network is divided into several smaller groups for saving energy consumption during data gathering [ 7 , 8 , 9 , 10 , 11 ]. Huang et al proposed a clustering head selection algorithm (CHSA) [ 9 ] that reduces overall energy consumption by organizing direction-sensitive clusters.…”
Section: Introductionmentioning
confidence: 99%
“…However, it is costly to set up separate devices such as the ultrashort baseline (USBL) system in each node. On the other hand, Sihem et al proposed two clustering algorithms, k-means cluster based energy efficient routing algorithm (KEER) and its enhanced version (EKEER) for mobile UWSNs [ 11 ]. They use the k-means technique for the selection of initial cluster-heads and then replace each one with the sensor node that has the highest remaining energy in the next round, thereby increasing the network’s lifetime.…”
Section: Introductionmentioning
confidence: 99%
“…Few cluster-based routing algorithms were proposed in the literature [4][5][6] ; these algorithms differ from each other by the way clusters are formed, the way the Cluster Head (CH) is elected, and the suggested intra-and inter-cluster data routing. For instance, in, 4 the authors propose a Distributed Underwater Clustering Scheme (DUCS) in which random rotation among nodes is used to distribute the energy consumption in the network, and the nodes with the highest energy levels are selected as CHs.…”
Section: Related Workmentioning
confidence: 99%
“…The CH then sends the aggregated data to the sink node using multi-hop routing. A K-means Energy Efficient Routing (KEER) cluster-based protocol is suggested in, 5 in which k-means algorithm is applied to initially select CHs based on their closeness to the center of the cluster; then in the next rounds, nodes elect the CH locally based on the remaining energy of every node. Nodes within the cluster send their data directly to the CH, who performs data aggregation, and transmits the remaining data directly to the sink.…”
Section: Related Workmentioning
confidence: 99%
“…15 Many UWSN routing protocols have been proposed recently. [16][17][18][19][20][21][22][23][24][25] We briefly review some of them in this section.…”
Section: Related Workmentioning
confidence: 99%