In IEEE802.11 Wireless Local Area Networks (WLANs), frame collisions occur drastically when the number of wireless terminals connecting to the same Access Point (AP) increases. It causes the decrease of the total throughput of all terminals. To solve this issue, the authors have proposed a new media access control (MAC) method, Synchronized Phase MAC (SP-MAC), based on the synchronization phenomena of coupled oscillators. We have addressed the network environment in which only uplink flows from the wireless terminal to an AP exist. However, it is necessary to take into consideration of the real network environment in which uplink and downlink flows are generated simultaneously. If many bidirectional data flows exist in the WLAN, the AP receives many frames from both uplink and downlink by collision avoidance of SP-MAC. As a result, the total throughput decreases by buffer overflow in the AP. In this paper, we propose a priority control method based on SP-MAC for avoiding the buffer overflow in the AP under the bidirectional environment. Also, we show that the proposed method has an effect for improving buffer overflow in the AP and total throughput by the simulation.

This paper deals with the inefficient channel utilization of wireless LANs that use rate adaptation. Recently, wireless LANs are being utilized in various environments. However, inefficient channel utilization is still a serious problem. The effective solutions include to decrease the frequency of packet loss and to transmit packets at a higher rate. While the backoff algorithm in IEEE 802.11 avoids only the packet loss caused by collision, other previous works tackle the packet loss caused by channel fading by means of transmission at a lower rate. This approach is called rate adaptation and a simple rate adaptation scheme is widely diffused in commercial 802.11 wireless LAN devices. However, utilizing lower transmission rate degrades transmission efficiency because the channel is occupied for a longer time. In this paper, decreasing transmission rate is avoided with novel transmission scheduling. Specifically, the proposed scheduling interrupts packet transmission to receiver stations under fading channel condition until the condition improves. Instead, other packets to other stations are transmitted in advance. To implement this proposed scheduling, only access points (APs) need to be modified. Hence, legacy wireless stations can benefit from higher communication bandwidth simply by introducing the modified APs. Moreover, although wireless stations must also be modified, an extended RTS/CTS handshake is also proposed to quickly detect the improvement of channel condition and to minimize the wasted time even if fading loss occurs. Here, wireless stations must also be modified to adopt the extended RTS/CTS handshake but further bandwidth increase is achievable. Evaluation results demonstrate that network throughput is improved without degrading the throughput fairness among receiver stations and packet transfer delay of interrupted stations.

Wireless local area networks (LANs) based on the IEEE802.11 standard usually use carrier sense multiple access with collision avoidance (CSMA/CA) for media access control. However, in CSMA/CA, if the number of wireless terminals increases, the back-off time derived by the initial contention window (CW) tends to conflict among wireless terminals. Consequently, a data frame collision often occurs, which sometimes causes the degradation of the total throughput in the transport layer protocols. In this study, to improve the total throughput, we propose a new media access control method, SP-MAC, which is based on the synchronization phenomena of coupled oscillators. Moreover, this study shows that SP-MAC drastically decreases the data frame collision probability and improves the total throughput when compared with the original CSMA/CA method.

This paper proposes a distributed TDMA slot scheduling algorithm with power control, which the slot allocation priority is controlled by distance measurement information. In the proposed scheme, Lamport's bakery algorithm for mutual exclusion is applied for prioritized slot allocation based on the distance measurement information between nodes, and a packet-based transmission power control scheme is combined. This aims at achieving media access control methods which can construct a local network practically by limiting the scope. The proposed scheme can be shown as a possible replacement of DRAND algorithm for Z-MAC scheme in a distance-measurement-oriented manner. The scheme can contribute to the efficient TDMA slot allocation.

In distributed spectrum sensing, spatially distributed sensors perform radio frequency (RF) sensing and forward the result to a fusion center (FC). Cognitive radio (CR) obtains spectral information from the FC. Distributed spectrum sensing facilitates reliable discovery of spectrum opportunity while providing enhanced protection to legacy systems. The overall performance of distributed spectrum sensing depends both on the quality of sensing at the individual sensors and the forwarding scheme from the individual sensors. In this aspect the choice of media access control (MAC) plays a significant role. We can improve the system performance by optimizing the MAC and the spectrum sensing parameters jointly. In this paper we propose an enhanced MAC scheme based on existing scheduled MAC protocols to yield a high performance distributed spectrum sensing. To demonstrate our idea, we provide computer simulation by considering energy detection based distributed spectrum sensors and IEEE 802.15.4 PHY and MAC parameters.

UHF band passive RFID systems are being steadily adopted by industries because of their capability of long range automatic identification with passive tags. For an application which demands a large number of readers located in a limited geographical area, referred to as dense reader mode, interference rejection among readers is important. The coding method, baseband or subcarrier coding, in the tag-to-reader communication link results in a significant influence on the interference rejection performance. This paper examines the frequency sharing of baseband and subcarrier coding UHF RFID systems from the perspective of their transmission delay using a media access control (MAC) simulator. The validity of the numerical simulation was verified by an experiment. It is revealed that, in a mixed operation of baseband and subcarrier systems, assigning as many channels as possible to baseband system unless they do not exploit the subcarrier channels is the general principle for efficient frequency sharing. This frequency sharing principle is effective both to baseband and subcarrier coding systems. Otherwise, mixed operation fundamentally increases the transmission delay in subcarrier coding systems.

