Throughput performance of an unslotted direct-sequence SSMA packetradio network

A spread-spectrum multiple-access (SSMA) packet radio network model is presented. The topology is a fully connected network with identical message generation processes at all radios. Packet lengths are exponentially distributed, and packets are generated from a Poisson process, resulting in a Markovian model. This network model accounts for the availability of idle receivers in a finite population network. The model also allows the performance of the radio channel to be specified in detail. The channel considered is a BPSK (binary phase-shift keying) direct-sequence SSMA radio channel with hard-decision Viterbi decoding. An analysis of the Viterbi decoder leads to a bound on its performance which is valid for a system with a varying probability of error, as is the case for the network under consideration. The approximate analysis yields lower bounds on throughput and probability of successful packet transmission. Results are given which show the effects on throughput of the received energy-to-noise density ratio, the number of chips per symbol, and the number of radios, as well as the improvement due to error control coding     

Adaptive forwarding in frequency-hop spread-spectrum packet radionetworks with partial-band jamming

Adaptive protocols that specify the ways in which a radio is permitted to modify its normal forwarding procedures based on information obtained locally in the network are considered. A computer program has been developed to simulate a frequency-hop (FH) packet radio network with partial-band jamming and interference due to other FH and narrowband radios. The radios in the network use time-slotted, receiver-directed, FH spread-spectrum signaling. Results on throughput, delay, and end-to-end probability of success are presented, and comparisons between different forwarding protocols are given for a static network topology with both static and mobile network jamming     

Routing in frequency-hop packet radio networks with partial-bandjamming

Research in adaptive, decentralized routing for frequency-hop packet radio networks with mobile partial-band jamming. A routing technique called least-resistance routing (LRR) is developed, and various versions of this routing method are examined. LRR uses a quantitative assessment of the interference environment experienced by a radio's receiver to determine a resistance value for that radio. Two components for the interference environment are considered: transmissions from other radios and partial-band jamming. The resistances for each of the radios in a particular path are combined to form the path resistance, and packets are forwarded on the path with the smallest resistance. Comparisons are made between different versions of LRR and between LRR and previously developed adaptive routing techniques. It is found that LRR is an effective way for dealing with mobile jamming in a frequency-hop packet radio network. Significant increases in throughput and end-to-end probability of success are obtained with LRR     

A technique to improve the performance of serial, matched-filter acquisition in direct-sequence spread-spectrum packet radio communications

In this paper, we examine a simple method to improve the performance of serial, matched-filter acquisition in direct-sequence spread-spectrum packet radio communications. Each packet transmission includes an acquisition preamble, and the preamble sequence is changed at the boundaries of predefined time epochs based on a pseudorandom sequence generator. It is shown in previous work that the presence of an intermediate-frequency filter and the characteristics of the automatic gain-control subsystem lead to a probability of not acquiring that is a nonmonotonic function of the signal-to-noise ratio if the acquisition algorithm uses a threshold-crossing detector with a fixed threshold. The acquisition algorithm presented in this paper employs an estimator to adaptively select the acquisition threshold for each test statistic. It is shown that this technique reduces the severity of the nonmonotonicity and substantially improves the acquisition performance.     

Interference Mitigation Based on Radio Aware Channel Assignment for Wireless Mesh Networks

An intricate network deployment for high demand users leads to simultaneous transmission in wireless mesh networks. Multiple radios are adapted to individual nodes for improving network performance and Quality of Service (QoS). However, whenever multiple radios are assigned to the same channel, co-located radio interference occurs, which poses a major drawback. This paper proposes a Radio aware Channel Assignment (Ra-CA) mechanism based on a direct graphical model for mitigation of interference in multi-radio multi-channel networks. Initially, the co-located radio interference is identified by classifying non-interfering links for simultaneous transmission in the network. Proposed channel assignment mechanism helps in allocating the minimal number of channels to the network that mitigate co-located radio interference. Performance analysis of the proposed Ra-CA strategy is carried out compared with other existing techniques, like Breadth First Search-Channel Assignment (BFS-CA) and Maximal Independent Set Channel Assignment (MaIS-CA), in multi-radio networks. Simulation results demonstrate that the proposed channel assignment scheme is more efficient compared to the existing ones, in terms of QoS parameters like, packet drop rate, packet delivery ratio, transmission delay and throughput.     

