Question Waves: A multicast query routing algorithm for social search

Peers in Mobile P2P (MP2P) networks exploit both the structured and unstructured styles to enable communication in a peer-to-peer fashion. Such networks involve the participation of two types of peers: benign peers and malicious peers. Complexities are witnessed in the determination of the identity of the peers because of the user mobility and the unrestricted switching (ON/OFF) of the mobile devices. MP2P networks require a scalable, distributed and light-weighted secure communication scheme. Nevertheless, existing communication approaches lack the capability to satisfy the requirements above. In this paper, we propose an Adaptive Trusted Request and Authorization model (ATRA) over MP2P networks, by exploiting the limited historical interaction information among the peers and a Bayesian game to ensure secure communication. The simulation results reveal that regardless of the peer’s ability to obtain the other such peer’s trust and risk data, the request peers always spontaneously connect the trusted resource peers and the resource peers always preferentially authorize the trusted request peers. Performance comparison of ATRA with state-of-the-art secure communication schemes over MP2P networks shows that ATRA can: (a) improve the success rate of node typing identification, (b) reduce time required for secure connections found, (c) provide efficient resource sharing, and (d) maintain the lower average cost

show abstract

Applying Short-term Memory to Social Search Agents

Mansilla

Sam

Rosa

2015

Procedia Computer Science

View full text Add to dashboard Cite

This paper presents about our research in social search. Generally, the research in social search falls into two principal challenges. The first challenge is how to find more relevant answers to the question. The second one is how to increase speed in finding relevant answers. Recently, we had provided two algorithms called Asknext and Question Waves to find more relevant answers compared to the baseline algorithm BFS. But, the search speed of the two proposed algorithms still the subject to improve. In this paper, we introduce the agents’ ability of learning the answers from the interactions with other agents so that they can quickly answer the question of other agents. We model this learning process by implementing the concept of data caching as the short-term memory of each social search agent. The result improvement of the speediness and the reduction of the number of messages used to communicate between agents, after apply agent's short-term memory concept, demonstrates the usefulness of the proposed approachThis work was supported in part by by the EU's 7FP under grant agreement no 316097, by the TIN2013-48040-R (QWAVES) Nuevos métodos de automatización de la búsqueda social basados en waves de preguntas, the IPT20120482430000 (MIDPOINT) Nuevos enfoques de preservación digital con mejor gestión de costes que garantizan su sostenibilidad, VirCoin2SME – num. H2020-MSCA-RISE SEP 210165853. Social, complementary or community virtual currencies transfer of knowledge to SME: a new era for competitiveness and entrepreneurship, and VISUAL AD, RTC-2014-2566-7 and GEPID, RTC-2014-2576-7, as well as the grup de recerca consolidat CSI-ref. 2014 SGR 146

show abstract

Question Waves: A multicast query routing algorithm for social search

Cited by 4 publications

References 41 publications

On Value Preservation with Distributed Ledger Technologies, Intelligent Agents, and Digital Preservation

On Value Preservation with Distributed Ledger Technologies, Intelligent Agents, and Digital Preservation

An adaptive secure communication framework for mobile peer-to-peer environments using Bayesian games

Applying Short-term Memory to Social Search Agents

Contact Info

Product

Resources

About