Capacity of wireless erasure networks

In this paper, a special class of wireless networks, called wireless erasure networks, is considered. In these networks, each node is connected to a set of nodes by possibly correlated erasure channels. The network model incorporates the broadcast nature of the wireless environment by requiring each node to send the same signal on all outgoing channels. However, we assume there is no interference in reception. Such models are therefore appropriate for wireless networks where all information transmission is packetized and where some mechanism for interference avoidance is already built in. This paper looks at multicast problems over these networks. The capacity under the assumption that erasure locations on all the links of the network are provided to the destinations is obtained. It turns out that the capacity region has a nice max-flow min-cut interpretation. The definition of cut-capacity in these networks incorporates the broadcast property of the wireless medium. It is further shown that linear coding at nodes in the network suffices to achieve the capacity region. Finally, the performance of different coding schemes in these networks when no side information is available to the destinations is analyzed.     

The node distribution of the random waypoint mobility model for wireless ad hoc networks

The random waypoint model is a commonly used mobility model in the simulation of ad hoc networks. It is known that the spatial distribution of network nodes moving according to this model is, in general, nonuniform. However, a closed-form expression of this distribution and an in-depth investigation is still missing. This fact impairs the accuracy of the current simulation methodology of ad hoc networks and makes it impossible to relate simulation-based performance results to corresponding analytical results. To overcome these problems, we present a detailed analytical study of the spatial node distribution generated by random waypoint mobility. More specifically, we consider a generalization of the model in which the pause time of the mobile nodes is chosen arbitrarily in each waypoint and a fraction of nodes may remain static for the entire simulation time. We show that the structure of the resulting distribution is the weighted sum of three independent components: the static, pause, and mobility component. This division enables us to understand how the model's parameters influence the distribution. We derive an exact equation of the asymptotically stationary distribution for movement on a line segment and an accurate approximation for a square area. The good quality of this approximation is validated through simulations using various settings of the mobility parameters. In summary, this article gives a fundamental understanding of the behavior of the random waypoint model.     

The random waypoint mobility model with uniform node spatial distribution

In this paper, we tackle the problem of designing a random mobility model generating a target node spatial distribution. More specifically, we solve a long standing open problem by presenting two versions of the well-known random waypoint (RWP) mobility model in bounded regions generating a uniform steady-state node spatial distribution. In the first version, named temporal-RWP, we exploit the temporal dimension of node mobility and achieve uniformity by continuously changing the speed of a mobile node as a function of its location and of the density function of trajectories in the movement region R. In the second version, named spatial-RWP, we instead exploit the spatial dimension and achieve uniformity by selecting waypoints according to a suitably defined mix of probability density functions. Both proposed models can be easily incorporated in wireless network simulators, and are thus of practical use. The RWP models presented in this paper allow for the first time completely removing the well-known border effect causing possible inaccuracies in mobile network simulation, thus completing the picture of a “perfect” simulation methodology drawn in existing literature.     

Capacity and delay of hybrid wireless broadband access networks

An optical network is too costly to act as a broadband access network. On the other hand, a pure wireless ad hoc network with n nodes and total bandwidth of W bits per second cannot provide satisfactory broadband services since the pernode throughput diminishes as the number of users goes large. In this paper, we propose a hybrid wireless network, which is an integrated wireless and optical network, as the broadband access network. Specifically, we assume a hybrid wireless network consisting of n randomly distributed normal nodes, and m regularly placed base stations connected via an optical network. A source node transmits to its destination only with the help of normal nodes, i.e., in the ad hoc mode, if the destination can be reached within L (L /spl geq/ 1) hops from the source. Otherwise, the transmission will be carried out in the infrastructure mode, i.e., with the help of base stations. Two transmission modes share the same bandwidth of W bits/sec. We first study the throughput capacity of such a hybrid wireless network, and observe that the throughput capacity greatly depends on the maximum hop count L and the number of base stations m. We show that the throughput capacity of a hybrid wireless network can scale linearly with n only if m = Ω(n), and when we assign all the bandwidth to the infrastructure mode traffics. We then investigate the delay in hybrid wireless networks. We find that the average packet delay can be maintained as low as Θ(1) even when the per-node throughput capacity is Θ(W).     

