Multicluster, mobile, multimedia radio network
Wireless Networks
On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Next century challenges: mobile networking for “Smart Dust”
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Load-Balancing Clusters in Wireless Ad Hoc Networks
ASSET '00 Proceedings of the 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology (ASSET'00)
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Topology control for wireless sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Minimizing communication costs in hierarchically-clustered networks of wireless sensors
Computer Networks: The International Journal of Computer and Telecommunications Networking
A scalable approach for reliable downstream data delivery in wireless sensor networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Convex Optimization
Initializing newly deployed ad hoc and sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Maximizing the Lifetime of Dominating Sets
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
IEEE Communications Magazine
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
An energy-efficient adaptive clustering algorithm with load balancing for wireless sensor network
International Journal of Sensor Networks
An energy-balancing clustering approach for gradient-based routing in wireless sensor networks
Computer Communications
Provable configuration planning for wireless sensor networks
Proceedings of the 8th International Conference on Network and Service Management
| Hi-index | 0.00 |
In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network by optimal balancing of power consumption among cluster heads (CHs). Clustering significantly reduces the energy consumption of individual sensors, but it also increases the communication burden on CHs. To investigate this tradeoff, our analytical model incorporates both intra- and intercluster traffic. Depending on whether location information is available or not, we consider optimization formulations under both deterministic and stochastic setups, using a Rayleigh fading model for intercluster communications. For the deterministic setup, sensor nodes and CHs are arbitrarily placed, but their locations are known. Each CH routes its traffic directly to the sink or relays it through other CHs. We present a coverage-time-optimal joint clustering/routing algorithm, in which the optimal clustering and routing parameters are computed using a linear program. For the stochastic setup, we consider a cone-like sensing region with uniformly distributed sensors and provide optimal power allocation strategies that guarantee (in a probabilistic sense) an upper bound on the end-to-end (inter-CH) path reliability. Two mechanisms are proposed for achieving balanced power consumption in the stochastic case: a routing-aware optimal cluster planning and a clustering-aware optimal random relay. For the first mechanism, the problem is formulated as a signomial optimization, which is efficiently solved using generalized geometric programming. For the second mechanism, we show that the problem is solvable in linear time. Numerical examples and simulations are used to validate our analysis and study the performance of the proposed schemes.