Adaptive Graph Partitioning Wireless Protocol

We propose a new wireless protocol, called the Adaptive Graph Partitioning Wireless Protocol, that dynamically partitions nodes into the available logical channels in such a manner so as to improve performance by balancing the intra-logical channel traffic between the available logical channels, and minimising the inter-logical channel traffic. We have simulated the performance of a simplified model of the system, at an instant in time, based on the following parameters: nodal load, number of channels, node buffer size, central entity buffer size, channel locality factor, and packet transmission probability. The simulations show the benefits of graph partitioning: when the channel loads are balanced and the channel locality factor is high, performance is significantly improved. We have also developed analysis for this simplified model of the system which serves as a upper bound calculation for packet loss in the system.