@conference {
	title = {Probability of Imminent Failure as a Routing Metric in a High-Mobility Wireless Ad Hoc Network},
	author = {Alzate, Marco A., Baras, John S.},
	year = {2003},
	month = {10/2003},
	abstract = {The current duration of a link in a mobile wireless ad hoc network (MANET) has important information to offer with respect to its stability. Unlike location or signal strength methods, life measurements implicitly include the effects of true propagation mechanisms, mobility space geometry, power control mechanisms and other phenomena that are ignored or simplistically modeled in the methods mentioned above. Consequently, the information contained in the current duration of the links can be used to enhance the accuracy of these methods. Furthermore, under high mobility conditions and in the absence of any resources for location and signal strength measurements, this information can also be used alone to obtain new routing metrics to enhance the performance of routing algorithms in a MANET. One such metric is the probability of imminent failure, which can also be used to predict route failures with relatively high accuracy. Here we modify DSR to use this metric, improving the efficiency by reducing the routing overhead.},
	address = {Seoul, Korea},
	booktitle = {8th International Conference on Intelligent Communications (CIC 2003)}
}
@conference {
	title = {Dynamic Adaptation of Access Control Policies},
	author = {Bharadwaj, Vijay G., Baras, John S.},
	year = {2003},
	month = {10/2003},
	abstract = {We describe an architecture and algorithms for deriving an access control policy by composing access control requirements specified at multiple levels in a command hierarchy. Our method can detect conflicts in requirements, and find a policy that maximally satisfies the requirements, by satisfying higher priority requirements at the expense of lower priority ones. It also allows for easy verification of the final policy by an administrator. The architecture allows quick adaptation of policies to changing situations, by providing for delegation of authority while ensuring that high priority requirements will always be satisfied.},
	address = {Boston, Massachusetts},
	booktitle = {MILCOM 2003},
	pages = {pp. 761-766}
}
@conference {
	title = {Clustering for transmission range control and connectivity assurance for self configured ad hoc networks},
	author = {Manousakis, Kyriakos., Baras, John S.},
	year = {2003},
	month = {10/2003},
	abstract = {Ad hoc networks have been the new networking technology trend because of their promising characteristics. These characteristics fit better the requirements of today{\textquoteright}s army and the needs of today{\textquoteright}s commercial world. Most of the applications that have been referred in the bibliography assume devices that are of finite power. The latter is true because of the existing technology (web-enabled cell phones, PDAs, laptops, PPCs). The goal for ad hoc networks is to accommodate lightweight, battery-powered portable devices. Because of the finite power limitation, we have to design efficient ways to use the existing power. A first step towards efficient utilization of power is to eliminate its unnecessary usage wherever possible. For a networking device, significant part of power is consumed for communications and more specifically for transmissions. In this work we focus on eliminating the transmission power consumed into the network subject to the network{\textquoteright}s connectivity. The assurance of network connectivity is essential in this problem since the usage of limited transmission power from the nodes may result in a partitioned network. We provide solutions to the efficient usage of transmission power by clustering the nodes based on their proximity and ensuring the intracluster and intercluster connectivity of the network. The algorithms presented in this paper achieve their objective as the collected results from their simulation show.},
	address = {Boston, MA},
	booktitle = {Military Communications Conference, MILCOM 2003},
	pages = {pp. 1043-1047}
}
@conference {
	title = {Key Distribution Protocols for Secure Multicast Communication Survivable in MANETs},
	author = {Striki, Maria., Baras, John S.},
	year = {2003},
	month = {10/2003},
	abstract = {In this paper, we develop a secure, robust and scalable key management scheme for multicast communications in Mobile Ad Hoc Networks (MANETs). Most key distribution protocols of today are primarily designed for wire-line networks. Frequent node failures, network partitions, inefficient computational and communication capabilities of wireless nodes, network delay, bad quality of signal etc, are some of the reasons why they fail to work properly in MANETs. We classify existing and newly developed protocols in two families, contributory and non-contributory. We evaluate them and compare their performance. We focus on studying and developing key distribution techniques that achieve scalability and high performance within our framework without sacrificing the security level of the network. We also describe a hierarchical two-level hybrid key management scheme that utilizes some of the above protocols in the appropriate combinations to further reduce the storage, communication and computation costs of nodes.},
	address = {Boston, Massachusetts},
	booktitle = {MILCOM 2003},
	pages = {pp. 1-6}
}
@conference {
	title = {Data Dependent Keying for Wireless Networks},
	author = {Karir, Manish., Baras, John S.},
	year = {2003},
	month = {10/2003},
	abstract = {The failure of the 802.11 WEP security specifications to provide any reasonable level of security has come under sharp criticism recently. In this paper we propose a novel scheme for providing security in both a base station based, as well as an ad hoc network environment. Our proposed scheme uses data exchanged between communicating peers to evolve per-packet keys. In addition to the concept of data dependent keying (DDK), we include other well-known security primitives such as SHA-1 based HMAC and RC4 encryption to provide a complete security solution for wireless networks. We argue that our scheme provides an adequate security/overhead tradeoff, and can be easily implemented on current hardware platforms. In addition, the low overhead characteristic as well as the use of symmetric cryptographic functions makes the scheme an attractive option for sensor networks, where energy efficiency is a primary objective.},
	address = {Orlando, Florida},
	booktitle = {58th Vehicular Technology Conference},
	pages = {pp. 2098-2102}
}
@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}
}
