Research on the Critical Nodes Compensation Algorithm in Sparse Ad Hoc Wireless Networks

Sparse Ad hoc wireless networks are an active application in recent years, though sparse environment often makes the network unconnected. However, most of the previous researches focus on connected networks where an end-to-end path exists between any two nodes in the network, therefore these technologies would not work well in sparse ad hoc networks where restricted node communication radius can result in periods of intermittent connectivity. In this work, we develop a critical nodes compensation algorithm in order to prevent network from partitioning, thereby insure network connectivity and throughput. Finally, we give simulation design and analysis of the critical nodes compensation algorithm using NS model. Simulation results show that the algorithm can effectively improve sparse ad hoc networks performance.