Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
A taxonomy of wireless micro-sensor network models
ACM SIGMOBILE Mobile Computing and Communications Review
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Rate allocation in wireless sensor networks with network lifetime requirement
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Convex Optimization
On the Fundamental Capacity and Lifetime Limits of Energy-Constrained Wireless Sensor Networks
RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
A Utility-based Distributed Maximum Lifetime Routing Algorithm forWireless Networks
Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
Optimal rate allocation for energy-efficient multipath routing in wireless ad hoc networks
IEEE Transactions on Wireless Communications
Distributed algorithms for network lifetime maximization in wireless visual sensor networks
IEEE Transactions on Circuits and Systems for Video Technology
Optimal flow control for utility-lifetime tradeoff in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fair flow control in solar powered WLAN mesh networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Optimal resource allocation for video communication over distributed systems
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Energy-efficient data gathering in wireless sensor networks with asynchronous sampling
ACM Transactions on Sensor Networks (TOSN)
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Optimal flow control for utility-lifetime tradeoff in wireless sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Mini-sink mobility with diversity-based routing in wireless sensor networks
Proceedings of the 8th ACM Symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
A Robust and Efficient Cross-Layer Optimal Design in Wireless Sensor Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
The network lifetime and application performance are two fundamental but conflicting desig objectives in wireless sensor networks. Hence there is an intrinsic tradeoff between network lifetime maximization and application performance maximization. Often application performance correlates to the application data rate obtained in sensor networks. We can thus study this tradeoff by investigating the interactions between the network lifetime maximization problem and the rate allocation problem. Severe bias on the allocated rates of some sensor nodes may exist if only the total throughput of the sensor network is maximized, hence we enforce fairness on source rates of sensor nodes by invoking the network utility maximization (NUM) framework. First we consider the network lifetime as global information shared by sensor nodes. We formulate the network lifetime maximization and fair rate allocation both as constrained maximization problems. By introducing a system parameter, we combine these two objectives into a single weighted objective, and characterize the tradeoff between them. Then we give the optimality condition, and derive a partially distributed algorithm. Also, we identify the similarity between network lifetime maximization and max-min rate allocation in networks. Since the latter one can be approximated using NUM framework, we adopt the same idea for the former one, and approximate the optimal solution in the unified NUM framework. Based on this, an efficient fully distributed algorithm is derived.