Efficient contention-based MAC protocol using adaptive fuzzy controlled sliding backoff interval for wireless networks

Efficient medium access control (MAC) protocol should be able to provide high throughput performance and efficient share of the medium. In this paper, a new contention-based MAC protocol based on adaptive fuzzy controlled sliding backoff interval is proposed to maximize the channel throughput and improve the fairness of random access channels. In the proposed protocol, every node that experiences packet collisions increases its sliding backoff interval (SB) range by a forward sliding factor (FSF). In case of successful transmission the node decreases its SB range by a backward sliding factor (BSF). Forward and backward sliding factors are controlled by the channel offered traffic using a fuzzy controller. Furthermore, the operation of the proposed backoff algorithm does not depend on the knowledge of the number of active nodes. A computer simulation is developed using MATLAB to evaluate the performance of the proposed algorithm and compare it with other backoff schemes. Simulation results show that the proposed algorithm significantly outperforms other backoff schemes, such as binary exponential backoff (BEB) and the fast collision resolution (FCR) scheme. It provides a significant efficient fair sharing performance improvement which converges to the ideal fairness performance while providing high throughput performance.     

QoS provisioning wireless multimedia transmission over cognitive radio networks

The rapid growing of wireless multimedia applications increases the needs of spectrum resources, but today’s spectrum resources have become more and more scarce and large part of the assigned spectrum is in an inefficiency usage. Cognitive Radio (CR) technologies are proposed to solve current spectrum inefficiency problems and offer users a ubiquitous wireless accessing environment, relying on dynamic spectrum allocation. However, there are two unsolved problems in previous work: 1) based on the simplified Quality of Service (QoS) uniform assumption, specific requirements of different wireless multimedia applications cannot be satisfied; 2) aiming at single-objective optimization of spectrum utilization or handoff rate, the co-optimization of these two necessary objectives in CR networks has not been achieved. In this paper, we propose a Two-tier Cooperative Spectrum Allocation method (TCSA) to solve these two problems. TCSA consists of two functional parts: one is a Spectrum Adjacency Ranking algorithm implemented at the secondary users’ terminals to satisfy the QoS requirements for different wireless multimedia applications; and the other is a Max Hyper-weight Matching algorithm implemented at the cognitive engines of CR networks to co-optimize spectrum utilization and secondary users’ spectrum handoff rate. Simulation results show that, compared with the other Random matching algorithm and Cost minimized algorithm, TCSA can significantly improve the performance of CR networks in terms of secondary users’ throughput and spectrum handoff rate.     

Efficient authentication protocol for secure multimedia communications in IoT-enabled wireless sensor networks

Multimedia Tools and Applications - In current times, multimedia application includes integrated sensors, mobile networks and Internet-of-Things (IoT) services. In IoT services, if more devices are...     

Compressive sampling and adaptive dictionary learning for the packet loss recovery in audio multimedia streaming

Multimedia Tools and Applications - In this work, a scheme based on a compressive sampling technique and a fast dictionary learning approach for reconstructing audio content in multimedia streaming...     

CCMAC: Coordinated cooperative MAC for wireless LANs

In wireless LANs, throughput is one of, if not the most, important performance metric. This metric becomes more critical at the bottleneck area of the network, which is normally the area around the Access Point (AP). In this paper, we propose CCMAC, a coordinated cooperative MAC for wireless LANs. It is designed to improve the throughput performance in the region near the AP through cooperative communication, where data is forwarded through a two-hop high data rate link instead of a low data rate direct link. The most unique feature is that, it can coordinate nodes to perform concurrent transmissions which can further increase the throughput. To optimize the performance, the coordination problem is formulated as a Partially Observable Markov Decision Process and solved by a Reinforcement Learning algorithm. Through analysis and simulation, we show that CCMAC can significantly shorten the transmission time for stations with low data rate links to the AP and CCMAC has better throughput performance than other MAC protocols, such as CoopMAC and legacy IEEE 802.11.     

抗语音分组丢失的自适应传输调整算法的实现

