Performance analysis of CSMA and BTMA protocols in multihop networks (II). Multiple channel case

Busy tone multiple access protocols have been used in multihop networks to reduce the effect of the hidden terminal problem. This paper demonstrates another approach to reduce the effect of the hidden terminal problem namely the use of multiple channel schemes. A protocol that uses both the busy tone and the multiple channel techniques achieves the best performance. Using a Markov chain model and an approximation, the throughput performance of the multiple channel non-persistent CSMA protocol and the multiple channel conservative BTMA protocol in a large network is evaluated and compared. The results show that the multichannel CSMA and BTMA schemes exhibit a better performance over their single channel counterparts in a multihop network.     

Performance analysis of CSMA/CA protocols with multi-packet transmission

Wireless objects equipped with multiple antennas are able to simultaneously transmit multiple packets by exploiting the channel’s spatial dimensions. In this paper, we study the benefits of such Multiple Packet Transmission (MPT) approach, when it is used in combination with a Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol for fully interconnected networks, addressing the interactions between the two mechanisms and showing the performance gains that can be achieved. To this end, a very simple Media Access Control (MAC) protocol that captures the fundamental properties and tradeoffs of a CSMA/CA channel access protocol supporting MPT is introduced. Using this protocol as a reference, a new analytical model is presented for the case of non-saturated traffic sources with finite buffer space. Simulation results show that the analytical model is able to accurately characterize the steady-state behavior of the reference protocol for different number of antennas and different traffic loads, providing a useful tool for understanding the performance gains achieved by MAC protocols supporting MPT.     

Performance analysis of fast reservation protocols in ATM networks

In Asynchronous Transfer Mode (ATM) networks, VP/VC establishment and bandwidth reservation can be separately performed. Fast Reservation Protocol (FRP), a recently proposed protocol, utilizes this unique feature of the ATM technology to accomplish an efficient use of bandwidth. In FRP, a protocol data unit is called a burst, and a source requests the bandwidth reservation for each burst transmission on the established connection. In this paper, we provide an exact analysis for a class of FRP to obtain the burst delay distribution. Another feature of ATM is that the transmission rate can be set freely if it is admitted by the network. In our modeling, this feature is also incorporated in such a way that the requested bandwidth is reduced if the first attempt to reserve bandwidth is rejected by the network. Through numerical examples, appropriate values of control parameters such as the requested transmission rates are examined to show an effectiveness of FRP. The influences of the propagation delay and overhead due to control cells are also investigated by introducing an approximate technique.     

Performance evaluation of split transmission in multihop wireless networks

Multimedia applications in multihop wireless networks have great market potential. Multiple channels and multiple radios are commonly used for exploring multimedia transmissions in multihop wireless networks. Split transmission allows multiple channels attached to different radios simultaneously to be used, and so to achieve a fundamentally improved transmission capacity. The goal of this paper is to present a theoretical background to justify the improved performance of the split transmission. We theoretically study and prove that, by using the split transmission, the worst-case delay is decreased to \(\frac{\sigma\rho_{k-1}}{LC_{m-1}C_{k-1}}\) of that without using the split transmission, the average throughput is increased to \(\frac{1}{1-\prod_{j=0}^{k-1}\alpha_j}\) of that without using the split transmission, and the average delay jitter is decreased to \(\frac{C_{k-1}C_{\rho}}{C_{m-1}[C_{\rho}+L(\rho+C)]}\) of that without using the split transmission. We believe that this is the first attempt to consider split transmission in theory. We also evaluate the performance of the split transmission in ns-2 simulations. The observed results show that the split transmission achieves shorter worst packet delays, higher average throughput, and smaller average delay jitter as compared to the performance achieved without the split transmission.     

CSMA/CA在CSMA/TDMA混合网络中的性能分析

CSMA/CA机制与TDMA在同频段共存时会存在相互干扰,为评估混合网络中CSMA/CA的性能表现,将TDMA视为周期性的干扰提出改进的二维Markov分析模型,能够计算不同条件下的CSMA/CA饱和吞吐量,并通过仿真实验证明了模型的有效性。同时讨论了TDMA时隙分配方式对系统性能产生的影响,仿真结果表明时隙均匀分配方式能保证较低的时延和时延抖动,而连续分配方式能使CSMA/CA获得较高的吞吐量。提出将基于最低信道需求时间的阈值计算方法与吞吐量分析模型相结合,用于在不同应用场景下进行时隙分配方式的选择。     

Dynamic frame length channel assignment in wireless multihop ad hoc networks

A good channel assignment scheme in a multihop ad hoc network should not only guarantee successful data transmissions without collisions but also enhance the channel spatial reuse to maximize the system throughput. From the channel assignment schemes in time division multiple access (TDMA) slot assignment protocols developed in previous studies, we have found that these protocols do not have a convenient frame length shrink scheme after the expansion of the frame length. As the network size grows, the frame length expands quickly, particularly when we set the frame length as a power of two. A very long frame may result in poor channel utilization when it contains many unused slots. In this paper, we propose a dynamic frame length expansion and recovery method called dynamic frame length channel assignment (DFLCA). This strategy is designed to make better use of the available channels by taking advantage of the spatial reuse concept. In DFLCA, the increase in the spatial reuse is achieved by adding certain amount of control overhead. We show that the bandwidth saved due to the channel spatial reuse is larger than the additional bandwidth spent on the control overhead.     

