Digital channel capacity calculation using augmented ordered binary decision diagram
MetadataShow full item record
Digital channel capacity of a network is an important factor in network design. Recent solutions use the Markov chain to model and compute the capacity of only a specific wireless network with multiple relays and multiple hops (MR-MH), and thus cannot be used for networks in general. Further, the solutions assume that all communication link failure probabilities are equal and that state transitional probabilities are known. This paper proposes a general solution for computing the capacity. Our solution first converts the problem of computing the channel capacity of such networks into a network reliability problem. Then, it applies the Augmented Ordered Binary Decision Diagram (OBDD-A) method to compute the reliability, and hence the channel capacity. The OBDD-A does not require the aforementioned assumptions, and can be applied to a wide range of networks. Since the OBDD-A has been shown to have linear time complexity and constant space complexity for families of networks with constant inter-connectivity (such as MR-MH) the proposed solution is extremely efficient. The application of our method is verified by simulations.
Copyright © 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Showing items related by title, author, creator and subject.
Herrmann, Johannes; Soh, Sieteng (2013)Digital channel capacity of a network is an important factor in network design. Recent solutions use the Markov chain to model and compute the capacity of only a specific wireless network with multiple relays and multiple ...
Chai, Pey San Nancy (2011)Backhaul networks are used to interconnect access points and further connect them to gateway nodes which are located in regional or metropolitan centres. Conventionally, these backhaul networks are established using ...
Grigoleit, Mark Ted (2008)The Constrained Shortest Path Problem (CSPP) consists of finding the shortest path in a graph or network that satisfies one or more resource constraints. Without these constraints, the shortest path problem can be solved ...