Cryoelectric hybrid system for very large random access memory

The recent introduction of structured cells characterized by no cell-to-cell interaction, adequate sense signal, and array tolerance under repetitive worse-case disturb evaluation and coincident current operation, has made possible new systems approaches. A coincident current "hybrid" (word-bit) system utilizing room temperature decoders and structured loop cell arrays was designed to satisfy the criteria pertinent to a very large random access cryoelectric memory. Besides offering the advantage of an early realization of a cryoelectric memory, compared to previous systems advanced, several other benefits are realized: 1) low electronics cost, especially in large systems sizes, 2) low heat load, and 3) potential plane yield improvement through redundancy techniques. Although a disadvantage is the large number of interconnections, analysis shows that the overall memory cost can be minimized through proper substrate design. The technology required by the hybrid system embodies present art, and very large random access cryoelectric memories employing hybrid organization and loop cell arrays appear to be feasible.     

Capacity analysis of reservation-based random access for broadband wireless access networks

In this paper we propose a novel model for the capacity analysis on the reservation-based random multiple access system, which can be applied to the medium access control protocol of the emerging WiMAX technology. In such a wireless broadband access system, in order to support QoS, the channel time is divided into consecutive frames, where each frame consists of some consequent mini-slots for the transmission of requests, used for the bandwidth reservation, and consequent slots for the actual data packet transmission. Three main outcomes are obtained: first, the upper and lower bounds of the capacity are derived for the considered system. Second, we found through the mathematical analysis that the transmission rate of reservationbased multiple access protocol is maximized, when the ratio between the number of mini-slots and that of the slots per frame is equal to the reciprocal of the random multiple access algorithm?s transmission rate. Third, in the case of WiMAX networks with a large number of subscribers, our analysis takes into account both the capacity and the mean packet delay criteria and suggests to keep such a ratio constant and independent of application-level data traffic arrival rate.     

Capacity of a synchronous BFSK frequency-hopped multiple accesssystem with RTT erasure decision

The capacity of binary frequency shift keying (BFSK) frequency-hopped multiple access (FHMA) systems with side information is derived. The use of erasure decision with ratio-threshold test (RTT) for generating side information in fading and non-fading channels is investigated. The authors demonstrate the benefits of using erasure decision, achievable maximum capacity, optimum threshold setting and the optimal number of users in order to maximise the capacity     

Self-healing group-wise key distribution schemes with time-limited node revocation for wireless sensor networks

In this article two novel group-wise key distribution schemes with time-limited node revocation are introduced for secure group communications in wireless sensor networks. The proposed key distribution schemes are based on two different hash chain structures, dual directional hash chain and hash binary tree. Their salient security properties include self-healing rekeying message distribution, which features a periodic one-way rekeying function with efficient tolerance for lost rekeying messages; and time-limited dynamic node attachment and detachment. Security evaluation shows that the proposed key distribution schemes generally satisfy the requirement of group communications in WSNs with lightweight communication and computation overhead, and are robust under poor communication channel quality.     

Optical networks with hybrid routing

All-optical switching or wavelength routing has the benefit of optical bypass that can eliminate expensive high-speed electronic processing at intermediate nodes and reduce significantly the cost of high-bandwidth transport. But all-optical switching has the limitations of coarse granularity, lack of multiplexing gain, and scarcity of wavelength resources, which do not mesh well with Internet traffic that has many small and diverse flows and emphasizes the importance of resource sharing. In particular, wavelength routed light paths have difficulty to seamlessly converge with multiprotocol label switching label-switched paths that have arbitrary bandwidth granularity and relatively abundant labels. In this paper, we propose a hybrid wavelength and subwavelength routing scheme that can preserve the benefits of optical bypass for large traffic flows at the same time provide multiplexing gain for small traffic flows. We first study the hybrid routing scheme using static optimization that produces an optimal path set and a partition between wavelength and subwavelength routing. We then present a dynamic heuristic that tracks the static optimization closely. During the process, we proposed a traffic arrival process called incremental arrival with sporadic random termination to more accurately model practical optical network traffic generation process.     

