The estimated cost of a search tree on binary words

The problem of constructing a binary search tree for a set of binary words has wide applications in computer science, biology, mineralogy, etc. Shannon considered a similar statement in his optimal coding theorem. It is NP-complete to construct a tree of minimum cost; therefore, the problem arises of finding simple algorithms for constructing nearly optimal trees. We show that there is a simple algorithm for constructing search trees sufficiently close to the optimal tree on average. By means of this algorithm we prove that for the optimal tree the average number of bits to be checked is near to its natural lower bound, i.e., the binary logarithm of the number of given words: their difference is less than 1.04     

End‐to‐end delay and packet drop rate performance for a wireless sensor network with a cluster‐tree topology

In this paper, we study the delay performance in a wireless sensor network (WSN) with a cluster‐tree topology. The end‐to‐end delay in such a network can be strongly dependent on the relative location between the sensors and the sink and the resource allocations of the cluster heads (CHs). For real‐time traffic, packets transmitted with excessive delay are dropped. Given the timeline allocations of each CH for local and inter‐cluster traffic transmissions, an analytical model is developed to find the distribution of the end‐to‐end transmission delay for packets originated from different clusters. Based on this result, the packet drop rate is derived. A heuristic scheme is then proposed to jointly find the timeline allocations of all the CHs in a WSN in order to achieve the minimum and balanced packet drop rate for traffic originated from different levels of the cluster tree. Simulation results are shown to verify the analysis and to demonstrate the effectiveness of the proposed CH timeline allocation scheme. Copyright © 2012 John Wiley & Sons, Ltd.     

QoS‐aware packet forwarding in MIMO sensor networks: a cross‐layer approach

Multiple‐input multiple‐output (MIMO) enabled wireless sensor networks (WSNs) are becoming increasingly important since significant performance enhancement can be realized. In this paper, we propose a packet forward strategy for MIMO sensor networks by jointly considering channel coding, rate adaptation, and power allocation. Each sensor node has multiple antennas and uses orthogonal space time block codes (OSTBC) to exploit both spatial and temporal diversities. The objective is to determine the optimal routing path that achieves the minimum symbol error rate (SER) subject to the source‐to‐destination (S‐D) energy consumption constraint. This SER‐based quality‐of‐service (QoS) aware packet forwarding problem is formulated into the framework of dynamic programming (DP). We then propose a low‐complexity and near‐optimal approach to considerably reduce the computation complexity, which includes state space partition and state aggregation techniques. Simulations indicate that the proposed protocol significantly outperforms traditional algorithms. Further still, the performance gain increases with tighter S‐D energy constraint. Copyright © 2009 John Wiley & Sons, Ltd.     

Bio‐inspired packet dropping for ad‐hoc social networks

Ad‐hoc social networks (ASNETs) explore social properties of nodes in communications. The usage of various social applications in a resource‐scarce environment and the dynamic nature of the network create unnecessary congestion that might degrade the quality of service dramatically. Traditional approaches use drop‐tail or random‐early discard techniques to drop data packets from the intermediate node queue. Nonetheless, because of the unavailability of the social properties, these techniques are not suitable for ASNETs. In this paper, we propose a Bio‐inspired packet dropping (BPD) algorithm for ASNETS. BPD imitates the matching procedure of receptors and epitopes in immune systems to detect congestions. The drop probability settings depend on the selection of data packets, which is based on node popularity level. BPD selects the most prioritized node through social properties, which is inspired by the B‐cell stimulation in immune systems. To fairly prioritize data packets, two social properties are used: (1) similarity and (2) closeness centrality between nodes. Extensive simulations are carried out to evaluate and compare BPD to other existing schemes in terms of mean goodput, mean loss rate, throughput, delay, attained bandwidth, and overhead ratio. The results show that the proposed scheme outperforms these existing schemes. Copyright © 2014 John Wiley & Sons, Ltd.     

A bit-level systolic architecture for implementing a VQ tree search

A bit-level systolic array system for performing a binary tree Vector Quantization codebook search is described. This consists of a linear chain of regular VLSI building blocks and exhibits data rates suitable for a wide range of real-time applications. A technique is described which reduces the computation required at each node in the binary tree to that of a single inner product operation. This method applies to all the common distortion measures (including the Euclidean distance, the Weighted Euclidean distance and the Itakura-Saito distortion measure) and significantly reduces the hardware required to implement the tree search system.     

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.     

Small‐block interleaving for low‐delay cross‐packet forward error correction over burst‐loss channels

