Performance analysis of broadcast star network with collision-avoidance switch

In mobile ad hoc networks (MANETs), the estimation of packet end-to-end delay depends on that of one-hop packet delay. In this paper, we conduct an analysis of the one-hop packet delay in MANETs, where the medium access control (MAC) layer uses the IEEE 802.11 distributed coordination function (DCF) to share the medium. In the MANET, each node runs the IEEE 802.11 DCF and a routing protocol. It is assumed that all nodes are one-hop neighbors, and that any pair of nodes can send data over the wireless channel with a fixed data rate. The light traffic condition is used, i.e., each node generates packets at the network layer according to a Poisson process. By modeling each wireless node as an M/M/1 queueing system, we derive the mean one-hop packet delay analytically under the light traffic condition. Simulation analysis is carried out to verify the derived results. Results show that the mean one-hop packet delay increases with either the network size or the packet generation rate in networks subject to the light traffic condition. The mean one-hop packet delay derived in this paper is analytical and exact for networks under the light traffic condition. Results that can be found in the literature are usually based on the heavy traffic condition, and they tend to overestimate by a large amount the mean one-hop delay for networks with light traffic.

Effect of audio-visual interaction on soundscape in the urban residential context: A virtual reality experiment

We establish a conservation law for G/G/1 queues with any work-conserving service discipline using the equilibrium equations, also called the basic equations. We use this conservation law to prove an extremal property of the first-come firstserved (FCFS) service discipline: among all service disciplines that are work-conserving and independent of remaining service requirements for individual customers, the FCFS service discipline minimizes [maximizes] the mean sojourn time in a G/G/1 queue with independent (but not necessarily identical) service times with a common mean and new better [worse] than used (NBUE[NWUE]) distributions. This extends recent results of Halfin and Whitt (1990), Righter et al. (1990) and Yamazaki and Sakasegawa (1987a,b). In addition we use the conservation law to obtain an approximation for the mean queue length in a GI/GI/1 queue under the processor-sharing service discipline with finite degree of multiplicity, called LiPS discipline. Several numerical examples are presented which support the practical usefulness of the proposed approximation.

Underwater acoustic networks can have large propagation delays as compared to typical packet durations, as a result of the low speed of sound in water. The ill effects of large propagation delay on medium access control (MAC) are well known. Conventional MAC protocol design for such networks focuses on mitigation of the impact of propagation delay. Most proposed protocols to date achieve, at best, a throughput similar to that of the zero propagation delay scenario. We have explored the possibility that propagation delays can be exploited to make throughput far exceed that of networks without propagation delay and shown that the throughput of a N-node wireless network with propagation delay is upper bounded by N/2. In a small set of illustrative network geometries, we can manually determine transmission schedules that allow us to achieve this N/2 bound. However, for a given network, the problem of determining transmission schedules that maximize throughput is as yet unsolved. In this paper, we put forward an algorithm that generates transmission schedules with high throughput for arbitrary network geometries.

Underwater acoustic (UWA) networks are a key form of communications for human exploration and activities in the oceanographic space of the earth. A fundamental issue of UWA communications is large propagation delays due to water medium, which has posed a grand challenge in UWA network protocol design. Conventional wisdom of addressing this issue is to live with this disadvantage by inserting a guard interval to introduce immunity to propagation delays. Recent advances in interference alignment (IA) open up a new direction to address this issue and promise a great potential to improve network throughput by exploiting large propagation delays. In this paper, we investigate propagation delay-based IA (PD-IA) in multi-hop UWA networks. We first develop a set of simple constraints to characterize PD-IA feasible region at the physical layer. Based on the set of PD-IA constraints, we develop a distributed PD-IA scheduling algorithm to greedily maximize interference overlapping possibilities in a multi-hop UWA network. Simulation results show that the proposed PD-IA algorithm yields higher throughput than an idealized benchmark algorithm without propagation delays, indicating that large propagation delays are not adversarial but beneficial for network throughput performance.

The large-scale mobile Underwater Wireless Sensor Network (UWSN) is a useful networking paradigm to explore underwater environments. The characteristics of mobile UWSNs, such as low communication bandwidth, large propagation delay, and floating node mobility are significantly different from wireless sensor networks. In this paper, we propose a new efficient routing protocol, called multi-path routing (MPR) protocol, for UWSNs to improve the transmission delay. Multi-path is utilized during the path construction from the source node to the destination node, which is composed of a series of multi-subpaths. Each multi-subpath is a sub-path from a sending node to its two-hop neighboring node, called receiving node, by one more relay nodes, where these relay nodes simultaneously are neighboring nodes of sending and receiving nodes. Due to the different propagation delay of UWSN, the packet arrival time along the different sub-path is different; thus it may avoid the data collision in the receiving node when receiving different packets from different relay nodes. It surely sends the different packet along different sub-path to significantly improve delay time and packet delivery ratio. Finally, simulation results illustrate the performance achievements of the MPR protocol in improving delay time, packet delivery ratio, throughput and reducing overhead ratio.

