By Topic

An Economic Approach to Hierarchical Routing in Resource Rationed Ad Hoc Networks

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
$33 $13
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)
Wenjing Wang ; Electrical Engineering and Computer Science, University of Central Florida, Orlando, FL 32816, wenjing@eecs.ucf.edu ; Mainak Chatterjee ; Kevin Kwiat

In this paper, we focus on the problem of routing in resource rationed ad hoc networks. We exemplify the concept of resource rationing in a military scenario where the allocated resources are rationed to prolong the mission. By modeling the network as a directed weighted graph, we propose an economic approach to address the routing issue, namely HR3. Our approach begins with a hierarchical bidding process, through which nodes in the network bid for virtual currency. The winning bids use the granted virtual currency to pay the intermediate nodes for packet forwarding. After successful delivery, nodes get rewards. We study the truthfulness of HR3 with rational nodes and propose security extension to identify and isolate the malicious nodes. Through simulations on ns-2, HR3 shows performance gains in data throughput and energy consumption.

Published in:

2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks

Date of Conference:

18-21 June 2007