SwePub
Sök i LIBRIS databas

  Utökad sökning

onr:"swepub:oai:DiVA.org:oru-91136"
 

Sökning: onr:"swepub:oai:DiVA.org:oru-91136" > Analytical Comparis...

Analytical Comparison of Resource Search Algorithms in Non-DHT Mobile Peer-to-Peer Networks

Arunachalam, Ajay, 1985- (författare)
Örebro universitet,Institutionen för naturvetenskap och teknik,Centre for Applied Autonomous Sensor Systems (AASS)
Ravi, Vinayakumar (författare)
Center for Artificial Intelligence, Prince Mohammad Bin Fahd University, Khobar, Saudi Arabia
Krichen, Moez (författare)
Faculty of CSIT, Al-Baha University, Saudi Arabia ReDCAD Laboratory, University of Sfax, Tunisia
visa fler...
Alroobaea, Roobaea (författare)
Department of Computer Science, College of Computers and Information Technology, Taif University, Taif, Saudi Arabia
Alqurni, Jehad Saad (författare)
Department of Education Technologies, College of Education, Imam Abdulrahman Bin Faisal University, Saudi Arabia
visa färre...
 (creator_code:org_t)
Tech Science Press, 2021
2021
Engelska.
Ingår i: Computers, Materials and Continua. - : Tech Science Press. - 1546-2218 .- 1546-2226. ; 68:1, s. 983-1001
  • Tidskriftsartikel (refereegranskat)
Abstract Ämnesord
Stäng  
  • One of the key challenges in ad-hoc networks is the resource discovery problem. How efficiently & quickly the queried resource/object can be resolved in such a highly dynamic self-evolving network is the underlying question? Broadcasting is a basic technique in the Mobile Ad-hoc Networks (MANETs), and it refers to sending a packet from one node to every other node within the transmission range. Flooding is a type of broadcast where the received packet is retransmitted once by every node. The naive flooding technique floods the network with query messages, while the random walk scheme operates by contacting subsets of each node's neighbors at every step, thereby restricting the search space. Many earlier works have mainly focused on the simulation-based analysis of flooding technique, and its variants, in a wired network scenario. Although, there have been some empirical studies in peer-to-peer (P2P) networks, the analytical results are still lacking, especially in the context of mobile P2P networks. In this article, we mathematically model different widely used existing search techniques, and compare with the proposed improved random walk method, a simple lightweight approach suitable for the non-DHT architecture. We provide analytical expressions to measure the performance of the different flooding-based search techniques, and our proposed technique. We analytically derive 3 relevant key performance measures, i.e., the avg. number of steps needed to find a resource, the probability of locating a resource, and the avg. number of messages generated during the entire search process.

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

Nyckelord

Mathematical model
MANET
P2P networks
P2P MANET
unstructured
search algorithms
Peer-to-Peer
ad-hoc
flooding
random walk
resource discovery
content discovery
mobile peer-to-peer
broadcast
peer

Publikations- och innehållstyp

ref (ämneskategori)
art (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy