@article{jun_sichitiu_2008, title={MRP: Wireless mesh networks routing protocol}, volume={31}, ISSN={["1873-703X"]}, DOI={10.1016/j.comcom.2008.01.038}, abstractNote={Wireless Mesh Networks (WMNs) are one of the few commonly implemented types of mobile ad-hoc networks (MANETs); several companies offer WMNs for broadband Internet access and for extending the coverage of wireless local area networks. Several particularities differentiate WMNs from MANETs. First, in WMNs, most of the traffic originates or terminates at the gateways (nodes connected to the wired infrastructure/Internet). Second, in most applications, WMN nodes tend to be neatly differentiated as either stationary nodes (providing connectivity and coverage) or mobile nodes (utilizing the coverage afforded by the stationary nodes). While general MANET routing protocols can be used in WMNs, it is expected that a protocol that takes the particularities of WMNs into account will outperform the general protocol. In this paper, we propose such a routing protocol and evaluate its performance via simulations. Results show that, for WMNs, the proposed routing protocol outperforms general purpose MANET protocols in terms of routing overhead, packet delivery ratio, network throughput, end-to-end delay, and average hop-count.}, number={7}, journal={COMPUTER COMMUNICATIONS}, author={Jun, Jangeun and Sichitiu, Mihail L.}, year={2008}, month={May}, pages={1413–1435} }
 @inproceedings{jun_sichitiu_2006, title={Scalable OSPF updates for MANETs}, booktitle={Globecom 2006 - 2006 ieee global telecommunications conference}, author={Jun, J. and Sichitiu, M. L.}, year={2006} }
 @article{jun_sichitiu_2003, title={The nominal capacity of wireless mesh networks}, volume={10}, ISSN={["1558-0687"]}, DOI={10.1109/mwc.2003.1241089}, abstractNote={Wireless mesh networks are an alternative technology for last-mile broadband Internet access. In WMNs, similar to ad hoc networks, each user node operates not only as a host but also as a router; user packets are forwarded to and from an Internet-connected gateway in multihop fashion. The meshed topology provides good reliability, market coverage, and scalability, as well as low upfront investments. Despite the recent startup surge in WMNs, much research remains to be done before WMNs realize their full potential. This article tackles the problem of determining the exact capacity of a WMN. The key concept we introduce to enable this calculation is the bottleneck collision domain, defined as the geographical area of the network that bounds from above the amount of data that can be transmitted in the network. We show that for WMNs the throughput of each node decreases as O(1/n), where n is the total number of nodes in the network. In contrast with most existing work on ad hoc network capacity, we do not limit our study to the asymptotic case. In particular, for a given topology and the set of active nodes, we provide exact upper bounds on the throughput of any node. The calculation can be used to provision the network, to ensure quality of service and fairness. The theoretical results are validated by detailed simulations.}, number={5}, journal={IEEE WIRELESS COMMUNICATIONS}, author={Jun, JG and Sichitiu, ML}, year={2003}, month={Oct}, pages={8–14} }