| Abstract |
When two opportunistic network peers encounter, utility functions are\n generally employed to select the messages that have to be exchanged,\n with the purpose of maximizing message delivery probability and reduce\n congestion. These functions compute weighted sums of various parameters,\n like centrality, similarity, and trust. Most of the existing solutions\n statically compute the weights based on offline observations and apply\n the same values regardless of a node\'s context. However, mobile networks\n are not necessarily constant in terms of behavior and characteristics,\n so the classic approach might not be suitable. The network might be\n split into sub-networks, which behave differently from each other. Thus,\n in this paper, we show that, by dynamically adjusting the behavior of a\n node based on its context, through the adjustment of the utility\n function on the fly, the opportunistic forwarding process can be\n improved. We show that nodes behave differently from each other and have\n different views of the network. Through real-life trace-based\n simulations, we prove that our solution is feasible and is able to\n improve an opportunistic network\'s performance from the standpoint of\n hit rate, latency, and delivery cost. |
Manage cookies