This paper presents a novel approach to analyse the traffic efficiency of infrastructureless networks. Wireless communication is rapidly moving towards more infrastructureless routing schemes, where the devices encounter frequent topology changes and communicate with each other anonymously and sporadically. Nodes do not have the opportunity to choose an optimum routing path, they do rather obtain a valid routing path on the fly during the data exchange by cooperating with the nearest neighbours. Packets emanated from an infrastructureless node are disseminated through each node found in the vicinity. This produces a vast number of packet duplicates within the entire communication environment, causing the problem of increased congestion, increased packet delay, more packet drops, and undesirable energy consumption compared to the infrastructured networks. Data exchange and packet routing operations in large networks are highly stochastic. Thus, the performance analysis of routing operations is modeled as a stochastic queueing system, where the input and output traffics and throughput operations of routing systems are precisely formulated in the form of stochastic processes. A hypothetical routing algorithm is also defined here as a reference model in order to perform a comparative analysis of the infrastructureless routing scheme.

中文翻译：

---

无基础设施网络的路由效率：比较分析

本文提出了一种新颖的方法来分析无基础设施网络的流量效率。无线通信正迅速朝着无基础设施的路由方案发展，在这些方案中，设备会遇到频繁的拓扑更改，并且会彼此匿名和零星地通信。节点没有机会选择最佳的路由路径，而是通过与最近的邻居合作，在数据交换过程中即时获得有效的路由路径。从无基础结构节点发出的数据包通过附近的每个节点进行分发。这会在整个通信环境中产生大量重复的数据包，从而导致拥塞增加，数据包延迟增加，数据包丢失更多，与基础设施网络相比，能耗降低。大型网络中的数据交换和数据包路由操作是高度随机的。因此，路由操作的性能分析被建模为一个随机排队系统，其中路由系统的输入和输出流量以及吞吐量操作以随机过程的形式精确地表述。假设的路由算法在此也定义为参考模型，以便对无基础设施的路由方案进行比较分析。路由系统的输入和输出通信量以及吞吐量操作以随机过程的形式精确地表述。假设的路由算法在此也定义为参考模型，以便对无基础设施的路由方案进行比较分析。路由系统的输入和输出通信量以及吞吐量操作以随机过程的形式精确地表述。假设的路由算法在此也定义为参考模型，以便对无基础设施的路由方案进行比较分析。