A new wireless network medium access protocol based on cooperation

In this paper, we propose a new media access protocol for wireless networks, that due to its ability to resolve collisions can achieve high throughput. We view the wireless network as a spatially distributed antenna with antenna elements linked via the wireless channel. When there is a collision, the collided packets are saved in a buffer. In the slots following the collision, a set of nodes designated as nonregenerative relays retransmit the signal that they received during the collision slot. By processing the originally collided packets and the signals forwarded by the relays, the destination node can recover the original packets. The proposed scheme maintains the benefits of ALOHA systems, i.e., needs no scheduling overhead and is suitable for bursty sources, such as multimedia sources. It also offers the benefits of multi-antenna systems, i.e., spatial diversity while employing a single transmit/receive antenna at each node. Spatial diversity enables it to be robust to the wireless channel. The proposed approach achieves higher throughput and energy savings than existing techniques that allow for multiple packet reception.     

A medium access protocol exploiting multiuser-detection in CDMA ad-hoc networks

A new medium access protocol which exploits the physical layer capability of multiuser detection is proposed to help in improving the throughput/delay performance of ad-hoc networks. When more than one node has packets buffered for a common node in the neighborhood, all such nodes can simultaneously transmit their packets to the common receiver after reserving their surrounding channel. This is achieved in our protocol by extending the (sender-initiated) CSMA/CA collision avoidance framework by the receiver-initiated medium access technique and incorporating the transmission power control. We analyze the improvement in the throughput that can be achieved over the basic sender-initiated collision avoidance protocol in the network. Since the throughput improvement via multi-packet reception is influenced by the network layer activity as well, the performance of our protocol rolls back to that of the basic sender-initiated protocol in case of no coordination from the network layer. For the evaluation of performance of our protocol we simulate ad-hoc networks for different network topologies and traffic configurations. We observe the scheme to be capable in significantly improving the throughput/delay performance of the network.     

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.     

一种新的基于网络编码的碰撞解决算法

文中提出一种叫做网络编码树算法的新的碰撞解决算法,该算法在树算法的基础上结合了网络编码技术.树算法没有充分利用碰撞的数据包,对于碰撞数据包的处理往往采用丢弃的方式.通过引入网络编码技术,可以利用碰撞的数据包带来的信息,从而提高树算法的效率和性能.通过仿真,将网络编码分裂树算法与现有的其他碰撞解决算法进行了性能比较,证实网络编码树算法大幅度地提高网络的吞吐量并降低了平均延时.     

Analysis of a stack algorithm for CSMA-CD random length packetcommunication

An exact performance evaluation of the free-access stack collision resolution algorithm is given under the hypotheses of carrier-sense multiple access with collision detection (CSMA-CD) local area network communication with packets of different length. In particular, the packet delay moments (mean and variance) and the maximum throughput that the system achieves for any given packet length distribution are precisely described     

A hybrid multi-channel MAC protocol for wireless ad hoc networks

In a regular wireless ad hoc network, the Medium Access Control (MAC) protocol coordinates channel access among nodes, and the throughput of the network is limited by the bandwidth of a single channel. The multi-channel MAC protocols can exploit multiple channels to achieve high network throughput by enabling more concurrent transmissions. In this paper, we propose a hybrid and adaptive protocol, called H-MMAC, which utilizes multi-channel resources more efficiently than other multi-channel MAC protocols. The main idea is to adopt the IEEE 802.11 Power Saving Mechanism and to allow nodes to transmit data packets while other nodes try to negotiate the data channel during the Ad hoc Traffic Indication Message window based on the network traffic load. The analytical and simulation results show that the proposed H-MMAC protocol improves the network performance significantly in terms of the aggregate throughput, average delay, fairness and energy efficiency.     

Evaluation of the masked node problem in ad hoc wireless LANs

