作者: Matthew Orlinski , Nick Filer , None
关键词: Cluster analysis 、 Distributed computing 、 Transient (computer programming) 、 Relevance (information retrieval) 、 Cluster (physics) 、 Mobile ad hoc network 、 Temporal information 、 Data delivery 、 Computer science 、 Network packet
摘要: Distributed cluster detection has been widely applied to the problem of efficient data delivery in Pocket Switched Networks (PSNs). However, previously proposed methods can become less over long periods time as more and transient, pair-wise connections are used form clusters which monotonically increase size. Monotonically increasing clusters, also known aggregated suffer an inevitable loss temporal information. Thus relevance individual movement patterns at particular times is diminished. This paper applies expectation-based spatio-temporal clustering PSNs. We will show that be detected distributively improve efficiency by 7% deliver 6% packets compared methods. Furthermore, 3 strategies utilise proposed.