Showing papers by "Min Sheng published in 2003"
27 Mar 2003
TL;DR: The IEEE 802.11 multiple access control protocol was modified for use in multi-channel, multi-hop ad hoc network, through the use of a new channel-status indicator, and a number of throughput scaling laws are proposed.
Abstract: The IEEE 802.11 multiple access control protocol was modified for use in multi-channel, multi-hop ad hoc network, through the use of a new channel-status indicator. In particular, we have evaluated the improvement due to the multi-channel use. We report in this paper on the results of the throughput per node and the end-to-end delay for the modified IEEE 802.11 protocol for different network sizes. Using these results, we were able to propose a number of throughput scaling laws. Our simulation results show that the throughputs per node with multiple channels for the line and the grid ad hoc network topologies will increase by 47.89%, and by 1.39-163%, respectively, for networks with 16 to 64 nodes, as compared with that of single channel.
92 citations
TL;DR: The modified IEEE 802.11 multiple access control protocol was modified for use in multi-channel, multi-hop ad hoc networks through the use of a new channel-status indicator and a number of per-node throughput scaling laws were proposed.
Abstract: In this paper, the IEEE 802.11 multiple access control (MAC) protocol was modified for use in multi-channel, multi-hop ad hoc networks through the use of a new channel-status indicator. In particular, in the modified protocol, the RTS/CTS dialogue is exchanged on the common access control channel and data packets are transmitted on a selected traffic channel. We have evaluated the improvement due to the multi-channel use and we report in this paper on the results of the per-node throughput and the end-to-end delay for different network sizes. Using these results, we were able to propose a number of per-node throughput scaling laws. Our simulation results show that the per-node throughput with multiple channels for the fully connected, the line, and the grid ad hoc network topologies increases by 90% to 253%, by 47%, and by 139% to 163%, respectively, for networks with 16 to 64 nodes, as compared with that of a single channel.
33 citations
TL;DR: Simulation results show that ABF-CSMA/CA can support smart antennas effectively and provide higher channel utilisation and an improved virtual carrier-sense mechanism is proposed.
Abstract: A novel MAC protocol for a mobile ad hoc network with smart antennas $adaptive beamforming CSMA/CA protocol (ABF-CSMA/CA) - is presented. In ABF-CSMA/CA, training sequences are transmitted just before request-to-send (RTS) and clear-to-send (CTS) packets, so the temporal reference beamforming can be performed. An improved virtual carrier-sense mechanism is also proposed. In this scheme, every node has two kinds of network allocation vector (NAV) - omnidirectional NAV (oNAV) and beamforming NAV (WAV). Simulation results show that ABF-CSMA/CA can support smart antennas effectively and provide higher channel utilisation.
31 citations
TL;DR: A novel routing protocol for ad-hoc networks, delay sensitive adaptive routing protocol (DSARP), is presented, which not only provides a reliable route for delay-sensitive traffic, but also can select the route based on the constrained condition: ‘the shortest route and the lowest average delay’.
Abstract: A novel routing protocol for ad-hoc networks, delay sensitive adaptive routing protocol (DSARP), is presented, which not only provides a reliable route for delay-sensitive traffic, but also can select the route based on the constrained condition: ‘the shortest route and the lowest average delay’ Therefore, the DSARP is assured to provide QoS guarantee and improve the performance of the network Simulation results show that DSARP outperforms the dynamic source routing protocol used in ad-hoc wireless networks
28 citations
27 Mar 2003
TL;DR: In this article, a delay sensitive adaptive routing protocol (DSARP) is proposed for ad hoc networks, where the reliable route for delay sensitive traffic can be supplied and the route can be selected based on the constrained condition -the shortest route and the lowest average delay.
Abstract: A novel routing protocol for ad hoc networks - DSARP (Delay Sensitive Adaptive Routing Protocol) - is presented in this paper. According to DSARP, the reliable route for delay sensitive traffic can be supplied and the route can be selected based on the constrained condition - "the shortest route and the lowest average delay". Therefore, the "hotspot" on the shortest path can be avoided. Meanwhile, DSARP can provide a QoS guarantee and improve the performance of the network. Simulation results show that DSARP performs better than the DSR routing protocol used in ad hoc wireless networks.
10 citations
Proceedings Article•
27 Mar 2003
TL;DR: A novel routing protocol for ad hoc networks - DSARP (Delay Sensitive Adaptive Routing Protocol) - is presented and simulation results show that DSARP performs better than the DSR routing protocol used in ad hoc wireless networks.
Abstract: A novel routing protocol for ad hoc network ? DSARP (Delay Sensitive Adaptive Routing Protocol) is presented in this paper. According to DSARP, the reliable route for delay sensitive traffic can be supplied and the route can be selected based on the constrained condition --"the Shortest route and the Lowest average delay". Therefore, the "hotspot" on the shortest path can be avoided. Meanwhile, the DSARP can assure to provide QoS guarantee and improve the performance of the network. Simulation results show that DSARP performs better than DSR routing protocol used in ad hoc wireless network.
8 citations
27 Mar 2003
TL;DR: A novel concept of "different interactive mode for different scale of network" is presented and the network performance is optimized by using appropriate periodical or nonperiodical interactive mode based on the scale of the network.
Abstract: The wireless ad-hoc network is self-organizing. rapidly deployable and without fixed infrastructure. The hosts in ad-hoc networks communicate with each other over a wireless channel without any centralized control. The basic problem is to obtain a distributed routing scheme so that any mobile host can transmit/receive data from any other host in the network. As we know, in terms of the way in which nodes obtain information, routing protocols for ad-hoc networks have been classified as table-driven and on-demand. In table-driven routing protocols, the interactive mode of the control message has a great effect on network performance. In this paper, a novel concept of "different interactive mode for different scale of network" is presented. The network performance is optimized by using appropriate periodical or nonperiodical interactive mode based on the scale of the network. A different interactive mode is given for different scales of the network by theoretical analysis and algorithm simulation. The simulation result is of great practicability.