Managing traffic growth in solar powered wireless mesh networks

Authors:
Ghada H. Badawy;Amir A. Sayegh;Terence D. Todd
Affiliations:
McMaster University, Hamilton, Ontario, Canada;McMaster University, Hamilton, Ontario, Canada;McMaster University, Hamilton, Ontario, Canada
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 5
Cited 0

Using Genetic Algorithms to Design Mesh Networks

Computer
Upgrading arcs to minimize the maximum travel time in a network

Networks
Upgrading arc problem with budget constraint

Proceedings of the 43rd annual Southeast regional conference - Volume 1
Energy-aware geographic routing in lossy wireless sensor networks with environmental energy supply

QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
Resource Allocation and Outage Control for Solar-Powered WLAN Mesh Networks

IEEE Transactions on Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless mesh nodes must often be upgraded so that the network can accommodate evolving user demands. When some of the nodes are operated using a sustainable solar energy source, these upgrades must take into account the cost of updating the node energy resource configurations. This is required so that the new network configuration can properly accommodate the updated energy workloads of the reprovisioned network. In this paper we study this problem in the context of sustainable energy mesh node provisioning costs. We derive a mixed integer linear programming (MILP) formulation which is used to optimize the costs of node resource upgrades. Using this result, a lower bound on the network upgrade cost is obtained. The paper then proposes the use of a genetic algorithm based methodology for determining practical cost-effective mesh node resource upgrading. Various examples are given using networks with random, mesh and tree topologies which show the value of the proposed mechanism. In particular we find that the genetic algorithm approach achieves results which are much better than those from an algorithm which uses local optimization. It also performs well compared to our derived lower bound.