Analysis of Random Data Hopping in Distributed Multihop Wireless Networks

Free registration required

Executive Summary

Spatial reuse TDMA (Time Division Multiple Access) in multi-hop ad hoc network is a subject of intense research interest for next generation wireless systems. In this paper, the selection of concurrent communication pairs, that utilize the same resources, is formulated as a non-linear mixed integer programming problem. However, it has been found that the solution to this non-linear programming problem is NP-hard. Recently, a Random Data Hopping (RDH) technique applied over a time slot partitioned system has been proposed by the authors as a novel heuristic algorithm. This random data hopping scheme is further studied in this paper for different values of traffic loads, and its performance is evaluated under realistic propagation conditions.

  • Format: PDF
  • Size: 134.57 KB