Optimisation algorithms for the cooperative communication problem in mobile ad-hoc networks
by Kil-Woong Jang
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 10, No. 1, 2012

Abstract: In this paper, we propose efficient optimisation algorithms to obtain a set of routes to maximise the connectivity among the mobile nodes for the Cooperative Communication Problem (CCP) in mobile ad-hoc networks. We solve the CCP by using heuristic approaches that can efficiently obtain high-quality solutions within a reasonable time for a large-size network. We evaluate and compared these algorithms with other existing algorithms in terms of the number of connections and the computation time of the algorithms. The comparison results show that the proposed algorithms outperform other existing algorithms and can efficiently solve the CCP in mobile ad-hoc networks.

Online publication date: Fri, 15-Jun-2012

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com