scispace - formally typeset
Journal ArticleDOI

Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks

TLDR
A constant factor approximation algorithm is designed for MARPCP, which is much faster than the first method and shows an existing algorithm for MWDSP can produce an approximate solution forMARPCP.
Abstract
In this paper, we introduce a new clustering problem in underwater sensor networks, namely minimum average routing path clustering problem (MARPCP). To deal with the high complexity of MARPCP, we relax it to a special case of minimum weight dominating set problem (MWDSP). We show an existing algorithm for MWDSP can produce an approximate solution for MARPCP. Also, we design a constant factor approximation algorithm for MARPCP, which is much faster than the first method.

read more

Citations
More filters
Journal ArticleDOI

Data aggregation in underwater wireless sensor network: Recent approaches and issues

TL;DR: A paper based on the survey of UWSN with data aggregation to highlight its benefits and limitations and to build interest of research fraternity towards future challenges identified on the basis of survey of existing approaches.
Journal ArticleDOI

Energy Efficient Architecture for Intra and Inter Cluster Communication for Underwater Wireless Sensor Networks

TL;DR: The proposed Intra and Inter Cluster Communication for data aggregation in UWSN reduces the average energy consumption and end-to-end delay, thereby improving the packet delivery ratio and the main strength of the paper is to provide an optimal selection for CH.
Journal ArticleDOI

Protocol Stack of Underwater Wireless Sensor Network: Classical Approaches and New Trends

TL;DR: A broad survey of issues concerning underwater sensor networks is presented in this article, which provides an overview of test beds, routing protocols, experimental projects, simulation platforms, tools and analysis that are available with research fraternity.
Journal ArticleDOI

Improved Data Aggregation for Cluster Based Underwater Wireless Sensor Networks

TL;DR: An Improved Data Aggregation technique for Cluster Based UWSN is proposed where an efficient sleep-wake up algorithm is used for aggregating the sensed data and TDMA based transmission schedule is used to avoid intra and inter cluster collisions.
Journal ArticleDOI

Underwater Networked Wireless Sensor Data Collection for Computational Intelligence Techniques: Issues, Challenges, and Approaches.

TL;DR: The concept of data collection in UWSN along with its classification based on routing is summarized and a short discussion about existence of CORONA below the water along with water purification is carried out.
References
More filters
Journal ArticleDOI

Wireless sensor networks: a survey

TL;DR: The concept of sensor networks which has been made viable by the convergence of micro-electro-mechanical systems technology, wireless communications and digital electronics is described.
Proceedings ArticleDOI

Energy-efficient communication protocol for wireless microsensor networks

TL;DR: The Low-Energy Adaptive Clustering Hierarchy (LEACH) as mentioned in this paper is a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network.

Energy-efficient communication protocols for wireless microsensor networks

TL;DR: LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network, is proposed.
Journal ArticleDOI

Underwater acoustic sensor networks: research challenges

TL;DR: In this paper, several fundamental key aspects of underwater acoustic communications are investigated and a cross-layer approach to the integration of all communication functionalities is suggested.
Journal ArticleDOI

A Greedy Heuristic for the Set-Covering Problem

TL;DR: It turns out that the ratio between the two grows at most logarithmically in the largest column sum of A when all the components of cT are the same, which reduces to a theorem established previously by Johnson and Lovasz.
Related Papers (5)