On the capacity of an FFH-CDMA packet radio network

A packet radio network employing FFH-CDMA as multiple access technique is studied. We focus on the acquisition process and we examine the effect of multiple-access interference. The relationship between the maximum number of tolerable interfering transmissions and the number of frequencies used in frequency hopping is investigated. The bounds to the probability of acquisition as well as approximations to them are used. The effects of other system parameters, such as the length of the signal's preamble, the number of chips of the code (frequency shifts) per bit and the number of correlators are also studied     

一种节点自分布最优Ad Hoc多播树及其应用

为无线单播模式设计的RTS/CTS信道握手机制不适用于多播模式,导致Ad hoc多播树节点易与隐藏终端发生冲突.通过提出m阶冲突域、节点在冲突域中的分布指标,结合无线网多播数据通信机制分析树节点所在m阶冲突域的冲突概率,进而得到节点自分布最优树的概念,并将它融入多播树的适应函数的设计中,淘汰不良树,优化树节点在m阶冲突域中的分布,在网络层形成一种预防机制,可降低隐藏终端冲突概率;应用于MAODV协议中,提高了MAODV的端到端数据分组平均投递率,这也能够为基于网的和混合式的其他类型MANETs多播路由协议的路由节点分布优化提供有价值的参考.     

CR-CEA: A collision- and energy-aware routing method for cognitive radio wireless sensor networks

Currently, working in the overcrowded shared unlicensed spectrum band, leads to a reduction in the quality of communications in wireless networks. This makes a considerable increase in packet loss caused by collisions that necessitates packets retransmissions. In the case of wireless sensor networks (WSN), a large amount of energy of sensor nodes will be wasted by these retransmissions. Cognitive radio technology makes it possible for sensor nodes, to opportunistically use licensed bands with better propagation characteristics and less congestion. In this paper a routing method for cognitive radio wireless sensor networks (CR-CEA) is presented, that is based on a cross-layer design that jointly considers route and spectrum selection. The CR-CEA method has two main phases: next hop selection and channel selection. The routing is performed hop-by-hop with local information and decisions, which are more compatible with sensor networks. Primary user activity and prevention from interference with them, is considered in all spectrum decisions. It uniformly distributes frequency channels between adjacent nodes, which lead to a local reduction in collision probability. This clearly affects energy consumption in all sensor nodes. In CR-CEA, route selection is energy-aware and a learning-based technique is used to reduce the packet delay in terms of hop-count. The simulation results reveal that by applying cognitive radio technology to WSNs and selecting a proper operating channel, we can consciously decrease collision probability. This saves energy of sensor nodes and improves the network lifetime.     

Improving the performance of a slotted ALOHA packet radio networkwith an adaptive array

The use of an adaptive antenna array as a means of improving the performance of a slotted ALOHA packet radio network is presented. An adaptive array creates a strong capture effect at a packet radio terminal by automatically steering the receiver antenna pattern toward one packet and nulling other contending packets in a slot. A special code preamble and randomized arrival times within each slot allow the adaptive array to lock onto one packet in each slot. The throughput and delay performance of a network with an adaptive array are computed by applying the standard Markov chain analysis of slotted ALOHA. It is shown that throughput levels comparable to carrier sense multiple access (CSMA) are attainable with an adaptive array without the need for stations to be able to hear each other. The performance depends primarily on the number of adaptive array nulls, the array resolution, and the length of the randomization interval within each slot     

Frequency-hop transmission for satellite packet switching and terrestrial packet radio networks

The performance of frequency-hop transmission in a packet communication network is analyzed. Satellite multiple-access broadcast channels for packet switching and terrestrial packet radio networks are the primary examples of the type of network considered. An analysis of the effects of multiple-access interference in frequency-hop radio networks is presented. New measures of "local" performance are defined and evaluated for networks of this type, and new concepts that are important in the design of these networks are introduced. In particular, error probabilities and local throughput are evaluated for a frequency-hop radio network which incorporates the standard slotted and unslotted ALOHA channel-access protocols, asynchronous frequency hopping, and Reed-Solomon error-control coding. The performance of frequency-hop multiple access with error-control coding is compared with the performance of conventional ALOHA random access using narrow-band radios.     

