Minimum energy broadcast on rectangular grid wireless networks
スポンサーリンク
概要
- 論文の詳細を見る
The minimum energy broadcast problem is to assign a transmission range to each node in an ad hoc wireless network to construct a spanning tree rooted at a given source node such that any non-root node resides within the transmission range of its parent. The objective is to minimize the total energy consumption, i.e., the sum of the δth powers of a transmission range (δ<1). In this paper, we consider the case that δ=2, and that nodes are located on a 2-dimensional rectangular grid. We prove that the minimum energy consumption for an n-node k×l-grid with n=kl and k≤l is at most nπ+O(n k0.68) and at least nπ+Ω(nk)-O(k). Our bounds close the previously known gap of upper and lower bounds for square grids. Moreover, our lower bound is n3-O(1) for 3≤k≤18, which matches a naive upper bound within a constant term for k≡0(mod3). © 2011 Elsevier B.V. All rights reserved.
- 2011-09-09
論文 | ランダム
- ナースが知りたい! 臨床看護技術ガイド(第11回・最終回)急性期の抑制(身体拘束)
- 新たな国づくりに向けた雇用政策 (特集 民主政権 問われる推進力)
- 骨代謝マーカー オステオポンチン,オステオネクチン (広範囲 血液・尿化学検査 免疫学的検査(第7版・2)その数値をどう読むか) -- (生化学的検査(2))
- 平面弾性ならびに熱弾性 BEM の高精度・高能率化について
- A Profile of Nagoya,"the Capital of Industrial Technology"