Increase Network Throughput Research Articles

Joint Throughput Optimization for Multichannel Multiradio Multirate Wireless Network with Network Coding

ABSTRACTNetwork coding has been proposed to increase network throughput by combining packets at intermediate nodes. In this paper, we propose a joint throughput optimization method for a multirate multichannel multiradio wireless network with network coding. We propose algorithms for congestion control, joint distributed rate control, and heuristic resource allocation to solve the utility maximization problem in the wireless network environment with network coding. To minimize performance degradation generated by packet loss, we propose a congestion control algorithm. Furthermore, we present a sophisticated resource allocation algorithm which finds a node for the worst traffic jam and selects a session that needs to be first transferred in the node. Then, the node is allocated with the channels and radios for the packets of the selected session. Furthermore, a rate selection method is presented to determine the rate of each node. The simulation results show that the proposed method achieves the optimal performance in a multirate multichannel multiradio wireless network.

Analysis of channel allocation and management using tlbo, ga & de algorithms in cellular networks

Accuracy of spectrum sensing in cellular mobile networks can be increased by reducing the sensing error probability, call blocking probability & by increasing network throughput. In our Project work, an advanced algorithms like Teaching Learning Based Optimization (TLBO), Genetic (GA) and Differential Evaluation (DE) Algorithms are used to analyze the sensing error probability, call blocking probability and network throughput. We will propose a channel allocation and management scheme with the above mentioned algorithms for supporting mobile users. With the help of these algorithms, sensing error and call blocking probabilities are analyzed to find out an optimal value for reducing the errors to some extent and improving network throughput. Channel Allocation in cellular networks is a key aspect with channel impairments and non-ideal antenna patterns. Finally, performance analysis is done through comparison of simulation results.

A New Technique for File Sharing Mechanism Ad hoc Networks

Network coding is a data transmission technique which allows intermediate nodes in a network to re-code data in transit. In contrast to traditional network communication where a node repeats incoming data to its outgoing channel without modifying the payload, a node implementing network coding not only repeats but also alters data. Network coding has been demonstrated to increase network throughput compared to the traditional forwarding transmission. It has potentially broad applications in many areas, including traditional computer networks, wireless ad-hoc networks, and peer to peer systems. This paper process a new technique for file sharing in P2P.

The Application of Social Characteristic and L1 Optimization in the Error Correction for Network Coding in Wireless Sensor Networks.

One of the remarkable challenges about Wireless Sensor Networks (WSN) is how to transfer the collected data efficiently due to energy limitation of sensor nodes. Network coding will increase network throughput of WSN dramatically due to the broadcast nature of WSN. However, the network coding usually propagates a single original error over the whole network. Due to the special property of error propagation in network coding, most of error correction methods cannot correct more than C/2 corrupted errors where C is the max flow min cut of the network. To maximize the effectiveness of network coding applied in WSN, a new error-correcting mechanism to confront the propagated error is urgently needed. Based on the social network characteristic inherent in WSN and L1 optimization, we propose a novel scheme which successfully corrects more than C/2 corrupted errors. What is more, even if the error occurs on all the links of the network, our scheme also can correct errors successfully. With introducing a secret channel and a specially designed matrix which can trap some errors, we improve John and Yi’s model so that it can correct the propagated errors in network coding which usually pollute exactly 100% of the received messages. Taking advantage of the social characteristic inherent in WSN, we propose a new distributed approach that establishes reputation-based trust among sensor nodes in order to identify the informative upstream sensor nodes. With referred theory of social networks, the informative relay nodes are selected and marked with high trust value. The two methods of L1 optimization and utilizing social characteristic coordinate with each other, and can correct the propagated error whose fraction is even exactly 100% in WSN where network coding is performed. The effectiveness of the error correction scheme is validated through simulation experiments.

Convolutional Neural Network for Intermediate View Enhancement in Multiview Streaming