IEEE 802.11 wireless networks employ the so-called RTS/CTS mechanism in order to avoid data packet collisions. The main design assumption is that all the nodes in the vicinity of a sender and a receiver will hear the RTS or CTS packets, and defer their transmission appropriately. This assumption happens to not hold, in general, even under perfect operating conditions. Often, neighboring nodes are "masked" by other ongoing transmissions nearby and, hence, are unable to receive the RTS or CTS packets correctly. We refer to such nodes as masked nodes. In this paper, we describe the masked node problem and show scenarios leading to data packet collisions. We evaluate the impact of masked nodes through mathematical analysis and real experiments on a small IEEE 802.11 ad hoc network. The analytical and experimental data closely match and reveal that the presence of a masked node in a network can result in an order of magnitude increase in data packet loss compared to a network without masked nodes. These results are further validated by extensive simulations on a large-scale network, which show that masked nodes also significantly affect delay and throughput performance. Therefore, masked nodes severely limit the effectiveness of the RTS/CTS mechanism in preventing performance degradation in wireless LANs.     

Performance evaluation of CSMA/ID MAC protocol for IP over WDM ring networks

In this paper, a packet pre‐classification media access control protocol based on a carrier sense multiple access with idle detection (CSMA/ID) scheme is investigated for supporting IP packets over all‐optical WDM ring networks. The purpose of the protocol is to increase throughput and to decrease the packet transmission delay of IP packets over optical networks in a metropolitan area network. This protocol avoids both packet collision and packet fragmentation. In order to improve the utilization of the network, the packets transmitted from a local area network are first pre‐classified into various class queues of an access point (AP) according to their length. After checking the available space based on the wavelength received by the receivers of the AP, the packets in the queues are transmitted. An analytical model is developed to evaluate the performance of the protocol, with simulation results showing good network efficiency. The proposed network has short‐term variations that introduce unfairness conditions. This problem could be overcome by assigning a quota on individual queues to allow all queues fair access. Copyright © 2008 John Wiley & Sons, Ltd.     

Fair MAC protocol for optical ring network of wavelength-shared access nodes

In this paper, a WDM optical ring consisting of access nodes with fixed transmitter-n fixed receivers (FT—FR ⁿ ) is considered. As access nodes share a wavelength channel there is trade-off between node throughput and fairness among them. In order to abbreviate the transmission unfairness and to increase the throughput, we propose p-persistent medium access control (MAC) protocol. Each node uses the carrier sense multiple access with collision avoidance (CSMA/CA) protocol to transmit packets, and decides whether to use a local empty slot with probability p when a transferred packet based on source-stripping is dropped and emptied. Numerical prediction for the proposed MAC protocol is introduced to compute the maximum node throughput under uniform traffic condition. For more detail results, we use network simulation with self-similar traffic and introduce various results. The proposed MAC protocol gives better node throughput than non-persistent protocol and shows an improved fairness factor than 1-persistent protocol. Through simulation, we also find the reasonable probability of p-persistent protocol for a given architecture.     

A successive transmission medium access scheme with dynamic contention window for VLC system with saturated traffic

The visible light communication (VLC) network is usually relatively small scale and can provide high-data-rate information transmission, where multiple users get access to the network according to the carrier sense multiple access with collision avoidance (CSMA/CA) mechanism specified by IEEE 802.15.7 standard. In this paper, we propose a novel dynamic contention window with successive transmission (DCW-ST) scheme to improve the performance of this channel access mechanism and to achieve better network throughput without delay performance degradation. Specifically, we propose to adjust the contention window dynamically to adapt to the time-changing network size. Further, we derive the contention window size to achieve trade-off of throughput and delay, and the minimum contention window size required for the throughput enhancement. In addition, in order to further improve the delay performance, we present a successive transmission scheme that allows the nodes which have completed one transmission successfully to get the chance of transmitting information successively according to the network condition. Simulations are performed for the VLC system in saturated traffic and compared with the theoretical performances, which demonstrate that our proposed scheme outperforms the legacy CSMA/CA of IEEE 802.15.7.     

