TY - GEN
T1 - Sufficient node density conditions on delay-tolerant sensor networks for wildlife tracking and monitoring
AU - Ehsan, Samina
AU - Brugger, Max
AU - Bradford, Kyle
AU - Hamdaoui, Bechir
AU - Kovchegov, Yevgeniy
PY - 2011
Y1 - 2011
N2 - This paper investigates the performance limits of delay tolerant networks (DTNs) with intermittently connected nodes deployed for wildlife monitoring, wherein information is either transmitted or carried to static accesspoints by free-ranging animals whose movement is assumed to be random. Specifically, in such mobility-aided applications where routing is performed in a store-carry-and-drop manner, limited buffer capacity of a carrier node plays a critical role, and data loss due to buffer overflow heavily depends on access-point density. Driven by this fact, our focus in this paper is on providing sufficient conditions on accesspoint density that limit the likelihood of buffer overflow. Specifically, we first derive and prove sufficient access-point density conditions that ensure that the data loss rates are statistically guaranteed to be below a given threshold. We consider studying both the square and hexagonal accesspoint deployment structures. Then, we validate the derived theoretical results for each of the two studied structures through simulations.
AB - This paper investigates the performance limits of delay tolerant networks (DTNs) with intermittently connected nodes deployed for wildlife monitoring, wherein information is either transmitted or carried to static accesspoints by free-ranging animals whose movement is assumed to be random. Specifically, in such mobility-aided applications where routing is performed in a store-carry-and-drop manner, limited buffer capacity of a carrier node plays a critical role, and data loss due to buffer overflow heavily depends on access-point density. Driven by this fact, our focus in this paper is on providing sufficient conditions on accesspoint density that limit the likelihood of buffer overflow. Specifically, we first derive and prove sufficient access-point density conditions that ensure that the data loss rates are statistically guaranteed to be below a given threshold. We consider studying both the square and hexagonal accesspoint deployment structures. Then, we validate the derived theoretical results for each of the two studied structures through simulations.
UR - http://www.scopus.com/inward/record.url?scp=84857230473&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2011.6134558
DO - 10.1109/GLOCOM.2011.6134558
M3 - Conference contribution
AN - SCOPUS:84857230473
SN - 9781424492688
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - 2011 IEEE Global Telecommunications Conference, GLOBECOM 2011
T2 - 54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011
Y2 - 5 December 2011 through 9 December 2011
ER -