Name
Abstract | ||
|---|---|---|
An ad-hoc sensor network is composed of sensing devices which can measure or detect features of their environment, communicate with one other and possibly with other devices that perform data fusion. One of the problems motivated by ad-hoc sensor networks is to position sensors in order to maximize coverage, or equivalently to minimize the number of sensors required to cover a given area. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/MAHSS.2008.4660045 | Atlanta, GA |
Keywords | Field | DocType |
boolean algebra,ad hoc networks,wireless sensor networks,boolean model,ad-hoc sensor network,dense sensor deployment,mobile communication,lattices,data fusion,gain,robustness,government,sensor network | Software deployment,Computer science,Visual sensor network,Computer network,Sensor fusion,Robustness (computer science),Wireless ad hoc network,Position sensor,Wireless sensor network,Mobile telephony,Distributed computing | Conference |
ISSN | ISBN | Citations |
2155-6806 | 978-1-4244-2575-4 | 0 |
PageRank | References | Authors |
0.34 | 11 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| amotz barnoy | 1 | 0 | 0.34 |
| timothy x brown | 2 | 0 | 0.34 |
| matthew p johnson | 3 | 0 | 0.34 |
| deniz sarioz | 4 | 0 | 0.34 |
| Dinesh C. Verma | 5 | 176 | 42.63 |
| Chai Wah Wu | 6 | 330 | 67.62 |