Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
SIAM Journal on Computing
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
Wireless integrated network sensors
Communications of the ACM
Proceedings of the 7th annual international conference on Mobile computing and networking
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Data Gathering in SEnsor Networks using the Energy Delay Metric
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets
Computer Networks: The International Journal of Computer and Telecommunications Networking
An energy-efficient heterogeneous dual routing scheme for mobile ad hoc and sensor networks
International Journal of Mobile Network Design and Innovation
Constructing special k-dominating sets using variations on the greedy algorithm
Pervasive and Mobile Computing
Efficient multi-hop broadcasting in wireless networks using k-shortest path pruning
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
A new pruning method for efficient broadcasting in ad hoc networks
International Journal of Mobile Network Design and Innovation
| Hi-index | 0.00 |
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, called k-SPR sets. Such a set can serve as a virtual backbone to facilitate shortest path routing, as introduced in [4] and [14]. When employed in a hierarchical fashion, together with a hybrid (partly proactive, partly reactive) strategy, the k-SPR set methods become highly scalable, resulting in guaranteed minimal path routing, with comparatively little overhead.