scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

Hierarchical topology adaptation for distributed convergecast applications

TL;DR: It is theoretically shown that there is a trade-off between the topology architecture and the network traffic load and a hierarchical topology adaptation scheme is proposed for the tree based convergecast to improve overall application performances.
Abstract: Sink based spanning tree topologies are effectively used in convergecast applications for efficient packet delivery with minimum forwarding delay, eliminating packet loss or duplicate packet delivery. For tree based convergecast, this paper theoretically shows that there is a trade-off between the topology architecture and the network traffic load. Depending on this trade-off, a hierarchical topology adaptation scheme is proposed for the tree based convergecast to improve overall application performances. The effectiveness of the proposed scheme is analyzed using simulation results.
References
More filters
Proceedings ArticleDOI
11 Dec 2006
TL;DR: The average delay and capacity in random access MAC based WMNs are characterized and it is indicated that how the performance of WMNs scales with the number of mesh routers and clients scales withThe analytical results indicate that howThe results obtained for WMNs compare with well known results on asymptotic capacity of infrastructure-less ad hoc networks.
Abstract: The wireless mesh networks (WMNs) are emerging as a popular means of providing connectivity to communities in both affluent and poor parts of the world. The presence of backbone mesh routers and the use of multiple channels and interfaces allow mesh networks to have better capacity than infrastructure-less multihop ad hoc networks. In this paper we characterize the average delay and capacity in random access MAC based WMNs. We model residential area WMNs as open G/G/1 queuing networks. The analytical model takes into account the mesh client and router density, the random packet arrival process, the degree of locality of traffic and the collision avoidance mechanism of random access MAC. The diffusion approximation method is used to obtain closed form expressions for end-to-end packet delay and maximum achievable per-node throughput. The analytical results indicate that how the performance of WMNs scales with the number of mesh routers and clients. We also discuss that how the results obtained for WMNs compare with well known results on asymptotic capacity of infrastructure-less ad hoc networks. The results obtained from simulations agree closely with the analytical results.

65 citations


"Hierarchical topology adaptation fo..." refers methods in this paper

  • ...The value of Xi and X(2) i can be calculated based on [2]....

    [...]

Journal ArticleDOI
TL;DR: An algorithm that builds and maintains clusters over a network subject to mobility and is mobility-adaptive: after a series of topological changes, the algorithm converges to a clustering, which computes the largest possible number of clusters.
Abstract: We propose an algorithm that builds and maintains clusters over a network subject to mobility. This algorithm is fully decentralized and makes all the different clusters grow concurrently. The algorithm uses circulating tokens that collect data and move according to a random walk traversal scheme. Their task consists in (i) creating a cluster with the nodes it discovers and (ii) managing the cluster expansion; all decisions affecting the cluster are taken only by a node that owns the token. The size of each cluster is maintained higher than m nodes (m is a parameter of the algorithm). The obtained clustering is locally optimal in the sense that, with only a local view of each clusters, it computes the largest possible number of clusters (i.e. the sizes of the clusters are as close to m as possible). This algorithm is designed as a decentralized control algorithm for large scale networks and is mobility-adaptive: after a series of topological changes, the algorithm converges to a clustering. This recomputation only affects nodes in clusters where topological changes happened, and in adjacent clusters.

12 citations


"Hierarchical topology adaptation fo..." refers background in this paper

  • ...It has been assumed that there exists a distributed clustering protocol, such as [1], to group the nodes of the network in a set of clusters....

    [...]

Journal ArticleDOI
TL;DR: This paper proposes a Load-Balanced and energy-efficient Tree (LBT) algorithm to maximize the lifetime of WSNs, which takes into account the load balance and energy efficiency of 1-hop nodes and is the first to present the upper bound of network lifetime for data gathering without aggregation with tree-based topology.
Abstract: Wireless sensor networks (WSNs), often composed of a large number of sensor nodes with limited power, have been widely used for environmental monitoring and battlefield surveillance. A basic operation in such networks is data gathering. In the applications of data gathering without aggregation, the 1-hop nodes always incur much heavier traffic load compared with other nodes, which determine the lifetime of the whole network. Due to the energy constrained nature of sensor devices, energy-efficient methods should be employed for data gathering. In this paper, we propose a Load-Balanced and energy-efficient Tree (LBT) algorithm to maximize the lifetime of WSNs, which takes into account the load balance and energy efficiency of 1-hop nodes. To the best of our knowledge, we are the first to present the upper bound of network lifetime for data gathering without aggregation with tree-based topology. Simulation results demonstrate that our algorithm utilizes up to 98 % of the total energy of the 1-hop nodes and outperforms the state-of-the-art algorithms in terms of network lifetime. Furthermore, LBT can achieve a lifetime consistently close to the upper bound.

6 citations


"Hierarchical topology adaptation fo..." refers background in this paper

  • ...Tree based data gathering [4,5] is an efficient way to collect data for such applications....

    [...]

Journal ArticleDOI
TL;DR: A set of algorithms has been proposed for dynamic switching between two spanning trees to offer better adaptivity towards the environment for different applications to assure the availability of the system at any instance of time.
Abstract: The changes in environmental parameters may demand switching between underlying topologies for better performance of distributed message passing applications. Arbitrary topology switching using distributed tree construction may lead to loss or redundancy in delivery of application messages. In this work, a set of algorithms has been proposed for dynamic switching between two spanning trees to offer better adaptivity towards the environment for different applications. Here, two extreme cases of spanning trees, a Breadth First Search (BFS) tree and a Depth First Search (DFS) tree, rooted at the core node, have been considered for switching. The core node initiates the switching and all other nodes cooperatively change their parents on the fly maintaining the DFS or BFS properties as required. However, the application remains transparent to the switching that assures the availability of the system at any instance of time. Simulation results show that each application message is delivered correctly to the destination without any loss or redundancy. The proposed scheme is scalable and the control message overhead for switching is linear with respect to the number of edges in the communication graph. Furthermore, there is no control message overhead to assure the delivery of application messages at the time of switching.

5 citations


"Hierarchical topology adaptation fo..." refers background in this paper

  • ...Adaptive topology switching has been studied in literature, such as [3] and the references therein, where the authors have designed specific switching algorithms for two extreme spanning trees - a BFS tree and a DFS tree....

    [...]

  • ...4 compares the performance of the proposed hierarchical topology switching with the global topology switching proposed in [3]....

    [...]

Journal ArticleDOI
TL;DR: This work illustrates distributed protocol switching by providing a distributed algorithm for adaptive broadcast that dynamically switches from a BFS tree to a DFS tree and investigates the specific delivery guarantees that can be provided when a single crash fault happens, both during switching and when no switching is in progress.

3 citations


"Hierarchical topology adaptation fo..." refers background in this paper

  • ...Tree based data gathering [4,5] is an efficient way to collect data for such applications....

    [...]