International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 59 - Number 18 |
Year of Publication: 2012 |
Authors: Md. Mohiuddin Khan |
10.5120/9652-4433 |
Md. Mohiuddin Khan . Application of Graph Abstraction for Performance Optimization of Wireless Ad Hoc Networks: Two Node Scenarios. International Journal of Computer Applications. 59, 18 ( December 2012), 42-49. DOI=10.5120/9652-4433
This paper examines the feasibility and efficiency of representation of wireless networks using graph abstractions. These abstractions represent wireless nodes and interactions between them as vertices and edges in a labelled graph. Vertices are defined with respect to different environmental and network protocol settings on a node while edges correspond to monitored performance metrics. In this paper we present the findings of the two node network. We use the upper layer metrics such as application layer goodput and fairness to characterize network performance. The parameters include network topologies as well as different traffic types and underlying transport protocols. Our results indicate that for many parameter settings of the vertices, the graph abstractions can be relatively simple. Each edge type can easily be modelled using basic mathematical functions. The results obtained from this simple scenarios work as a sanity check for larger networks.