An Information Theoretic Approach for the Performance Evaluation of MultihopWireless Ad Hoc Networks

The information theoretic principles of Maximum Entropy (ME) and Minimum Relative Entropy (MRE) are employed, as least-biased methods of inference, towards the analysis of a multi-hop ad hoc system with bursty arrivals and Repetitive Service (RS) blocking. The system consists of K MAC layer and R IP layer finite capacity links together with a shared medium which forwards from the MAC layer to higher layer (IP) links in a determined fashion. The traffic at each MAC layer link is assumed to be bursty and is modeled by a Compound Poisson Process (CPP) with geometrically distributed batches. The shared medium provides Generalized Exponential (GE) type of service whilst each output link forms a single GE-type server queue under a First-Come-First-Served (FCFS) rule.