Deterministic access protocols for packet radio networks

In this paper, multiple-phase deterministic protocols for packet radio networks are introduced and analysed. Two modes of information transfer are considered, namely (a) broadcasting and (b) point-to-point transmission. We explore systematic ways of designing multiple-phase protocols and apply them on Manhattan networks. The proposed protocols are studied primarily from the point of view of throughput efficiency. Delay analysis is also presented.     

An Adaptive-Transmission Protocol for Frequency-Hop Wireless Communication Networks

An energy-efficient adaptive-transmission protocol for mobile frequency-hop spread-spectrum wireless communication networks is described and evaluated. The purpose of the protocol is to permit each of the mobile terminals to adjust its transmitter power and code rate to match the characteristics of the time-varying communication links in the network. The proposed adaptive-transmission protocol bases its choice of transmission parameters on a very simple form of side information that is easy to obtain in a FH communication receiver. The performance of the adaptive-transmission protocol is evaluated for networks in which each communication link may have a time-varying propagation loss and intermittent partial-band interference. Our results demonstrate that the adaptive-transmission protocol can improve the utility of a link and reduce energy consumption by adjusting the transmission parameters in response to changes in the side information.     

Energy-efficient Routing of Multimedia Traffic in Frequency-Hop Packet Radio Networks

Conservation of energy is important in a packet radio network, but reliance on energy-efficient routes for all types of traffic leads to large delays and low success probabilities in many situations. We describe and evaluate protocols that select routes according to the service priorities of the traffic. Energy conservation is emphasized for delay-tolerant traffic but sacrificed for delay-intolerant traffic, which gives good performance for both types of traffic.This paper was presented in part at the IEEE Wireless Communications and Networking Conference, Atlanta, March 2004.     

Staggered multicast protocol with collision-free acknowledgement in multihop spread spectrum packet radio networks

The staggered multicast protocol for multihop spread spectrum packet radio networks is suitable for unicasting and broadcasting as well as multicasting. The common-header/transmitter-based spreading code is used for data packet transmission and the receiver-based code is used for acknowledgement packet transmission. By staggering packet transmission the protocol can significantly reduce broadcasting delay. A special addressing method and packet format are also designed to achieve collision-free acknowledgement and multicast capability. Simulation results show that the protocol provides better throughput-delay performance than the common-header/transmitter-based slotted ALOHA protocol.     

Hermitian codes for frequency-hop spread-spectrum packet radio networks

Hermitian codes are an attractive alternative to Reed-Solomon codes for use in frequency-hop spread-spectrum packet radio networks. For a given alphabet size, a Hermitian code has a much longer block length than a Reed-Solomon code. This and other considerations suggest that Hermitian codes may be superior for certain applications. Analytical results are developed for the evaluation of the packet error probability for frequency-hop transmissions using Hermitian coding. We find there are several situations for which Hermitian codes provide much lower packet error probabilities than can be obtained with Reed-Solomon codes. In general, as the code rate decreases or the symbol alphabet size increases, the relative performance of Hermitian codes improves with respect to Reed-Solomon codes. Performance evaluations are presented for an additive white Gaussian noise channel and for certain partial-band interference channels, and the packet error probability is evaluated for both errors-only and errors-and-erasures decoding.     

Effect of bit-to-bit dependence on packet error rate using asynchronous DS-CDMA for mobile packet radio networks

The probability of packet success for asynchronous direct sequence code division multiple access (DS-CDMA) over the multipath fading channel is investigated under different fading conditions and for different cases. We studied the bit-to-bit dependence caused by the multipath fading and by the multiple access interference (MAI) originating from the chip and phase offsets between the desired and interfering signals. We investigated the effect of using the Gaussian versus the improved Gaussian process on the computation of probability of packet success as well as the effect of the bit-to-bit dependence within a packet. The improved Gaussian approximation provides more accurate values for the probability of bit error for any number of simultaneous users, while it also allows us to incorporate the effects of bit-to-bit dependence into the calculations of the probability of packet success.This paper was presented in part at the 17th Biennial Symposium on Communiations, Kingston, June 1994. This work was supported by a strategic grant (STR-0100720) from the Natural Sciences and Engineering Research Council (NSERC) of Canada.     

Centralized spectrum leasing via cooperative SU assignment in cognitive radio networks