Multiview video streaming continues to gain popularity due to the great viewing experience it offers, as well as its availability that has been enabled by increased network throughput and other recent technical developments. User demand for interactive multiview video streaming that provides seamless view switching upon request is also increasing. However, it is a highly challenging task to stream stable and high quality videos that allow real-time scene navigation within the bandwidth constraint. In this paper, a convolutional neural network (ConvNet)-assisted seamless multiview video streaming system is proposed to tackle the challenge. The proposed method solves the problem from two perspectives. First, a ConvNet-assisted multiview representation method is proposed, which provides flexible interactivity without compromising on multiview video compression efficiency. Second, a bit allocation mechanism guided by a navigation model is developed to provide seamless navigation and adapt to network bandwidth fluctuations at the same time. These two blocks work closely to provide an optimized viewing experience to users. They can be integrated into any existing multiview video streaming framework to enhance overall performance. Experimental results demonstrate the effectiveness of the proposed method for seamless multiview streaming.

Consistency-Aware Weather Disruption-Tolerant Routing in SDN-Based Wireless Mesh Networks

Wireless network solutions, a dominant enabling technology for the backhaul segment, are susceptible to weather disturbances that can substantially degrade network throughput and/or delay, compromising the stringent 5G requirements. These effects can be alleviated by centralized rerouting realized by software defined networking architecture. However, careless frequent reconfigurations can lead to inconsistencies in the network states due to asynchrony between different switches, which can create congestion and limit the rerouting gain. The aim of this paper is to minimize the total data loss during rain disturbance by proposing an algorithm that decides on the timing, the sequence, and the paths for rerouting of network flows considering the imposed congestion during reconfiguration. At each time sample, the central controller decides whether to adopt the optimal routes at a switching cost, defined as the imposed congestion, or to keep using existing, sub-optimal routes at a throughput loss. To find optimal solutions with minimal data loss in a static scenario, we formulate a dynamic programming problem that utilizes perfect knowledge of rain attenuation for the whole rain period. For dynamic scenarios with unknown future rain attenuation, we propose an online consistency-aware rerouting algorithm, called consistency-aware rerouting with prediction (CARP), which uses the temporal correlation of rain fading to estimate future rain attenuation. Simulation results on synthetic and real networks validate the efficiency of our CARP algorithm, substantially reducing data loss and increasing network throughput with a fewer number of rerouting actions compared to a greedy and a regular rerouting benchmarking approaches.

A publicly verifiable network coding scheme with null-space HMAC

The encode-and-forward mechanism of network coding (NC) system, not only could provide increased network throughput, but also might get seriously vulnerable to pollution attacks. It has been an interesting and challenging topic how to design a secure, efficient and publicly verifiable homomorphic NC scheme. The existing cryptography-based NC schemes are grouped in either public key cryptosystem (PKC), or symmetric key cryptosystem (SKC). NC schemes in PKC naturally have public verifiability, but imply much more computation cost and longer operation delay. NC schemes in SKC have cheaper computations cost, but are dilemma about how to share the secret key to those intermediate nodes who might be malicious. Therefore, in this paper, we provide a new NC scheme that based on null-space HMAC with hierarchically sharing keys. The inner sharing keys are for the destination nodes to verify the integrity of the messages; the outer sharing keys are for the intermediate nodes to verify the integrity of the received packets. Our scheme shows a way how to balance the computation efficiency and the public verifiability for the NC system with a SKC scheme.

Centralized congestion control routing protocol based on multi-metrics for low power and lossy networks

Owing to the unreliability of wireless link and the resource constraints of embedded devices in terms of energy, processing power, and memory size in low power and lossy networks (LLNs), network congestion may occur in an emergency and lead to significant packet loss and end-to-end delay. To mitigate the effect of network congestion, this paper proposes a centralized congestion control routing protocol based on multi-metrics (CCRPM). It combines the residual energy of a node, buffer occupancy rate, wireless link quality, and the current number of sub-nodes for the candidate parent to reduce the probability of network congestion in the process of network construction. In addition, it adopts a centralized way to determine whether the sub-nodes of the congested node need to be switched based on the traffic analysis when network congestion occurs. Theoretical analysis and extensive simulation results show that compared with the existing routing protocol, the performance of CCRPM is improved significantly in reducing the probability of network congestion, prolonging average network lifetime, increasing network throughput, and decreasing end-to-end delay.

