Mathematical Model Validation of Search Protocols in MP2P Networks  

作　　者：Ajay Arunachalam Vinayakumar Ravi Moez Krichen Roobaea Alroobaea Saeed Rubaiee 

机构地区：[1]Centre for Applied Autonomous Sensor Systems(AASS),Örebro University,Örebro,Sweden [2]Center for Artificial Intelligence,Prince Mohammad Bin Fahd University,Khobar,Saudi Arabia [3]Faculty of CSIT,Al-Baha University,Saudi Arabia ReDCAD Laboratory,University of Sfax,Tunisia [4]Department of Computer Science,College of Computers and Information Technology,Taif University,P.O.Box 11099,Taif,21944,Saudi Arabia [5]Department of Industrial and Systems Engineering,College of Engineering,University of Jeddah,Jeddah,Saudi Arabia

出　　处：《Computers, Materials & Continua》2021年第8期1807-1829,共23页计算机、材料和连续体（英文）

基　　金：Supporting Project number(TURSP-2020/36),Taif University,Taif,Arabia Saudi.

摘　　要：Broadcasting is a basic technique in Mobile ad-hoc network(MANET),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 technique operates by contacting the subsets of every node’s neighbors at each step,thereby restricting the search space.One of the key challenges in an ad-hoc network is the resource or content discovery problem which is about locating the queried resource.Many earlier works have mainly focused on the simulation-based analysis of flooding,and its variants under a wired network.Although,there have been some empirical studies in peer-to-peer(P2P)networks,the analytical results are still lacking,especially in the context of P2P systems running over MANET.In this paper,we describe how P2P resource discovery protocols perform badly over MANETs.To address the limitations,we propose a new protocol named ABRW(Address Broadcast Random Walk),which is a lightweight search approach,designed considering the underlay topology aimed to better suit the unstructured architecture.We provide the mathematical model,measuring the performance of our proposed search scheme with different widely popular benchmarked search techniques.Further,we also derive three relevant search performance metrics,i.e.,mean no.of steps needed to find a resource,the probability of finding a resource,and the mean no.of message overhead.We validated the analytical expressions through simulations.The simulation results closely matched with our analyticalmodel,justifying our findings.Our proposed search algorithm under such highly dynamic self-evolving networks performed better,as it reduced the search latency,decreased the overall message overhead,and still equally had a good success rate.

关 键 词：Search protocols random walk MANET P2P networks P2P MANET mathematical model peer-to-peer wireless ad hoc network FLOODING mobile P2P UNSTRUCTURED P2P NS-2 network simulator 

分 类 号：TN9[电子电信—信息与通信工程]