Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks
- 25 December 2009
- journal article
- research article
- Published by Springer Science and Business Media LLC in Optimization Letters
- Vol. 4 (3), 383-392
- https://doi.org/10.1007/s11590-009-0168-z
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A BETTER APPROXIMATION FOR MINIMUM AVERAGE ROUTING PATH CLUSTERING PROBLEM IN 2-D UNDERWATER SENSOR NETWORKSDiscrete Mathematics, Algorithms and Applications, 2009
- A 5+ϵ-approximation algorithm for minimum weighted dominating set in unit disk graphTheoretical Computer Science, 2009
- Distributed Minimum-Cost Clustering Protocol for UnderWater Sensor Networks (UWSNs)Published by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- Minimum connected dominating sets and maximal independent sets in unit disk graphsTheoretical Computer Science, 2006
- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk GraphsLecture Notes in Computer Science, 2006
- Energy-efficient communication protocol for wireless microsensor networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A survey of clustering schemes for mobile ad hoc networksIEEE Communications Surveys & Tutorials, 2005
- Underwater acoustic sensor networks: research challengesAd Hoc Networks, 2005
- Multi-Level Hierarchies for Scalable Ad hoc RoutingPublished by Springer Science and Business Media LLC ,2003
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979