By Topic

Energy efficient beaconing control in delay tolerant networks with multiple destinations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yahui Wu ; Sci. & Technol. on Inf. Syst. Eng. Lab., Nat. Univ. of Defense Technol., Changsha, China ; Su Deng ; Hongbin Huang

The store-carry-forward communication mode in delay tolerant networks closely depends on the opportunistic contacts between the nodes. In addition, there is a higher probability that a node can detect others if the beaconing rate is higher (although this consumes more energy). This study studies the optimal beaconing policy to obtain a trade-off between the performance and the energy consumption. In particular, the authors consider the case with multiple destinations. According to whether the destinations forward the message to others, they study the problem in non-replicative and replicative cases, respectively. First, a theoretical framework that can evaluate the trade-off under different beaconing policies is introduced for each case. Then, they formulate an optimisation problem based on these frameworks. Through Pontryagin's maximal principle, they obtain the optimal policies and prove that the optimal policies conform to the threshold form in both cases. The imulations show the accuracy of the theoretical frameworks. The numerical results show that they can obtain a better trade-off in the replicative case.

Published in:

Communications, IET  (Volume:8 ,  Issue: 5 )