Networking with secrecy constraints

Parvathinathan Venkitasubramaniam, Ting He, Lang Tong

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

3 Scopus citations


Wireless Networks are susceptible to anonymous monitoring of transmissions by adversaries who can infer valuable infonnation about data flows in the network. It is therefore necessary to design network protocols that maintain secrecy of routes from eavesdroppers. In this work, we present a mathematical formulation of route secrecy when eavesdroppers observe transmission epochs of nodes. We consider networks where the nodes use receiver directed signaling schemes and each node has a strict delay constraint for relaying packets. We propose a scheduling technique to provide complete secrecy of routes, and based on that, characterize achievable rate regions for two-hop data routes under the given constraints. Furthermore, we extend the results when an additional constraint on packet loss is imposed.

Original languageEnglish (US)
Title of host publicationMilitary Communications Conference 2006, MILCOM 2006
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Print)1424406188, 9781424406180
StatePublished - Jan 1 2006
EventMilitary Communications Conference 2006, MILCOM 2006 - Washington, D.C., United States
Duration: Oct 23 2006Oct 25 2006

Publication series

NameProceedings - IEEE Military Communications Conference MILCOM


OtherMilitary Communications Conference 2006, MILCOM 2006
Country/TerritoryUnited States
CityWashington, D.C.

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering


Dive into the research topics of 'Networking with secrecy constraints'. Together they form a unique fingerprint.

Cite this