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

Frank Roijers - One of the best experts on this subject based on the ideXlab platform.

  • performance modeling of a Bottleneck Node in an ieee 802 11 ad hoc network
    Lecture Notes in Computer Science, 2006
    Co-Authors: Hans Van Den Berg, Michel Mandjes, Frank Roijers
    Abstract:

    The IEEE 802.11 MAC-protocol, often used in ad-hoc networks, has the tendency to share the capacity equally amongst the active Nodes, irrespective of their loads. An inherent drawback of this fair-sharing policy is that a Node that serves as a relay-Node for multiple flows is likely to become a Bottleneck. This paper proposes a flow-level performance model of such a Bottleneck Node using fluid-flow analysis. Assuming Poisson initiations of new flow transfers at the Bottleneck Node, we obtain insightful, robust, and explicit expressions for characteristics related to the overall flow transfer time, the buffer occupancy, and the packet delay at the Bottleneck Node. The analysis is enabled by a translation of the behavior of the Bottleneck Node and the source Nodes in terms of an M/G/1 queueing model. We conclude the paper by an assessment of the impact of alternative capacity sharing amongst source Nodes and the Bottleneck in order to improve the performance of the Bottleneck.

  • performance modeling of a Bottleneck Node in an ieee 802 11 ad hoc network
    CWI. Probability Networks and Algorithms [PNA], 2006
    Co-Authors: J L Van Deberg, Michel Mandjes, Frank Roijers
    Abstract:

    This paper presents a performance analysis of wireless ad-hoc networks, with IEEE 802.11 as the underlying Wireless LAN technology. WLAN has, due to the fair radio resource sharing at the MAC-layer, the tendency to share the capacity equally amongst the active Nodes, irrespective of their loads. An inherent drawback of this sharing policy is that a Node that serves as a relay-Node for multiple flows is likely to become a Bottleneck. This paper proposes to model such a Bottleneck by a fluid-flow model. Importantly, this is a model at the flow-level: flows arrive at the Bottleneck Node, and are served according to the sharing policy mentioned above. Assuming Poisson initiations of new flow transfers, we obtain insightful, robust, and explicit expressions for characteristics related to the overall flow transfer time, the buffer occupancy, and the packet delay at the Bottleneck Node. The analysis is enabled by a translation of the buffer dynamics at the Bottleneck Node in terms of an M/G/1 queueing model. We conclude the paper by an assessment of the impact of alternative sharing policies (which can be obtained by the IEEE 802.11E version), in order to improve the performance of the Bottleneck.

Hans Van Den Berg - One of the best experts on this subject based on the ideXlab platform.

  • performance modeling of a Bottleneck Node in an ieee 802 11 ad hoc network
    Lecture Notes in Computer Science, 2006
    Co-Authors: Hans Van Den Berg, Michel Mandjes, Frank Roijers
    Abstract:

    The IEEE 802.11 MAC-protocol, often used in ad-hoc networks, has the tendency to share the capacity equally amongst the active Nodes, irrespective of their loads. An inherent drawback of this fair-sharing policy is that a Node that serves as a relay-Node for multiple flows is likely to become a Bottleneck. This paper proposes a flow-level performance model of such a Bottleneck Node using fluid-flow analysis. Assuming Poisson initiations of new flow transfers at the Bottleneck Node, we obtain insightful, robust, and explicit expressions for characteristics related to the overall flow transfer time, the buffer occupancy, and the packet delay at the Bottleneck Node. The analysis is enabled by a translation of the behavior of the Bottleneck Node and the source Nodes in terms of an M/G/1 queueing model. We conclude the paper by an assessment of the impact of alternative capacity sharing amongst source Nodes and the Bottleneck in order to improve the performance of the Bottleneck.

