Introduction to algorithms
Distributed code assignments for CDMA Packet Radio Network
IEEE/ACM Transactions on Networking (TON)
Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A probabilistic analysis for the range assignment problem in ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Algorithmic aspects of topology control problems for ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
CDMA-based MAC protocol for wireless ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Fairness in Routing and Load Balancing
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Topology control for wireless sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Design and implementation of a single system image operating system for ad hoc networks
Proceedings of the 3rd international conference on Mobile systems, applications, and services
An Ultra Low Power System Architecture for Sensor Network Applications
Proceedings of the 32nd annual international symposium on Computer Architecture
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
Energy-efficient topology control in wireless ad hoc networks with selfish nodes
Computer Networks: The International Journal of Computer and Telecommunications Networking
Neighbor Selection Game in Wireless Ad Hoc Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.25 |
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 properties 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.