@conference {
	title = {Ant-based Adaptive Trust Evidence Distribution in MANET},
	author = {Jiang, Tao., Baras, John S.},
	year = {2004},
	month = {03/2004},
	abstract = {Due to the lack of infrastructure and vulnerability of wireless links, security in ad hoc networks is considered to be much more difficult than in traditional hierarchical networks. Building the trust relationship between entities is a fundamental problem in ad hoc networks, since the availability of servers, which distribute trust certificates, is not guaranteed. Furthermore, the existence of any trusted server might not be assumed either. Therefore, the commonly used key distribution center (KDC) and certification authority (CA) are not applicable in such highly autonomous environments. In this paper, we propose a scheme for the distribution of trust certificates, which is completely distributed and adaptive to mobility. Our scheme is based on the swarm intelligence paradigm, which has been used for routing both in wired and wireless networks. Our simulations in ns-2 show that it performs very well in ad hoc environments.},
	address = {Tokyo, Japan},
	booktitle = {2nd International Workshop on Mobile Distributed Computing, in conjunction with the International Conference on Distributed Computing Systems, MDC\&rsquo;04},
	pages = {pp. 588-593}
}
@article {
	title = {Long-run Performance Analysis of a Multi-Scale TCP Traffic Model},
	author = {Liu, Nelson X., Baras, John S.},
	year = {2004},
	month = {06/2004},
	abstract = {The long-run queueing performance of a multi-scale TCP traffic model, the HOO model, is analyzed. Since the model links the multi-scale behavior with practical traffic elements and approximates TCP traffic very well, the analysis is expected to provide insights into the physical interpretation of multi-scale traffic and to give useful results for performance prediction. To derive a meaningful solution and avoid the extreme difficulty of an exact analysis, the authors adopt several techniques to track the problem, among which are techniques to establish equivalent processes to the traffic process or the queue content process in two cases, the case of fast flows and the case of slow flows. Quantitative results for the queue tails are obtained in both cases, and a unified form is derived. It indicates that three levels of traffic elements in different time scales, i.e. the connection, the burst and the packet, all affect the asymptotic queueing performance. It shows quantitatively how the connection determines the index of the queue tail, and the burst and the packet contribute to the tail with their averages. Used with simple statistical inferences, the analytical result is shown to predict the queueing performance of real traffic well.},
	pages = {pp. 251-257},
	volume = {Vol.  151},
	number = {No. 3},
	journal = {Communications \&ndash; IEEE Proceedings}
}
@conference {
	title = {Cross-Layer Attacks in Wireless Ad-Hoc Networks},
	author = {Radosavac, Svetlana., Benammar, Nassir., Baras, John S.},
	year = {2004},
	month = {03/2004},
	abstract = {Denial of Service (DoS) attacks are difficult to prevent and protect against. In this paper we focus on DoS attacks in wireless ad hoc networks that propagate from MAC to routing layer, causing breaking of critical routes. We present several traffic patterns that an intelligent attacker can generate to cause Denial of Service attack in one or several nodes in ad hoc networks. More specifically, we focus on the properties of IEEE 802.11 MAC protocol and attack propagation to the routing layer. We focus on attacks that use low-rate traffic patterns with the goal of disabling one or more specific nodes or partitioning the network. We propose a scheme for attack detection based on modelling of MAC protocols using Extended Finite State Machines (EFSM) and present general outline for an Intrusion Detection System that has the ability to generate attack patterns and check the validity of communication patterns in the network.},
	address = {Princeton, New Jersey},
	booktitle = {Proceedings of 38th Conference on Information Sciences and Systems - CISS 2004,},
	pages = {pp. 1266-1271}
}
@conference {
	title = {Adaptive Dynamic Routing in Mobile Wireless Ad Hoc Networks Utilizing On-Line Link Life Estimates},
	author = {Alzate, Marco A., Baras, John S.},
	year = {2004},
	month = {03/2004},
	abstract = {The current duration of a link in a mobile wireless ad hoc network (MANET) can be used for link stability assessment through on-line remaining link life estimation. These estimates implicitly include the effects of true propagation mechanisms, mobility space geometry, power control mechanisms and other phenomena that are ignored or simplistically modeled in other methods based on location or signal strength measures. In this paper we use such estimates for multipath/backup adaptive dynamic routing, and compare its performance with a corresponding multipath/backup version of DSR.},
	address = {Princeton, NY},
	booktitle = {38th Annual Conference on Information Sciences and Systems (CISS 2004)}
}
@conference {
	title = {Dynamic Clustering of Self Configured Ad-Hoc Networks Based on Mobility},
	author = {Manasoukis, Kyriakos., Baras, John S.},
	year = {2004},
	month = {03/2004},
	abstract = {If heterogeneous ad hoc battlefield networks are to scale to hundreds or thousands of nodes, then they must be automatically split into separate network domains. Domains allow routing, QoS and other networking protocols to operate on fewer nodes, with cross-domain interaction only through a few border nodes. This division greatly reduces overall overhead (e.g., routing overhead with n nodes goes from O(n2) to O(nlogn) and allows protocols to be tuned to more homogenous condition 1]. On the other hand, the benefits from grouping the nodes are obvious only when the clustering is done in a way that the overhead that is produced due to its application does not offset the gain from the grouping of nodes. A significant source of overhead is the reclustering of nodes due to dynamic changes in network topology. If we manage to minimize the effect of reclustering then we expect the performance of the network to be improved (e.g., more scalable and survivable network). In this work we try to identify the various mobility groups and cluster the nodes accordingly. By grouping together nodes with similar mobility characteristics we can minimize/eliminate the effect of reclustering, since the topology changes will not affect the intra cluster connectivity.},
	address = {Princeton, NJ},
	booktitle = {38th Annual Conference on Information Sciences and Systems (CISS 2004)},
	pages = {pp. 1-6}
}
@conference {
	title = {A Reliable Multicast Transport Protocol with Feedback Implosion Suppression for Satellite Communication Systems},
	author = {Akkor, Gun., Baras, John S.},
	year = {2004},
	month = {03/2004},
	abstract = {In this paper, we propose a reliable multicast transport protocol for satellite communication systems. Many of the emerging applications in the Internet would benefit from reliable multicast services, and broadband satellite communication systems have attractive characteristics for supporting such services. However, many of the protocols designed primarily for terrestrial networks do not perform well over satellite networks. Therefore, it is necessary to look at the problem of reliable multicast in the solution space of satellite communications. Our protocol makes use of a special form of forward error correcting codes and couples it with an adaptive window based control mechanism to dynamically adjust the number of encoding packets forwarded to the users. Protocol makes very good use of the broadcast nature of the satellite channel and attempts to minimize the feedback volume by a novel feedback implosion suppression algorithm. We evaluate the protocol performance by computer simulations.},
	address = {Princeton, New Jersey},
	booktitle = {38th Annual Conference on Information Sciences and Systems (CISS 2004)},
	pages = {pp. 1-6}
}
@conference {
	title = {A Parallel Virtual Queue Structure for Active Queue Management},
	author = {Jou,  Jia-Shiang., Tan, Xiaobo., Baras, John S.},
	year = {2004},
	month = {03/2004},
	abstract = {Performance of the Adaptive RED scheme is susceptible to bursty web traffic. A parallel queue structure was proposed earlier to address this problem, where real time connections (such as web and UDP) and non-real time connections (such as FTP) are served in two different queues with droptail and Adaptive RED policies, respectively. In this paper a modified Adaptive RED scheme is proposed for the second queue to improve the goodput of non-real time connections. In this scheme the queue length thresholds for the Adaptive RED are dynamically determined by the average droppping probability. Simulation shows that the packet dropping probability of the Adaptive RED queue stays within a desired small region. The stability of the queue length variation under this policy is proved under mild conditions.},
	address = {Princeton, New Jersey},
	booktitle = {Proceedings of 38th Conference on Information Sciences and Systems - CISS 2004,},
	pages = {pp. 1-6}
}
@conference {
	title = {A Parallel Queue Structure for Active Queue Management},
	author = {Jou,  Jia-Shiang., Tan, Xiaobo., Baras, John S.},
	year = {2004},
	month = {03/2004},
	address = {Princeton, NJ},
	booktitle = {Annual Conference on Information Sciences and Systems}
}
