Interface placement in constructing widest spanning tree for multi-channel multi-interface wireless mesh networks

Proceedings of the IEEE Wireless Communications and Networking Conference, 2009, p. 2560-2564Widest spanning tree is a broadcast tree with its bottleneck link bandwidth maximized. It provides a cost effective broadcasting solution in multi-channel multi-interface wireless mesh networks. To find the widest spanning tree, existing algorithms jointly consider channel assignment, routing and scheduling while assuming the number of network interface cards (NICs) at each node is given. In this paper, we treat the number of NICs at each node as a design parameter, whereas the total number of NICs in the system is given. By properly placing more NICs to more "critical" nodes, the bandwidth of the spanning tree can be further increased. To this end, a new Integer Linear Programming (ILP) is formulated for solving the widest spanning tree problem based on joint optimization of interface placement, channel assignment, routing and scheduling. Numerical results show that interface placement provides a significant boost to the bandwidth of the widest spanning tree found. © 2009 IEEE.published_or_final_versio

Interface placement in constructing widest spanning tree for multi-channel multi-interface wireless mesh networks

Proceedings of the IEEE Wireless Communications and Networking Conference, 2009, p. 2560-2564Widest spanning tree is a broadcast tree with its bottleneck link bandwidth maximized. It provides a cost effective broadcasting solution in multi-channel multi-interface wireless mesh networks. To find the widest spanning tree, existing algorithms jointly consider channel assignment, routing and scheduling while assuming the number of network interface cards (NICs) at each node is given. In this paper, we treat the number of NICs at each node as a design parameter, whereas the total number of NICs in the system is given. By properly placing more NICs to more "critical" nodes, the bandwidth of the spanning tree can be further increased. To this end, a new Integer Linear Programming (ILP) is formulated for solving the widest spanning tree problem based on joint optimization of interface placement, channel assignment, routing and scheduling. Numerical results show that interface placement provides a significant boost to the bandwidth of the widest spanning tree found. © 2009 IEEE.published_or_final_versio

Maximizing broadcast tree lifetime in wireless ad hoc networks

Abstract — In wireless ad hoc networks (WANETs), e.g. wireless sensor networks, battery-powered devices are constrained by limited amount of energy. Many WANET applications require that the duration (called lifetime) for which the network remains operational- until the first node exhausts its battery energy-is maximized. We study the problem of maximizing the lifetime of WANET broadcast trees under two receiver cost models: 1) the constant receiver power (CORP) model, in which a receiver consumes a fixed amount of energy for receiving an information bit; and, 2) the transmitter-receiver power tradeoff (TREPT) model, in which the amount of energy consumed by a receiver is a function of the received signal power and hence the transmitter power. We propose a graph theoretic solution for CORP model to find a maximum lifetime tree and a binary search based solution for TREPT model to determine power assignment which maximizes the lifetime of a given broadcast tree. Both polynomialtime solutions are formally proved to be optimal. I