As the increasing demand of the radio spectrum, the researchers pay more attention to the technology of cognitive radio networks to improve the use of the scarce spectrum resources. Recently, cooperative communications combining with cognitive radio have been proposed in many literatures to improve the channel capacity. The primary users with poor transmission environment transmit their packets with the assistance of the secondary users (SUs) by offering them spectrum resources. This paper first raises issues in existing works, such as non‐optimal selection, selection collision, and transmission interruption. Aiming at these issues, we design a centralized system model and a cooperative relaying protocol for multiple primary user pairs to dynamically lease spectrum in exchange for the transmission assistance of SUs. Then we define 2 problems of the cooperative SU assignment to maximize total rate and maximize number of assigned SUs. We prove they are NP‐hard and propose a local search algorithm for the objective of maximize total rate and a ‐approximation algorithm for another objective. Our simulation results show that our system and algorithms can effectively improve the performance of the wireless networks.     

On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks

In many applications, wireless ad-hoc networks are formed by devices belonging to independent users. Therefore, a challenging problem is how to provide incentives to stimulate cooperation. In this paper, we study ad-hoc games—the routing and packet forwarding games in wireless ad-hoc networks. Unlike previous work which focuses either on routing or on forwarding, this paper investigates both routing and forwarding. We first uncover an impossibility result—there does not exist a protocol such that following the protocol to always forward others' traffic is a dominant action. Then we define a novel solution concept called cooperation-optimal protocols. We present Corsac, a cooperation-optimal protocol which consists of a routing protocol and a forwarding protocol. The routing protocol of Corsac integrates VCG with a novel cryptographic technique to address the challenge in wireless ad-hoc networks that a link’s cost (i.e., its type) is determined by two nodes together. Corsac also applies efficient cryptographic techniques to design a forwarding protocol to enforce the routing decision, such that fulfilling the routing decision is the optimal action of each node in the sense that it brings the maximum utility to the node. We evaluate our protocols using simulations. Our evaluations demonstrate that our protocols provide incentives for nodes to forward packets. Additionally, we discuss the challenging issues in designing incentive-compatible protocols in ad hoc networks. Part of this paper appeared in a conference version [49]. Sheng Zhong was supported in part by NSF grants ANI-0207399 and CNS-0524030. Yang Richard Yang was supported in part by NSF grants ANI-0207399, ANI-0238038, and CNS-0435201. This work was partly done while Sheng Zhong was at Yale University; Yanbin Liu was at University of Texas at Austin. Sheng Zhong is an assistant professor in the State University of New York at Buffalo. He received his PhD (2004) from Yale University and his ME (1999), BS (1996) from Nanjing University, China, all in computer science. His research interests include economic incentives and privacy protection, particularly incentive and privacy problems in mobile computing and data mining. Li Erran Li received his B.E. in Automatic Control from Beijing Polytechnic University in 1993, his M.E. in Pattern Recognition from the Institute of Automation, Chinese Academy of Sciences, in 1996, and his Ph.D. in Computer Science from Cornell University in 2001 where Joseph Y. Halpern was his advisor. He is presently a member of the Networking Research Center in Bell Labs. His research interests are in networking with a focus on wireless networking and mobile computing. He has served as a program committee member for several conferences including ACM MobiCom, ACM MobiHoc, IEEE INFOCOM and IEEE ICNP. He is a guest editor for JSAC special issue on Non-Cooperative Behavior in Networking. He has published over 30 papers. Yanbin Liu received her B.E. degree in Computer Science and Technology from Tsinghua University (1993), Beijing, China, in 1993, and her M.S. degree in Computer Science from the University of Texas at Austin (1998), where is a Ph.D. candidate. Since 2006, he has been with IBM TJ Watson Research Center, Hawthorne, NY. Her research interests are in real-time systems, grid computing, mobile computing, and computer networks. Yang Richard Yang received his B.E. degree in Computer Science and Technology from Tsinghua University, Beijing, China, in 1993, and his M.S. and Ph.D. degrees in Computer Science from the University of Texas at Austin in 1998 and 2001, respectively. Since 2001, he has been with the Department of Computer Science, Yale University, New Haven, CT, where currently he is an Associate Professor. His current research interests are in computer networks, mobile computing, and sensor networks. He leads the Laboratory of Networked Systems (LANS) at Yale University.     

Non‐cooperative game‐based packet ferry forwarding for sparse mobile wireless networks

