Congestion Threshold of Ad-hoc Networks

DOI IR Web Site

Bibliographic Information

Other Title
  • アドホックネットワークの輻輳閾値
  • アドホックネットワーク ノ フクソウシキイチ

Search this article

Abstract

In order to evaluate congestion threshold of ad-hoc network, the simulations emulating TCP/IP on the network model known as Random Geometric Network(RGN) were performed, and network traffic congestion was generated. As a result of this study, the congestion threshold of RGN was found to be around one-seventh of that of Random Network because traffic of RGN concentrates on the nodes between node groups in which nodes are connected each other with many links. Comparing RGN with Barabasi-Albert(BA) model which is one of scale-free networks showed that the congestion threshold of RGN is larger than that of BA, and that the packet arriving rate of RGN becomes lower than that of BA for the region that packet generation rate per a node is over 0.036. This indicates that date communication on RGN becomes a difficult situation once congestion emerges. Furthermore, it was confirmed that increasing the average degree is effective for improving the congestion tolerance of RGN. By increasing the average degree, node groups merge into a strongly connected giant network since nodes between node groups disappear. For instance, the maximum amount of traffic of RGN with the average degree 20 was three times that of RGN with the average degree 6.

Journal

Keywords

Details 詳細情報について

Report a problem

Back to top