Adaptive Link Cost Reduction by Generic Topology Construction in Ad-Hoc Networks

• Authors: Reu-Ching Chen;Cheng-Min Lin
• Venue: ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
• Year: 2009

Many works have been done on improving the performance of the ad-hoc networks, in which a stringent issue is concentrated on proper topology establishment with least link connections due to the cost considerations. In this paper, a generic method based on network topology design, called "the spider network topology" is proposed to achieve link cost reduction between distinct nodes communications in the modern ad-hoc networks. In our approach, the link cost reduction using the spider topology is compared with the complete graph topology [1] for ad-hoc networks (link is thought as the system resource for cost estimation in the following sections). Our contribution is concentrated on less total link cost as compared with the complete graph construction under the constraint that average connection links between distinct nodes is less than some constant. The spider network topology technique adopted in this paper is superior than other network topology in some conditions, especially when there are no clear relationship between node pairs for link constructions. The spider network behaves the advantage both in easy implementation and less congestion occurring. This characteristic will benefit on the system performance improving, especially in reliability guarantees. The new architecture presented here can be widely applied in topology design for the modern ad-hoc networks due to the efficient link constructions.