@conference {
	title = {Broadcast Scheduling for Time-Constrained Information Delivery},
	author = {Raissi-Dekhordi, Majid., Baras, John S.},
	year = {2007},
	month = {11/2007},
	abstract = {In this report, the problem of broadcast scheduling in Push broadcast systems is studied. We introduce an optimization approach that leads to well-justified policies for Push broadcast systems with time constraints. In particular, we apply our results to a Push broadcast system with different deadlines associated to the files while allowing the files to have arbitrary demand rates and lengths.We calculate the optimal average cost for our experimental settings and show, through extensive simulation studies, that the results obtained from our scheduling policy are very close to that optimal value for each experiment.},
	address = {Washington DC},
	booktitle = {IEEE 2007 Global Communications Conference (GLOBECOM) Enhibition \&amp; Industry Forum},
	pages = {pp. 5298-5303}
}
@conference {
	title = {Analysis of Delay Properties and Admission Control in 802.11 Networks},
	author = {Raissi-Dekhordi, Majid., Chandrashekar, Karthikeyan., Baras, John S.},
	year = {2005},
	month = {06/2005},
	abstract = {The ubiquitous use of 802.11 wireless networks highlights the importance of understanding the performance of the 802.11 protocol, specifically its delay properties which is the key to sustaining delay sensitive applications over such networks. In this paper, analytical expressions are derived for the channel access delay distribution of 802.11 networks. An implicit admission control scheme is proposed that uses the channel service time distribution as input to determine the maximum number of users that can be admitted. The analytical expressions for the delay are shown to closely match simulation results. We analyze the performance of the admission control scheme and calculate the saturation throughput for the admitted user. Simulation results validate the effectiveness of the admission control scheme and the analytical results.},
	address = {Maui, Hawaii},
	booktitle = {2005 International Conference on Wireless Networks, Communications and Mobile Computing},
	pages = {pp. 674-679}
}
@conference {
	title = {Providing Full Connectivity in Large Ad-Hoc Networks by Dynamic Placement of Aerial Platforms},
	author = {Chandrashekar, Karthikeyan., Raissi-Dekhordi, Majid., Baras, John S.},
	year = {2004},
	month = {10/2004},
	abstract = {In this paper, we address the problem of providing full connectivity to disconnected ground MANET nodes by dynamically placing unmanned aerial vehicles (UAVs) to act as relay nodes. We provide a heuristic algorithm to find the minim1 number of such aerial vehicles required to provide full connectivity and find the corresponding locations for these aerial platforms (UAVs). We also track the movement of the ground nodes and update the location of the UAVs. We describe a communication framework that enables the ground nodes to communicate with its peer ground nodes as well as the UAVs that act as relay nodes. The communication architecture is designed to work with existing MANET Routing Protocols.},
	address = {Monterey, California},
	booktitle = {MILCOM 2004},
	pages = {pp. 1429-1436}
}
@conference {
	title = {Near-optimal Policies for Broadcasting Files with Unequal Sizes},
	author = {Raissi-Dekhordi, Majid., Baras, John S.},
	year = {2003},
	month = {10/2003},
	abstract = {Information broadcasting is an effective method to deliver popular information pages to a large number of users in wireless and satellite networks. In a previous work, we used a dynamic optimization approach to address the problem of broadcast scheduling for a pull system with equal file sizes. In this paper, we address that problem in a more general setting where the file sizes are not equal and have geometric size distributions with possibly different means. The dynamic optimization approach allows us to find a near-optimal scheduling policy, which we use as a benchmark to evaluate a number of other heuristic policies. Also, we modify the resulting policy and apply it to the case with fixed (unequal) file sizes and compare the results with some other well known, as well as new, heuristic policies. Finally, we introduce a low-complexity heuristic policy to be used for practical implementations. The results show that the performance of the new policy is very close to that of the original policy.},
	address = {Monticello, Illinois},
	booktitle = {41st Annual Allerton 2003 Conference},
	pages = {pp. 279-288}
}
@conference {
	title = {Broadcast scheduling in information delivery systems},
	author = {Raissi-Dekhordi, Majid., Baras, John S.},
	year = {2002},
	month = {11/2002},
	abstract = {Information broadcasting is an effective method to deliver popular information packages to a large number of users in wireless and satellite networks. We address the problem of broadcast scheduling in the pull environment and try to solve this problem by formulating it as a dynamic optimization problem. This approach allows us to find a near-optimal scheduling policy, which we use as a benchmark to evaluate a number of other existing heuristic policies. Also, in addition to providing a solution for the usual case with Poisson arrivals and equal priority pages, our approach enables us to address extended versions of this problem with other arrival processes and with distinct weights assigned to different pages.},
	address = {Taipei, Taiwan},
	booktitle = {Global Telecommunications Conference, Taipei},
	pages = {pp. 2935-2939}
}
@conference {
	title = {Hybrid Internet Simulation Testbed},
	author = {Liu, Mingyan., Karir, Manish., Raissi-Dekhordi, Majid., Baras, John S.},
	year = {1999},
	month = {08/1999},
	abstract = {Internet technology as a widely accepted modern telecommunication standard has been widely extended to combine with numerous other technologies, e.g..,satellite, ATM, wireless. This is what we term as Hybrid Internet. Along with this technology emerging, various enhancements and alterations of standard TCP/IP for different purposes have been proposed and studied in-tensively. More and more frequently we are facing the question of how to choose from these different schemes to design a system for a particular purpose, which would inevitably involve the interaction and trade-of study. We believe that simulation is a powerful tool for this type of work. In this paper, we describe our implementation of a Hybrid Internet testbed which includes a series of traffic models and TCP/IP enhancements. The goal of our work is to make a set of reusable modules upon which we can build complex systems to study the standard protocols and their variations. We also present application examples using these module components.},
	address = {Washington DC},
	booktitle = {Proceedings of the 1999 OPNET Annual Technology Conference (OPNETWORK)},
	pages = {pp. 1-6}
}
@techreport {
	title = {Interactive Data Services in Wireless Access Networks: Capacity Planning and Protocols},
	author = {Zhou, Xiaoming., Raissi-Dekhordi, Majid.},
	year = {2005},
	month = {01/2005},
	abstract = {In this paper, we study the capacity planning in wireless access network for interactive data services such as web browsing. A closed queuing model has been developed which can capture the bottleneck effects in both the forward and the reverse channels. The model can be used to calculate the average throughput, the average response time and the number of users the system can support. We evaluate the performance of several MAC protocols such as slotted Aloha, static TDMA, Aloha/periodic stream and combined free demand assignment multiple access (CFDAMA) using realistic web traffic models. Based on the performance evaluation, we propose a new MAC protocol and a new transport layer protocol. Our new MAC protocol called combined polling free demand assignment multiple access (CPFDAMA) explores the correlation between forward channel data packets and reverse channel acknowledgement packets. Our new transport layer protocol called RWBP uses per-flow queuing, round robin scheduling and receiver window backpressure for congestion management. RWBP can eliminate congestion losses inside the wireless networks. Our protocol suite outperforms the proposed protocols in term of both channel utilization and response time. Our results can be used for service providers to dimension their networks and provide quality of service to a certain number of users.},
	number = {Number: CSHCN TR 2005-5}
}
@techreport {
	title = {Providing Full Connectivity in Large Ad-Hoc Networks by Dynamic Placement of Aerial Platforms},
	author = {Karthikeyan Chadrashekar, Raissi-Dekhordi, Majid.},
	year = {2004},
	month = {01/2004},
	abstract = {In this paper we address the problem of providing full connectivity to disconnected ground MANET nodes by dynamically placing unmanned aerial vehicles (UAVs) to act as relay nodes. We provide a heuristic algorithm to find the minimal number of such aerial vehicles required to provide full connectivity and find the corresponding locations for these aerial platforms (UAVs). We also track the movement of the ground nodes and update the location of the UAVs. We describe a communication framework that enables the ground nodes to communicate with its peer ground nodes as well as the UAVs that act as relay nodes. The communication architecture is designed to work with existing MANET routing protocols.},
	number = {Number: CSHCN TR 2004-11}
}
@techreport {
	title = {A Dynamic Optimization Approach to the Scheduling Problem in Satellite and Wireless Broadcast Systems},
	author = {Raissi-Dekhordi, Majid.},
	year = {2002},
	month = {01/2002},
	abstract = {The continuous growth in the demand for access to information andthe increasing number of users of the information delivery systemshave sparked the need for highly scalable systems with moreefficient usage of the bandwidth. One of the effective methods forefficient use of the bandwidth is to provide the information to agroup of users simultaneously via broadcast delivery. Generally,all applications that deliver the popular data packages (trafficinformation, weather, stocks, web pages) are suitable candidatesfor broadcast delivery and satellite or wireless networks withtheir inherent broadcast capability are the natural choices forimplementing such applications.In this report, we investigate one of the most important problemsin broadcast delivery i.e., the broadcast scheduling problem. Thisproblem arises in broadcast systems with a large number of datapackages and limited broadcast channels and the goal is to findthe best sequence of broadcasts in order to minimize the average waiting time of the users.We first formulate the problem as a dynamic optimization problemand investigate the properties of the optimal solution. Later, weuse the bandit problem formulation to address a version of theproblem where all packages have equal lengths. We find anasymptotically optimal index policy for that problem and comparethe results with some well-known heuristic methods.},
	number = {Number: CSHCN TR 2002-34}
}
