Application of Graph Abstraction for Performance Optimization of Wireless Ad Hoc Networks: Two Node Scenarios
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, the authors present the findings of the two node network. They use the upper layer metrics such as application layer good put and fairness to characterize network performance. The parameters include network topologies as well as different traffic types and underlying transport protocols.