Near-far effects in land mobile random access networks withnarrow-band Rayleigh fading channels

The near-far effect of random access protocols in mobile radio channels with receiver capture is investigated. To this end, the probability of successful reception of a packet from a terminal at a known distance from the central receiver is obtained taking into account Rayleigh fading, UHF propagation attenuation, and the statistics of contending packet traffic in radio nets employing slotted ALOHA, carrier sense multiple access (CSMA) or inhibit sense multiple access (ISMA) protocols. Various models of receiver capture are compared, namely packet error rates for synchronous detection in slow- and fast-fading channels, and the probability that the signal-to-interference ratio is above a required threshold     

Performance Evaluation of Impulse Radio UWB Networks Using Common or Private Acquisition Preambles

For impulse-radio ultrawideband (IR-UWB) networks without global synchronization, the first step for correct packet reception is packet detection and timing acquisition: Before recovering the payload of the packet, the destination must detect that the packet is on the medium and determine when exactly the payload begins. Packet detection and timing acquisition rely on the presence of an acquisition preamble at the beginning of each packet. How this preamble is chosen is a network design issue and it may have quite an impact on the network performance. A simple design choice of the network is to use a common acquisition preamble for the whole network. A second design choice is to use an acquisition preamble that is private to each destination. The throughput with the latter choice is likely to be much higher, albeit at the cost of learning the private acquisition preamble of a destination. In this paper, we evaluate how using a common or private acquisition preambles affects the network throughput. Our analysis is based on analytical modeling and simulations. Using our analytical model, we show that a private acquisition preamble yields a tremendous increase in throughput compared to a common acquisition preamble. The throughput difference grows with the number of concurrent transmitters and interferers. This result is confirmed by simulations. Furthermore, additional simulations on multihop topologies with TCP flows demonstrate that a network using private acquisition preambles has a stable throughput. On the contrary, using a common acquisition preamble exhibits the presence of a compounding effect similar to the exposed terminal issue in IEEE 802.11 networks: The throughput is severely degraded and complete flow starvation may occur.     

一种自适应侦听的异步无线传感器网络MAC协议

为了提升异步无线传感器网络MAC协议在动态网络负载下的性能,论文提出了一种流量自适应的异步协议AA-MAC.该协议基于短前导序列采样技术,当节点收稿数据后并不理解转入睡眠而自适应增加若干个最短侦听时间用以接收发送节点的可能其他数据,使得收发双方在网络负载较重时能实现一次配对多次收发数据.分析并对比了AA-MAC和X-M...     

Performance analysis of spread spectrum packet radio network withchannel load sensing

A continuous-time Markov-chain model for an asynchronous communication spread-spectrum code-division-multiple-access (CDMA) packet radio network is developed. The network is composed of mutually independent users. The receiver-based code is considered; a terminal with a packet to send looks up the destination's code and transmits on that code. Each user senses the channel load and refrains from transmission if the channel load exceeds the channel threshold. The model makes it possible to study the threshold effect of channel load on the performance of the CDMA packet radio network. Improvements in performance of spread-spectrum packet radio networks due to channel-load sensing are shown. Steady-state results for throughput are obtained     

Coexisting with the dynamic PU,the effect of PU‐returns on a secondary network

Coexisting with a dynamic primary user network is a challenge in cognitive radio networks, since the rate at which primary user reoccupies the spectrum is high. Therefore, it is important to investigate deeply the effect of primary traffic dynamics on secondary network performance metrics. To do that, interference due to both sensing error and primary user re‐occupancy must be formulated and considered in throughput and collision probability. Besides them, secondary packet retransmissions due to such interference should be considered in metrics such as average energy consumption and average packet delay. In this study, we formulate the mentioned secondary network metrics regarding to such kinds of interference and secondary packet retransmission. Numerical results along with discussions are given to clarify derived expressions. Simulations are also performed to justify the theoretical results, and optimum operating point for secondary network settings is derived by genetic algorithm.     