This paper presents an algorithm to make the adaptation of the UBR service category to the operation on HFC (hybrid fibre coax) networks. The adaptation is based on the ERICA load computations for the ABR service category, with some modifications. ABR and UBR data streams are considered with equal priorities, and the set of all UBR active sources share an amount of bandwidth that is equal to the total bandwidth that an equal number of unconstrained ABR sources would have with the ERICA algorithm. This amount of bandwidth is totally dedicated to transmit UBR messages, and a service discipline is used to schedule the transmission of the messages. In the context of the choice of an appropriate service discipline, a new service discipline is proposed (named TDQ-transmission delay queueing). Its principle of operation is to schedule the message that has the lowest value of the ratio T/sub t//(T/sub t/+T/sub w/), where T/sub t/ is the expected transmission time of the message, and T/sub w/ is the time that the message has already waited for transmission. As shown by simulations, this procedure reduces substantially the standard deviation of the waiting times of the messages, achieving lower values than those of other service disciplines, namely SCFQ, W2FQ+, and WFQ. Simulations also indicate that TDQ has very low delay bounds, because maximum delays obtained were the lowest, as low of those of W2FQ+ and lower than those of WFQ and of SCFQ. The new service discipline does not offer protection and therefore fairness, but it can be associated with ether mechanisms in order to provide them.

We consider Markovian multi-server queues with two types of impatient customers: high- and low-priority ones. The first type of customer has a non-preemptive priority over the other type. After entering the queue, a customer will wait a random length of time for service to begin. If service has not begun by this time he or she will abandon and be lost. We consider two cases where the discipline of service within each customer type is first-come first-served (FCFS) or last-come first-served (LCFS). For each type of customer, we focus on various performance measures related to queueing delays: unconditional waiting times, and conditional waiting times given service and given abandonment. The analysis we develop holds also for a priority queue with mixed policies, that is, FCFS for the first type and LCFS for the second one, and vice versa. We explicitly derive the Laplace–Stieltjes transforms of the defined random variables. In addition we show how to extend the analysis to more than two customer types. Finally we compare FCFS and LCFS and gain insights through numerical experiments.

The use of wireless access networks, particularly IEEE 802.11 wireless access networks, is an economical method for realizing a communication network between a core information network of a smart grid and a rural area network. This paper presents a novel analysis of the throughput performance of the IEEE 802.11 carrier sense multiple access with collision avoidance (CSMA/CA) protocol with a large propagation delay. The throughput analysis is performed by using a real model. A Markov chain model is used to analyze the throughput performance of the IEEE 802.11 CSMA/CA binary exponential backoff algorithm. The results of analysis and computer simulations show that the theoretical throughput is in good agreement with the throughput obtained from computer simulations under the propagation delay less than 20 µs. When the propagation delay is more than 20 µs, the throughput obtained from the simulation results becomes larger than the theoretical throughput because of short-term unfairness. The throughput degradation for a transmission rate of 6 Mb/s and a propagation delay of 40 µs is 16.8 %; this propagation delay corresponds to a transmission distance of 12 km.

We consider a problem of controlling the production rate of a single machine, single product, stochastic manufacturing system in order to minimize the total discounted inventory /backlog costs. The demand has two components: one is deterministic with constant rate d and the other is stochastic with random demand batches. Under heavy loading (or heavy traffic) conditions, that is, when the average production capacity is close to the average demand, the control problem is approximated by a singular stochastic control problem. The approximate problem can be solved expli­citly. The solution is then interpreted in terms of the actual manufactur­ing system and a control policy for this system is derived. We prove that the resulting policy is nearly optimal under the heavy traffic condition. This policy is characterized by a single critical level z0• The commodity should be produced only when inventory is less than or equal to z0 : The production rate is maximal if the inventory is less than z0 and equal to the deterministic component d of the demand rate if the inventory is equal to z0•.

We study queues with impatient customers and Processor Sharing (PS) discipline as well as other variants of PS discipline, namely, Discriminatory Processor Sharing (DPS) and Generalized Processor Sharing (GPS) disciplines, where customers have deadlines until the end of service (DES). Customers arrive according to a state-dependent Poisson process and have general impatience. Customers have exponential service times with state-dependent service rates. Analytical methods based on simple Markov chains are given for the performance analysis of such queues. The principal measures of performance are the steady-state probability of missing deadline and the steady-state probability of blocking. Similar results are obtained for related queues with Random Order Service (ROS) discipline where customers have deadlines until the beginning of service (DBS). In view of a lack of exact analytical results for First Come First Served (FCFS) queues with state-dependent rates, a highly accurate approximation method is also given for these latter queues. The efficacy and accuracy of the approach are illustrated by some numerical examples and simulation experiments.

