2,885 research outputs found
Resource efficient redundancy using quorum-based cycle routing in optical networks
In this paper we propose a cycle redundancy technique that provides optical
networks almost fault-tolerant point-to-point and multipoint-to-multipoint
communications. The technique more importantly is shown to approximately halve
the necessary light-trail resources in the network while maintaining the
fault-tolerance and dependability expected from cycle-based routing. For
efficiency and distributed control, it is common in distributed systems and
algorithms to group nodes into intersecting sets referred to as quorum sets.
Optimal communication quorum sets forming optical cycles based on light-trails
have been shown to flexibly and efficiently route both point-to-point and
multipoint-to-multipoint traffic requests. Commonly cycle routing techniques
will use pairs of cycles to achieve both routing and fault-tolerance, which
uses substantial resources and creates the potential for underutilization.
Instead, we intentionally utilize redundancy within the quorum cycles for
fault-tolerance such that almost every point-to-point communication occurs in
more than one cycle. The result is a set of cycles with 96.60% - 99.37% fault
coverage, while using 42.9% - 47.18% fewer resources.Comment: 17th International Conference on Transparent Optical Networks
(ICTON), 5-9 July 2015. arXiv admin note: substantial text overlap with
arXiv:1608.05172, arXiv:1608.0516
Security and Privacy Issues in Wireless Mesh Networks: A Survey
This book chapter identifies various security threats in wireless mesh
network (WMN). Keeping in mind the critical requirement of security and user
privacy in WMNs, this chapter provides a comprehensive overview of various
possible attacks on different layers of the communication protocol stack for
WMNs and their corresponding defense mechanisms. First, it identifies the
security vulnerabilities in the physical, link, network, transport, application
layers. Furthermore, various possible attacks on the key management protocols,
user authentication and access control protocols, and user privacy preservation
protocols are presented. After enumerating various possible attacks, the
chapter provides a detailed discussion on various existing security mechanisms
and protocols to defend against and wherever possible prevent the possible
attacks. Comparative analyses are also presented on the security schemes with
regards to the cryptographic schemes used, key management strategies deployed,
use of any trusted third party, computation and communication overhead involved
etc. The chapter then presents a brief discussion on various trust management
approaches for WMNs since trust and reputation-based schemes are increasingly
becoming popular for enforcing security in wireless networks. A number of open
problems in security and privacy issues for WMNs are subsequently discussed
before the chapter is finally concluded.Comment: 62 pages, 12 figures, 6 tables. This chapter is an extension of the
author's previous submission in arXiv submission: arXiv:1102.1226. There are
some text overlaps with the previous submissio
Wireless Network Information Flow: A Deterministic Approach
In a wireless network with a single source and a single destination and an
arbitrary number of relay nodes, what is the maximum rate of information flow
achievable? We make progress on this long standing problem through a two-step
approach. First we propose a deterministic channel model which captures the key
wireless properties of signal strength, broadcast and superposition. We obtain
an exact characterization of the capacity of a network with nodes connected by
such deterministic channels. This result is a natural generalization of the
celebrated max-flow min-cut theorem for wired networks. Second, we use the
insights obtained from the deterministic analysis to design a new
quantize-map-and-forward scheme for Gaussian networks. In this scheme, each
relay quantizes the received signal at the noise level and maps it to a random
Gaussian codeword for forwarding, and the final destination decodes the
source's message based on the received signal. We show that, in contrast to
existing schemes, this scheme can achieve the cut-set upper bound to within a
gap which is independent of the channel parameters. In the case of the relay
channel with a single relay as well as the two-relay Gaussian diamond network,
the gap is 1 bit/s/Hz. Moreover, the scheme is universal in the sense that the
relays need no knowledge of the values of the channel parameters to
(approximately) achieve the rate supportable by the network. We also present
extensions of the results to multicast networks, half-duplex networks and
ergodic networks.Comment: To appear in IEEE transactions on Information Theory, Vol 57, No 4,
April 201
Computation in Multicast Networks: Function Alignment and Converse Theorems
The classical problem in network coding theory considers communication over
multicast networks. Multiple transmitters send independent messages to multiple
receivers which decode the same set of messages. In this work, computation over
multicast networks is considered: each receiver decodes an identical function
of the original messages. For a countably infinite class of two-transmitter
two-receiver single-hop linear deterministic networks, the computing capacity
is characterized for a linear function (modulo-2 sum) of Bernoulli sources.
Inspired by the geometric concept of interference alignment in networks, a new
achievable coding scheme called function alignment is introduced. A new
converse theorem is established that is tighter than cut-set based and
genie-aided bounds. Computation (vs. communication) over multicast networks
requires additional analysis to account for multiple receivers sharing a
network's computational resources. We also develop a network decomposition
theorem which identifies elementary parallel subnetworks that can constitute an
original network without loss of optimality. The decomposition theorem provides
a conceptually-simpler algebraic proof of achievability that generalizes to
-transmitter -receiver networks.Comment: to appear in the IEEE Transactions on Information Theor
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
Maintaining consistency in distributed systems
In systems designed as assemblies of independently developed components, concurrent access to data or data structures normally arises within individual programs, and is controlled using mutual exclusion constructs, such as semaphores and monitors. Where data is persistent and/or sets of operation are related to one another, transactions or linearizability may be more appropriate. Systems that incorporate cooperative styles of distributed execution often replicate or distribute data within groups of components. In these cases, group oriented consistency properties must be maintained, and tools based on the virtual synchrony execution model greatly simplify the task confronting an application developer. All three styles of distributed computing are likely to be seen in future systems - often, within the same application. This leads us to propose an integrated approach that permits applications that use virtual synchrony with concurrent objects that respect a linearizability constraint, and vice versa. Transactional subsystems are treated as a special case of linearizability
Constructive Multiuser Interference in Symbol Level Precoding for the MISO Downlink Channel
This paper investigates the problem of interference among the simultaneous
multiuser transmissions in the downlink of multiple antennas systems. Using
symbol level precoding, a new approach towards the multiuser interference is
discussed along this paper. The concept of exploiting the interference between
the spatial multiuser transmissions by jointly utilizing the data information
(DI) and channel state information (CSI), in order to design symbol-level
precoders, is proposed. In this direction, the interference among the data
streams is transformed under certain conditions to useful signal that can
improve the signal to interference noise ratio (SINR) of the downlink
transmissions. We propose a maximum ratio transmission (MRT) based algorithm
that jointly exploits DI and CSI to glean the benefits from constructive
multiuser interference. Subsequently, a relation between the constructive
interference downlink transmission and physical layer multicasting is
established. In this context, novel constructive interference precoding
techniques that tackle the transmit power minimization (min power) with
individual SINR constraints at each user's receivers is proposed. Furthermore,
fairness through maximizing the weighted minimum SINR (max min SINR) of the
users is addressed by finding the link between the min power and max min SINR
problems. Moreover, heuristic precoding techniques are proposed to tackle the
weighted sum rate problem. Finally, extensive numerical results show that the
proposed schemes outperform other state of the art techniques.Comment: Submitted to IEEE Transactions on Signal Processin
- …