By Topic

Localized detection of k-connectivity in wireless ad hoc, actuator and sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)

Ad hoc, actuator and sensor wireless networks normally have critical connectivity properties before becoming fault intolerant. Existing algorithms for testing k-connectivity are centralized. In this article, we introduce localized algorithms for testing A-connectivity. In localized protocols, each node makes its own decision based on the information available in its local neighborhood. In the first proposed local neighbor detection (LND) algorithm, each node verifies whether or not itself and each of its p-hop neighbors have at least k neighbors. In the second local critical node detection (LCND) protocol, it also tests if the subgraph of its p-hop neighbours of a given node is k-connected. The third local subgraph connectivity detection (LSCD) protocol is based on communications between neighboring nodes to exchange the local decisions starting from k=l. All nodes declare themselves locally 1-connected. For k=2,3,..., iteratively, local decisions are propagated to p-hop neighbors. If node A is (k-1,)-connected, all its p-hop neighbors are (k-1)-connected, and the graph consisting of p-hop neighbors of A (excluding A) is (k-1,)-connected, then node A declares its neighborhood as k-connected. The experiments are carried with two ways of uniform generation of connected unit disk graphs. They show low percentage of false 'alarms', ability to locate critical areas in k-disconnected networks, and increased accuracy with increased local knowledge.

Published in:

Computer Communications and Networks, 2007. ICCCN 2007. Proceedings of 16th International Conference on

Date of Conference:

13-16 Aug. 2007