1,721,267 research outputs found

    A bandwidth-based polling scheme for QoS support in Bluetooth

    No full text
    [[abstract]]A flexible bandwidth management scheme namely Bandwidth-based Polling (BBP) for Bluetooth is proposed. A framing structure of time is defined in BBP, and the master allocates proper number of slots for each active slave in a frame. BBP allows the master to poll a slave more than once to achieve high flexibility for bandwidth allocation. The calculation of the polling time as well as the payload type for a slave is according to the bandwidth requirement of the slave and the limit of the frame size controlled by the master. Extension of BBP for supporting slaves with the SCO link and slaves without bandwidth requirement (best-effort slaves) is also proposed. Simulation results have shown the efficiency and fairness of BBP in bandwidth management. The flexibility of bandwidth allocation depends on the maximum polling time preset by BBP. A larger maximum polling time makes the higher flexibility of bandwidth allocation at the expense of a longer latency before reaching the equilibrium state. Analysis of the impact of the maximum polling time on bandwidth allocation is also presented in the paper. (C) 2004 Elsevier B.V. All fights reserved.[[note]]SC

    Reduction of the broadcast redundancy by location awareness in mobile ad hoc networks

    No full text
    [[abstract]]In this paper, a reachability-guaranteed approach for reducing broadcast storms in MANET is proposed. The approach is based on location awareness of each node, which means each node in the network needs to equip the positioning device like GPS and exchanges location information in the HELLO message with its neighbors. Three mechanisms are included in the proposed approach: Relay Set (RS), Neighbor Coverage (NC), and Transmission Order (TO). RS is a sender-based mechanism in which the sending node of the broadcast message determines the relay set of its, neighbors for rebroadcast according to the radio coverage of the neighbors. The idea of the received-based NC is: a node receiving a broadcast message does not have to rebroadcast the message if all its neighbors have received the same message. TO mechanism requires a farther neighbor node away from the sending node to rebroadcast the message earlier than closer nodes so that a closer node may have more chances to save the rebroadcast. Simulation results have shown that the proposed approach 'RS + NC + TO' has a better performance than existing solutions like threshold-based schemes and angle-based scheme in terms of 100% reachability, more saved rebroadcast, and shorter average latency. (C) 2003 Elsevier B.V. All rights reserved.[[note]]SC

    Going Beyond Counting First Authors in Author Co-citation Analysis

    Get PDF
    The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
    corecore