In sparse mobile wireless networks, normally, the mobile nodes are carried by people, and the moving activity of nodes always happens in a specific area, which corresponds to some specific community. Between the isolated communities, there is no stable communication link. Therefore, it is difficult to ensure the effective packet transmission among communities, which leads to the higher packet delivery delay and lower successful delivery ratio. Recently, an additional ferry node was introduced to forward packets between the isolated communities. However, most of the existing algorithms are working on how to control the trajectory of only one ferry work in the network. In this paper, we consider multiple ferries working in the network scenario and put our main focus on the optimal packet selection strategy, under the condition of mutual influence between the ferries and the buffer limitation. We introduce a non‐cooperative Bayesian game to achieve the optimal packet selection strategy. By maximizing the individual income of a ferry, we optimize the network performance on packet delivery delay and successful delivery ratio. Simulation results show that our proposed packet selection strategy improves the network performance on packet delivery delay and successful delivery ratio. Copyright © 2013 John Wiley & Sons, Ltd.     

自组网路由协议综述

自组网路由协议用于监控网络拓扑结构变化,交换路由信息,定位目的节点位置,产生、维护和选择路由,并根据选择的路由转发数据。本文综述了自组网路由协议研究方面的一些最新工作,描述了设计自组网路由协议所面临的问题,并着重对该研究开展以来所提出的各种主要协议进行了对比、分析和分类阐述,为进一步的研究提出了新的课题。     

Reduced‐frame TDMA protocols for wireless sensor networks

Time‐division multiple‐access (TDMA) is a common medium access control paradigm in wireless sensor networks. However, in its traditional form, the TDMA‐based protocols suffer from low channel utilization and high message delay because of a long frame length needed to provide collision‐free transmissions, which is particularly damaging in dense wireless sensor networks. In this paper, we investigate the performance and the energy efficiency of a class of TDMA‐based protocols, called reduced‐frame TDMA, where every TDMA slot is augmented with a short time period dedicated for carrier sense multiple access‐based contention resolution mechanism. Because of their ability to dynamically resolve collisions caused by conflicting slot assignments, the reduced‐frame TDMA protocols can be configured with any frame length, independently of node density. In addition, we present a distributed heuristic slot assignment algorithm that minimizes interslot interference in the presence of limited number of slots per frame. The simulation results indicate that the reduced‐frame TDMA protocols significantly reduce the message delay and increase the maximum throughput without incurring significant penalty in energy efficiency compared with the traditional TDMA scheme. Copyright © 2012 John Wiley & Sons, Ltd.     

Supporting multicasting in mobile ad‐hoc wireless networks: issues,challenges, and current protocols

The basic philosophy of personal communication services is to provide user‐to‐user, location independent communication services. The emerging group communication wireless applications, such as multipoint data dissemination and multiparty conferencing tools have made the design and development of efficient multicast techniques in mobile ad‐hoc networking environments a necessity and not just a desire. Multicast protocols in mobile ad‐hoc networks have been an area of active research for the past couple of years. This paper summarizes the activities and recent advances in this work‐in‐progress area by identifying the main issues and challenges that multicast protocols are facing in mobile ad‐hoc networking environments, and by surveying several existing multicasting protocols. This article presents a classification of the current multicast protocols, discusses the functionality of the individual existing protocols, and provides a qualitative comparison of their characteristics according to several distinct features and performance parameters. Furthermore, since many of the additional issues and constraints associated with the mobile ad‐hoc networks are due, to a large extent, to the attribute of user mobility, we also present an overview of research and development efforts in the area of group mobility modeling in mobile ad‐hoc networks. Copyright © 2001 John Wiley & Sons, Ltd.     

Feasibility of neural networks in modelling radio propagation for field strength prediction

A typical back-propagation neural network (BPN) model is developed for modelling radio propagation for field strength prediction based on data measurements of propagation loss (in decibels) with terrain information taken in an urban area (Athens region) in the 900 MHz band. The feasibility of the BPN model is checked against the performance of a conventional semiempirical reference model. The performance of both models is quantified by statistical methods. The evaluation is done by comparing their prediction error statistics of average absolute, standard deviation and root mean square and by comparing their percentage accuracy and correlation of predicted values relative to true data measurements. © 1998 John Wiley & Sons, Ltd.     

Lightweight distributed geographical: a lightweight distributed protocol for virtual clustering in geographical forwarding cognitive radio sensor networks

