Discrete Mathematics - Topics on domination
A tight analysis of the greedy algorithm for set cover
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Authenticated ad hoc routing at the link layer for mobile systems
Wireless Networks
The quest for security in mobile ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Geometric Spanners for Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
IEEE Network: The Magazine of Global Internetworking
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Due to the limited lifetime of the nodes in ad hoc and sensor networks, energy efficiency needs to be an important design consideration in any routing algorithm. It is known that by employing a virtual backbone in a wireless network, the efficiency of any routing scheme for the network can be improved. Most of the current algorithms for electing the virtual backbone mainly focused on the energy balance among the network nodes without considering the nodes distribution in the real environment. In this paper, we use the node's geometric locations to introduce a first secure algorithm that can construct the virtual backbone structure locally in 3D environment; we have proofed that our new algorithm construction time is constant.