Award Abstract # 0728928
Foundations of Coverage and Connectivity for Wireless Sensor Networks Deployed in Thin Strips

NSF Org: CCF
Division of Computing and Communication Foundations
Recipient: UNIVERSITY OF MEMPHIS
Initial Amendment Date: September 17, 2007
Latest Amendment Date: September 17, 2007
Award Number: 0728928
Award Instrument: Standard Grant
Program Manager: Phillip Regalia
pregalia@nsf.gov
 (703)292-2981
CCF
 Division of Computing and Communication Foundations
CSE
 Directorate for Computer and Information Science and Engineering
Start Date: September 15, 2007
End Date: August 31, 2011 (Estimated)
Total Intended Award Amount: $350,000.00
Total Awarded Amount to Date: $350,000.00
Funds Obligated to Date: FY 2007 = $350,000.00
History of Investigator:
  • Santosh Kumar (Principal Investigator)
    skumar4@memphis.edu
  • Bela Bollobas (Co-Principal Investigator)
  • Paul Balister (Co-Principal Investigator)
Recipient Sponsored Research Office: University of Memphis
115 JOHN WILDER TOWER
MEMPHIS
TN  US  38152-0001
(901)678-3251
Sponsor Congressional District: 09
Primary Place of Performance: University of Memphis
115 JOHN WILDER TOWER
MEMPHIS
TN  US  38152-0001
Primary Place of Performance
Congressional District:
09
Unique Entity Identifier (UEI): F2VSMAKDH8Z7
Parent UEI:
NSF Program(s): COMMUNICATIONS RESEARCH
Primary Program Source: app-0107 
Program Reference Code(s): 9150, 9218, HPCC
Program Element Code(s): 409600
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.070

ABSTRACT

Abstract: In several real-life scenarios, wireless sensors may be deployed in thin strip regions, such as when deploying sensors along international borders to detect illegal intrusion, around forests to detect the spread of forest fire, around a chemical factory to detect the spread of lethal chemicals, or on both sides of a long gas pipeline to detect potential sabotage. Most existing work on coverage and connectivity are not applicable to these strip deployment regions since they often ignore the boundaries of the deployment region. Further, most existing work on coverage and connectivity for random deployments provide only asymptotic results, and do not give reliable numerical conditions for determining the density required for adequate coverage in finite regions.



This project is aimed at establishing a strong foundation for coverage and connectivity when wireless sensors are deployed in thin strip regions. To achieve this goal, this project is investigating the coverage and connectivity properties for three kinds of sensors omnidirectional sensors, directional sensors (such as lasers and cameras), and mobile sensors. The project uses rigorous mathematical analysis to derive precise numerical estimates for achieving coverage and connectivity for random deployments. It is also investigating optimal algorithms (both centralized and distributed versions) for critical network activities such as coverage/connectivity verification, coverage restoration upon sensor failures, and sleep-wakeup schedule determination for network lifetime maximization. The new techniques developed in this project for deriving precise density estimates make the coverage and connectivity results readily usable in real-life, thus bridging the gap between theory and practice. The comprehensive foundation for coverage and connectivity for thin strips being created in this project is expected to make perimeter security with wireless sensors more practical.

PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH

Note:  When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

(Showing: 1 - 10 of 33)
P. N. Balister, B. Bollobas, A. Sarkar, and M. J. Walters "Sentry Selection in Wireless Networks" Advances in Applied Probability , v.42 , 2010 , p.1
A. Chowdhury, B. Patkos "Shadows and Intersections in Vector Spaces" J. of Combinatorial Theory , v.117 , 2010 , p.1095
Balister, P; Bollobas, B "Bond Percolation With Attenuation in High Dimensional Voronoi Tilings" RANDOM STRUCTURES & ALGORITHMS , v.36 , 2010 , p.5 View record at Web of Science 10.1002/rsa.2029
Balister, P; Bollobas, B; Johnson, JR; Walters, M "Random Majority Percolation" RANDOM STRUCTURES & ALGORITHMS , v.36 , 2010 , p.315 View record at Web of Science 10.1002/rsa.2028
Balister, P; Bollobas, B; Sarkar, A; Walters, M "A CRITICAL CONSTANT FOR THE k-NEAREST-NEIGHBOUR MODEL" ADVANCES IN APPLIED PROBABILITY , v.41 , 2009 , p.1 View record at Web of Science
Balister, P; Bollobas, B; Sarkar, A; Walters, M "Highly connected random geometric graphs" DISCRETE APPLIED MATHEMATICS , v.157 , 2009 , p.309 View record at Web of Science 10.1016/j.dam.2008.03.00
Balister, P; Bollobas, B; Sarkar, A; Walters, M "SENTRY SELECTION IN WIRELESS NETWORKS" ADVANCES IN APPLIED PROBABILITY , v.42 , 2010 , p.1 View record at Web of Science
Balister, P; Bollobas, B; Walters, M "RANDOM TRANSCEIVER NETWORKS" ADVANCES IN APPLIED PROBABILITY , v.41 , 2009 , p.323 View record at Web of Science
Balister, P; Kalikow, S; Sarkar, A "The Linus Sequence" COMBINATORICS PROBABILITY & COMPUTING , v.19 , 2010 , p.21 View record at Web of Science 10.1017/S096354830999019
Balister, P; Patkos, B "Random Partial Orders Defined by Angular Domains" ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS , v.28 , 2011 , p.341 View record at Web of Science 10.1007/s11083-010-9172-
Balogh, J. and Bollobas, B. and Morris, R. "Bootstrap Percolation in High Dimensions" Combinatorics Probability & Computing , v.19 , 2010 , p.643
(Showing: 1 - 10 of 33)

Please report errors in award information by writing to: awardsearch@nsf.gov.

Print this page

Back to Top of page