By adding the redundant packets into source packet block, cross‐packet forward error correction (FEC) scheme performs error correction across packets and can recover both congestion packet loss and wireless bit errors accordingly. Because cross‐packet FEC typically trades the additional latency to combat burst losses in the wireless channel, this paper presents a FEC enhancement scheme using the small‐block interleaving technique to enhance cross‐packet FEC with the decreased delay and improved good‐put. Specifically, adopting short block size is effective in reducing FEC processing delay, whereas the corresponding effect of lower burst‐error correction capacity can be compensated by deliberately controlling the interleaving degree. The main features include (i) the proposed scheme that operates in the post‐processing manner to be compatible with the existing FEC control schemes and (ii) to maximize the data good‐put in lossy networks; an analytical FEC model is built on the interleaved Gilbert‐Elliott channel to determine the optimal FEC parameters. The simulation results show that the small‐block interleaved FEC scheme significantly improves the video streaming quality in lossy channels for delay‐sensitive video. Copyright © 2013 John Wiley & Sons, Ltd.     

Low‐temperature formation of local Al contacts to a‐Si:H‐passivated Si wafers

We have passivated boron‐doped, low‐resistivity crystalline silicon wafers on both sides by a layer of intrinsic, amorphous silicon (a‐Si:H). Local aluminum contacts were subsequently evaporated through a shadow mask. Annealing at 210°C in air dissolved the a‐Si:H underneath the Al layer and reduces the contact resistivity from above 1 Ω cm² to 14·9 m Ω cm². The average surface recombination velocity is 124 cm/s for the annealed samples with 6% metallization fraction. In contrast to the metallized regions, no structural change is observed in the non‐metallized regions of the annealed a‐Si:H film, which has a recombination velocity of 48 cm/s before and after annealing. Copyright © 2004 John Wiley & Sons, Ltd.     

Bounded‐delay and loss‐free guarantees for real‐time video in integrated services packet networks

In this paper, we analyse upper bounds on the end‐to‐end delay and the required buffer size at the leaky bucket and packet switches within the network in the context of the deterministic bandwidth allocation method in integrated services packet networks. Based on that formulation, we then propose a CAC method suitable to ISPN to guarantee the bounded end‐to‐end delay and loss‐free packet transmissions. As an example application, the GOP–CBR MPEG‐2 is considered. In that case, we also show tighter bounds by slightly modifying the coding method of GOP–CBR MPEG‐2. Using the actual traced data of GOP–CBR MPEG‐2, we discuss the applicabilities of our analytical results and proposed CAC by comparing with simulation. Numerical results show that the loose upper bounds can also achieve more utilization even in the context of deterministic bandwidth allocation compared with the peak bandwidth allocation strategy. Copyright © 2000 John Wiley & Sons, Ltd.     

SEAL2: An SDN‐enabled all‐Layer2 packet forwarding network architecture for multitenant datacenter networks

This paper presents the design and development of a new network virtualization scheme to support multitenant datacenter networking (MT‐DCN) based on software‐defined networking (SDN) technologies. Effective multitenancy supports are essential and challenging for datacenter networking designs. In this study, we propose a new network virtualization architecture framework for efficient packet forwarding in MT‐DCN. Traditionally, an internet host uses IP addresses for both host identification and location information, which causes mobile IP problems whenever the host is moved from one IP subnet to another. Unfortunately, virtual machine (VM) mobility is inevitable for cloud computing in datacenters for reasons such as server consolidation and network traffic flow optimization. To solve the problems, we decouple VM identification and location information with two independent values neither by IP addresses. We redefine the semantics of Ethernet MAC address to embed tenant ID information to the MAC address field without violating its original functionality. We also replace traditional Layer2/Layer3 two‐stage routing schemes (MAC/IP) with an all‐Layer2 packet forwarding mechanism that combines MAC addresses (for VM identification and forwarding in local server groups under an edge switch gateway) and multiprotocol label switching (MPLS) labels (for packet transportation between edge switch gateways across the core label switching network connecting all the edge gateways). To accommodate conventional IP packet architecture in a multitenant environment, SDN (OpenFlow) technology is used to handle all this complex network traffics. We verified the design concepts by a simple system prototype in which all the major system components were implemented. Based on the prototype system, we evaluated packet forwarding efficiency under the proposed network architecture and compared it with conventional IP subnet routing approaches. We also evaluated the incurred packet processing overhead caused by each of the packet routing components.     

A unified framework for tree search decoding: rediscovering the sequential decoder

