Journal
COMPUTER COMMUNICATIONS
Volume 31, Issue 1, Pages 160-173Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.comcom.2007.10.040
Keywords
wireless ad hoc networks; energy conservation; topology control; routing; traffic load
Ask authors/readers for more resources
Wireless ad hoc networks are usually composed of battery constraint devices, which make energy conservation a vital concern of their design. Reducing energy consumption has been addressed through different aspects till now. Topology Control (TC) is a well-known approach which tries to assign transmission ranges of nodes to optimize their energy utilization while keeping some network propertied like connectivity. However, in current TC schemes, the transmission range of each node is mostly accounted as the exclusive estimator for its energy consumption, while ignoring the amount of data it sends or relays. In this paper, we redefine the problem of Topology Control regarding both transmission range and traffic load parameters. After proving the NP-hardness of the new problem, we mathematically formulate it as a mixed integer linear programming problem to find optimal solutions. Then, we introduce polynomial-time heuristic algorithms to practically solve the problem. During construction of network topology, we deliberately take into account the impact of the employed routing method on load of individual nodes. Finally, we show the advantages of our proposals through simulations. (C) 2007 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available