为提高语音的传输质量,减少语音分组因网络状况恶化造成的丢失现象,在研究实时语音传输技术的基础上,提出了一种抗语音分组丢失的自适应传输调整算法.通过量化接收端反馈回发送端的语音分组丢失率等信息来判断网络状态,并通过改进AIMD(和式增加乘积减少)拥塞控制算法来自适应地随网络状态调整语音的传输速率,以此来达到抗语音分组丢失的效果.通过自行搭建拓扑结构的网络环境,对算法进行了测试分析,验证了该算法的有效性.     

Efficient adaptive collect using randomization

An adaptive algorithm, whose step complexity adjusts to the number of active processes, is attractive for distributed systems with a highly-variable number of processes. The cornerstone of many adaptive algorithms is an adaptive mechanism to collect up-to-date information from all participating processes. To date, all known collect algorithms either have non-linear step complexity or they are impractical because of unrealistic memory overhead. This paper presents new randomized collect algorithms with asymptotically optimal O(k) step complexity and linear memory overhead only. In addition we present a new deterministic collect algorithm that beats the best step complexity for previous polynomial-memory algorithms. Partially supported by NSF Grants CCR–0310970 and ANI–0326001. A preliminary version of this paper appeared in the Proceedings of the 18th Annual Conference on Distributed Computing (DISC) 2004 [10].     

Method and system for adaptive network security using intelligent packet analysis

<美国专利>6,499,107Gleichauf, et a1.December 24,2002<发明人>Gleichauf;Robert E.(San Antonio,TX);TealDaniel M.(San Antonio,TX);Wiley;Kevin L(Elgin,TX)<代理人>Cisco Technology,Inc.(San Jose,CA)<公开号>223071<公开日>December 29,1998<美国分类>713/20]<国际分类>G06F 01l/30<检索号>713/200,201 709/223,224,229,225,100,102,103,104,226 705/8,9<摘要>A method and system for adaptlye net-work security using intelligent packet analysisare provided.The method comprises monitoringnetwork data traff…     

无线网络中多媒体传输拥塞控制机制的研究

TFRC是一种专门针对多媒体流在Internet中传输的拥塞控制方案。在有线网络如Internet中,TFRC效率很高,然而在无线网络中．TFRC的发送速率会因传输造成的比特错误而急剧下降？因此,如何在无线网络中改善TFRC的拥塞控制机制便成了当前需要解决的一个前沿课题：介绍了针对这一问题的两种解决方案——ZBS和TFRC Veno,并且通过仿真分析,指出ZBS和TFRC Veno在无线网络中都能获得比TFRC更高的吞吐率,而在有线网络中TFRC Veno则表现出比ZBS更好的TCP友好特性。因此．TFRC Veno是针对该问题的更为有效的解决方案：     

Statistical learning theory for location fingerprinting in wireless LANs

In this paper, techniques and algorithms developed in the framework of Statistical Learning Theory are applied to the problem of determining the location of a wireless device by measuring the signal strength values from a set of access points (location fingerprinting). Statistical Learning Theory provides a rich theoretical basis for the development of models starting from a set of examples. Signal strength measurement is part of the normal operating mode of wireless equipment, in particular Wi–Fi, so that no special-purpose hardware is required.The proposed techniques, based on the Support Vector Machine paradigm, have been implemented and compared, on the same data set, with other approaches considered in scientific literature. Tests performed in a real-world environment show that results are comparable, with the advantage of a low algorithmic complexity in the normal operating phase. Moreover, the algorithm is particularly suitable for classification, where it outperforms the other techniques.     

Ant-based routing for wireless multimedia sensor networks using multiple QoS metrics

In wireless sensor networks, most routing protocols consider energy savings as the main objective and assume data traffic with unconstrained delivery requirements to be a given. However, the introduction of video and imaging sensors unveils additional challenges. The transmission of video and imaging data requires both energy efficiency and QoS assurance (end-to-end delay and packet loss requirements), in order to ensure the efficient use of sensor resources as well as the integrity of the information collected. This paper presents a QoS routing model for Wireless Multimedia Sensor Networks (WMSN). Moreover, based on the traditional ant-based algorithm, an ant-based multi-QoS routing metric (AntSensNet) is proposed. The AntSensNet protocol builds a hierarchical structure on the network before choosing suitable paths to meet various QoS requirements from different kinds of traffic, thus maximizing network utilization, while improving its performance. In addition, AntSensNet is able to use a efficient multi-path video packet scheduling in order to get minimum video distortion transmission. Finally, extensive simulations are conducted to assess the effectiveness of this novel solution and a detailed discussion regarding the effects of different system parameters is provided. Compared to typical routing algorithms in sensor networks and the traditional ant-based algorithm, this new algorithm has better convergence and provides significantly better QoS for multiple types of services in wireless multimedia sensor networks.     

