Improved Message Diffusion Model for Node Coverage Problem of Ad Hoc Network Based on Node Visit Times

It is of great significance to conduct researches on the message diffusion process for the node coverage problem, which can be generally abstracted as a random sampling model in the cooperative communication systems including the ad hoc and unstructured P2P networks. However, the message diffusion in the ad hoc network is not a completely independent random process. When forwarding the messages, the nodes will be influenced by such factors as degrees, visit times, and network connectivity. But the random sampling model does not take these factors into consideration, resulting in the overestimated node coverage degree. Discussing the message diffusion process of the cooperative communication systems like ad hoc network, this paper analyzes the causes of the inaccuracy problems of random sampling model and solves the problems by specially introducing the factors such as node degree and visit times. As for the E-R random network topology, it validates the effectiveness of the model proposed herein in contrast with the simulation experiment results. Compared with the random sampling model, the model proposed herein coincides better with the simulation results of the ad hoc network message diffusion process in the condition of network connectivity and its accuracy can meet the requirements for 3 and 5 visits.

[1]  Roy Friedman,et al.  RaWMS -: random walk based lightweight membership service for wireless ad hoc network , 2006, MobiHoc '06.

[2]  Alhussein A. Abouzeid,et al.  Optimizing random walk search algorithms in P2P networks , 2007, Comput. Networks.

[3]  Donald F. Towsley,et al.  Neighbor discovery in wireless networks and the coupon collector's problem , 2009, MobiCom '09.

[4]  Bhaskar Krishnamachari,et al.  The power of choice in random walks: An empirical study , 2008, Comput. Networks.

[5]  Jon Crowcroft,et al.  A survey and comparison of peer-to-peer overlay network schemes , 2005, IEEE Communications Surveys & Tutorials.

[6]  Song Jiang,et al.  LightFlood: Minimizing Redundant Messages and Maximizing Scope of Peer-to-Peer Search , 2008, IEEE Transactions on Parallel and Distributed Systems.

[7]  Antonio Fernández,et al.  Performance of random walks in one-hop replication networks , 2009, Comput. Networks.

[8]  Jing Xie,et al.  Modeling Random Walk Search Algorithms in Unstructured P2P Networks with Social Information , 2009, 2009 IEEE International Conference on Communications.

[9]  Jin Wang,et al.  An Efficient Clustering Algorithm in Wireless Sensor Networks Using Cooperative Communication , 2012, Int. J. Distributed Sens. Networks.

[10]  BisnikNabhendra,et al.  Optimizing random walk search algorithms in P2P networks , 2007 .

[11]  Marco Zuniga,et al.  Using Heterogeneity to Enhance Random Walk-based Queries , 2009, J. Signal Process. Syst..

[12]  A. Rbnyi.  ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

[13]  Roberto Beraldi.  Biased Random Walks in Uniform Wireless Networks , 2009, IEEE Transactions on Mobile Computing.

[14]  Mingyan Liu,et al.  Optimal controlled flooding search in a large wireless network , 2005, Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05).

[15]  Jennifer L. Welch,et al.  Random Walk for Self-Stabilizing Group Communication in Ad Hoc Networks , 2006, IEEE Trans. Mob. Comput..

[16]  Tim Moors,et al.  Survey of Research towards Robust Peer-to-Peer Networks: Search Methods , 2007, RFC.

[17]  Thomas Sauerwald,et al.  Tight bounds for the cover time of multiple random walks , 2009, Theor. Comput. Sci..

[18]  Roy Friedman,et al.  RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks , 2008, TOCS.

[19]  Antonio Fernández,et al.  A model of self‐avoiding random walks for searching complex networks , 2012, Networks.

[20]  Yong Sun,et al.  Cooperative Communications for Wireless Ad Hoc and Sensor Networks , 2013, Int. J. Distributed Sens. Networks.

[21]  Thomas Sauerwald.  Expansion and the cover time of parallel random walks , 2010, PODC '10.

[22]  Diane E. Vaughan,et al.  A Survey of the Coupon Collector’s Problem with Random Sample Sizes , 2007 .