Call for Paper - November 2022 Edition
IJCA solicits original research papers for the November 2022 Edition. Last date of manuscript submission is October 20, 2022. Read More

Advantages of VCG Auction based Relay Algorithm for DTNs

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2017
Gulnaz Malled, Logesh K.

Gulnaz Malled and Logesh K.. Advantages of VCG Auction based Relay Algorithm for DTNs. International Journal of Computer Applications 178(4):20-30, November 2017. BibTeX

	author = {Gulnaz Malled and Logesh K.},
	title = {Advantages of VCG Auction based Relay Algorithm for DTNs},
	journal = {International Journal of Computer Applications},
	issue_date = {November 2017},
	volume = {178},
	number = {4},
	month = {Nov},
	year = {2017},
	issn = {0975-8887},
	pages = {20-30},
	numpages = {11},
	url = {},
	doi = {10.5120/ijca2017915810},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}


Wireless Mobile ad hoc networks use Delay/disruption tolerant technology in order to make up for the lack of end to end connectivity. DTNs work in store-carry-forward fashion to deliver messages with opportunistic encounters of nodes. And this strategy consumes resources such as storage and energy. This could well be the reason for nodes to avoid message forwarding, to save their limited resources. This kind of selfish behavior hinders communication. In order to stimulate participation of nodes for a smooth communication incentives are awarded. An efficient Incentive-Compatible-Routing Protocol (ICRP) with multiple copies for two-hop DTNs by using optimal sequential stopping rule and algorithmic game theory will be used. Relaying nodes can receive the maximum reward only when they honestly report the true encounter probability and routing metrics, which will stimulate nodes to participate in the relay node selection process. To implement this Vickrey-Clarke-Groves (VCG) Auction (second-price sealed-bid) based algorithm is employed as a strategy to refine the relay node selection process. ICRP attempts to find the optimal stopping time threshold adaptively based on realistic probability model and propose an algorithm to calculate the threshold. Based on this threshold, it proposes a new method to select relay nodes for multi-copy transmissions. ICRP can effectively stimulate nodes to carry/forward messages and achieve higher packet delivery ratio with lower transmission cost. This implementation reduces the end-to-end delay, energy consumption. And it ensures the existence of more number of live nodes.


  1. Kevin Fall 2003 “A Delay-Tolerant Network Architecture for Challenged Internets”
  2. Nidhi Goyal, Naveen Hemrajani 2013 “Comparative Study of AODV and DSR Routing Protocols for MANET: Performance Analysis”
  3. S.Burleigh, A. Hooke, L. Torgerson 2003 “Delay-tolerant networking: anapproach to interplanetary Internet”
  4. Augustin Chaintreau, Pan Hui 2007 “Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms”
  5. Thrasyvoulos Spyropoulos 2008 “Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy”
  6. R.S.Mangrulkar 2010 “Routing in a Delay Tolerant Network”
  7. Zhensheng Zhang 2008 “Routing in intermittently connect mobile ad hoc networks and delay tolerant networks: overview and challenges”
  8. Kevin Fall 2008 DTN: An architectural retrospective
  9. Quan Yuan  Quan Yuan ,  Ionut Cardei ,  Jie Wu 2011 “Predict and Relay: An Efficient Routing in Disruption-Tolerant Networks”
  10. Jon Crowcroft, EikoYoneki, Pan Hui 2008 “Promoting Tolerance for Delay Tolerant network Research”
  11. Anders Lindgren Pan Hui “The Quest for a Killer App for Opportunistic and Delay Tolerant Networks”
  12. SotiriosAngelos Lenas,Scott C. Burleigh,2012Vassilis Tsaoussidis 2012 “Reliable Data Streaming over Delay tolerant networks”


Epidemic Algorithm, Incentive Compatible routing algorithm (ICRP), optimal sequential stopping rule, VCG based auction Algorithm.