一种应用于Ad Hoc无线局域网的随机接入协议

本文分析了应用于Ad Hoc无线局域网的BSAC(Buffered Slotted ALOHA CDMA)随机接入协议,并且首次提出了采用Markov(马尔可夫)链方法的分析模型.此模型应用两个Markov链模型,一个表示节点中的M/M/1/k排队模型,另一个表示网络中活动节点数量.两个Markov链模型通过节点空闲概率相互联系.在此模型基础上,本文详细分析了扩频增益、队列长度与最大允许重传次数等输入参数对网络吞吐量、平均延迟与丢包概率等性能尺度的影响,推导得出了BSAC协议的吞吐量极限.另外,本文还引入多数据包接收技术-延迟捕获技术,该项技术可以有效降低数据包冲突概率,相对于没有采用延迟捕获技术的BSAC协议,平均提高吞吐量29.1%,最大吞吐量提高20.8%,使网络性能接近于理论极限.     

A Cluster-Based Random Key Revocation Protocol for Wireless Sensor Networks

In recent years,several random key pre-distribution schemes have been proposed to bootstrap keys for encryption,but the problem of key and node revocation has received relatively little attention.In this paper,based on a random key pre-distribution scheme using clustering,we present a novel random key revoca-tion protocol,which is suitable for large scale networks greatly and removes compromised information efficiently.The revocation protocol can guarantee network security by using less memory consumption and communication load,and combined by centralized and distributed revoca-tion,having virtues of timeliness and veracity for revoca-tion at the same time.     

多包接收无线传感器网络的跨层优化策略研究

多包接收能有效提高无线传感器网络的网络吞吐量,但由于该思想在物理层实现的复杂性,决定了在上层难以建立充分发挥多包接收性能的最优传输方案。本文根据基于信噪比的物理层数据发送模型,通过研究可同时传输数据的节点集合,建立了链路层的分时传输模型。为了使该模型可在多项式时间内求解,提出了最大可行集合的概念,减少了求解的时间和空间复杂度,最终提出基于多包接收的无线传感器网络跨层优化策略。仿真显示,采用该策略后数据传输速率比传统方案提高了1倍。     

On Supporting Weighted Service Differentiation in Multi-Packet Reception Wireless Networks: A Distributed Tree-Based Approach

The conventional medium access control (MAC) protocols assume that only one packet (frame) can be received at a given time. However, with the advent of spread spectrum, antenna arrays, and sophisticated signal processing techniques, it is now possible to achieve multiple-packet reception (MPR) in wireless networks. With MPR, the network capacity can be remarkably increased, but so far, how to achieve fair bandwidth allocation for the stations with different quality of service (QoS) requirements in such networks is still a problem. To solve this problem, we propose a distributed method that can support multiple priority classes in the MPR-capable wireless networks with weighted fair share. In particular, this method assigns each class a frame transmission probability to reflect its relative weight among the different data traffic flows. A closed-form expression of system throughput is derived for each class in the environment, and it is numerically evaluated with different simulation scenarios. The results show that the method can achieve the weighted fairness under different numbers of priority classes and different numbers of stations in the networks.     

一种无线传感器网络的访问控制协议

传感器网络中的节点存在由于能量耗尽或恶意攻击而丧失作用的威胁,因此需要新节点的加入.利用Bloom Filter技术,提出了一种访问控制协议.本协议不仅便于实现新节点、旧节点的双向认证和密钥协商,而且便于实现节点的加入与撤消.通过性能分析和安全性分析说明了该协议的有效性.     

Hybrid Unified-Slot Access Protocol for Wireless Body Area Networks

Wireless body area network (WBAN) solution is an emerging new technology to resolve the small area connection issues around human body, especially for the medical applications. Based on the integrated superframe structure of IEEE 802.15.4, a modified medium access control (MAC) protocol, named Hybrid Unified-slot Access (HUA) protocol for WBANs is proposed with focus on the simplicity, dependability and power efficiency. Considering the support to multiple physical layer (PHY) technologies including ultra-wide band (UWB), the slotted ALOHA is employed in the contention access period (CAP) to request the slot allocation. Mini-slot method is designed to enhance the efficiency of the contention. Moreover, sufficient slot allocation in the contention-free period (CFP) makes HUA adaptive to the different traffic including the medical and non-medical applications. Simulation results show that the protocol effectively decreases the probability of collision in a CAP and extends the CFP slots to support more traffic with quality of service (QoS) guarantee.     