A hybrid reservation-based MAC protocol for underwater acoustic sensor networks

Due to the characteristics of underwater acoustic channel, such as long propagation delay and low available bandwidth, media access control (MAC) protocol designed for the underwater acoustic sensor network (UWASN) is quite different from that for the terrestrial wireless sensor network. However, for the contention-based MAC protocols, the packet transmission time is long because of the long preamble in real acoustic modems, which increase the packet collisions. And the competition phase lasts for long time when many nodes are competing for the channel to access. For the schedule-based MAC protocols, the delay is too long, especially in a UWASN with low traffic load. In order to resolve these problems, a hybrid reservation-based MAC (HRMAC) protocol is proposed for UWASNs in this paper. In the proposed HRMAC protocol, the nodes reserve the channel by declaring and spectrum spreading technology is used to reduce the collision of the control packets. Many nodes with data packets to be transmitted can reserve the channel simultaneously, and nodes with reserved channel transmit their data in a given order. The performance analysis shows that the proposed HRMAC protocol can improve the channel efficiency greatly. Simulation results also show that the proposed HRMAC protocol achieves better performance, namely higher network throughput, lower packet drop ratio, smaller end-to-end delay, less overhead of control packets and lower energy overhead, compared to existing typical MAC protocols for the UWASNs.     

Network protocols for frequency-hop packet radios with decoder sideinformation

Reliable data distribution within spread-spectrum packet radio networks requires high performance from the network protocols. This paper describes research in forwarding and routing protocols that are designed specifically for slow-frequency hop (SFH) packet radio networks in which some of the radios are subjected to excessive interference. It is shown that information extracted from the decoder can be used to aid the network protocols. New metrics are introduced that use this information to give a quantitative assessment of the interference environment experienced by the receiver in an SFH radio. Forwarding protocols are developed that can react quickly to local sources of interference, and the metrics that are introduced permit the routing algorithm to react to changes in the interference conditions in the network     

The low-cost packet radio

Research on packet switched radio networks requires reconfigurable testbeds with large numbers of readily deployable radios. This motivated the development of a small, low-cost packet radio (LPR) with the flexibility to support extensive network experiments, and to be amenable to tailoring to specific end-use applications. The LPR incorporates a digitally controlled direct sequence minimum shift keyed spread-spectrum radio and a microprocessor-based packet switch. Code changeable surface acoustic wave (SAW) matched filtering provides processing gain at burst symbol rates of 100k and 400k symbols per second in the presence of interference. Coherent recursive integration enhances synchronization performance, provides synchronous detection of the data, and serves the adaptive multipath accumulator. Forward error correction utilizing convolutional encoding and sequential decoding is incorporated at four different code rates for both burst symbol rates. The microprocessor runs the networking software. Requirements, design, and performance data for the LPR engineering model are presented.     

水声通信网络中的MACA-C介质访问控制协议

介质访问控制协议（Medium Access Control , MAC）是水声通信网络中的一种关键技术。与陆地无线通信系统使用无线电波有所不同,水声通信网络依靠水声进行通信。水声通信网络中的MAC协议设计面临许多挑战面,如:传播延迟大、带宽窄、电池不易更换或充电、节点发射功率受限等。因此,陆地无线通信系统的各MAC协议不能直接应用到水声通信网络。本文提出了一种适用于水声通信网络的MACA（MACA-C）协议,该协议主要将传输数据包和控制包结合使用,在每轮握手的过程中,该协议通过发送列的首数据包和RTS控制包来改善信道利用率。仿真结果也表明MACA-C能够达到较高的和稳定的吞吐量性能,同时在保持低碰撞率的前提下增加信道利用率。      

Analysis of Cognitive Radio Spectrum Access with Optimal Channel Reservation

A Markov chain analysis for spectrum access in licensed bands for cognitive radios is presented and forced termination probability, blocking probability and traffic throughput are derived. In addition, a channel reservation scheme for cognitive radio spectrum handoff is proposed. This scheme allows the tradeoff between forced termination and blocking according to QoS requirements. Numerical results show that the proposed scheme can greatly reduce forced termination probability at a slight increase in blocking probability