Dynamic duty cycle and adaptive contention window based QoS-MAC protocol for wireless multimedia sensor networks

Rapid penetration of small, customized wireless devices and enormous growth of wireless communication technologies has already set the stage for large-scale deployment of wireless sensor networks. While the need to minimize the energy consumption has driven significant researches in wireless sensor networks, offering some precise quality of service (QoS) for multimedia transmission over sensor networks has not received significant attention. However, the emerging new applications like video surveillance, telemedicine and traffic monitoring needs transmission of wireless multimedia over sensor networks. Naturally, offering some better QoS for wireless multimedia over sensor networks raises significant challenges. The network needs to cope up with battery-constraints, while providing improved QoS (end-to-end delay and bandwidth requirement). This calls for a suitable sensory MAC protocol capable of achieving application-specific QoS. In this paper, we have proposed a new QoS-based sensory MAC protocol, which not only adapts to application-oriented QoS, but also attempts to conserve energy without violating QoS-constraints. Performance modeling, analysis and simulation results demonstrate that the proposed protocol is capable of providing lower delay and better throughput, at the cost of reasonable energy consumption, in comparison to other existing sensory MAC protocols.     

Admission control scheme based on priority access for wireless LANs

In order to support the quality of service (QoS) requirements at the medium access control (MAC) layer, the enhanced distributed channel access (EDCA) has been developed in IEEE 802.11e standard. However, it cannot guarantee the stringent real-time constraints of multimedia applications such as voice and video without an efficient method of controlling network loads. In this paper, we propose a measurement-based admission control scheme, which is made up of two parts: priority access and admission control. First, in order to measure the channel status per traffic type, we propose a priority access mechanism in which each priority traffic is distinguished by a busy tone, and separately performs its own packet transmission operation. Then, admission control mechanism protects existing flows from new ones, and maintains the QoS of the admitted flows based on the measured channel status information. Performance of the proposed scheme is evaluated by simulation. Our results show that the proposed scheme is very effective in guaranteeing the QoS of multimedia applications as well as in avoiding the performance starvation of low priority traffics.     

Efficient solution for frequency band decomposition problem using wavelet packet in HRV

Heart rate variability (HRV) is a very significant noninvasive tool for assessment of sympathovagal balance (SB) that reflects variation of parasympathetic and sympathetic activities in autonomic nervous system (ANS). Low frequency/high frequency (LF/HF) power ratio provides information about these activities. Because of nonstationary characteristic of HRV, analyses based on wavelet transform were typically preferred in previous studies. There is an important problem that required frequency ranges for LF and HF cannot be obtained using discrete wavelet transform (DWT). Different sampling frequencies do not remove this problem. In this study, a solution based on wavelet packet (WP) is presented for removing this problem. In addition, effect of WP on SB values is investigated. Method was applied to spontaneous ventricular tachyarrhythmia database and variation of energy values and LF/HF energy ratios were compared for DWT and WP. WP provides absolutely excellent approximation to required frequency bands and exposes different and impressive SB results.     

A two-hop clustered image transmission scheme for maximizing network lifetime in wireless multimedia sensor networks

In traditional wireless sensor networks, normal sensor nodes which measure scalar physical phenomena like temperature, pressure and humidity usually compress the data before sending them out to minimize the communication energy consumption. However, this strategy may not be suitable for image transmission in wireless multimedia sensor networks. In the traditional clustering structure, when the camera-equipped node or the cluster head compresses the images, an energy hole will appear. This is a key factor that affects the lifetime of the network. To avoid the energy hole problem, a two-hop clustered image transmission scheme is proposed in this paper. In the proposed scheme, many redirectors are used to compress and forward the images for the purpose of reducing energy consumption of the camera-equipped node and the cluster head. With adaptive adjustment of the transmission radius in the camera cluster and tasks allocation based on the residual energy of the normal sensor nodes by the camera-equipped node, the energy consumption of the nodes in the network is balanced. The experimental results show that the proposed scheme can prolong the network lifetime dramatically in the case of the sensor nodes deployed densely.     