基于规则与感知的水声网络MAC协议

针对水声网络(UAN)媒体访问控制(MAC)协议采用RTS/CTS握手机制,导致信道利用率和网络吞吐量较低的问题,提出一套信道访问规则,基于该规则设计了节点状态感知的水声网络MAC(RP-MAC)协议.当接收节点不在收发状态,并且其他邻居节点也都不在接收状态时,发送节点才会尝试发送一到多个报文给接收节点.节点通过侦听和...     

RIPT: A Receiver-Initiated Reservation-Based Protocol for Underwater Acoustic Networks

Although there are many MAC protocols that have been proposed for terrestrial wireless networks with a wide variety of aspects, these protocols cannot be applied directly in underwater acoustic networks due to the channel's uniqueness of having low data rate and long propagation delay. In order to achieve a high throughput, both characteristics must be taken into account in the MAC design. We propose a random access MAC protocol for multi-hop underwater acoustic networks based on receiver reservation, which we shall call the "Receiverinitiated Packet Train" (RIPT) protocol. It is a handshakingbased protocol that addresses the channel?s long propagation delay characteristic by utilizing receiver-initiated reservations, as well as by coordinating packets from multiple neighboring nodes to arrive in a packet train manner at the receiver. Our simulation results have confirmed that the RIPT protocol can achieve our goal of having high and stable throughput performance while maintaining low collision rate.     

移动Ad HOc网络中的公平按需多址接入协议

基于快速、有效竞争预约接入、无冲突轮询传输的思想和带冲突预防的冲突分解策略,本文提出了适于移动Ad Hoc网络的公平按需多址接入(FODA)协议.该协议在分群结构的基础上,利用公平冲突预防算法预约信道资源获得轮询服务,从而完全消除了载波侦听方式下多跳无线网络业务传输中的隐藏终端和暴露终端问题.另外,公平冲突预防算法解决了节点竞争接入时的冲突问题和不公平现象.最后,仿真结果表明,与带冲突避免的载波侦听多址接入(CSMA/CA)和轮询协议相比,FODA协议可以提供较高的信道吞吐量、较低的平均消息丢弃率和平均消息时延.     

Modeling of Collision Avoidance Protocols in Single-Channel Multihop Wireless Networks

Although there has been considerable work on the performance evaluation of collision avoidance schemes, most analytical work is confined to single-hop ad hoc networks or networks with very few hidden terminals. We present the first analytical model to derive the saturation throughput of collision avoidance protocols in multi-hop ad hoc networks with nodes randomly placed according to a two-dimensional Poisson distribution. We show that the sender-initiated collision-avoidance scheme achieves much higher throughput than the ideal carrier sense multiple access scheme with a separate channel for acknowledgments. More importantly, we show that the collision-avoidance scheme can accommodate much fewer competing nodes within a region in a network infested with hidden terminals than in a fully-connected network, if reasonable throughput is to be maintained. Simulations of the IEEE 802.11 MAC protocol and one of its variants validate the predictions made in the analysis. It is also shown that the IEEE 802.11 MAC protocol cannot ensure collision-free transmission of data packets and thus throughput can degrade well below what is predicted by the analysis of a correct collision avoidance protocol. Based on these results, a number of improvements are proposed for the IEEE 802.11 MAC protocol.     

Efficient Protocols Design and Performance Analysis for Centralized WLAN

Device-to-device communications have attracted much more attention recently in the realization of smart cities. In this paper, we propose a network coding (NC) scheme based on device-to-device communication for centralized wireless local area network (WLAN). In centralized WLAN scenarios, users’ communication can be implemented through multiple interaction of access points acted as relay nodes, which are similar to direct link session (DLS) protocol in IEEE 802.11 standard and we named the proposed protocol as advanced DLS scheme, where analytical performance results of the proposed two-way communication system using NC, with and without AP selection, are obtained in multi-AP cases, as well as the asymptotic results in high transmitting power. In addition, the performance comparisons of throughput, delay and collision probability of proposed scheme with IEEE 802.11 are provided in simulation, which present the advantages of centralized WLAN. By the analysis, it is found that the proposed advanced DLS scheme can achieve almost exactly the same bit error ratio performance as the optimal selection at all signal to noise ratio ranges. It is also shown that the proposed transmission scheme significantly outperform the current mode in two-way communication Nakagami channels owing to the diversity order and array gains. The proposed scheme only need little frame modification and can be compatible with the current standard. Finally, simulation results validate the theoretical analysis.     

