Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is K-Connectivity

Handbook of Research on Wireless Security
If a network (graph) has k-connectivity, it means the it is k-connected, that is, given any pair of wireless devices (nodes), there are at least k disjoint paths to connect them.
Published in Chapter:
Fault Tolerant Topology Design for Ad Hoc and Sensor Networks
Yu Wang (University of North Carolina at Charlotte, USA)
Copyright: © 2008 |Pages: 13
DOI: 10.4018/978-1-59904-899-4.ch040
Abstract
Fault tolerance is one of the premier system design desiderata in wireless ad hoc and sensor networks. It is crucial to have a certain level of fault tolerance in most of ad hoc and sensor applications, especially for those used in surveillance, security, and disaster relief. In addition, several network security schemes require the underlying topology provide fault tolerance. In this chapter, we will review various fault tolerant techniques used in topology design for ad hoc and sensor networks, including those for power control, topology control, and sensor coverage.
Full Text Chapter Download: US $37.50 Add to Cart
More Results
Connectivity Management in Drone Networks: Models, Algorithms, and Methods
Also known as k -vertex-connectivity. A connected graph's ability to remain connected after removal of any fewer than k vertices.
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR