The r-neighborhood graph: An adjustable structure for topology control in wireless ad hoc networks
檔案
- 000244465900009.pdf (1.50 MB, Adobe PDF)
日期
2007-04-01
類型
系所
期刊名稱
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
卷期與頁次
第 18 卷第 4 期,頁 536–549
ISSN
1045-9219
語言
英文
摘要
In wireless ad hoc networks, constructing and maintaining a topology with lower node degrees is usually intended to mitigate excessive traffic load on wireless nodes. However, keeping lower node degrees often prevents nodes from choosing better routes that consume less energy. Therefore, the trade-off is between the node degree and the energy efficiency. In this paper, an adjustable structure, named the r-neighborhood graph, is proposed to control the topology. This structure has the flexibility to be adjusted between the two objectives through a parameter r, 0 <= r <= 1. More explicitly, for any set of n nodes, the maximum node degree and power stretch factor can be bounded from above by some decreasing and increasing functions of r, respectively. Specifically, the bounds can be constants in some ranges of r. Even more, the r-neighborhood graph is a general structure of both RNG and GG, two well-known structures in topology control. Compared with YGk, another famous adjustable structure, our method always results in a connected planar with symmetric edges. To construct this structure, we investigate a localized algorithm, named PLA, which consumes less transmitting power during construction and executes efficiently in O(n log n) time.
所屬典藏
期刊論文引用此條目
Jeng, A. A.-K., & Jan, R.-H. (2007). The r-neighborhood graph: An adjustable structure for topology control in wireless ad hoc networks. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 18(4), 536–549. https://doi.org/10.1109/TPDS.2007.1004
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/10981