A Percolation based M2M Networking Architecture for Data Transmission and Routing

Jihua Lu, Jianping An, Xiangming Li, Jie Yang, Lei Yang

Abstract

We propose a percolation based M2M networking architecture and its data transmission method. The proposed network architecture can be server-free and router-free, which allows us to operate routing efficiently with percolations based on six degrees of separation theory in small world network modeling. The data transmission can be divided into two phases: routing and data transmission phases. In the routing phase, probe packets will be transmitted and forwarded in the network thus multiple paths are selected and performed based on the constriction of the maximum hop number. In the second phase, the information will be encoded, say, with the fountain codes, and transmitted using the paths generated in the first phase. In such a way, an efficient routing and data transmission mechanism can be built, which allow us to construct a low-cost, flexible and ubiquitous network. Such a networking architecture and data transmission can be used in many M2M communications, such as the stub network of internet of things, and deep space networking, and so on.

Introduction

Traditional networking protocols, primarily designed for the "Internet of People," rely on stable infrastructure like centralized servers and dedicated routers. However, the burgeoning field of Machine-to-Machine (M2M) communication and the Internet of Things (IoT) presents a different set of challenges. M2M "stub networks" often consist of thousands of low-power, inexpensive nodes with limited processing capabilities and highly dynamic connectivity.

Standard protocols often fail in these environments due to high overhead, the cost of maintaining dedicated infrastructure, and the computational burden of maintaining global network maps in a frequently changing topology. This paper proposes a decentralized, "server-free and router-free" architecture that leverages percolation theory and small-world modeling to overcome these hurdles.

Network Architecture and Star Nodes

The proposed architecture moves away from centralized control. Instead, it utilizes the "small-world" property of networks, where any two nodes are likely connected by a short chain of intermediate acquaintances—the "six degrees of separation" principle.

A network graph highlighting a 'Star node' (G) which facilitates efficient small-world routing.

A key feature of this topology is the identification of "Star nodes." As shown in the figure above, a Star node (such as node G) possesses a significantly higher number of neighbors than the average node. These nodes act as natural hubs, accelerating the percolation process and reducing the average number of hops required to reach a destination across the network.

The Two-Phase Transmission Method

The data transmission process is divided into two distinct phases: routing and data transmission.

Phase 1: Percolation Routing

When a source node needs to communicate with a destination, it initiates a "percolation" process. Rather than consulting a global routing table, the node sends "probe packets" to its immediate neighbors. These neighbors use local information—stored in simple "close-neighbor" tables—to forward the probes toward the destination.

The percolation routing process showing multiple paths (R1, R2, R3) established between source E and destination N.

To prevent network congestion, the system restricts the maximum number of hops (typically following the "six degrees" rule) and limits the number of parallel paths. As illustrated in the figure, multiple viable paths (e.g., $R_1, R_2, R_3$) are discovered simultaneously, creating a robust multipath connection between the source (E) and the destination (N).

Phase 2: Data Transmission with Fountain Codes

Once paths are established, the source node transmits data using Fountain Codes (such as LT or Raptor codes). These are "rateless" codes that transform a data block into a potentially infinite stream of encoded packets.

The primary advantage of this approach is that the receiver does not need to receive packets in a specific order or from a specific path. It simply needs to collect a sufficient number of unique packets from any of the available paths to reconstruct the original data. This eliminates the need for complex feedback mechanisms like Automatic Repeat Request (ARQ), making the system highly resilient to individual path failures or intermittent jamming.

Key Insights and Advantages

  • Self-Maintenance: By relying on local "guessing" based on neighbor tables rather than global maps, the network remains functional even as nodes join or leave.
  • Bio-inspired Resilience: The routing mimics water seeping through soil, where small trickles (probes) find paths that eventually support high-speed data "torrents."
  • Low Complexity: Removing the need for dedicated routers and servers significantly lowers deployment costs and hardware requirements, making it ideal for stub networks of inexpensive IoT devices.
  • Adaptive Performance: The use of fountain codes allows the transmission rate to adapt naturally to real-time channel conditions without constant re-negotiation.

Conclusion and Future Applications

This percolation-based architecture provides a flexible, low-cost framework for ubiquitous M2M networking. While further empirical validation is needed for extremely sparse or dense networks, the theoretical benefits make it a strong candidate for challenging environments like Deep Space Networking and anti-jamming communication systems. By embracing the decentralized nature of the small-world model, we can build more resilient and scalable IoT infrastructures.

Summary updated

Abstract

We propose a percolation based M2M networking architecture and its data transmission method. The proposed network architecture can be server-free and router-free, which allows us to operate routing efficiently with percolations based on six degrees of separation theory in small world network modeling. The data transmission can be divided into two phases: routing and data transmission phases. In the routing phase, probe packets will be transmitted and forwarded in the network thus multiple paths are selected and performed based on the constriction of the maximum hop number. In the second phase, the information will be encoded, say, with the fountain codes, and transmitted using the paths generated in the first phase. In such a way, an efficient routing and data transmission mechanism can be built, which allow us to construct a low-cost, flexible and ubiquitous network. Such a networking architecture and data transmission can be used in many M2M communications, such as the stub network of internet of things, and deep space networking, and so on.
BibTeX
@misc{lu2014percolation,
  author = {Jihua Lu and Jianping An and Xiangming Li and Jie Yang and Lei Yang},
  title = {{A Percolation based M2M Networking Architecture for Data Transmission and Routing}},
  year = {2014},
  eprint = {1403.8123},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/1403.8123},
}

Loading related content...

Figure