Paper Info
Title
Congestion Control for Epidemic Routing in Opportunistic Networks
Abstract
Flooding-based routing protocols in opportunistic networks like Epidemic provide a simple routing algorithm. While delivery probability is high and delivery latency is low, the generated overhead of distributing every message to each node generates unnecessary load in the network, especially in areas with higher node density and areas with network congestion. Several approaches try to control congestion by utilizing additionally transferred information to coordinate packet transmissions. Due to the nature of an opportunistic network, solutions designed to use a central or global oracle are seldom feasible. Our solution contributes a per-message probability-based decision for congestion control using ephemeral information of a nodes' surroundings. Simulations conducted using the ONE simulator show, that after a certain node density resulting in a congested network area, overhead ratio decreases and delivery probability significantly increases compared to Epidemic routing. By testing scenarios with different movement models, we also foreclose algorithm efficiency based on node interactions.
Year
DOI
Venue
2019
10.1109/iThings/GreenCom/CPSCom/SmartData.2019.00039
2019 International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData)
Keywords
Field
DocType
Opportunistic networks,Epidemic,flooding,congestion,ONE
Metadata,Algorithmic efficiency,Latency (engineering),Computer science,Network packet,Quality of service,Oracle,Computer network,Network congestion,Routing protocol
Conference
ISBN
Citations 
PageRank 
978-1-7281-2981-5
0
0.34
References 
Authors
5
2
Name
Order
Citations
PageRank
Raphael Bialon101.35
Kalman Graffi222828.17