This letter proposes a busy-tone based scheme for reliable and efficient broadcasting in mobile ad hoc networks. Control packets such as RTS, CTS and ACK are ignored in the broadcast scheme, and two busy tones are used, one for channel reservation and the other for negative acknowledgement. Unlike traditional schemes for reliable broadcasting, the proposed scheme is highly efficient as it achieves both collision avoidance and fast packet loss recovery. Simulation results are presented which show the effectiveness of the proposed scheme.

This paper proposes the Multimedia Pre-allocation WDMA (MP-WDMA) media access control (MAC) protocol to provide an efficient packet transfer service for metro-wavelength division multiple access (WDMA) networks. MP-WDMA considers three traffic types: constant bit rate (CBR), variable bit rate 1 (VBR1), and VBR2 traffic for a multimedia service as categorized in Multimedia WDMA (M-WDMA) MAC protocol. MP-WDMA is based on pre-allocation WDMA (P-WDMA), but the three traffic types are simultaneously allocated at one time slot, and one of them is selected through low bandwidth control signaling. Namely, a station assigns appropriate priority to input traffic, based on proposed traffic priority rules in MP-WDMA in order to determine the type of traffic. Accordingly, MP-WDMA can reduce station complexity as well as the possibility of idle time slot occurrences, compared with M-WDMA. Additionally, we analytically investigate the channel utilization and channel access delay of MP-WDMA and compare them with those of M-WDMA to find a proper MAC protocol for the networks. As a result, MP-WDMA supports maximally 30% higher channel utilization than M-WDMA regardless of channel and traffic conditions. Furthermore, MP-WDMA reduces the channel access delay of the delay-sensitive VBR2 traffic at the cost of increasing the channel access delay of the delay-insensitive VBR1 traffic. In this regard, MP-WDMA is suitable for the networks in terms of station complexity, channel utilization, and the channel access delay for VBR2 traffic.

In this paper, we examine the Interleaved Polling with Adaptive Cycle Time (IPACT) that was proposed to control upstream traffic for Gigabit Ethernet-PONs, a promising technology for the Fiber To The Home (FTTH). We analyzed the performance for the gated service and the limited service mathematically. To do this, the IPACT protocol was modeled as a polling system and analyzed by using mean-value analysis technique. The traffic arrival rate λ was divided into three regions, and each region was analyzed separately and merged appropriately by using an interpolation method. The average packet delay, average queue size, and average cycle time of both the gated service and the limited service were obtained through the analysis. In order to evaluate the accuracy of the mathematical analysis, discrete event simulation was performed for the IPACT protocol. Simulation results show the accuracy of the mathematical analysis. The analysis results can be widely used in the design of the FTTH system based on EPON, as the performance results in the present study can be obtained in a rather short time. We can design an appropriate system depending on various traffic conditions by adjusting system parameters, such as the number of users N, the maximum transfer window WMAX, and so on.

This paper considers the problem of providing relative service differentiation in IEEE 802.11 Wireless LAN by using different Medium Access Control (MAC) parameters for different service classes. We present an analytical model which predicts the saturation throughput of IEEE 802.11 Distributed Coordination Function with multiple classes of service. This model allows us to show that relative service differentiation can be achieved by varying the initial contention window alone. In this case, the saturation throughput of a station can be shown to be approximately inversely proportional to the initial contention window size being used by that station. The simulation results validate our analytical model.

In wireless ad hoc networks, various medium access control (MAC) protocols have been developed to avoid data packet collision and improve channel utilization in the presence of hidden terminals. For distributed MAC protocols, exchange of messages (handshake), are usually required before data transmission. Based on the initiator of the handshake, MAC protocols can be categorized as sender-initiated or receiver-initiated protocols. Theoretically, the latter outperforms the former since less control overhead is required. However, fundamental assumptions made in the receiver-initiated protocols are very vulnerable. In this paper, we propose a new MAC protocol known as multiple access with reduced handshake (MARCH). MARCH utilizes the broadcast characteristics of an omni-directional antenna to reduce the number of handshakes required to initiate a data transmission. Simulation results demonstrate that this low-overhead MAC protocol results in a 65% increase in network throughput.

Timed token protocols inadequately provide periodic communication service, although this is crucial for hard real time systems. We propose an algorithm to guaranteeing periodic communication service on a timed token protocol network. In this approach, we allocate bandwidth to each node so that the summation of bandwidth allocations is Target Token Rotation Time (TTRT). If a node cannot consume the allocated time, the residual time is made concession to other nodes for non-periodic service using a timer which contains the unused time value and is appended to the token. This algorithm can always guarantee transmission of real-time messages before their deadlines when the network utilization is less than 50%.

