Optimal Beaconing Control in Delay-Tolerant Networks With Multiple Destinations
The opportunistic contacts between nodes have necessary impact on the routing process in delay-tolerant networks, and they are related to the beaconing rate. In this paper, we tend to study the optimal beaconing rates for the relay nodes and destinations at the same time. Initial, a theoretical framework, which can be used to guage the performance below totally different beaconing policies, is presented. Then based mostly on the framework, we formulate an optimization problem. Through Pontryagin's maximum principle, we have a tendency to acquire the optimal beaconing policies for the relay nodes and destinations, respectively. Additionally, we tend to prove that each optimal policies conform to the threshold form. The optimal policy of the relay nodes changes its price from the maximal beaconing rate to the minimal one, but it is opposite for the destinations. The simulations show the accuracy of our theoretical model. Extensive numerical results show that the optimal policies are very better.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here