Zobrazeno 1 - 10
of 27
pro vyhledávání: '"David F. Shallcross"'
Autor:
David F. Shallcross, O. Younis, Sunil Samtani, Kenneth C. Young, Latha Kant, Mitesh Patel, C. Graff, Kyriakos Manousakis, Miriam Tauil, Kaustubh Sinkar
Publikováno v:
Ad Hoc Networks. 11:2461-2469
To guide users who attempt to deploy wireless networks in military applications, there is an evolving need for developing systematic methodologies to analyze/predict the performance of mobile ad hoc networks (MANETs). In addition, the advance in cogn
Autor:
K. Young, C. Graff, Kirk Chang, Kyriakos Manousakis, Latha Kant, Anthony McAuley, Mitesh Patel, David F. Shallcross, O. Younis, Kaustubh Sinkar
Publikováno v:
IEEE Communications Magazine. 48:70-77
Unlike commercial MANET applications, tactical networks are typically hierarchical and involve heterogeneous types of radio communications. Future tactical networks also require cognitive functions across the protocol stack to exploit scarce spectrum
Publikováno v:
Telecommunication Systems. 49:271-286
This paper presents a design algorithm for networks with a restoration mechanism that provides end-to-end path protection to a set of demands with specified working routes, where demands must survive one or two failures in optical networks and these
Publikováno v:
Telecommunication Systems. 46:17-30
This paper presents a design algorithm for networks with a restoration mechanism that provides failure-independent, end-to-end path protection to a set of given demands under a single link or node failure with a focus on optical networks. The restora
Autor:
Latha Kant, Kaustubh Sinkar, Anthony McAuley, K. Young, David F. Shallcross, O. Younis, Kyriakos Manousakis, Kirk Chang, C. Graff
Publikováno v:
IEEE Communications Magazine. 46:55-61
Mobile ad hoc networks have become the basis of the military's network-centric warfare (NCW) approach. However, for NCW to be successful, it is imperative that the networks be designed in a robust manner with the capability to produce consistent pred
Publikováno v:
Annals of Operations Research. 106:199-228
We consider a node placement and sizing problem that arises in certain types of broadband access architectures, such as ADSL and FTTC. We consider three variants of the problem that become progressively more restrictive, to capture realistic planning
Publikováno v:
Mathematical Programming. 80:1-15
Given a genericm × n matrixA, the simplicial complexK(A) is defined to be the collection of simplices representing maximal lattice point free convex bodies of the form {x : Ax ź b}. The main result of this paper is that the topological space associ
Publikováno v:
MILCOM
Shortage of spectrum constrains military applications that need to support different classes of traffic. In this work, we study efficient utilization of limited spectrum and propose joint time division multiple access (TDMA) MAC scheduling and channe
Publikováno v:
MILCOM
The advancements in cognitive radios coupled with the ever increasing demand for spectrum have propelled research into dynamic and adaptive spectrum management techniques. More specifically, the need to support a wide variety of network centric warfa
Publikováno v:
ORSA Journal on Computing. 5:206-212
In recent years many advances have been made in solution techniques for specially structured 0–1 integer programming problems. In contrast, very little progress has been made on solving general (mixed) integer problems. This, of course, is not true