期刊
COMPUTER NETWORKS
卷 56, 期 2, 页码 902-914出版社
ELSEVIER
DOI: 10.1016/j.comnet.2011.10.025
关键词
Wireless ad hoc networks; Energy efficiency; Topology control; Game theory; Selfish nodes
类别
资金
- Iran Telecommunication Research Center (ITRC)
In wireless ad hoc networks there is no fixed infrastructure or centralized controller to enforce cooperation between nodes. Therefore, nodes may act selfishly in running network protocols for conserving their own energy resources. In this paper, we consider the topology control (TC) game as the problem of creating an energy-efficient topology in wireless ad hoc networks in the presence of selfish nodes. We define a new TC game in which nodes are able to dynamically adjust their transmission power in a per-packet manner, and try to minimize their energy usage through considering both traffic load and transmission power parameters. After analyzing the problem, we propose several algorithms to find stable topologies in an environment composed of selfish nodes, using two types of global and local connectivity information. Finally, we evaluate the performance of the proposed algorithms by simulations. Our simulation results show that using appropriate local information can interestingly result in more efficient topologies than global information. (C) 2011 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据