A. Neidhardt

Telcordia Technologies, Middlesex, New Jersey, United States

Are you A. Neidhardt?

Claim your profile

Publications (3)0 Total impact

  • Source
    R. Lau · Heechang Kim · M. Pang · A. Neidhardt · A. Cisneros · V. Kaul ·
    [Show abstract] [Hide abstract]
    ABSTRACT: The benefits of Global Positioning System (GPS) are recognized in numerous military as well as civilian applications. In many situations, however, GPS signals are simply not available or, at best, intermittently observable. This paper describes a novel location tracking system, called self-correcting adaptive tracking system (SATS), which focuses on solving group location problem when GPS is not available. In our location tracking system, we use a tracking mechanism that allows locating group members based on their pair wise distance information. A key innovation of SATS is that we use an adaptive search algorithm to find the new position estimate based on constraints given by the ranged data. In addition, our location tracking system is capable of extracting directional information normally unavailable in ranging system, which allows us to adaptively stabilize the orientation of the group. The SATS methodology has been prototyped and tested as part of an Office of Navy Research (ONR) program.
    Military Communications Conference, 2008. MILCOM 2008. IEEE; 12/2008
  • A. Neidhardt · H. Luss · K.R. Krishnan ·
    [Show abstract] [Hide abstract]
    ABSTRACT: Modern technology can equip small devices (like mobile phones) with sensing-capabilities for various threats, offering a mobile, 'opportunistic' pool of secondary sensors that can be polled to augment the information provided by a pre-deployed set of primary sensors, to reduce uncertainty in threat-detection. We derive an optimal decision-rule for fusing the information from fixed and mobile, accounting for the costs of erroneous decisions. We also formulate a model for an 'equitable' solution to the problem of the optimal positioning of sensors.
    Sensors Applications Symposium, 2008. SAS 2008. IEEE; 03/2008
  • Source
    Arnie Neidhardt · Judith Jerkins · K. R. Krishnan ·
    [Show abstract] [Hide abstract]
    ABSTRACT: We present an analytical model and propose an efficient algorithm for evaluating call blocking in GSM networks with directed retry, where a call blocked by the sector of its initial attempt may be redirected to one or more alternative sectors. Since exact solution by Markov-chain analysis is unfeasible in large networks owing to the size of the state-space, we propose a method for an approximate solution, which is shown to be highly accurate in two small examples. .