Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Scenario-based performance analysis of routing protocols for mobile ad-hoc networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A Survey of Energy Efficient Network Protocols for Wireless Networks
Wireless Networks
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
The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Trajectory based forwarding and its applications
Proceedings of the 9th annual international conference on Mobile computing and networking
Topology control for wireless sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
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
A unified energy-efficient topology for unicast and broadcast
Proceedings of the 11th annual international conference on Mobile computing and networking
Localized topology control algorithms for heterogeneous wireless networks
IEEE/ACM Transactions on Networking (TON)
Localized Fault-Tolerant Topology Control in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Localized Topology Control for Unicast and Broadcast in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
Distributed optimal dynamic base station positioning in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-efficient topology control in wireless ad hoc networks with selfish nodes
Computer Networks: The International Journal of Computer and Telecommunications Networking
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part II
Neighbor Selection Game in Wireless Ad Hoc Networks
Wireless Personal Communications: An International Journal
DMED: A Dual-Mode Energy-Driven Routing Protocol for Wireless Planetary Exploration Sensor Network
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
In wireless ad hoc networks, energy utilization is perhaps the most important issue, since it corresponds directly to the operational network lifetime. Topology Control (TC) is a well-known energy saving technique which tries to assign transmission ranges of nodes to optimize their energy utilization while keeping the network connected. 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 forwards. Especially when such schemes are coupled with the popular shortest path routing, they usually create a highly-loaded area at the center of the network in which nodes deplete their battery very quickly. In this paper, we introduce efficient strategies that take both load and range into account to handle this problem. We first consider the simple strategy in which a proper transmission range is computed for all nodes of the network to optimize their energy utilization under the presence of the shortest path routing. Inspiring from the results of this strategy, we then propose our combined strategy and argue that a combination of circular paths and shortest paths could result in a much better solution. We also provide detailed analytical models to measure the forwarding load and interference of nodes and then corroborate them with simulation results. Using the combined strategy, the achieved improvement in terms of traffic load, interference, and maximum energy consumption is about 50%, as compared with the simple strategy.