Achieving optimal performance in IEEE 802.11 wireless LANs with the combination of link adaptation and adaptive backoff

IEEE 802.11 is one of the most popular wireless LAN standards [Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications, IEEE Standard 802.11, August 1999]. In the paper, we propose a simple analytical model, which helps one obtain deep insight into the mechanism of achieving optimal performance by using IEEE 802.11 DCF (Distributed Coordination Function) protocol. The first contribution of this paper is the analysis of the optimal operation point where maximum goodput can be achieved. Through the analysis, we answer some fundamental questions about the existence and the uniqueness of the optimal operation point; about the maximum system goodput can be achieved; about the existence of a simple rule to check out if the system operates under the optimal state or not; and how do the data transmission rates, which is dependent on the selected physical transmission mode, and packet transmission errors, caused by channel fading and (or) interference, affect the final system performance. Another contribution is the proposal of a simple distributed adaptive scheme “LABS” (i.e., Link adaptation and Adaptive Backoff Scheme), which makes the system operate under the optimal operation point and, at the same time, achieves some pre-defined target service differentiation ratio between different traffic flows. In the LABS, two adaptive schemes are combined: one is the so called “Link Adaptation” scheme, which dynamically selects an optimal modulation mode at a given time so as to improve the achieved system goodput; the other one is the so called “Adaptive Backoff” scheme, which adaptively adjusts the minimum contention window size of each sending node to guarantee that the system operates under (or near) the optimal operation point. Results obtained in the paper are relevant to both theoretical research and implementation of real systems.     

Efficient wireless packet scheduling in a non-cooperative environment: Game theoretic analysis and algorithms

In many practical scenarios, wireless devices are autonomous and thus, may exhibit non-cooperative behaviors due to self-interests. For instance, a wireless cellular device may be programmed to report bogus channel information to gain resource allocation advantages. Such non-cooperative behaviors are highly probable as the device’s software can be modified by the user. In this paper, we first analyze the impact of these rationally selfish behaviors on the performance of packet scheduling algorithms in time-slotted wireless networks. Using a mixed strategy game model, we show that the traditional maximum rate packet scheduling algorithm can cause non-cooperative devices to converge to highly inefficient Nash equilibria, in which the wireless channel resources are significantly wasted. By using a repeated game to enforce cooperation, we further propose a novel game theoretic algorithm that can lead to an efficient equilibrium.     

基于FPGA的自适应MIMO-OFDM无线基带传输系统的研究

针对自适应MIMO-OFDM无线基带传输系统,提出了一种并行复用的基4-FFT/IFFT算法的FPGA实现方法,并对其中的自适应数字调制、STBC编码和FFT/IFFT模块进行了FPGA实现研究和仿真。仿真结果表明,该方法实现了模块的功能,且性能良好,具有一定的应用价值。     

一种用于多媒体教学的无线鼠标

介绍了一种无线鼠标设计电路,它不仅保持了有线鼠标全部功能和结构,而且在不影响有线鼠标工作的前提下,具有远距离遥控鼠标左键和滚轮的功能。用编译码模块PT2262/PT2272和射频发射/接收电路互相配合,可以在较远距离灵活操纵鼠标,符合操作习惯,而且制作时无须对原有鼠标的外观及内部电路做任何改动。可广泛用于多媒体教学、会务演示等远距离使用计算机的场合。     

Efficient packet sampling for accurate traffic measurements

Packet sampling is needed to measure network traffic scalably at high speeds. While many sampled-based measurement techniques have been developed in the recent past, most approaches select packets uniformly, without regard to their size. We discuss that this behavior can negatively impact the performance of tools, and present a sampling scheme that, taking into account packet sizes, overcomes several weaknesses of classic sampling methods. While the idea behind of our approach is conceptually not new, the way we propose to implement it yields a cost-effective solution that is suitable at very high speeds.To see the advantages of the approach, we study the problem of estimating traffic volumes. Our analysis and experimental evaluation with real traffic traces show that sampling considering packet sizes can improve the quality of measurements and make their accuracy less dependant on the properties of the traffic, at a small additional overhead compared to traditional methods.