The paper opens with a description of the demand and current state of mobile ad hoc networks. They then address their product, that is, a weighted clustering algorithm or WCA. They use this to restructure mobile adhoc networks when they determine the clusterheads, the most connected nodes, in a network. This algorithm determines the weight of paths between nodes for the purpose of increasing or lessening load levels. Its heuristics take into account a surprising number of variables including: ideal degree, transmission power, mobility, and battery power. It only triggers when it is needed, so as to not constantly restructure the network. It seems that in further distributing the load of the network, there comes a loss of connectivity.
This has a reasonably high degree of relevance to our project. Their algorithm takes into account many factors that are pertinent to mobile bluetooth gaming as players dropping and rejoining will necessitate a reorganization of their connections. Although in its current state, our system features a network where each node connects to every possible node.
http://www.springerlink.com.lib-ezproxy.tamu.edu:2048/content/knme635wbqmhvpx5/
No comments:
Post a Comment