Optimization of the Low-Speed Link Throughput for Voice Services

The weak point of the field network is represented by E12 low-speed relay links. The situation requires savings of the bandwidth. For this purpose, the necessary bandwidth for voice transmission up to the level of the physical layer has been analyzed. As a suitable solution of network throughput increase, we propose the change of a Voice Payload Size. After finding the optimal Voice Payload Size, tests were carried out to verify the impact of the Voice Payload Size on call quality. A packet loss rate is chosen as a parameter for modelling real traffic. To obtain the expected voice quality, the E-model according to the G.107 Recommendation is applied. The theoretical results are compared with practical measurements, when using the proprietary Cisco Packet Loss Concealment algorithm to evaluate the voice quality. The results obtained have confirmed the suitability of the solution.

An Internet of Things Wireless Sensor Network Data Exchange Model Based on Hierarchical Address Automatic Configuration and Header Compression Encoding Strategy

To explore the wireless sensor network data exchange model, an addressing strategy is applied to the Internet of Things, and the real-time communication between the underlying wireless sensor network and the Internet based on the IEEE 802.15.4 protocol is realized. In addition, Hierarchical address auto configuration strategy is adopted. First of all, inside the bottom network, it allows nodes to use link local address derived by 16-bit short address for data packet transmission. Secondly, Sink node in each underlying network accesses to the global routing prefix through the upper IP router, and combined with interface identifier, it forms Sink node global address, and realizes wireless sensor network and Internet data exchange. The research results show that the strategy has certain superiority in network cost, throughput, energy consumption and other performances. In summary, the proposed addressing strategy has the characteristics of effectively integrating heterogeneous networks, reducing system energy consumption, increasing network throughput and ensuring real-time system performance for the future Internet of things.

Power Aware MAC Protocol for Mobile Ad Hoc Networks Using Directional Antennas

Several power control schemes provide lower power consumption and increase network throughput. Some of these protocol use maximum energy and some adjustable energy to transmit data. Some schemes use directional antenna transmission technique without using any power control scheme. Therefore, in this paper, we proposed a power control scheme that uses directional antenna and takes interference into account. This Power control scheme uses different power levels to transmit RTS–CTS, DATA–ACK using directional antenna. The use of directional antenna increases spatial reuse in the network. Experiment result shows that proposed scheme enhances the throughput of the network and decreases energy consumption. This power control scheme has been compared with existing IEEE 802.11, DMAC, and DBASIC schemes. Our scheme outperforms the above existing schemes in terms of throughput and energy consumption. The throughput of this scheme improves from 9 to 19% for denser to sparse networks. However, as the network density increases the performance of the proposed scheme decreases marginally, but still remains better.

DEBH: detecting and eliminating black holes in mobile ad hoc network

Security in mobile ad hoc network (MANET) is one of the key challenges due to its special features e.g. hop-by-hop communications, dynamic topology, and open network boundary that received tremendous attention by scholars. Traditional security methods are not applicable in MANET due to its special properties. In this paper, a novel approach called detecting and eliminating black holes (DEBH) is proposed that uses a data control packet and an additional black hole check table for detecting and eliminating malicious nodes. Benefiting from trustable nodes, the processing overhead of the security method decreases by passing time. Ad hoc on-demand distance vector (AODV) routing protocol is used as the routing protocol in our design. After finding the freshest path using AODV, our design checks the safety of selected path. In case of detecting any malicious node, it is isolated from the entire network by broadcasting a packet that contains the ID of malicious nodes. Simulation results show that DEBH increases network throughput and decreases packet overhead and delay in comparison with other studied approaches. Moreover, DEBH is able to detect all active malicious nodes which generates fault routing information.

DRP: An energy‐efficient routing protocol for underwater sensor networks