Session length and group size are two most significant factors in achieving efficient scheduling for unicast and multicast traffic in single-hop wavelength division multiplexing (WDM) local area networks (LANs). This paper presents a hybrid protocol to schedule both unicast and multicast traffic in broadcast WDM networks. The protocol makes an important assumption that unicast traffic is the major portion of the overall traffic and is usually scheduled with a pre-allocation-based protocol. On the other hand, multicast traffic is a smaller portion of the overall traffic with multicast sessions and multicast groups, and is scheduled with a reservation-based protocol. The concept of multicast threshold, a function of random variables including the multicast session length and the multicast group size, is also proposed to partition the multicast traffic into two types. If the transmission threshold of a multicast request is larger than the multicast threshold, the request is handled with a reservation-based protocol. Otherwise, the multicast request is handled similar to unicast traffic; that is, each packet in the multicast session is replicated and sent to the unicast queues of destinations. The results show that the hybrid protocol can achieve better channel utilization efficiency and packet delay for unicast traffic under the multicast scenarios with moderate session length and group size. However, separate scheduling or broadcasting will be more suitable for a multicast scenario with very large session length and group size, which is not common on most realistic networks.

This paper focuses on a single BSA (Basic Service Area) in an infrastructure network and studies the performance of the IEEE 802.11 standard MAC protocol by means of simulation. The MAC protocol supports DCF (Distributed Coordination Function) and PCF (Point Coordination Function). The simulation model includes both data transmission with the DCF and H.263 video transmission with the PCF. In the simulation we assume that the channel transmission rate is 2 Mbps and use the system parameters specified in the standard for the DSSS (Direct Sequence Spread Spectrum) physical layer. We evaluate the performance of this protocol in terms of throughput and MPDU (MAC Protocol Data Unit) delay for various values of the CFP (Contention Free Period) repetition interval and the CFP maximum duration. Numerical results show that if the CFP repetition interval is set too long, video MPDU delay becomes very large periodically; therefore, average video MPDU delay deteriorates. We also find that as the CFP maximum duration decreases, the number of video terminals that can be accommodated in the system decreases. Furthermore, how channel transmission errors affect the performance of the protocol is examined. A two-state continuous-time Markov model is used as a burst error model. As a result, we see that for a small number of video terminals, the average video-MPDU-delay performance does not deteriorate drastically for larger values of bit error rate.

In this paper, we propose a dynamic TDMA with priority-based request packet transmission scheme (D-TDMA/PRPTS) which applies priority-based request packet transmission scheme instead of slotted ALOHA (S-ALOHA). D-TDMA/PRPTS can avoid collisions between voice request packets and data request packets and transmit voice request packets preferentially. This makes D-TDMA/PRPTS enlarge the system capacity for voice users with SAD. We analyze voice packet dropping probability and channel utilization for voice traffic by using an appropriate Markov model. We also present simulation results to verify the analysis and to investigate data performances as well, with the voice-data integrated scenario.

Recent technology innovations have increased the study on wireless LAN (Local Area Network). Also, improved computing power of end user has needed the distributed communication environment. However, conventional access protocols (TDMA, CSMA/CA and CDMA) have some problems such as the degradation of channel utilization, necessity of control station and code reuse. Therefore, we propose new multiple access scheme, Hybrid Reservation CDMA based on our previous work, DR-CDMA. Proposed method for distributed/central wireless LAN architecture provides, distributed channel access mechanism, code reuse method and internetworking method with conventional wire-based LAN. In proposed mechanism, efficient channel utilization could be obtained by minimizing overhead. Also, variable length frame from upper layer could be transmitted without segmentation. Moreover, nodes are serviced based on priority. In view of management, insertion of new node could be done easily in proposed HR-CDMA in proposed method due to its variable length property which can encapsulate conventional LAN frame. According to computer simulation, it has been shown that performances of proposed method are better than those of reservation TDMA bitmap protocol with respect to delay and throughput characteristics in the distributed environments as well as interworking environments between wire and wireless LAN.

This paper investigates the problems which inhibits the use of today's WDM networks. These are propagation delay, packet processing overhead, bit & frame synchronization, and tuning latency. So far, these problems, especially propagation delay, have been ignored in most performance analysis papers. They have always hindered network designers, but they are magnified by the order of magnitude increase in speed of optical communications systems as compared to previous media. This paper examines the impact of the propagation delay on the performance of WDM protocols with variations in the number of channels, packet length and system size, specifically in two reservation based protocols with control channels and two pre-allocation protocols without the control channels. Also the impact of three delay factors (packet processing overhead, bit & frame synchronization and tuning latency) are studied with different propagation delay parameters. In reservation protocols, each node has one agile transmitter and two receivers; one of them is fixed and the other one is agile. The fixed receiver continuously monitors the control channel, receives all control packets, and updates their own status tables in order to track the availability of the other nodes as a target and data channels to avoid the destination collisions and the data channel collisions, respectively. In pre-allocation protocols, each node has a tunable transmitter, a fixed or slow tunable receiver, and its own home channel to receive the packets. The performance of this protocol is evaluated through the discrete-event simulation in terms of the average packet delay and network throughput.