Michel Mandjes - One of the best experts on this subject based on the ideXlab platform.

  • performance modeling of a Bottleneck Node in an ieee 802 11 ad hoc network
    Lecture Notes in Computer Science, 2006
    Co-Authors: Hans Van Den Berg, Michel Mandjes, Frank Roijers
    Abstract:

    The IEEE 802.11 MAC-protocol, often used in ad-hoc networks, has the tendency to share the capacity equally amongst the active Nodes, irrespective of their loads. An inherent drawback of this fair-sharing policy is that a Node that serves as a relay-Node for multiple flows is likely to become a Bottleneck. This paper proposes a flow-level performance model of such a Bottleneck Node using fluid-flow analysis. Assuming Poisson initiations of new flow transfers at the Bottleneck Node, we obtain insightful, robust, and explicit expressions for characteristics related to the overall flow transfer time, the buffer occupancy, and the packet delay at the Bottleneck Node. The analysis is enabled by a translation of the behavior of the Bottleneck Node and the source Nodes in terms of an M/G/1 queueing model. We conclude the paper by an assessment of the impact of alternative capacity sharing amongst source Nodes and the Bottleneck in order to improve the performance of the Bottleneck.

  • performance modeling of a Bottleneck Node in an ieee 802 11 ad hoc network
    CWI. Probability Networks and Algorithms [PNA], 2006
    Co-Authors: J L Van Deberg, Michel Mandjes, Frank Roijers
    Abstract:

    This paper presents a performance analysis of wireless ad-hoc networks, with IEEE 802.11 as the underlying Wireless LAN technology. WLAN has, due to the fair radio resource sharing at the MAC-layer, the tendency to share the capacity equally amongst the active Nodes, irrespective of their loads. An inherent drawback of this sharing policy is that a Node that serves as a relay-Node for multiple flows is likely to become a Bottleneck. This paper proposes to model such a Bottleneck by a fluid-flow model. Importantly, this is a model at the flow-level: flows arrive at the Bottleneck Node, and are served according to the sharing policy mentioned above. Assuming Poisson initiations of new flow transfers, we obtain insightful, robust, and explicit expressions for characteristics related to the overall flow transfer time, the buffer occupancy, and the packet delay at the Bottleneck Node. The analysis is enabled by a translation of the buffer dynamics at the Bottleneck Node in terms of an M/G/1 queueing model. We conclude the paper by an assessment of the impact of alternative sharing policies (which can be obtained by the IEEE 802.11E version), in order to improve the performance of the Bottleneck.

Yogendra Singh Dohare - One of the best experts on this subject based on the ideXlab platform.

  • energy harvesting by detection of Bottleneck Node in wireless sensor network
    Social Science Research Network, 2019
    Co-Authors: Indra Kumar Shah, Tanmoy Maity, Yogendra Singh Dohare
    Abstract:

    Wireless Sensor Network (WSN) consists of tiny Nodes that are capable to sense, process and communicate with neighbor Nodes to form a sensible Network. For these purpose Nodes utilizes small battery as power source. WSNs are utilized in many civil and military applications. Many times due to hazardous environmental condition replacement of this power source is not easy task, so efficient power utilization is an important aspect in wireless Sensor Network. Due to random deployment of Nodes, energy consumption is different for each Node; some Nodes are acting as Bottleneck Nodes which connect one group of Network to another group. If this Node dies earlier Network will fail soon. To improve Network lifetime it is important to identify Bottleneck Node. Therefore, another route can find and load of data forwarding will change from specific Node to another and enhance the Network time. In this paper, we describe Bottleneck Nodes detection method based on local information of the Sensor Network. Traditionally MINCUT is used for Bottleneck detection but it is not suitable for Network having large number of Nodes.

Xusheng Tian - One of the best experts on this subject based on the ideXlab platform.

  • the accuracy of markov chain models in predicting packet loss statistics for a single multiplexer
    IEEE Transactions on Information Theory, 2008
    Co-Authors: James W Modestino, Xusheng Tian
    Abstract:

    In this correspondence, we investigate the accuracy of low-complexity discrete-time Markov chain models in characterizing the packet-loss process associated with a transport network whose behavior can be described in terms of a single Bottleneck Node, modeled by a single multiplexer. The results are useful since network behavior is often characterized in terms of a single Bottleneck Node and it is of some interest to establish the accuracy of Markov chain models in predicting the packet-loss process on even such a simplified network model. We demonstrate that, although higher order Markov chain models can achieve increasingly more accurate descriptions, the Gilbert model has some serious deficiencies in predicting the packet-loss statistics of the single-multiplexer model for a variety of packet arrival processes. We show that this has some serious consequences for the performance evaluation of forward error correction (FEC) coding schemes using Markov chain models compared to that predicted by an exact queueing analysis of the single-multiplexer model.

  • the accuracy of gilbert models in predicting packet loss statistics for a single multiplexer network model
    International Conference on Computer Communications, 2005
    Co-Authors: James W Modestino, Xusheng Tian
    Abstract:

    The Gilbert model (1-st order Markov chain model) and the single-multiplexer model are two frequently used models in the study of packet-loss processes in communication networks. In this paper we investigate the accuracy of the Gilbert model, and higher-order Markov chain extended Gilbert models, in characterizing the packet-loss process associated with a transport network modeled in terms of a single-multiplexer. More specifically, we quantitatively compare the packet-loss statistics predicted by the Gilbert models with those predicted by an exact queueing analysis of the single-multiplexer model. This topic is important since low-complexity Gilbert models are frequently used to characterize end-to-end network packet-loss behavior. On the other hand, network congestion behavior is often characterized in terms of a single Bottleneck Node modeled as a multiplexer. It is of some interest then to establish the relative accuracy of Gilbert models in predicting the packet-loss behavior on even such a simplified network model. We demonstrate that the Gilbert models have some serious deficiencies in accurately predicting the packet-loss statistics of the single-multiplexer model. The results are shown to have some serious consequences for the performance evaluation of forward error correction (FEC) coding schemes used to combat the effects of packet losses due to network buffer overflows.