Distributed Sequential Access MAC Protocol for Single-Hop Wireless Networks

Medium access control overhead is the primary reason for low throughput in wireless networks. Performing blind contentions, contentions without any information of other contenders, and exchanging control message are time-consuming control operations. In this study, we propose a new MAC protocol called distributed sequential access MAC (DSA-MAC) which provides the transmission order without any explicit control operations. It may induce very light control overhead; therefore, compared to existing wireless MAC protocols, DSA-MAC can remarkably enhance network throughput.     

SYN-MAC: A Distributed Medium Access Control Protocol for Synchronized Wireless Networks

In this paper, we propose a novel medium access control (MAC) protocol, called SYN-MAC (for SYNchronized MAC), based on a binary countdown approach tailored for wireless networks. SYN-MAC has several attractive features such as simplicity, robustness, high efficiency, fairness, and quality of service capability. We evaluate SYN-MAC in terms of collision probability, system throughput, and packet delay, via both analysis and simulation. Our results show that, with properly chosen parameters, SYN-MAC can achieve a very low collision probability, packet delay tolerance, and extremely high channel efficiency (of > 90%) under a wide range of traffic load. As a result, SYN-MAC may serve as an alternative to IEEE 802.11 for the wireless stations in synchronized networks.This work is supported in part by National Science Foundation CAREER Award under Award Number CNS-0347686, by U.S. Department of Energy (DoE) under Award Number DE-FG02-04ER46136, and by Board of Regents, State of Louisiana under Contract Number No. DOE/LEQSF(2004-07)-ULL and LEQSF(2003-06)-RD-A-37. Part of this work was presented in the student poster session of IEEE International Conference on Network Protocols (ICNP) 2003, Atlanta, GA.Hongyi Wu is currently a tenure-track Assistant Professor in the Center for Advanced Computer Studies (CACS), University of Louisiana (UL) at Lafayette. He received his Ph.D. degree in computer science and M.S. degree in electrical engineering from State University of New York (SUNY) at Buffalo in 2002 and 2000, respectively. He received his B.S. degree in scientific instruments from Zhejiang University in 1996. His research interests include wireless mobile ad hoc networks, wireless sensor networks, next generation cellular systems, and integrated heterogeneous wireless systems. He has served as symposium chair, session chair, and technical committee member of several IEEE conferences, and a guest editor of ACM MONET special issue on Integration of Heterogeneous Wireless Technologies. He has published more than two dozens of technical papers in leading journals and conference proceedings.Anant P. Utgikar (S’03) graduated with B.Tech. in Electrical Engineering from IIT—Bombay in 2001. He received M.S. in Computer Engineering from Univ. of Louisiana at Lafayette (UL Lafayette) in 2003. Presently he is working towards Ph.D. at UL Lafayette. His research interests include computer networking, logic design, software, simulation, mobile computing and distributed systems. His contributions to network simulator NS2 were ranked in top-5 of over 240,000 pages by Google. He has won many programming competitions, IEEE, IEE technical paper presentation contests as undergraduate and High School Science-Math Olympiads in India. He was honored by Govt. of India for outstanding performance at national level in XII-th. He has authored a book chapter on Reservation Based MAC protocols. He has published in IEEE ICNP’03, IEEE SiPS’03 and IEEE CAMP’03. He was invited with travel grant to NS2 workshop’02 at USC/ISI, ICNP’03 and SiPS’03. He has been in organizing team of IEEE CAMP 2003 and CyberSecurity Workshop 2003. He has served as Reviewer for IEEE-VTC and ACM-MONET. He has held positions of Student Government Senator and Secretary, Graduate Students Organization at UL Lafayette. He has contributed as volunteer to National Science-Technology-Math ESTME Week organised by NSF and DoE, USA.Nian-Feng Tzeng received the Ph.D. degree in Computer Science from the University of Illinois at Urbana-Champaign. Since 1987, he has been with Center for Advanced Computer Studies, the University of Louisiana at Lafayette, where he is currently a professor. His current research interest is in the areas of computer communications and networks, high-performance computer systems, parallel and distributed processing and fault-tolerant computing. He was on the editorial board of the IEEE Transactions on Parallel and Distributed Systems, 1998–2001, and on the editorial board of the IEEE Transactions on Computers, 1994–1998. He served as a Distinguished Visitor of the IEEE Computer Society, 1994–1997, and was the Chair of Technical Committee on Distributed Processing, the IEEE Computer Society, from 1999 till 2002. He has been on the technical program committees of various conferences and will serve as the Technical Program Chair of the 10th International Conference on Parallel and Distributed Systems, July 2004.Dr. Tzeng is the recipient of the outstanding paper award of the 10th International Conference on Distributed Computing Systems, May 1990. He received the University Foundation Distinguished Professor Award in 1997.     

