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

Donghyun Kim; Wei Wang; Ling Ding; Jihwan Lim; Heekuck Oh; Weili Wu

doi:10.1007/s11590-009-0168-z

ScienceGate Book Chapters

JOURNAL ARTICLE

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

Donghyun Kim Wei Wang Ling Ding Jihwan Lim Heekuck Oh Weili Wu

Year: 2009 Journal: Optimization Letters Vol: 4 (3)Pages: 383-392 Publisher: Springer Science+Business Media

DOI: 10.1007/s11590-009-0168-z

Get Full-Text PDF Get Analytical Report

Keywords:

Cluster analysis Computational intelligence Computer science Routing (electronic design automation) Path (computing) Wireless sensor network Approximation algorithm Mathematical optimization Mathematics Algorithm Artificial intelligence Computer network

Metrics

Cited By

0.69

FWCI (Field Weighted Citation Impact)

Refs

0.77

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Energy Efficient Wireless Sensor Networks

Physical Sciences → Computer Science → Computer Networks and Communications

Underwater Vehicles and Communication Systems

Physical Sciences → Engineering → Ocean Engineering

Mobile Ad Hoc Networks

Physical Sciences → Computer Science → Computer Networks and Communications

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

Metrics

Citation History

Topics

Related Documents

A BETTER APPROXIMATION FOR MINIMUM AVERAGE ROUTING PATH CLUSTERING PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS

An Artificial Bee Colony Algorithm for the Minimum Average Routing Path Clustering Problem in Multi-hop Underwater Sensor Networks

Shortest Average Routing Path-Based d-hop Clustering in wireless sensor networks

A PTAS FOR MINIMUM d-HOP UNDERWATER SINK PLACEMENT PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS

A novel multi-hop distributed clustering-based routing protocol for underwater wireless sensor networks