Open AccessA comprehensive analysis for fair probability marking based traceback approach in WSNs
Author(s) -
Liu Anfeng,
Liu Xiao,
Liu Yuxin
Publication year - 2016
Publication title -
security and communication networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.446
H-Index - 43
eISSN - 1939-0122
pISSN - 1939-0114
DOI - 10.1002/sec.1515
Subject(s) - computer science , ip traceback , network packet , node (physics) , tree (set theory) , convergence (economics) , tree network , computer network , algorithm , denial of service attack , time complexity , the internet , mathematics , world wide web , mathematical analysis , structural engineering , engineering , economics , economic growth
Currently, the analysis result of fair probability marking approach can only be got in the single‐source linear and single‐source tree network, which cannot meet the requirement of applications. This paper fills in this gap by providing an accurate marking probability analysis model for linear network, tree network, and planar network. Compare with the marking packets mechanism with equal marking probability, the analysis result of this paper shows that FPM mechanisms cannot only reduce convergence time up to 20%–60% for medium‐sized plane sensor networks, but also reduces the amount of data, so the network lifetime is 1.2 times to 3.37 times than previous methods. The mark probability τ of each node is given and its performance is comprehensively analyzed for FPM approach. The results have important guiding significance for designing traceback scheme. Copyright © 2016 John Wiley & Sons, Ltd.