On the /spl theta/-coverage and connectivity of large random networks

Wireless planar networks have been used to model wireless networks in a tradition that dates back to 1961 to the work of E. N. Gilbert. Indeed, the study of connected components in wireless networks was the motivation for his pioneering work that spawned the modern field of continuum percolation theory. Given that node locations in wireless networks are not known, random planar modeling can be used to provide preliminary assessments of important quantities such as range, number of neighbors, power consumption, and connectivity, and issues such as spatial reuse and capacity. In this paper, the problem of connectivity based on nearest neighbors is addressed. The exact threshold function for /spl theta/-coverage is found for wireless networks modeled as n points uniformly distributed in a unit square, with every node connecting to its /spl phi//sub n/ nearest neighbors. A network is called /spl theta/-covered if every node, except those near the boundary, can find one of its /spl phi//sub n/ nearest neighbors in any sector of angle /spl theta/. For all /spl theta//spl isin/(0,2/spl pi/), if /spl phi//sub n/=(1+/spl delta/)log/sub 2/spl pi//2/spl pi/-/spl theta//n, it is shown that the probability of /spl theta/-coverage goes to one as n goes to infinity, for any /spl delta/>0; on the other hand, if /spl phi//sub n/=(1-/spl delta/)log/sub 2/spl pi//2/spl pi/-/spl theta//n, the probability of /spl theta/-coverage goes to zero. This sharp characterization of /spl theta/-coverage is used to show, via further geometric arguments, that the network will be connected with probability approaching one if /spl phi//sub n/=(1+/spl delta/)log/sub 2/n. Connections between these results and the performance analysis of wireless networks, especially for routing and topology control algorithms, are discussed.     

Resources-aware trusted node selection for content distribution in mobile ad hoc networks

We propose a novel trust and probabilistic node selection mechanism for content distribution in mobile ad hoc networks. Due to the open nature of such networks which as a rule do not have strict node membership control, the selection of trustworthy nodes is an important challenge, especially as the resources (e.g., battery, bandwidth) of the mobile devices are limited and should not be wasted on erroneous or malicious content. Our proposal, in addition to considering the trustworthiness of nodes, ensures that the traffic load is equally shared amongst the population of nodes, thus further conserving mobile node resources. We analyse the proposed mechanisms and evaluate it against selected previously proposed trust schemes which, in the majority, favour the selection of the most trustworthy node. We demonstrate the benefits of our proposal which provides load balancing and prevents overuse of a single node’s resources, while still providing a good performance in regards to accurately choosing trustworthy nodes to provide the required content.     

Capacity of two-layer feedforward neural networks with binaryweights

The lower and upper bounds for the information capacity of two-layer feedforward neural networks with binary interconnections, integer thresholds for the hidden units, and zero threshold for the output unit is obtained through two steps. First, through a constructive approach based on statistical analysis, it is shown that a specifically constructed (N-2L-1) network with N input units, 2L hidden units, and one output unit is capable of implementing, with almost probability one, any dichotomy of O(W/ln W) random samples drawn from some continuous distributions, where W is the total number of weights of the network. This quantity is then used as a lower bound for the information capacity C of all (N-2L-1) networks with binary weights. Second, an upper bound is obtained and shown to be O(W) by a simple counting argument. Therefore, we have Ω(W/ln W)⩽C⩽O(W)     

Capacity of two-layered satellite networks

Wireless Networks - Satellite networks have great potential in providing global ubiquitous broadband communication. In this paper, we explore the capacity of both single-layered and two-layered...     

Capacity of interference-limited ad hoc networks with infrastructure support

In this letter, we consider the capacity of ad hoc networks with infrastructure support. Although Grossglauser-Tse mobile network model enables /spl Theta/(1) per-node throughput scaling, the mobility assumption may be too unrealistic to be accepted in some practical situations. One of the key observations we acquired is that the infrastructure support plays the same role played by the mobility in the Grossglauser-Tse model. We show that nodes can utilize the randomly located infrastructure support instead of mobility when nodes are nearly static. In this case, we show that the per-node throughput of /spl Theta/(1) is still achievable when the number of access points grows linearly with respect to the number of nodes.     

