The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper proposes an efficient network coding aware opportunistic routing mechanism (CoAOR) for wireless mesh networks (WMNs). A new coding gain function is proposed for forwarder selection, which takes into account the number of flows considered in an encoded packet, the link quality, and the number of nodes that are able to decode an encoded packet. The weights of the three parameters in the function...
Localized network coding can greatly improve the throughput of wireless mesh networks. In a typical practical wireless transmission mechanism using localized network coding, such as COPE, to make decision which forwarding packets should be coded together, each node needs to broadcast a notification message every τ interval time to inform their neighbors which packets they have buffered...
Routing is a critical problem in networking technology. The basic problem of QoS routing is to satisfy some network parameters constrained of many conditions which is not only a NP-complete problem but also QoS parameters are nondeterministic even fuzzy. Some practical heuristic algorithms are researched to solve such a problem. Based on Partheno-GA with Binary Coding, the network model and mathematical...
Energy saving is important for many wireless devices. In a multi-hop wireless network with multiple sessions, XOR network coding can be applied to opposite traffic flows so as to reduce the number of packet transmissions, which in turn reduce transmission energy. Such a change in packet forwarding, however, impacts the design of traffic routing. Traditional routing algorithms, which typically aim...
Growth Codes (GC) enhances the data persistence in dense sensor networks. However, GC exchanges data with neighbors in a completely random way, which may lead to uneven sensor data distribution in sparse sensor network. This significantly reduces the efficiency of GC data acquisition and fault-tolerance in sparse sensor network with less connectivity. In this paper, we propose Regulative Growth Codes...
Network-on-Chip (NoC) links consume a significant fraction of the total NoC power. We present Selective Packet Interleaving (SPI), a flit transmission scheme that reduces power consumption in NoC links. SPI decreases the number of bit transitions in the links by exploiting the multiplicity of virtual channels in a NoC router. SPI multiplexes flits to the router's output link so as to minimize the...
In this paper, we investigate the design of decentralized encoding procedure for distributed random linear coding (RLC) in resource-constrained wireless networks. We propose a novel distributed RLC scheme called “Fireworks”, analyze its performance and support it by simulation results. The presented results demonstrate design flexibility of the proposed scheme, where the design choices influence the...
A modified genetic particle swarm optimization method (MGPSO) is employed to solve the capacitated vehicle routing problems (CVRP). MGPSO was derived from the standard particle swarm optimization (PSO) and incorporated with the genetic reproduction mechanisms, namely crossover and mutation. MGPSO employs an integer encoding and decoding representation, which is suitable for combinatorial optimization...
An opportunistic network is a type of challenged network that has attracted a great deal of attention in recent years. While a number of schemes have been proposed to facilitate data dissemination in opportunistic networks, there is an implicit assumption that each participating peer behaves collaboratively. Consequently, these schemes may be vulnerable if there are uncooperative or malicious peers...
In this paper, we address the issue of multilayered multicast routing in wireless ad hoc networks (WAHNs). Existing multilayered multicast protocols assume homogeneous ad hoc wireless networks; in which all nodes are of the same type (they have the same processing, data rate and communication capabilities and characteristics). A more realistic assumption is a heterogeneous network; in which nodes...
Networks on chips (NoCs) provide a mechanism for handling complex communications in the next generation of integrated circuits. At the same time, lower yield in nano-technology, makes self repair communication channels a necessity in design of digital systems. This paper proposes a reliable NoC architecture based on specific application mapped onto an NoC. This architecture is capable of recovering...
Opportunistic routing (OR) schemes, such as ExOR, have been shown to provide significant throughput gains over traditional best-path routing schemes for wireless networks. Though the performance of OR schemes depend on the bit-rate, they currently use a fixed rate for transmitting packets. While several schemes have been proposed for selecting bit-rate for unicast transmission to a single receiver,...
Three applications in wireless networks where model-free stochastic learning is applicable, are discussed. The learning based optimization problems are formulated and simulation results are presented. Some open issues are also discussed.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.