Probability Models for the Splitting Algorithm in Wireless Access Networks with Multipacket Reception and Finite Nodes

In this paper, we propose an analytical approach for performance evaluation of the classic tree/stack splitting algorithm in an interference-dominating wireless access network with random traffic and finite nodes. In an interference-dominating wireless access network, a receiver could simultaneously receive multiple packets from a variety of transmitters, as long as the signal-to-interference-plus-noise ratio exceeds a predetermined threshold. We use discrete-time Markov chains and regenerative processes to derive the throughput curve, the packet blocking probability, the average system size, and the average packet delay. We show that the exact performance of the splitting algorithm depends on the total number of nodes in the network. We verify our numerical results by rigorous mathematical proof and computer simulations.     

Queuing network models for delay analysis of multihop wireless ad hoc networks

In this paper we analyze the average end-to-end delay and maximum achievable per-node throughput in random access multihop wireless ad hoc networks with stationary nodes. We present an analytical model that takes into account the number of nodes, the random packet arrival process, the extent of locality of traffic, and the back off and collision avoidance mechanisms of random access MAC. We model random access multihop wireless networks as open G/G/1 queuing networks and use the diffusion approximation in order to evaluate closed form expressions for the average end-to-end delay. The mean service time of nodes is evaluated and used to obtain the maximum achievable per-node throughput. The analytical results obtained here from the queuing network analysis are discussed with regard to similarities and differences from the well established information-theoretic results on throughput and delay scaling laws in ad hoc networks. We also investigate the extent of deviation of delay and throughput in a real world network from the analytical results presented in this paper. We conduct extensive simulations in order to verify the analytical results and also compare them against NS-2 simulations.     

A High-Throughput MAC Protocol for Wireless Ad Hoc Networks

One way to improve the throughput of a wireless ad hoc network at the media access (MAC) layer is to allow as much as possible concurrent transmissions among neighboring nodes. In this paper, we present a novel high-throughput MAC protocol, called Concurrent Transmission MAC(CTMAC), which supports concurrent transmission while allowing the network to have a simple design with a single channel, single transceiver, and single transmission power architecture. CTMAC inserts additional control gap between the transmission of control packets (RTS/CTS) and data packets (DATA/ACK), which allows a series of RTS/CTS exchanges to take place between the nodes in the vicinity of the transmitting or receiving node to schedule possible multiple, concurrent data transmissions. To safeguard the concurrent data transmission, collision avoidance information is included in the control packets and used by the neighboring nodes to determine whether they should begin their transmissions. Also, to isolate the possible interference between DATA packets and ACK packets, a new ACK sequence mechanism is proposed. Simulation results show that a significant gain in throughput can be obtained by the CTMAC protocol compared with the existing work including the IEEE 802.11 MAC protocol.     

一种新型的光分组交换环网体系结构

提出了一种以波长为标签的新型全光变长分组交换环网的体系结构、网络节点的光分组数据包收发模型,以及防止光分组冲突的多令牌协议。使用多令牌协议的环网在进行光分组交换时,不需要高速的光子器件,无需使用延迟线、电中继以及解决光分组的冲突问题。通过数值仿真,分析了4节点、8节点和16节点环网巾光分组各种的时延特性以及网络的吞吐量特性。结果表明,当网络负载增大时,数据包的平均时延增大,同时网络节点的吞吐量和资源利用率也随之增大;网络节点数目越多,网络的吞吐率也越大。