Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks

Author： Huang Hai   Richa Andréa W.   Segal Michael  

Publisher： Springer Publishing Company

ISSN： 1383-469X

Source： Mobile Networks and Applications, Vol.9, Iss.2, 2004-04, pp. : 151-161

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An enhanced clustering algorithm for mobile ad hoc networks to improve the throughput

By Rajaram S. Muthuramalingam; R.  

International Journal of Mobile Network Design and Innovation, Vol. 3, Iss. 4, 2011-09 ,pp. : 191-197

Inderscience Publishers

Access to resources Recommend Favorite

A game theoretical approach to clustering of ad-hoc and sensor networks

By Koltsidas Georgios  

Telecommunication Systems, Vol. 47, Iss. 1-2, 2011-06 ,pp. : 81-93

Springer Publishing Company

Access to resources Recommend Favorite

Ant-Based Distributed Topology Control Algorithms for Mobile Ad hoc Networks

By Shen Chien-Chung  

Wireless Networks, Vol. 11, Iss. 3, 2005-05 ,pp. : 299-317

Springer Publishing Company

Access to resources Recommend Favorite

A hierarchical approach to position-based multicast for mobile ad-hoc networks

By Transier Matthias  

Wireless Networks, Vol. 13, Iss. 4, 2007-08 ,pp. : 447-460

Springer Publishing Company

Access to resources Recommend Favorite

GUIDE-gradient: A Guiding Algorithm for Mobile Nodes in WLAN and Ad-hoc Networks

By Gonzalez Marco  

Wireless Personal Communications, Vol. 57, Iss. 4, 2011-04 ,pp. : 629-653

Springer Publishing Company

Access to resources Recommend Favorite