Thewalkersproblem课程.pptVIP

The walkers problem J.D., X.Perez, M.Serna, N.Wormald GOAL STUDY THE CONNECTIVITY OF THE AD-HOC NETWORK STABLISHED BETWEEN THE AGENTS, AS THESE MOVE FOLLOWING THE EDGES OF A GRAPH: Cycle Grid Hypercube Random Geometric graph GOAL STUDY THE ITERACTIONS OF SIMULTANEOUS RANDOM WALKS ON DIFFERENTS TOPOLOGIES. Walkers in the toroidal grid Given a set W (|W|=w) of walkers (agents, robots,..) which at each step, they can move N/S/E/W on the edges of a toroidal grid TN, with N=n2, the walkers have RF communication within a distance d (Manhatan, euclidian, etc.), we wish to study the evolution of t