We consider receiver design for coded transmission over linear Gaussian channels. We restrict ourselves to the class of lattice codes and formulate the joint detection and decoding problem as a closest lattice point search (CLPS). Here, a tree search framework for solving the CLPS is adopted. In our framework, the CLPS algorithm is decomposed into the preprocessing and tree search stages. The role of the preprocessing stage is to expose the tree structure in a form matched to the search stage. We argue that the forward and feedback (matrix) filters of the minimum mean-square error decision feedback equalizer (MMSE-DFE) are instrumental for solving the joint detection and decoding problem in a single search stage. It is further shown that MMSE-DFE filtering allows for solving underdetermined linear systems and using lattice reduction methods to diminish complexity, at the expense of a marginal performance loss. For the search stage, we present a generic method, based on the branch and bound (BB) algorithm, and show that it encompasses all existing sphere decoders as special cases. The proposed generic algorithm further allows for an interesting classification of tree search decoders, sheds more light on the structural properties of all known sphere decoders, and inspires the design of more efficient decoders. In particular, an efficient decoding algorithm that resembles the well-known Fano sequential decoder is identified. The excellent performance-complexity tradeoff achieved by the proposed MMSE-DFE Fano decoder is established via simulation results and analytical arguments in several multiple-input multiple-output (MIMO) and intersymbol interference (ISI) scenarios.     

An enhanced XOR‐based scheme for wireless packet retransmission problem

Solving wireless packet retransmission problem (WPRTP) using network coding (NC) is increasingly attracting research efforts. However, existing NC‐based schemes for WPRTP are with high computational complexity resulting from computation on larger Galois field (GF(2^q)), or the solutions on GF(2) found by the schemes are less efficient. In this paper, combining the basic ideas in two existing schemes, denoted as ColorNC and CliqueNC, respectively, we present a new scheme named as ColorCliqueNC. The advantages of ColorCliqueNC include the following: (i) it is suitable for all kinds of WPRTP instances; (ii) it works on GF(2); thus, it is computationally efficient than the schemes working on larger Galois fields; and (iii) the solutions found by ColorCliqueNC usually have fewer packet retransmissions than those by ColorNC and CliqueNC despite that they all work on GF(2). Theoretical analysis indicates that ColorCliqueNC is superior to ColorNC and CliqueNC. Simulation results show that ColorCliqueNC generally outperforms ColorNC and CliqueNC. Compared with ColorNC, ColorCliqueNC can save up to 10% packet retransmissions. Copyright © 2013 John Wiley & Sons, Ltd.     

Fast ping‐pong arbitration for input–output queued packet switches

Input–output queued switches have been widely considered as the most feasible solution for large capacity packet switches and IP routers. In this paper, we propose a ping‐pong arbitration scheme (PPA) for output contention resolution in input–output queued switches. The challenge is to develop a high speed and cost‐effective arbitration scheme in order to maximize the switch throughput and delay performance for supporting multimedia services with various quality‐of‐service (QoS) requirements. The basic idea is to divide the inputs into groups and apply arbitration recursively. Our recursive arbiter is hierarchically structured, consisting of multiple small‐size arbiters at each layer. The arbitration time of an n‐input switch is proportional to log₄?n/2? when we group every two inputs or every two input groups at each layer. We present a 256×256 terabit crossbar multicast packet switch using the PPA. The design shows that our scheme can reduce the arbitration time of the 256×256 switch to 11 gates delay, demonstrating the arbitration is no longer the bottleneck limiting the switch capacity. The priority handling in arbitration is also addressed. Copyright © 2001 John Wiley & Sons, Ltd.     

Software‐defined networking approach for enhanced evolved packet core network

The evolved packet core (EPC) network is the mobile network standardized by the 3rd Generation Partnership Project and represents the recent evolution of mobile networks providing high‐speed data rates and on‐demand connectivity services. Software‐defined networking (SDN) is recently gaining momentum in network research as a new generation networking technique. An SDN‐based EPC is expected to introduce gains to the EPC control plane architecture in terms of simplified, and perhaps even software‐based, vendor independent infrastructure nodes. In this paper, we propose a novel SDN‐based EPC architecture along with the protocol‐level detailed implementation and provide a mechanism for identifying information fields exchanged between SDN‐EPC entities that maintains correct functionality with minimal impact on the conventional design. Furthermore, we present the first comprehensive network performance evaluation for the SDN‐based EPC versus the conventional EPC and provide a comparative analysis of 2 networks performances identifying potential bottlenecks and performance issues. The evaluation focuses on 2 network control operations, namely, the S1‐handover and registration operations, taking into account several factors, and assessing performance metrics such as end‐to‐end delay (E2ED) for completion of the respective control operation, and EPC nodes utilization figures.     

Link optimization for energy‐constrained wireless networks with packet retransmissions