Performance analysis of broadcast protocols in ad hoc networks based on self-pruning

Self-pruning is an effective scheme for efficient broadcasting in ad hoc wireless networks. In a self-pruning broadcast protocol, a node may not forward a broadcast packet if a certain self-pruning condition is satisfied based on the neighborhood information. In a static network with an ideal MAC layer, only a subset of nodes forward the broadcast packet and still guarantee the complete network delivery. Various protocols have been proposed with different self-pruning conditions. Recently, a generic self-pruning protocol was proposed by Wu and Dai (2003), which combines the strength of previous conditions and is more effective. In this paper, we first propose an enhanced version of the generic protocol, which is more elegant in interpreting existing protocols and has a simpler correctness proof. Then, we evaluate the performance of the family of self-pruning protocols under various network situations with ns2. The objective is to observe the efficiency and reliability of these protocols as a function of network density, congestion, and mobility, and provide a guideline of implementation in the "real world". Our performance analysis reveals that the protocol reliability is barely affected by packet collision. However, most self-pruning protocols suffer from low delivery ratio in highly mobile networks. We further explore various techniques that improve the delivery ratio and show that both high efficiency and reliability can be achieved in highly mobile networks.     

Jointly optimal congestion control, channel allocation and power control in multi-channel wireless multihop networks

In this paper, to increase end-to-end throughput and energy efficiency of the multi-channel wireless multihop networks, a framework of jointly optimize congestion control in the transport layer, channel allocation in the data link layer and power control in the physical layer is proposed. It models the network by a generalized network utility maximization (NUM) problem with elastic link data rate constraints. Through binary linearization and log-transformation, and after relaxing the binary constraints on channel allocation matrix, the NUM problem becomes a convex optimization problem, which can be solved by the gateway centralized through branch and bound algorithm with exponential time complexity. Then, a partially distributed near-optimal jointly congestion control, channel allocation and power control (DCCCAPC) algorithm based on Lagrangian dual decomposition technique is proposed. Performance is assessed through simulations in terms of network utility, energy efficiency and fairness index. Convergence of both centralized and distributed algorithms is proved through theoretic analysis and simulations. As the available network resources increase, the performance gain on network utility increases.     

Markov Chain-based performance analysis of multihop IEEE 802.15.4 wireless networks

In this paper, we propose a Markov chain-based analytical framework for modeling the behavior of the medium access control (MAC) protocol in IEEE 802.15.4 wireless networks. Two scenarios are of interest. First, we consider networks where the (sensor) nodes communicate directly to the network coordinator (the final sink). Then, we consider cluster-tree (CT) scenarios where the sources communicate to the coordinator through a series of intermediate relay, which forward the received packets and do not generate traffic on their own. In both scenarios, no acknowledgment messages are used to confirm successful data packet deliveries and communications are beaconed (i.e., they rely on synchronization packets denoted as “beacons”). In all cases, our focus is on networks where the sources and the relays have finite queues (denoted as buffers) to store data packets. The network performance is evaluated in terms of aggregate network throughput and packet delivery delay. The performance predicted by the proposed analytical framework is in very good agreement with realistic ns-2 simulation results.     

A comparative analysis of video codecs for multihop wireless video sensor networks

Wireless video sensor networks (WVSNs) have drawn significant attention in recent years due to the advent of low-cost miniaturized cameras, which makes it feasible to realize large-scale WVSNs for a variety of applications including security surveillance, environmental tracking, and health monitoring. However, the conventional video coding paradigms are not suitable for WVSNs due to resource constraints such as limited computation power, battery energy, and network bandwidth. In this paper, we evaluated and analyzed the performance of video codecs based on emerging video coding paradigms such as distributed video coding and distributed compressive video sensing for multihop WVSNs. The main objective of this work was to provide an insight into the computational (encoding/decoding) complexity, energy consumption, node and network lifetime, processing and memory requirements, and the quality of reconstruction of these video codecs. Based on the findings, this paper also provides some guidelines for the selection of appropriate video codecs for a given WVSN application.     

Performance of multihop CDMA ad hoc networks with diversity combining techniques over fading environments

This study investigates the impact of the diversity combining techniques on the performance of wireless code division multiple access (CDMA) ad hoc networks operating over κ-μ fading channels, where the performance criterion in this study is in terms of the expected progress per hop. The probability density function (PDF) and the cumulative density function (CDF) of the interference power are obtained in κ-μ fading conditions. Furthermore, expression for the unconditional CDF of the signal-to-noise-and-interference ratio (SNIR) is derived, which is utilized to derive expressions for the expected progress per hop with selecting combining (SC) and maximal ratio combining (MRC) diversity. Corresponding expressions for Nakagami-m and Rician fading are presented in this paper as special cases of κ-μ fading. Numerical results are presented for illustration purposes.     