An Efficient Ticket Based Authentication Protocol with Unlinkability for Wireless Access Networks

The concept of anonymous channel ticket is one of the effective measures to protect user privacy and to reduce the overhead of re-authentication for wireless environments. Most recently, Hsieh et al. proposed an anonymous authentication protocol based on elliptic curve cryptography to enhance the efficiency and security strength. However, we identify that Hsieh et al.’s scheme has four weaknesses. (1) The scheme fails to provide identity anonymity. (2) The ticket authentication phase of the scheme suffers from desynchronization attack. (3) The scheme is vulnerable to the privileged insider attack. (4) Users cannot change passwords when required. We further propose an improved authentication scheme, which not only preserves the merits of the scheme of Hsieh et al., but also enjoys several other advantages. Our improved scheme is effective in protection from the weaknesses identified and achieves user anonymity and unlinkability. We compare the functionality and performance of our improved scheme with other related schemes, which indicates that our scheme is more secure and yet efficient for wireless access networks.     

MMSMAC: A Multi-mode Medium Access Control Protocol for Wireless Sensor Networks with Latency and Energy-Awareness

In this paper, we propose a new medium access control (MAC) protocol for wireless sensor networks called MMSMAC (multi-mode sensor MAC protocol), which operates according to the application requirements and traffic load, in three main modes: synchronous, asynchronous, and hybrid. In the synchronous mode, MMSMAC organizes the sensor nodes under even and odd clusters. Each sensor node has its own active/sleep and send/receive periods according to its cluster identifier, which ensures better load balancing among nodes. In the asynchronous mode, sensor nodes communicate freely without the utilization of even and odd clusters. We propose a mechanism to wake up the destination node and minimize the overhead. In this mode, we propose another mechanism to circumvent the problem of hidden host. In the hybrid mode, the features of asynchronous and asynchronous modes are combined. Our simulation results and analysis show that each of the MMSMAC modes shows convincing performance gains and outperforms B-MAC and Hybrid CSMA/TDMA protocols.     

随机接入协议:研究综述

随机接入协议(RAP)是数据链路层关键技术之一,总结了主要的随机接入协议的研究现状,并分析了在CDMA网络中协议设计的关键问题。     

A Relay-Aided Media Access (RAMA) Protocol in Multirate Wireless Networks

The IEEE 802.11 standard inherently supports multiple data rates at the physical layer. Various rate adaptation mechanisms have been proposed to exploit this multirate capability by automatically adapting the transmission rate to best utilize the wireless spectrum. This study is primarily motivated by the observation that in a wireless network, a multihop high-rate path can potentially achieve better throughput and delay than using a single-hop low-rate path for transmission. Specifically, this paper introduces a relay-aided media access (RAMA) protocol by taking advantage of the existence of such multihop high-rate links. This is demonstrated by replacing one low-rate link with two high-rate links using a relay node. One of the key novelties in the proposed RAMA protocol is that the transmission from the immediate relay node to the destination node is free of contention. Results from analysis and simulations show that RAMA can significantly improve performances in terms of both throughput and delay.     

A New Digital Sense Multiple Access (DSMA) Protocol for High-Speed Wireless Networks

