This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Local Thresholding in GeneralNetwork Graphs
April 2014 (vol. 26 no. 4)
pp. 916-928
Ran Wolff, Dept. of Inf. Syst., Univ. of Haifa, Haifa, Israel
Local thresholding algorithms were first presented more than a decade ago and have since been applied to a variety of data mining tasks in peer-to-peer systems, wireless sensor networks, and in grid systems. One critical assumption made by those algorithms has always been cycle-free routing. The existence of even one cycle may lead all peers to the wrong outcome. Outside the lab, unfortunately, cycle freedom is not easy to achieve. This work is the first to lift the requirement of cycle freedom by presenting a local thresholding algorithm suitable for general network graphs. The algorithm relies on a new repositioning of the problem in weighted vector arithmetics, on a new stopping rule, whose proof does not require that the network be cycle free, and on new methods for balance correction when the stopping rule fails. The new stopping and update rules permit calculation of the very same functions that were calculable using previous algorithms, which do assume cycle freedom. The algorithm is implemented on a standard peer-to-peer simulator and is validated for networks of up to 80,000 peers, organized in three different topologies representative of major current distributed systems: the Internet, structured peer-to-peer systems, and wireless sensor networks.
Index Terms:
wireless sensor networks,Distributed data mining,distributed convex thresholding,peer-to-peer
Citation:
Ran Wolff, "Local Thresholding in GeneralNetwork Graphs," IEEE Transactions on Knowledge and Data Engineering, vol. 26, no. 4, pp. 916-928, April 2014, doi:10.1109/TKDE.2013.59
Usage of this product signifies your acceptance of the Terms of Use.