Distributed Maintenance of Resource Efficient Wireless Network Topologies

Abstract

Multiple hop routing in mobile ad hoc networks can minimize energy consumption and increase data throughput. Yet, the problem of radio interferences remains. However if the routes are restricted to a basic network based on local neighborhoods, these interferences can be reduced such that standard routing algorithms can be applied. We compare different network topologies for these basic networks with respect to degree, spanner-properties, radio interferences, energy, and congestion, i.e. the Yao-graph (aka. Θ-graph) and some also known related models, which will be called the SymmY-graph (aka. YS-graph), the SparsY-graph (aka.YY-graph) and the BoundY-graph. Further, we present a promising network topology called the HL-graph (based on Hierarchical Layers). Further, we compare the ability of these topologies to handle dynamic changes of the network when radio stations appear and disappear. For this we measure the number of involved radio stations and present distributed algorithms for repairing the network structure. MotivationOur research aims at the implementation of a mobile ad hoc network based on distributed robust communication protocols. Besides the traditional use of omni-directional transmitters, we want to investigate the effect of space multiplexing techniques and variable transmission powers on the efficiency and capacity of ad hoc networks. Therefore our radios can send and receive radio signals independently in k sectors of angle θ using one frequency. Furthermore, our radio stations can regulate its transmission power for each transmitted signal. To show that this approach is also suitable in practical situations, we are currently developing a communication module for the mini robot Khepera [11,8] that can transmit and receive in eight sectors using infrared light with variable transmission distances up to one meter, see Fig. 1. A colony of Khepera robots will be equipped with

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

“…The first half of this theorem can be directly obtained from a result by Grunewald et al [16]. They basically show how to construct a counter example of a 2D network in which SYG is not a power spanner.…”

“…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.…”

“…Topology control [13][14][15] has been well-studied for 2D wireless ad hoc and sensor networks in the past decade [16][17][18][19][20][21][22][23][24][25][26]. Topology control methods allow each sensor node to locally adjust its transmission range and select certain neighbors for communication, while maintaining a structure that can support energy efficient routing and improve the overall network performance.…”

Developing the IoT through Wireless Communication Networks: Analysis of Topologies

“…Topology control has drawn significant research interest [12][13][14][15][16][17][18][19], in last few years. Different topologies have different properties; however, none of them can achieve all three preferred properties for unicast applications on wireless ad hoc networks: power spanner, planar, degree-bounded.…”

Narrow-Shallow-Low-Light Trees with and without Steiner Points

“…Lukovszki [16,15] devised fault-tolerant constructions of single-sink spanners. Single-sink spanners were also used in maintenance algorithms for wireless networks [12,17]. Farshi and Gudmundsson [10] conducted an experimental study of single-sink spanners.…”