TY - CHAP
T1 - Design of surveillance sensor grids with a lifetime constraint
AU - Mhatre, Vivek
AU - Rosenberg, Catherine
AU - Kofman, Daniel
AU - Mazumdar, Ravi
AU - Shroff, Ness
PY - 2004/1/1
Y1 - 2004/1/1
N2 - A surveillance area is to be monitored using a grid network of heterogeneous sensor nodes. There are two types of nodes; type 0 nodes which perform sensing and relaying of data within a cluster, and type 1 nodes which act as cluster heads or fusion points. A surveillance aircraft visits the area periodically, and gathers information about the activity in the area. During each data gathering cycle, the sensor nodes use multi-hopping to communicate with their respective cluster heads, while the cluster heads perform data fusion, and transmit the aggregated data directly to the aircraft. We formulate and solve a cost based optimization problem to determine the optimum number of sensor nodes (n0), cluster head nodes (n1) and the battery energy in each type of nodes (E0 and E1 respectively) to ensure at least T data gathering cycles. We observe that the number of cluster heads required, n1, scales approximately as n01-k/4 where k is the propagation loss exponent.
AB - A surveillance area is to be monitored using a grid network of heterogeneous sensor nodes. There are two types of nodes; type 0 nodes which perform sensing and relaying of data within a cluster, and type 1 nodes which act as cluster heads or fusion points. A surveillance aircraft visits the area periodically, and gathers information about the activity in the area. During each data gathering cycle, the sensor nodes use multi-hopping to communicate with their respective cluster heads, while the cluster heads perform data fusion, and transmit the aggregated data directly to the aircraft. We formulate and solve a cost based optimization problem to determine the optimum number of sensor nodes (n0), cluster head nodes (n1) and the battery energy in each type of nodes (E0 and E1 respectively) to ensure at least T data gathering cycles. We observe that the number of cluster heads required, n1, scales approximately as n01-k/4 where k is the propagation loss exponent.
UR - https://www.scopus.com/pages/publications/35048890501
U2 - 10.1007/978-3-540-24606-0_18
DO - 10.1007/978-3-540-24606-0_18
M3 - Chapter
AN - SCOPUS:35048890501
SN - 3540208259
SN - 9783540208259
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 263
EP - 275
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
A2 - Karl, Holger
A2 - Wolisz, Adam
A2 - Willig, Andreas
PB - Springer Verlag
ER -