SummaryThe features of transmissions in underwater sensor networks (UWSNs) include lower transmission rate, longer delay time, and higher power consumption when compared with terrestrial radio transmissions. The negative effects of transmission collisions deteriorate in such environments. Existing UWSN routing protocols do not consider the transmission collision probability differences resulting from different transmission distances. In this paper, we show that collision probability plays an important role in route selection and propose an energy‐efficient routing protocol (DRP), which considers the distance‐varied collision probability as well as each node's residual energy. Considering these 2 issues, DRP can find a path with high successful transmission rate and high‐residual energy. In fact, DRP can find the path producing the longest network lifetime, which we have confirmed through theoretical analysis. To the best of our knowledge, DRP is the first UWSN routing protocol that uses transmission collision probability as a factor in route selection. Simulation results verify that DRP extends network lifetime, increases network throughput, and reduces end‐to‐end delay when compared with solutions without considering distance‐varied collision probability or residual energy.

An adaptive traffic distribution scheme for CMT based on Lotka-Volterra model in multihomed networks

CMT (concurrent multipath transfer) can increase throughput and transmission efficiency in multihomed networks. However, it is still an important challenge about distributing traffic adaptively into multiple access networks. Based on LV (Lotka-Volterra) model, we propose an adaptive traffic distribution scheme. In the scheme, two competition modes are concluded, multiple S-D (source-destination) streams competition for bandwidth of one path and multipath competition for traffic between each multihomed S-D host pair. Actually, each access network can establish a path for S-D pairs. So, in the first mode, each path is analogous to a predator, and overall traffic in a multihomed host is reducing file transmission time and increasing network throughput in FTP service analogous to prey. Then, each path has to compete for the traffic by path information, e.g., bandwidth and congestion level. In the other one, if several S-D pairs pass through a shared path simultaneously, they will compete for bandwidth of the path. Here, each S-D pair is analogous to a predator, and the bandwidth of the common path is analogous to the prey. At last, compared with other three schemes, uniform traffic distribution, greedy path selection, random path selection in OPNET simulator, the proposed scheme can perform better on

基于windows server 2012的多网卡链路聚合实验设计与实现

NIC Teaming与链路聚合技术的使用能够扩展网络设备和服务器的带宽、增加吞吐量,并在链路上实现冗余和负载均衡。论文介绍了NIC Teaming与链路聚合原理和技术，重点介绍NIC Teaming与链路聚合实验的设计与实现。实验证明，利用NIC Teaming与链路聚合技术可以扩展网络设备和服务器的带宽、增加吞吐量,并在链路上实现冗余和负载均衡，提高服务器可用性和可靠性。 The use of NIC Teaming and Link Aggregation provides an efficient way to expand the bandwidth of network equipment and server, increase network throughput, and achieve redundancy and load balance on the link. This paper introduces the principle and technology of Teaming NIC and link aggregation, the design and implementation of NIC Teaming and Link Aggregation experi-mental are introduced. Experiments show that the use of NIC Teaming and the link aggregation technology can extend the network equipment and server bandwidth, increase network throughput, achieve redundancy and load balancing in link, improve server reliability and availability.

Multipath Activity Based Routing Protocol for Mobile ‎Cognitive Radio Ad Hoc Networks

Cognitive radio networks improve spectrum utilization by ‎sharing licensed spectrum with cognitive radio devices. In ‎cognitive radio ad hoc networks the routing protocol is one ‎of the most challenging tasks due to the changes in ‎frequency spectrum and the interrupted connectivity ‎caused by the primary user activity. In this paper, a multi‎path activity based routing protocol for cognitive radio ‎network (MACNRP) is proposed. The protocol utilizes ‎channel availability and creates multiple node-disjoint ‎routes between the source and destination nodes. The ‎proposed protocol is compared with D2CARP and FTCRP ‎protocols. The performance evaluation is conducted ‎through mathematical analysis and using OPNET ‎simulation. The performance of the proposed protocol ‎achieves an increase in network throughput; besides it ‎decreases the probability of route failure due to node ‎mobility and primary user activity. We have found that the ‎MACNRP scheme results in 50% to 75% reduction in ‎blocking probability and 33% to 78% improvement in ‎network throughput, with a reasonable additional routing ‎overhead and average packet delay. Due to the successful ‎reduction of collision between primary users and ‎cognitive users, the MACNRP scheme results in decreasing ‎the path failure rate by 50% to 87%.‎

Game-based TDMA MAC protocol for vehicular network

