On the capacity of wireless ad-hoc network basing on graph theory

Authors:
Dai Qin-yun;Hu Xiu-lin;Yu Hong-yi;Zhao Jun
Affiliations:
Department of Electronic and Information, University of Hua Zhong Science & Technology, WuHan, HuBei, China;Department of Electronic and Information, University of Hua Zhong Science & Technology, WuHan, HuBei, China;Department of Communication Engineering in Institute of Information Engineering, University of Military Information Engineering, ZhengZhou, HeNan, China;Department of Communication Engineering in Institute of Information Engineering, University of Military Information Engineering, ZhengZhou, HeNan, China
Venue:
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Year:
2005

Citing 7
Cited 1

A survey of routing techniques for mobile communications networks

Mobile Networks and Applications - Special issue: routing in mobile communications networks
A new model for packet scheduling in multihop wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Mobility increases the capacity of ad hoc wireless networks

IEEE/ACM Transactions on Networking (TON)
On the capacity improvement of ad hoc wireless networks using directional antennas

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Graph Theory With Applications

Graph Theory With Applications
The capacity of wireless networks

IEEE Transactions on Information Theory
A brief overview of ad hoc networks: challenges and directions

IEEE Communications Magazine - Part Anniversary

A graph theory based opportunistic link scheduling for wireless ad hoc networks

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The network capacity is a very important parameter to evaluate the performance of ad hoc network. In this paper, the objective of our research is how to obtain the large capacity in ad hoc network. We establish the ad hoc network model from the novel point of view and consider the network capacity could achieve the maximum when the network resources (including area, bandwidth, power, load and so on) are used up minimally on the successful transmission condition. We set up the equation that makes the network resource consumed minimally and solve the problems of network capacity and the corresponding routing policy by the graph theory. Subsequently, we improve on these algorithms that are proved more efficient through the simulation experiment. Finally, the conclusion that the network capacity should combine with the routing policy is made.