On Constructing k-Connected k-Dominating Set in Wireless Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
An Enhanced Zone-Based Routing Protocol for Mobile Ad-Hoc Networks Based on Route Reliability
AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 01
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Connectivity-based clustering with stretching technique in MANETs
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
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
Hierarchical routing in sensor networks using k-dominating sets
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Flooding in wireless ad hoc networks
Computer Communications
Determining the optimal configuration for the zone routing protocol
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
This paper proposes a new multi-hop wireless broadcast method called k-shortest path pruning (k-SPP). It is based on the dominant pruning method of Lim and Kim, and improves upon it in the context of certain routing protocols, such as the zone routing protocol. In this approach, every node must maintain as awareness of its k-hop neighbourhood, for some constant k ? 3. k-SPP dynamically discovers and exclusively uses forwarding paths having the property that every subpath of length k + 1 connects vertices that are a graph-theoretic distance k + 1 apart in the network graph. Experimental results demonstrate that k-SPP requires fewer transmissions than dominant pruning broadcasting.