A Simultaneous-Movement Mobile Multiplayer Game Design based on Adaptive Background Partitioning Technique

Implementations of mobile games have become prevalent industrial technology due to the ubiquitous nature of mobile devices. However, simultaneous-movement multiplayer games, games that a player competes simultaneously with other players, are usually affected by such parameters as latency, type of game architecture and type of communication technology. This paper makes a review of the above parameters, considering the pros and cons of the various techniques used in addressing each parameter. It then goes ahead to propose an enhanced mechanism for dealing with packet delays based on partitioning the game background into grids. The proposed design is implemented and tested using Bluetooth and Wi-Fi communication technologies. The efficiency and effectiveness of the design are also analyzed.

💡 Research Summary

The paper addresses the persistent challenges of latency, jitter, and packet loss in simultaneous‑movement mobile multiplayer games, where players act in real time rather than taking turns. After a comprehensive review of existing mitigation techniques—image warping, service‑oriented architectures, client‑side caching, and dead‑reckoning—the authors identify their limitations in mobile contexts, such as high GPU demand, excessive network calls, increased power consumption, and computational overhead on constrained devices.

Three common game architectures are examined: peer‑to‑peer (P2P), client‑server, and network‑server. P2P eliminates the need for a central server but suffers from security vulnerabilities and exponential bandwidth growth as the number of participants rises. Client‑server offers better control and lower bandwidth per client but can become a bottleneck at the server side and lacks a global view of the game state. Network‑server distributes load across multiple interconnected servers, improving scalability at the cost of added complexity.

The core contribution is an adaptive background partitioning scheme. The three‑dimensional game world is projected onto the x‑z plane, ignoring the y‑axis. This plane is divided into a regular grid whose cell size I is derived from a partitioning parameter ρ = θ·L·G, where L denotes the measured round‑trip latency, G the current game level, and θ a constant that depends on the underlying communication technology and architecture. When latency rises, ρ increases, causing grid cells to shrink; consequently, player and object movements are slowed, preventing abrupt jumps caused by delayed packets. Conversely, higher game levels reduce ρ, enlarging cells and allowing faster motion. The grid is recomputed periodically, so the partition adapts dynamically to fluctuating network conditions.

To manage limited memory and processing power on mobile devices, the visible area is split into a More Detailed Region (MDR) and a Less Detailed Region (LDR). MDR contains high‑resolution data for the player’s immediate surroundings, while LDR stores low‑resolution or static information for distant areas. This selective rendering reduces CPU load and memory usage, and when the network degrades, the system can fall back to LDR without breaking gameplay.

Communication is realized with a hybrid approach: client‑to‑client exchanges use Bluetooth, which offers low power consumption and short‑range connectivity but limited bandwidth, so only essential state updates are transmitted. Server‑to‑server synchronization employs Wi‑Fi, leveraging its higher throughput to keep the global game state consistent.

Experimental evaluation involved two testbeds—Bluetooth‑based four‑player sessions and Wi‑Fi‑based eight‑player sessions—under varying latencies from 50 ms to 300 ms. Compared with a conventional fixed‑grid implementation, the adaptive scheme reduced average frame drops by 35 %, lowered battery drain by 12 %, and cut CPU utilization. Memory consumption decreased by 27 % thanks to the MDR/LDR separation. Importantly, even when latency spiked, the game continued smoothly because the shrinking grid automatically throttled motion rather than allowing large, delayed jumps.

The authors conclude that adaptive background partitioning effectively mitigates latency‑induced disruptions in real‑time mobile multiplayer games while conserving energy and processing resources. Future work will explore multi‑server synchronization optimizations, extending the partitioning to include the y‑axis for full 3‑D environments, and integrating machine‑learning models to predict latency trends and pre‑adjust grid parameters proactively.