Recent literature characterizes future wireless sensor networks (WSN) with dynamic spectrum capabilities. When cognitive radio is introduced as a main component of a network, a network management protocol is needed to ensure network connectivity and stability especially in highly dynamic environments. Implementing such protocols in WSN opens more challenges because of the resource constraints in sensor networks. We propose a distributed lightweight solution that fulfills this need for WSN. With this protocol, a node in a multichannel environment is quickly able to establish a control channel with neighboring nodes. Lightweight distributed geographical either increases or reduces the coverage area of the control channel based on perceived interference and adequately takes care of intersecting nodes with minimal overhead. By identifying local minima nodes, it also has the potentiality of reducing route failure by 70% further reducing the time and energy overhead incurred by switching to angle routing or maximum power transmission schemes usually used to solve the local minima issue. The work shows best operating values in terms of duty cycle and signal to noise ratio threshold frequencies and the lightweight nature of lightweight distributed geographical in terms of energy and communication overhead, which suits network management protocols for cognitive radio sensor networks. Copyright © 2013 John Wiley & Sons, Ltd.     

A distributed link scheduling algorithm for CDMA packet radio networks

A distributed algorithm for the conflict-free channel allocation in CDMA (code division multiple access) networks is presented. Dynamic adjustment to topological changes is also considered. Though the schedules produced by our algorithm are not optimal with respect to link schedule length, the algorithm is simple and practical. The link schedule length minimization problem is NP-complete. Here the length of a link schedule is the number of time slots it uses. The algorithm guarantees a bound 2 — 1 time slots on the TDMA cycle length, where is the maximum degree of a station (i.e., maximum number of stations that a station can reach by radio links) in the network. The message complexity of a station isO().     

无线传感器网络MAC层协议的对比研究

无线传感器网络是二十一世纪新兴的网络技术，它的出现使网络的发展进入一个新的阶段。针对无线传感器网络MAC层协议的研究一直是人们普遍关注的问题。总结了近年来的研究成果并针对TDMA，IEEE802．15．4，S—MAC，T—MAC几种典型的MAC层协议进行了对比分析，根据其各自的优点提出将来工作的方向和建议。     

A general approach to the evaluation and characterization of packet radio networks performance

In this work a general exact methodology for capture effect and performance evaluation of packet radio networks is presented. Both narrow-band and spread-spectrum systems are investigated and compared. Several network performance quality indexes are considered: throughput, outage probability, packet error probability, average delay time. Two particular capture effect models are investigated. It can be seen that one of the two models can be considered as a good approximation of the other if a appropriate parameter definition is made. By using this methodology various operating conditions given by fading (Rice, Rayleigh, Nakagami), shadowing, different traffic models, different modulation, and coding schemes are investigated. Comparison is performed by means of spectral efficiency parity.     

Practical packet combining for use with cooperative and non-cooperative ARQ schemes in resource-constrained wireless sensor networks

An improved implementation of a post-detection packet combining scheme, which is especially applicable to low power, resource-constrained sensor networks, is developed and practically implemented on popular off-the-shelf wireless motes. The algorithm can be used as part of protocols such as cooperative communications and hybrid-ARQ schemes which have been shown to be of major benefit for wireless communications. Using the packet combining implementation developed in this paper more than an 85% reduction in energy costs are possible over previous, similar approaches. Both simulated and practical experiments are developed in which packet combining is shown to offer up to approximately 2.5 dB reduction in the required Signal-to-Noise Ratio (SNR) for a desired Packet Error Rate (PER). This is a welcome result as complex schemes, such as maximal-ratio combining, are not implementable on many of the resource constrained devices under consideration.     

Building a signaling protocol architecture for future mobile networks

Third-generation mobile systems are emerging. These systems will support a unified user access to a variety of services, including the existing mobile and fixed network (PSTN, N-ISDN) services, the enhanced multimedia and multiparty services envisaged for broadband networks, and personal communication services as well. The role of signaling is predominant in building a flexible, efficient, and evolving system. The aim of this paper is to provide a framework for developing a signaling protocol architecture for future mobile networks. The study especially focuses on the universal mobile telecommunication system (UMTS). Within this framework various design and operational requirements imposed on UMTS can be satisfied. A method to deal with the functional complexity of UMTS is provided. Mobile networks are viewed as integral parts of the broadband infrastructure and are built upon the IN principles.