In this paper, we propose a new digital sensemultiple access with delayed transmission (DSMA/DT)protocol for reverse channel in high-speed wirelessnetworks. The new protocol is motivated by theobservation that the existing DSMA protocol does not yieldsatisfactory throughput for long round-trip propagationand processing delay, which occurs in outdoor high-speedenvironments or when the receiver hardware requires long signal processing time. The newDSMA/DT protocol is intended to reduce the performanceimpacts of the round-trip delay. Look-ahead busy/idleflag, seizure queueing, and reserved time slots are also devised for the new protocol. Whilerequiring at most two additional status bits on theforward channel and no additional hardware capability,these features further enhance the protocol performance and enable constant-bit-rate service withlittle added complexity in control. The channelthroughput of the DSMA/DT protocol and the optionalfeatures are analyzed. Closed-form expressions for thethroughput are obtained. For non-negligible round-tripdelay relative to packet transmission time, ournumerical results show that the new protocol improvesthe throughput by as much as 60% when compared to theexisting DSMA protocol. For superior performance andsimplicity, the DSMA/DT protocol will be appropriate foruse in high-speed wireless networks.     

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.     

Cryptanalysis and Improvement of an Anonymous Authentication Protocol for Wireless Access Networks

Authentication protocols with anonymity attracted wide attention since they could protect users’ privacy in wireless communications. Recently, Hsieh and Leu proposed an anonymous authentication protocol based on elliptic curve Diffie–Hellman problem for wireless access networks and claimed their protocol could provide anonymity. However, by proposing a concrete attack, we point out that their protocol cannot provide user anonymity. To overcome its weakness, we propose an improved protocol. We also provide an analysis of our proposed protocol to prove its superiority, even though its computational cost is slightly higher.     

HYPERFLOW: An Efficient Error Control Protocol for Wireless Broadband Access Networks

The subject of this paper is the design and evaluation of an efficient errorcontrol scheme for indoor cellular wireless broadband access networks, whichcan be considered as the wireless extension of a fixed quality-of-serviceoriented network (e.g., based on the ATM- (asynchronous transfer mode-)protocol). In order to improve the high and time-variant probability of transmissionerrors, a novel error control scheme is developed. The protocol calledHYPERFLOW (Hybrid Partial sElective Repeat ARQ with Flow control) representsan efficient combination of a selective repeat and a Go-Back-N ARQ- (automaticrepeat request-) scheme while keeping the implementation complexity withinlimits. Additionally, it features a flow control mechanism which prevents the channel from being blocked by a user with momentarily hightransmission error probability and thus considerably increases the totalsystem throughput. Furthermore, the HYPERFLOW-protocol is combined with anadaptive forward error control code. The resulting type II hybrid ARQ-schemeis based on the principle of incremental redundancy with redundant symbolsbeing sent only when they are required.A realistic model for the fluctuations of the transmission quality is used forthe performance evaluation of the HYPERFLOW-protocol. It turns out that the adaptive FEC-based error correction scheme can considerably improve thesystem performance.The mean transmission delay, for instance, can be reduced by a factor of upto 10 when the FEC-scheme is properly applied.     

Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks

The scheduling problem in multi-hop wireless networks has been extensively investigated. Although throughput optimal scheduling solutions have been developed in the literature, they are unsuitable for multi-hop wireless systems because they are usually centralized and have very high complexity. In this paper, we develop a random-access based scheduling scheme that utilizes local information. The important features of this scheme include constant-time complexity, distributed operations, and a provable performance guarantee. Analytical results show that it guarantees a larger fraction of the optimal throughput performance than the state-of-the-art. Through simulations with both single-hop and multi-hop traffics, we observe that the scheme provides high throughput, close to that of a well-known highly efficient centralized greedy solution called the greedy maximal scheduler.     

无线随机接入网络中的冲突解决技术研究

在无线随机接入网络中,数据包的冲突是不可避免的。传统上,解决冲突的方法是采用MAC协议控制数据包接入信道和冲突后的重传管理。最近,又出现了采用信号处理技术解决数据包冲突的新方法,这一技术充分体现了信号处理技术与网络技术的融合。文中分析和比较了各种基于协议和基于信号处理技术的冲突解决方法。最后给出了进一步的研究方向与结论。     

无线接入网综述

1 接入网与无线接入网 整个通信网分为两部分:核心网(市话端局以上部分)与接入网(市话端局或远端模块以下的网络部分)。 接入网是指从本地交换局到用户之间的信息传送网。通信业务的发展对接入网提出了数字化、宽带化、灵活、可靠、易于管理等要求,希望一条用户线可