Performance of distributed algorithms for topology control in wireless networks

Rührup, Stefan; Schindelhauer, Christian; Volbert, Klaus; Grünewald, Matthias

doi:10.1109/ipdps.2003.1213107

Cited by 16 publications

(8 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Tradeoffs between congestion, dilation, and energy for routing and scheduling in wireless networks have also been studied (e.g. Ruhrup et al [2003] and auf der Heide et al [2004]). One of the main challenges in wireless network is the interference model.…”

Section: Introductionmentioning

confidence: 99%

Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks

Kumar

Marathe

Parthasarathy

et al. 2016

ACM Trans. Algorithms

View full text Add to dashboard Cite

Packet scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstraction here, and we study packet routing and scheduling under this model of interference. The main focus of our work is the development of fully distributed (decentralized) protocols. We present polylogarithmic/constant factor approximation algorithms for various families of disk graphs (which capture the geometric nature of wireless-signal propagation), as well as near-optimal approximation algorithms for general graphs. A basic distributed coloring procedure, originally due to Luby [1993] (Journal of Computer and System Sciences, 47:250-286, 1993), underlies many of our algorithms. The work of Finocchi et al. [2002] (Proc. ACM-SIAM Symposium on Discrete Algorithms, 2002) showed that a natural modification of this algorithm leads to improved performance. A rigorous explanation of this was left as an open question, and we prove that the modified algorithm is indeed provably better in the worst case.

show abstract

Section: Introductionmentioning

confidence: 99%

Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks

Kumar

Marathe

Parthasarathy

et al. 2016

ACM Trans. Algorithms

View full text Add to dashboard Cite

show abstract

“…Node u chooses a node v from each 3D cone, if there is any, so the incoming link ← − uv in YG has the smallest length among all incoming links from YG in that cone as shown in Figure 3c. Similar idea has been used for 2D networks by [16,19,57]. Algorithm 3 shows the detailed algorithm.…”

Section: D Yao Structures Based On Flexible Partitionmentioning

confidence: 99%

Localized geometric topologies with bounded node degree for three-dimensional wireless sensor networks

Chen

Wang

2012

J Wireless Com Network

View full text Add to dashboard Cite

Three-dimensional (3D) wireless sensor networks have attracted a lot of attention due to their great potential usages in both commercial and civilian applications, such as environmental data collection, pollution monitoring, space exploration, disaster prevention, and tactical surveillance. Topology control in 3D sensor networks has been studied recently, and different 3D geometric topologies were proposed to be the underlying network topologies to achieve the sparseness of the communication networks. However, most of these proposed 3D topologies cannot bound the maximum node degree, i.e., some nodes may need to maintain a large number of neighbors in the constructed topologies, which is not energy efficient and may lead to large contention. In this article, we extend several existing 3D geometric topologies to a set of new 3D topologies with bounded node degree. We provide both theoretical analysis and simulation evaluation on their power efficiency and node degree distributions. Our simulation results over random 3D sensor networks confirm nice performances of these proposed 3D topologies.

show abstract

“…YG基础上采用不同策略来保留边,将得到众多YG变形图.例如,Symm Yao [27] : [28,29] 类似于 YG,CBTC 也以角度约束为主,不同之处在于 CBTC 尽量让所有朝向的锥角α内含至少 1 个邻节点.…”

Section: Yg(yao Graph)unclassified

A Survey of Proximity Graphs in Wireless Networks

Lu¹,

Ming-tian²,

Niu³

et al. 2010

Journal of Software

View full text Add to dashboard Cite

Network topology can be represented by the proximity graph defined as a graph with a set of vertices V and a set of edges E such that a directed edge (u,v) belong to E if and only if the point v is in the neighborhood induced by some predefined proximity measures of point u. This paper reviews some important graphs obtained so far, and the contents mainly concentrated in five aspects of those proximity graphs including their definitions or conceptions, construction algorithms, illustrations, topological relationships, and some parameters. This paper also outlines several further research directions.

show abstract

Performance of distributed algorithms for topology control in wireless networks

Cited by 16 publications

References 8 publications

Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks

Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks

Localized geometric topologies with bounded node degree for three-dimensional wireless sensor networks

A Survey of Proximity Graphs in Wireless Networks

Contact Info

Product

Resources

About