With the objective to minimize the energy consumption for packet based communications in energy‐constrained wireless networks, this paper establishes a theoretical model for the joint optimization of the parameters at the physical layer and data link layer. Multilevel quadrature amplitude modulation (MQAM) and automatic repeat request (ARQ) techniques are considered in the system model. The optimization problem is formulated into a three dimensional nonlinear integer programming (NIP) problem with the modulation order, packet size, and retransmission limit as variables. For the retransmission limit, a simple search method is applied to degenerate the three dimensional problem into a two dimensional NIP problem, for which two optimization algorithms are proposed. One is the successive quadratic programming (SQP) algorithm, combining with the continuous relaxation based branch‐and‐bound method, which can obtain the global optimal solution since the continuous relaxation problem is proved to be hidden convex. The other is a low‐complexity sub‐optimal iterative algorithm, combining with the nearest‐neighboring method, which can be implemented with a polynomial complexity. Numerical examples are given to illustrate the optimization solution, which suggests that the joint optimization of the physical/data link layer parameters contributes noticeably to the energy saving in energy‐constrained wireless networks. Copyright © 2010 John Wiley & Sons, Ltd.     

A capture‐assisted random access scheme for multi‐beam LEO satellite packet data networks

A CDMA‐based satellite switch is proposed for use in multi‐beam satellites carrying random‐access packet‐switched data. Applications include the emerging new low‐earth‐orbit (LEO) satellite networks which support global wireless networking. Capture phenomenon is used to advantage in increasing the random access throughput, and the on‐board switch is at once simple and specially designed to handle full loads with minimal complexity. Copyright © 2004 John Wiley & Sons, Ltd.     

Distributed pattern matching: a key to flexible and efficient P2P search

Flexibility and efficiency are the prime requirements for any P2P search mechanism. Existing P2P systems do not provide satisfactory solution for achieving these two conflicting goals. Unstructured search protocols (as adopted in Gnutella and FastTrack) provide search flexibility but exhibit poor performance characteristics. Structured search techniques (mostly Distributed Hash Table (DHT)-based), on the other hand, can efficiently route queries but support exact-match semantic only. In this paper we have defined Distributed Pattern Matching (DPM) problem and have presented a novel P2P architecture, named Distributed Pattern Matching System (DPMS), as a solution. Possible application areas of DPM include P2P search, service discovery and P2P databases. In DPMS, advertised patterns are replicated and aggregated by the peers, organized in a lattice-like hierarchy. Replication Improves availability and resilience to peer failure, and aggregation reduces storage overhead. An advertised pattern can be discovered using any subset of its 1-bits. Search complexity in DPMS is logarithmic to the total number of peers in the system. Advertisement overhead and guarantee on search completeness is comparable to that of DHT-based systems. We have presented mathematical analysis and simulation results to demonstrate the effectiveness of DPMS     

CRAN,H‐CRAN,and F‐RAN for 5G systems: Key capabilities and recent advances

The world of telecommunication is witnessing a swift metamorphosis towards fifth generation cellular networks. Particularly, the rapid shift from a user centric to a device centric communication has created a tremendous impact on service complexity and network requirements. The future networks present requisite needs in ubiquitous throughput, low latency, and high reliability. They are also envisioned to provide energy efficiency, spectrum reuse, network scalability, and robustness as well as improved quality of user experience, which proves to be of ultimate importance. Accordingly, government, academic, and industrial institutions are working together to fulfill these challenging goals. Their research efforts have been extensively reported in various topics and directions, such as heterogeneous small cell networks, millimeter wave communication, massive multiple input multiple output, network function virtualization, software‐defined network, and device‐to‐device communication. More interestingly, a revolutionary network architecture based on cloud computing and centralized processing is adopted as one of the best candidates for fifth generation. It is denoted Cloud Radio Access Network (CRAN) and (H‐CRAN) in heterogeneous networks. An upgraded version, namely, Fog RAN (F‐RAN), with caching and fog computing capabilities is also presented. Environmental friendly, it ensures flexibility and scalability with reduced expenditures. This paper presents the aforementioned key technological functionalities and surveys the benefits and challenges of CRAN, H‐CRAN, and F‐RAN.     

Beyond cost models: communications satellite revenue models. Integrating cost considerations into a value‐centric mindset

While satellite cost models are pervasive throughout the aerospace industry, revenue models or utility models of space systems are quasi‐inexistent. This situation perhaps conveys the false impression that satellites are either cost sinks or expensive artefacts whose value or utility profile over their design lifetime is difficult to quantify. In this paper, we propose that satellites, like any other complex engineering systems, should be perceived as value delivery artefacts, and the value delivered, or the flow of service that the spacecraft delivers over its design lifetime, deserves as much effort to quantify as the system's cost. To this effect, we build, in the case of a GEO communications satellite, revenue models based on (1) statistical analyses of spacecraft loading dynamics and (2) historical trends of market prices for the communications services provided. Results and discussions presented here should prove useful to satellite operators and industry observers. Copyright © 2006 John Wiley & Sons, Ltd.