Title
An Economic Approach To Hierarchical Routing In Resource Rationed Ad Hoc Networks
Abstract
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. © 2007 IEEE.
Publication Date
12-1-2007
Publication Title
2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, WOWMOM
Number of Pages
-
Document Type
Article; Proceedings Paper
Personal Identifier
scopus
DOI Link
https://doi.org/10.1109/WOWMOM.2007.4351780
Copyright Status
Unknown
Socpus ID
47749134510 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/47749134510
STARS Citation
Wang, Wenjing; Chatterjee, Mainak; and Kwiat, Kevin, "An Economic Approach To Hierarchical Routing In Resource Rationed Ad Hoc Networks" (2007). Scopus Export 2000s. 6178.
https://stars.library.ucf.edu/scopus2000/6178