In this paper, we first present a theoretical framework aimed at generalizing the scaling laws of delay, secrecy and throughput in mobile ad-hoc networks for various network models and scheduling policies available in the literature. We derive new scaling laws for throughput-delay trade-offs for routing policies such as Spray-and-Wait. A model based on threshold secrecy constraint is developed and it is shown that scaling is not impacted provided the eavesdropper density is lower than the node density.