A vehicular ad hoc network (VANET) is a special network for vehicle-to-vehicle communication. The proper medium access control (MAC) protocol based on time division multiple access (TDMA) is the key to realizing efficient vehicle-to-vehicle communication. In a VANET, when two or more nodes occupy the same time slot and drive into each other's communication ranges, a reservation collision occurs, and all of the colliding nodes release their slots. This paper presents a game-based TDMA MAC protocol (GAH-MAC) to solve this problem. In this protocol, when a reservation collision occurs, the colliding nodes will play games with each other to decide whether to reserve the original slot or a new one. In this way, the time slots can be fully used, and the reservation speeds can be increased without being controlled by the base stations. The simulation results show that the performance of GAH-MAC is superior in high-density networks, raising the success rate of reservations and increasing network throughput.

Performance Enhancement in MANET using Power Controlled MAC Protocol

Mobile ad-hoc networks (MANET) are collections of battery powered wireless mobile nodes dynamically forming a temporary network without the use of any pre-defined network infrastructure or centralized administration. Nodes die out early due to limited battery power which ultimately affects the network's lifetime. Different actions of the nodes like transmitting, receiving, overhearing consume available energy. In order to increase the system's life-time, energy has to be conserved. Our proposed protocol improves on MAC by using power control for the RTS, CTS and DATA frame transmissions; remarkably reducing energy consumption and increase network throughput and lifetime. We follow a slow start principle for the RTS frame transmission power instead of keeping them at constant maximum transmission power and by using RSS the minimum required transmit power is used for DATA-ACK transmissions. Our scheme also allows for more simultaneous collision-free transmissions to take place which improves the overall performance of the network.

Analysis of the Effects of Connected–Automated Vehicle Technologies on Travel Demand

Connected–automated vehicle (CAV) technologies are likely to have significant effects not only on how vehicles operate in the transportation system, but also on how individuals behave and use their vehicles. While many CAV technologies—such as connected adaptive cruise control and ecosignals—have the potential to increase network throughput and efficiency, many of these same technologies have a secondary effect of reducing driver burden, which can drive changes in travel behavior. Such changes in travel behavior—in effect, lowering the cost of driving—have the potential to increase greatly the utilization of the transportation system with concurrent negative externalities, such as congestion, energy use, and emissions, working against the positive effects on the transportation system resulting from increased capacity. To date, few studies have analyzed the potential effects on CAV technologies from a systems perspective; studies often focus on gains and losses to an individual vehicle, at a single intersection, or along a corridor. However, travel demand and traffic flow constitute a complex, adaptive, nonlinear system. Therefore, in this study, an advanced transportation systems simulation model—POLARIS—was used. POLARIS includes cosimulation of travel behavior and traffic flow to study the potential effects of several CAV technologies at the regional level. Various technology penetration levels and changes in travel time sensitivity have been analyzed to determine a potential range of effects on vehicle miles traveled from various CAV technologies.

Minimum Interference Channel Assignment Algorithm for Multicast in a Wireless Mesh Network.

Wireless mesh networks (WMNs) have been considered as one of the key technologies for the configuration of wireless machines since they emerged. In a WMN, wireless routers provide multi-hop wireless connectivity between hosts in the network and also allow them to access the Internet via gateway devices. Wireless routers are typically equipped with multiple radios operating on different channels to increase network throughput. Multicast is a form of communication that delivers data from a source to a set of destinations simultaneously. It is used in a number of applications, such as distributed games, distance education, and video conferencing. In this study, we address a channel assignment problem for multicast in multi-radio multi-channel WMNs. In a multi-radio multi-channel WMN, two nearby nodes will interfere with each other and cause a throughput decrease when they transmit on the same channel. Thus, an important goal for multicast channel assignment is to reduce the interference among networked devices. We have developed a minimum interference channel assignment (MICA) algorithm for multicast that accurately models the interference relationship between pairs of multicast tree nodes using the concept of the interference factor and assigns channels to tree nodes to minimize interference within the multicast tree. Simulation results show that MICA achieves higher throughput and lower end-to-end packet delay compared with an existing channel assignment algorithm named multi-channel multicast (MCM). In addition, MICA achieves much lower throughput variation among the destination nodes than MCM.