On the maximum throughput of clandestine sensor networking

Ting He, Lang Tong, Ananthram Swami

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations


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.

Original languageEnglish (US)
Title of host publicationMILCOM 2009 - 2009 IEEE Military Communications Conference
StatePublished - 2009
Event2009 IEEE Military Communications Conference, MILCOM 2009 - Boston, MA, United States
Duration: Oct 18 2009Oct 21 2009

Publication series

NameProceedings - IEEE Military Communications Conference MILCOM


Other2009 IEEE Military Communications Conference, MILCOM 2009
Country/TerritoryUnited States
CityBoston, MA

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering


Dive into the research topics of 'On the maximum throughput of clandestine sensor networking'. Together they form a unique fingerprint.

Cite this