混合传播方式Ad hoc无线网络的容量研究

提出一种混合传播方式Ad hoc网络容量研究的方法,通过比较各传播方式在其相应规模下的容量确定主导传播方式并得出网络总容量。并以单播和多播混合传播为例,研究在基于多跳、MIMO和层次化合作情况下的主导传播方式和网络总容量。当该混合网络中单播的结节过半时,由多播传播方式确定网络的总容量。     

Capacity of ad hoc wireless networks with infrastructure support

We determine the asymptotic scaling for the per user throughput in a large hybrid ad hoc network, i.e., a network with both ad hoc nodes, which communicate with each other via shared wireless links of capacity W bits/s, and infrastructure nodes which in addition are interconnected with each other via high capacity links. Specifically, we consider a network model where ad hoc nodes are randomly spatially distributed and choose to communicate with a random destination. We identify three scaling regimes, depending on the growth of the number of infrastructure nodes, m relative to the number of ad hoc nodes n, and show the asymptotic scaling for the per user throughput as n becomes large. We show that when m /spl lsim/ /spl radic/n/logn the per user throughput is of order W//spl radic/n log n and could be realized by allowing only ad hoc communications, i.e., not deploying the infrastructure nodes at all. Whenever /spl radic/n/log n /spl lsim/ m /spl lsim/ n/log n, the order for the per user throughput is Wm/n and, thus, the total additional bandwidth provided by m infrastructure nodes is effectively shared among ad hoc nodes. Finally, whenever m /spl gsim/ n/log n, the order of the per user throughput is only W/log n, suggesting that further investments in infrastructure nodes will not lead to improvement in throughput. The results are shown through an upper bound which is independent of the routing strategy, and by constructing scenarios showing that the upper bound is asymptotically tight.     

Pulse networks with elliptic distribution of poles

A new class of ladder filters for pulse applications with poles located on elliptic contours is introduced. This class is generated by varying a real parameter which controls the pole positions on the same ellipse. Transient responses for order n = 3?6 are studied and shown to yield an improvement over Scanlan filters and other similar systems.     

On capacity of random wireless networks with physical-layer network coding

Throughput capacity of a random wireless network has been studied extensively in the literature. Most existing studies were based on the assumption that each transmission involves only one transmitter in order to avoid interference. However, recent studies on physical-layer network coding (PLNC) have shown that such an assumption can be relaxed to improve throughput performance of a wireless network. In PLNC, signals from different senders can be transmitted to the same receiver in the same channel simultaneously. In this paper, we investigate the impact of PLNC on throughput capacity of a random wireless network. Our study reveals that, although PLNC scheme does not change the scaling law, it can improve throughput capacity by a fixed factor. Specifically, for a one-dimensional network, we observe that PLNC can eliminate the effect of interference in some scenarios. A tighter capacity bound is derived for a two-dimensional network. In addition, we also show achievable lower bounds for random wireless networks with network coding and PLNC.     

Temporal signal processing with high-speed hybrid analog-digital neural networks

There are many problems which fall into the class of temporal signal processing. These problems have in common the need to relate the temporal properties of their inputs. Conventional solutions to these problems often have high hardware overhead, complex algorithmic solutions, or loss of information through the transformation of temporal properties of the input. To this end, a biologically motivated artificial and neural processing element has been developed. As in biological neurons, processing is time dependent and is implemented using both analog and digital techniques. These characteristics make the PE directly applicable a large class of temporal signal processing problems typically encountered in engineering and science. Multiple aspects of the PE behavior are adjustable, which produces a very wide range of behaviors from simple systems with only a few moderately connected processing elements. The processing element models are custom designed electric circuits based on basic CMOS components and therefore all developed systems can be directly implemented in any standard integrated CMOS technology. The integrated implementation, custom design, and a wide range of adaptable behaviors join to produce a very fast, low-hardware solution to complex spatiotemporal signal processing problems. Seven novel systems based on the hybrid PE are discussed as they relate to commonly encountered temporal signal processing problems.