@conference {
	title = {Impact of Protocols on Traffic Burstiness At Large Timescales in Wireless Multi-Hop Networks},
	author = {Jain, Kaustubh., Baras, John S.},
	year = {2013},
	month = {06/2013},
	abstract = {We investigate the impact of the protocol stack on traffic burstiness at large time-scales in wireless multi-hop network traffic. Origins of traffic burstiness at large scales (like its LRD nature) have been mostly attributed to the heavy-tails in traffic sources. In wired networks, protocol dynamics have little impact on large time-scale dynamics. However, given the nature wireless networks, the MAC and routing layers together can lead to route flapping or oscillations even in a static network.Hence, we explore whether these dynamics can lead to trafficburstiness and LRD. Using network simulations, we analyze traffic for two MANET routing protocols - OLSR and AODV. By varying the routing protocol parameters, we analyze their role in inducing or preventing route oscillations, and study their impact on traffic LRD. We find that, losses in OLSR control packets, due to congestion at the MAC, can lead to route oscillations and trafficburstiness at large timescales. By tuning the parameters, route oscillations and traffic LRD can be avoided. AODV dynamics show little evidence for traffic LRD, even though we cannot rule out this possibility. We also show that the route oscillations can have heavier body and tail than exponential distribution, and that the Markovian framework for route oscillations is inadequate to explain the observed traffic scaling. Lastly, we give a model that captures the MAC and OLSR routing protocol interactions and depending upon chosen protocol parameters and input load,correctly predicts the presence of traffic LRD. Thus, we use this model to design appropriate choice of protocol parameters to mitigate traffic burstiness at large-timescales.},
	address = {Corsica, France},
	booktitle = {IEEE 2013 The 12th Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net)},
	pages = {pp. 61-68},
	organization = {Ajaccio}
}
@conference {
	title = {A Model Based Platform for Design and Optimization of Multi-hop 802.11 Wireless Networks},
	author = {Baras, John S., Tabatabaee, Vahid., Jain, Kaustubh.},
	year = {2011},
	month = {10/2011},
	abstract = {We develop a loss model for multi-hop wireless networks based on IEEE 802.11 MAC. Given a multi-hop network topology, connection demands and routes, we model the working of 802.11 MAC in DCF mode to find good approximations to average MAC layer losses, service times and carried load. The model is defined as an implicit function amongst the variables in the model and solved using a fixed point approach. Further, using Automatic Differentiation (AD) on the implicit function , we perform sensitivity analysis and use it in an optimization framework. As an illustration of how this model can help in design and optimization of wireless networks, we optimize the network throughput by appropriate load splitting along multiple paths. We validate our models using network simulations.},
	address = {Miami Beach, Florida},
	booktitle = {8th ACM International Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor and Ubiquitous Networks (PE-WANSUN 201},
	pages = {pp. 17-24}
}
@conference {
	title = {Studying Real-time Traffic in Multi-hop Networks Using the EMANE Emulator: Capabilities and Limitations},
	author = {Jain, Kaustubh., Roy-Chowdhury, Ayan., Somasundaram, Kiran K., Wang, Baobing., Baras, John S.},
	year = {2011},
	month = {03/2011},
	abstract = {In this paper, we provide an open-source software emulator setup for MANETs and study its fidelity in providing reliable performance estimates for real-time traffic. We emulate the IEEE 802.11 MAC/PHY (DCF) using the EMANE software emulator deployed on a cluster and run experiments for different multi-hop wireless scenarios. As an instance, we study the performance of real-time streaming media over a mesh network supported by OLSR. We also use the setup to analyze the impact of the wireless network on the self-similarity of the traffic.},
	address = {Barcelona, Spain},
	booktitle = {SIMUTools 2011- 4th International Conference on Simulation Tools and Techniques},
	pages = {pp. 93-95}
}
@conference {
	title = {Distributed Topology Control for Stable Path Routing in Multi-hop Wireless Networks},
	author = {Somasundaram, Kiran K., Baras, John S., Jain, Kaustubh., Tabatabaee, Vahid.},
	year = {2010},
	month = {12/2010},
	abstract = {In this paper, we introduce the stable path topology control problem for routing in mobile multi-hop networks. We formulate the topology control problem of selective linkstate broadcast as a graph pruning problem with restricted local neighborhood information. We develop a multi-agent optimization framework where the decision policies of each agent are restricted to local policies on incident edges and independent of the policies of the other agents. We show that under a condition called the positivity condition, these independent local policies preserve the stable routing paths globally. We then provide an efficient algorithm to compute an optimal local policy that yields a minimal pruned graph, which we call the Stable Path Topology Control (SPTC) algorithm. Using simulations, we demonstrate that this algorithm, when used with the popular ETX metric, outperforms topology control mechanisms commonly used for Mobile Ad Hoc Networks.},
	address = {Atlanta, Georgia},
	booktitle = {49th IEEE Conference on Decision and Control (CDC 2010)},
	pages = {pp.  2342-2347}
}
@conference {
	title = {Component Based Modeling for Cross-layer Analysis of 802.11 MAC and OLSR Routing Protocols in Ad-hoc Networks},
	author = {Baras, John S., Tabatabaee, Vahid., Jain, Kaustubh.},
	year = {2009},
	month = {10/2009},
	abstract = {We present a complete scenario driven component based analytic model of 802.11 MAC and OLSR routing protocols in MANETs. We use this model to provide a systematic approach to study the network performance and cross-layer analysis and design of routing, scheduling, MAC, and PHY layer protocols. The routing protocol is divided into multiple components. Componentization is a standard methodology for analysis and synthesis of complex systems. To provide a component based design methodology, we have to develop a component based model of the wireless network that considers cross-layer dependency of performance. The component based model enables us to study the effect of each component on the overall performance of the wireless network and to design each component separately. For the MAC layer, we use a fixed point loss model of 802.11 protocol that considers effects of hidden nodes and finite retransmission attempts. We have also considered simple models for PHY and scheduling. The main focus of this paper is on the integration of these models to obtain a complete model for wireless networks. In several scenario driven studies, with user-specified topologies and traffic demands, we study the performance metrics - throughput and delay. By analyzing the performances under varying network scenarios, we are able to identify a few sources of performance degradation. We also study the effect of certain design parameters on the network performance. Thus, demonstrating the ability of the model to quickly identify problem components and try alternative design parameters},
	address = {Boston, Massachusetts},
	booktitle = {MILCOM 2009 \&quot;The Challenge of Convergence\&quot;},
	pages = {pp. 1-7}
}
@techreport {
	title = {Study of OLSR for Real-time Media Streaming over 802.11 Wireless Network in Software Emulation Environment},
	author = {Jain, Kaustubh., Somasundaram, Kiran K., Brian, K Wang., Baras, John S., Roy-Chowdhury, Ayan.},
	year = {2013},
	month = {12/2013},
	abstract = {In this paper we present a setup to study the real-time traffic carrying performance of Optimized Link State Routing (OLSR) protocol using software emulation. We emulate the IEEE 802.11 MAC/PHY using the EMANE software emulator, on a cluster of machines, for different multi-hop wireless scenarios. As an instance of real-world usage scenario, we study the performance of real-time streaming media over a mesh network supported by OLSR. In particular, we study the effect of mobility and background traffic on carried load and jitter. We propose to extend this emulation setup to test the real-time performance of prototype routing protocols such as Stable Path Topology Control (SPTC) and other real-time applications.}
}
@techreport {
	title = {Distributed Topology Control for Stable Path Routing in Multi-hop Wireless Networks},
	author = {Somasundaram, Kiran K., Baras, John S., Jain, Kaustubh., Tabatabaee, Vahid.},
	year = {2010},
	month = {07/2010},
	abstract = {In this paper, we introduce the topology control problem for stable path routing in mobile multi-hop networks. We formulate the topology control problem of selective linkstate broadcast as a graph pruning problem with restricted local neighborhood information. We develop a multi-agent optimization framework where the decision policies of each agent are restricted to local policies on incident edges and independent of the policies of the other agents. We show that under a condition called the positivity condition, these independent local policies preserve the stable routing paths globally. We then provide an efficient algorithm to compute an optimal local policy that yields a minimal pruned graph, which we call the Stable Path Topology Control (SPTC) algorithm. Using simulations, we demonstrate that this algorithm, when used with the popular ETX metric, has lesser control overhead and the resulting pruned routing paths carry more upper layer traffic when compared with other topology control mechanisms commonly used for Mobile Ad Hoc Networks.}
}
@techreport {
	title = {Distributed Topology Control for Stable Path Routing in Mobile Ad Hoc Networks},
	author = {Somasundaram, Kiran K., Jain, Kaustubh., Tabatabaee, Vahid., Baras, John S.},
	year = {2010},
	month = {03/2010},
	abstract = {In this paper, we introduce the stable path topology control problem for routing in Mobile Ad Hoc Networks (MANETs). We formulate the problem as a constrained multiagent optimization problem with only local neighborhood information. We develop and prove local pruning strategies that solve this problem. We also introduce the notion of distorted pruning, which offers a systematic method to trade path stability off against the hop count metric. Finally, we quantify the performance of our pruning algorithms using several simulation scenarios.}
}
