A new model for packet scheduling in multihop wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Energy-Aware Routing in Cluster-Based Sensor Networks
MASCOTS '02 Proceedings of the 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
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
End-to-end performance and fairness in multihop wireless backhaul networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 11th annual international conference on Mobile computing and networking
Energy-efficient data gathering algorithm in sensor networks with partial aggregation
International Journal of Sensor Networks
A tutorial on cross-layer optimization in wireless networks
IEEE Journal on Selected Areas in Communications
Review: A survey on cross-layer solutions for wireless sensor networks
Journal of Network and Computer Applications
QoS routing in wireless sensor networks—a survey
ACM Computing Surveys (CSUR)
International Journal of Autonomous and Adaptive Communications Systems
Computer Standards & Interfaces
Distributed Lifetime and Data Rate Optimization with Dynamic Approximation in Wireless Networks
Wireless Personal Communications: An International Journal
Maximum Lifetime Routing Problem in Duty-Cycling Sensor Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.01 |
In sensor networks, both energy and bandwidth are scarce resources. In the past, many energy efficient routing algorithms have been devised in order to maximize network lifetime, in which wireless link bandwidth has been optimistically assumed to be sufficient. This article shows that ignoring the bandwidth constraint can lead to infeasible routing solutions. As energy constraint affects how data should be routed, link bandwidth also affects not only the routing topology but also the allowed data rate on each link. In this paper, we discuss the sufficient condition on link bandwidth that makes a routing solution feasible, then provide mathematical optimization models to tackle both energy and bandwidth constraints. We first present a basic mathematical model to address using uniform transmission power for routing without data aggregation, then extend it to handle nonuniform transmission power, and then routing with data aggregation. We propose two efficient heuristics to compute the routing topology and link data rate. Simulation results show that these heuristics provide more feasible routing solutions than previous work, and provide significant improvement on throughput and lifetime.