Design and analysis of dynamic leader election protocols in broadcast networks

Summary.  The well-known problem of leader election in distributed systems is considered in a dynamic context where processes may participate and crash spontaneously. Processes communicate by means of buffered broadcasting as opposed to usual point-to-point communication. In this paper we design a leader election protocol in such a dynamic context. As the problem at hand is considerably complex we develop the protocol in three steps. In the initial design processes are considered to be perfect and a leader is assumed to be present initially. In the second protocol, the assumption of an initial leader is dropped. This leads to a symmetric protocol which uses an (abstract) timeout mechanism to detect the absence of a leader. Finally, in the last step of the design processes may crash without giving any notification of other processes. The worst case message complexity of all protocols is addressed. A formal approach to the specification and verification of the leader election protocols is adopted. The requirements are specified in a property-oriented way and the protocols are denoted by means of extended finite state machines. It is proven using linear-time temporal logic that the fault-tolerant protocol satisfies its requirements. Received: September 1993 / Revised: September 1995     

无线传感器网络的经典MAC协议验证与分析

首先介绍4种经典的无线传感器网络(WSN)介质接入控制(MAC)层信道接入方式,并在基于MSP430单片机的温湿度无线传感平台上进行性能验证。随后比较4种经典MAC接入方式的实测值,并分析存在差异的原因。最后提出无线传感器网络MAC层信道接入方式研究的可能方向。     

Performance analysis of a threshold based distributed channel allocation algorithm for cellular networks

Rapid advances of the handheld devices and the emergence of the demanding wireless applications require the cellular networks to support the demanding user needs more effectively. The cellular networks are expected to provide these services under a limited bandwidth. Efficient management of the wireless channels by effective channel allocation algorithms is crucial for the performance of any cellular system. To provide a better channel usage performance, dynamic channel allocation schemes have been proposed. Among these schemes, distributed dynamic channel allocation approaches showed good performance results. The two important issues that must be carefully addressed in such algorithms are the efficient co-channel interference avoidance and messaging overhead reduction. In this paper, we focus on our new distributed channel allocation algorithm and evaluate its performance through extensive simulation studies. The performance evaluation results obtained under different traffic load and user mobility conditions, show that the proposed algorithm outperforms other algorithms recently proposed in the literature.     

MPTCP与CMT-SCTP多路径传输协议性能分析

利用终端的多宿主特性实现多路径传输是因特网协议的一个热点研究问题,MPTCP和CMT-SCTP是目前比较成熟而关键的两个多路径传输协议,但在大规模应用前还需要作大量的性能测试分析研究。在本地测试床环境中,对MPTCP和CMT-SCTP多路径传输实际吞吐量的性能进行对比测试与分析。结果表明MPTCP和CMT-SCTP都能获得吞吐量的提高,但传输调度算法仍然不完善,需要进一步改进。     

Scheduling multihop CDMA networks in the presence of secondary conflicts

This paper presents an algorithm for producing near-optimal conflict-free schedules for networks operating under code division multiple access (CDMA). A procedure for finding a lower bound on the length of such schedules is also presented. The presence of both primary and secondary conflicts (due to imperfectly orthogonal CDMA codes) are accounted for by these algorithms. The complexity of both algorithms is analyzed and computational experience with both procedures is presented. Using the lower bound, it is shown that the heuristic is effective. The complexity analysis demonstrates that it is efficient enough to use in networks of realistic size, even when the schedules must be produced in real time.     

CSMA/CD的建模和性能分析

文章对CSMA／CD（载波侦听多址访问／冲突检测）网络建立分析模型,主要对其时延、吞吐量和介质利用率进行了性能分析,分析了该三项性能指标随网络参数的变化。最后总结出了CSMA／CD网络的优缺点。     

End-to-end maxmin fairness in multihop wireless networks: Theory and protocol

To promote commercial deployment of multihop wireless networks, the research/industry communities must develop new theories and protocols for flexible traffic engineering in these networks in order to support diverse user applications. This paper studies an important traffic engineering problem–how to support fair bandwidth allocation among all end-to-end flows in a multihop wireless network–which, in a more precise term, is to achieve the global maxmin fairness objective in bandwidth allocation. There exists no distributed algorithm for this problem in multihop wireless networks using IEEE 802.11 DCF. We have two major contributions. The first contribution is to develop a novel theory that maps the global maxmin objective to four local conditions and prove their equivalence. The second contribution is to design a distributed rate adjustment protocol based on those local conditions to achieve the global maxmin objective through fully distributed operations. Comparing with the prior art, our protocol has a number of advantages. It is designed for the popular IEEE 802.11 DCF. It replaces per-flow queueing with per-destination queueing. It achieves far better fairness (or weighted fairness) among end-to-end flows.