TY - GEN
T1 - On the maximum throughput of clandestine sensor networking
AU - He, Ting
AU - Tong, Lang
AU - Swami, Ananthram
PY - 2009
Y1 - 2009
N2 - We consider the problem of clandestine communications, i.e., communications that are meant to be invisible to third-party eavesdroppers, in the context of wireless sensor networks. Although encryption and anonymous routing protocols can hide the content and the routing information, the transmission activities of sensors on the same route can still reveal the information flow. In this work, a perfectly clandestine scheduling method is developed to hide the desired information flow in a sequence of independent transmission activities resembling those without any flow, while satisfying the resource constraint at the relay nodes in terms of limited buffer size. The proposed method is proved to achieve the maximum throughput, which is characterized analytically for transmission schedules following alternating renewal processes with a closed-form solution for Poisson processes. The analytical results are verified through numerical simulations on synthetic traffic as well as traces.
AB - We consider the problem of clandestine communications, i.e., communications that are meant to be invisible to third-party eavesdroppers, in the context of wireless sensor networks. Although encryption and anonymous routing protocols can hide the content and the routing information, the transmission activities of sensors on the same route can still reveal the information flow. In this work, a perfectly clandestine scheduling method is developed to hide the desired information flow in a sequence of independent transmission activities resembling those without any flow, while satisfying the resource constraint at the relay nodes in terms of limited buffer size. The proposed method is proved to achieve the maximum throughput, which is characterized analytically for transmission schedules following alternating renewal processes with a closed-form solution for Poisson processes. The analytical results are verified through numerical simulations on synthetic traffic as well as traces.
UR - http://www.scopus.com/inward/record.url?scp=77951495308&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77951495308&partnerID=8YFLogxK
U2 - 10.1109/MILCOM.2009.5379807
DO - 10.1109/MILCOM.2009.5379807
M3 - Conference contribution
AN - SCOPUS:77951495308
SN - 9781424452385
T3 - Proceedings - IEEE Military Communications Conference MILCOM
BT - MILCOM 2009 - 2009 IEEE Military Communications Conference
T2 - 2009 IEEE Military Communications Conference, MILCOM 2009
Y2 - 18 October 2009 through 21 October 2009
ER -