The Experts below are selected from a list of 231 Experts worldwide ranked by ideXlab platform

Jae-il Jung - One of the best experts on this subject based on the ideXlab platform.

  • ICCSA (2) - Location-aided secure routing scheme in mobile ad hoc networks
    Lecture Notes in Computer Science, 1
    Co-Authors: Do-hyeon Lee, Sun Choi, Ji-hyeon Choi, Jae-il Jung
    Abstract:

    This paper proposes a new routing scheme that uses geographical position information to minimize the number of intermediate Nodes that make a routing path, and to guarantee reliability and security in route establishment process. To achieve this purpose, we first describes the projection-line, the shadow-line, and three types of route request (RREQ) packet to select the Closest Node to the destination. The safety table is then newly defined by adding a specific subfield to a routing cache to identify the misbehaving Nodes. The suggested scheme decreases the number of hops to make up routing path in comparison with the existing one, and exclude malicious Nodes from route establishment process.

Deanna R. Worley - One of the best experts on this subject based on the ideXlab platform.

  • Incorporation of sentinel lymph Node mapping in dogs with mast cell tumours: 20 consecutive procedures
    Veterinary and comparative oncology, 2012
    Co-Authors: Deanna R. Worley
    Abstract:

    The study hypothesis is that incorporation of sentinel lymph Node (SLN) mapping in dogs presenting for mast cell tumour (MCT) removal would impact the recommended adjuvant therapy offered. Nineteen dogs were enrolled having either spontaneously occurring or incompletely excised MCTs. Staging included regional lymph Node aspiration. SLN mapping was done with regional lymphoscintigraphy combined with intra-operative lymphoscintigraphy and blue dye. Twenty MCTs in 19 dogs were excised with SLN mapping. Eight dogs had SLNs different from the Closest Node. Twelve dogs had metastasis in extirpated SLNs, seven occurred in MCTs with a MI ≤ 5. No correlation was noted between patient stage and the c-KIT proto-oncogene. Because of SLN staging, 8 of 19 dogs were offered additional therapy that would have otherwise been excluded. Anatomic sampling of lymph Nodes in dogs with MCTs does not accurately reflect which lymph Nodes are most likely to be receiving the draining tumour lymph.

Do-hyeon Lee - One of the best experts on this subject based on the ideXlab platform.

  • ICCSA (2) - Location-aided secure routing scheme in mobile ad hoc networks
    Lecture Notes in Computer Science, 1
    Co-Authors: Do-hyeon Lee, Sun Choi, Ji-hyeon Choi, Jae-il Jung
    Abstract:

    This paper proposes a new routing scheme that uses geographical position information to minimize the number of intermediate Nodes that make a routing path, and to guarantee reliability and security in route establishment process. To achieve this purpose, we first describes the projection-line, the shadow-line, and three types of route request (RREQ) packet to select the Closest Node to the destination. The safety table is then newly defined by adding a specific subfield to a routing cache to identify the misbehaving Nodes. The suggested scheme decreases the number of hops to make up routing path in comparison with the existing one, and exclude malicious Nodes from route establishment process.

Rongmei Zhang - One of the best experts on this subject based on the ideXlab platform.

  • Networked Group Communication - Anycast in Locality-Aware Peer-to-Peer Overlay Networks
    Lecture Notes in Computer Science, 2003
    Co-Authors: Rongmei Zhang
    Abstract:

    This paper advocates implementing anycast in peer-to-peer (p2p) overlay networks. We argue that anycast in p2p overlays (exemplified by Pastry, Tapestry, Chord, CAN) combines the advantages of IP anycast and existing application-layer anycast services. We show that anycast can leverage the locality-awareness embedded in existing p2p overlays. The locality-awareness of the p2p routing substrates can be extended to support anycast and anycast is achieved as the result of the enhanced locality-aware routing. We have implemented anycast in Pastry, and experiments confirm that with high probability, a message addressed to an anycast group is routed to the Closest Node in the group according to the proximity metric. We also evaluate the performance of anycast using a realistic failure trace and the results show that our implementation of anycast is resilient to Node failures.

John Kubiatowicz - One of the best experts on this subject based on the ideXlab platform.

  • DISC - Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks
    Lecture Notes in Computer Science, 2003
    Co-Authors: Kirsten Hildrum, John Kubiatowicz
    Abstract:

    In this paper, we show that two peer-to-peer systems, Pastry [13] and Tapestry [17] can be made tolerant to certain classes of failures and a limited class of attacks. These systems are said to operate properly if they can find the Closest Node matching a requested ID. The system must also be able to dynamically construct the necessary routing information when new Nodes enter or the network changes. We show that with an additional factor of O(log2 n) storage overhead and O(log n) communication overhead, they can continue to achieve both of these goals in the presence of a constant fraction Nodes that do not obey the protocol. Our techniques are similar in spirit to those of Saia et al. [14] and Naor and Wieder [10]. Some simple simulations show that these techniques are useful even with constant overhead.