The extreme conditions under which multi-hop underwater acoustic sensor networks (UASNs) operate constrain the performance of medium access control (MAC) protocols. The MAC protocol employed significantly impacts the operation of the network supported, and such impacts must be carefully considered when developing protocols for networks constrained by both bandwidth and propagation delay. Time-based coordination, such as TDMA, have limited applicability due to the dynamic nature of the water channel used to propagate the sound signals, as well as the significant effect of relatively small changes in propagation distance on the propagation time. These effects cause inaccurate time synchronization and therefore make time-based access protocols less viable. The large propagation delays also diminish the effectiveness of carrier sense protocols as they do not predict with any certainty the status of the intended recipients at the point when the traffic would arrive. Thus, CSMA protocols do not perform well in UASNs, either. Reservation-based protocols have seldom been successful in commercial products over the past 50 years due to many drawbacks, such as limited scalability, relatively low robustness, etc. In particular, the impact of propagation delays in UASNs and other such constrained networks obfuscate the operation of the reservation protocols and diminish, if not completely negate, the benefit of reservations. The efficacy of the well-known RTS-CTS scheme, as a reservation-based enhancement to the CSMA protocol, is also adversely impacted by long propagation delays. An alternative to these MAC protocols is the much less complex ALOHA protocol, or one of its variants. However, the performance of such protocols within the context of multi-hop networks is not well studied. In this paper we identify the challenges of modeling contention-based MAC protocols and present models for analyzing ALOHA and p-persistent ALOHA variants for a simple string topology. As expected, an application of the model suggests that ALOHA variants are very sensitive to traffic loads. Indeed, when the traffic load is small, utilization becomes insensible to p values. A key finding, though, is the significance of the network size on the protocols' performance, in terms of successful delivery of traffic from outlying nodes, indicating that such protocols are only appropriate for very small networks, as measured by hop count.

Transmission algorithms are introduced for use in a single-hop packet switching system with nonuniform traffic and with propagation delay that Is large relative to the packet transmission time. The traffic model allows arbitrary traffic streams subject only to a constraint on the number of data packets which can arrive at any individual source in the system or for any individual destination in the system over time periods of specified length. The algorithms are based primarily on sending transmission schedules to the receivers immediately before transmitting each data packet multiple times so that the receiver can maximize the number of packets it captures. An algorithm based on matchings in a random graph is shown to provide mean total delay divided by mean propagation delay arbitrarily close to one, as the propagation delay tends to infinity.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

With the ever-increasing number of multicast data applications recently, considerable efforts have been focused on the design of flow control schemes for multicast services. The main difficulties in designing a flow controller for multicast service are caused by heterogeneous multicast receivers, especially those with large propagation delays, since the feedback arriving at the source is somewhat outdated, and can be harmful to the control operations. To attack the above problem, the present paper describes a novel multicast flow control scheme, the so-called proportional, integrative, derivative plus neural network (PIDNN) predictive technique, which consists of two components: the proportional integrative plus derivative (PID) controller and the back propagation BP neural network (BPNN). This network-assisted property is different from the existing control schemes, in that the PIDNN controller can release the irresponsiveness of a multicast flow caused by those long propagation delays from the receivers. By using BPNN for the receivers with longer propagation delay, this active scheme makes the control more responsive to network status. Thus the rate adaptation can be performed in a timely manner, for the sender to respond to network congestion quickly. We analyze the theoretical aspects of the proposed algorithm, show how the control mechanism can be used to design a controller to support multi-rate multicast transmission based on feedback of explicit rates, and verify this matching using simulations. Simulation results demonstrate the efficiency of our scheme in terms of high link utilization, quick response, scalability, high unitary throughput, intra-session fairness and inter-session fairness.

In a wireless network with large propagation delay S-ALOHA(Slotted ALOHA) requires large guard time which causes lower normalized throughput. To reduce the large guard time in the ISA-ALOHA, a time alignment mechanism was proposed under the assumption of propagation delay estimation. In this letter, we propose a framed structure which is able to estimate propagation delay by employing coordinator beaconing. The framed structure consists of a time period for beaconing and a group of multiple time slots for random access. The proposed Beacon-based S-ALOHA(BS-ALOHA) can make packets generated during the time of beaconing evenly distributed over the random access period. Furthermore, we propose an analytical model considering overhead due to coordinator beaconing time and show that BS-ALOHA provides higher normalized throughput than both ALOHA and S-ALOHA employing the large guard time.