NDLI: Dominating connectivity and reliability of heterogeneous sensor networks

Content Provider	IEEE Xplore Digital Library
Author	Berman, K.A. Annexstein, F.S. Ranganathan, A.
Copyright Year	2006
Description	Author affiliation: Dept. of Electr. & Comput. Eng. & Comput. Sci., Cincinnati Univ., OH (Berman, K.A.; Annexstein, F.S.; Ranganathan, A.)
Abstract	Consider a placement of heterogeneous, wireless sensors that can vary the transmission range by increasing or decreasing power. The problem of determining an optimal assignment of transmission radii, so that the resulting network is strongly-connected and more generally k-connected has been studied in the literature. In traditional k-connectedness, the network is able resist the failure of up to k - 1 nodes anywhere in the network, and still remain strongly-connected. In this paper we introduce a much stronger k-connectedness property, which we show can be implemented efficiently, and without great increase in the radii of transmission needed to simply achieve connectedness. We say that a network is dominating k-connected if, for any simultaneous failure of nodes throughout the network, with at most k - 1 nodes failures occurring in the out-neighborhood any surviving (up) node, the set U of up nodes forms a dominating set and induces a strongly-connected subdigraph. In this paper, we give a simple characterization of the networks that are dominating k-connected and design an associated efficient algorithm for determining the dominating connectivity, i.e., the maximum k such that the network is dominating k-connected. We also present an efficient algorithm for computing an assignment of transmission radii that results in a dominating k-connected network which minimizes the maximum radius. Furthermore, we show that the maximum radius in this assignment is no more than a multiplicative factor of k greater than the percolation radius $rho_{perc},$ i.e., the minimum that the maximum transmission radius can be so that the network remains connected. We show through empirical testing that this multiplicative factor can, in practice, be considerably less than k and only slightly greater than that required to achieve traditional k-connectedness. Finally, we show that for sensors placed on the lattice points of a two-dimensional square, we can achieve dominating k-connectedness with a multiplicative factor of at most radic2[radick + .5] greater than $rho_{perc}$
Starting Page	5
Ending Page	95
File Size	211992
Page Count	91
File Format	PDF
ISBN	0769525202
DOI	10.1109/PERCOMW.2006.44
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-03-13
Publisher Place	Italy
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Wireless sensor networks Spread spectrum communication Resists Algorithm design and analysis Computer networks Testing Lattices Costs
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

DiF: A Diagnosis Framework for Wireless Sensor Networks

Minimizing communication costs in hierarchically clustered networks of wireless sensors

A Novel Three-Dimensional Localization Algorithm in Wireless Sensor Networks

Scalable emulation of TinyOS applications in heterogeneous network scenarios

Hybrid Energy-Aware Synchronization Algorithm in Wireless Sensor Networks

Preserving Relay Connectivity and Coverage in Heterogeneous Wireless Sensor Networks

Characterization of a Connectivity Measure for Sparse Wireless Multi-hop Networks

A clustering topology control algorithm for heterogeneous wireless network

Data Gathering Algorithm Based Load Balance for Wireless Sensor Networks

Dominating connectivity and reliability of heterogeneous sensor networks

Similar Documents

DiF: A Diagnosis Framework for Wireless Sensor Networks

Minimizing communication costs in hierarchically clustered networks of wireless sensors

A Novel Three-Dimensional Localization Algorithm in Wireless Sensor Networks

Scalable emulation of TinyOS applications in heterogeneous network scenarios

Hybrid Energy-Aware Synchronization Algorithm in Wireless Sensor Networks

Preserving Relay Connectivity and Coverage in Heterogeneous Wireless Sensor Networks

Characterization of a Connectivity Measure for Sparse Wireless Multi-hop Networks

A clustering topology control algorithm for heterogeneous wireless network

Data Gathering Algorithm Based Load Balance for Wireless Sensor Networks

Dominating connectivity and reliability of heterogeneous sensor networks