34 results about "End to end throughput" patented technology

The present invention relates to power management within the context of wireless ad-hoc networks. More specifically to the effects of using different transmit powers on the average power consumption and end-to-end network throughput in a wireless ad-hoc environment. This power management approach reduces the system power consumption and thereby prolongs the battery life of mobile nodes. Furthermore, the invention improves the end-to-end network throughput as compared to other ad-hoc networks in which all mobile nodes use the same transmit power. The improvement is due to the achievement of a tradeoff between minimizing interference ranges, reduction in the average number of hops to reach a destination, reducing the probability of having isolated clusters, and reducing the average number of transmissions including retransmissions due to collisions. The present invention provides a network with enhanced end-to-end throughput performance, and lower transmit power.

Cooperative communication is a technique that can be employed to meet the increased throughput needs of next generation WiMAX systems. In a cooperative scenario, multiple stations can jointly emulate the antenna elements of a multi-input multi-output system in a distributed fashion. A framework for a randomized distributed space-time coding (“R-DSTC”) technique in the emerging relay-assisted WiMAX network, and the development of a cooperative medium access control (“MAC”) layer protocol, called CoopMAX, for R-DSTC deployment in an IEEE 802.16 system, is described. The technique described couples the MAC layer with the physical (PHY) layer for performance optimization. The PHY layer yields significant diversity gain, while the MAC layer achieves a substantial end-to-end throughput gain.

The invention discloses a cognitive routing protocol suitable for a heterogeneous wireless return network, belonging to the field of wireless communication. The cognitive routing protocol mainly solves the problem of how to effectively select the path aiming to the difference of the nodes in the heterogeneous network. When a source node sends a RREQ (route request) and an intermediate node receives the RREQ, an acquired link delay EED and a link equivalent bandwidth ABITF are added into the RREQ by Wiener forecasting according to the message transmitted by a MAC (media access control) layer. A destination node selects a path for response in consideration of queuing delay, transmission delay, interference, link frequency diversity and other factors according to the routing information carried by the RREQ. After receiving the returned RREQ, the source node dynamically adjust the routing life time according to the forecasted end-to-end delay, so as to improve the effective utilization rate of the path. The cognitive routing protocol selects the routing in comprehensive consideration of frequency diversity and link interference according to the characteristics of the heterogeneous network by introducing Wiener forecasting and Q learning. Therefore, the end-to-end throughput is improved, the routing overhead is reduced, and the network resources are fully used.

The invention aims at a multi-relay system with an energy harvesting function and provides a method for optimal distribution of time of an energy harvesting relay system based on relay selection. In the method, a plurality of relay nodes work under an energy harvesting mode of wireless energy transmission (WET), an optimization model with maximum system end-to-end throughput is constructed based on the limitations of energy causality and data causality, and a branch and bound method is adopted to select the relay node used by each time slot. A simplex method and an independent solution method are respectively adopted to carry out optimal distribution on the transmission time of the source node and the relay node in each time slot for different service conditions of the relay node about the residual energy, so that the data quantity received by the target node is improved. According to the method, pairing of the relay node and the transmission time slot during multi-relay cooperation and optimal distribution of the transmission time of the source node and the relay node are realized, so that the system throughput performance is effectively improved, and the method has an advantage that the energy consumption expenditure is saved.

The invention discloses a directional antenna-based multi-rate multi-path route optimization method in the technical field of wireless network. The method comprises the following steps: obtaining higher end-to-end throughput by selecting a directional antenna forward direction; selecting a forward rate for each node provided with a directional antenna so as to obtain higher end-to-end throughput at the same time; and finally selecting a forward set for each node provided with the directional antenna so as to obtain higher end-to-end throughput by using a multi-path route mode. According to the method, the problems of selection of the direction of the directional antenna in multi-path routing and selection of the optimal transmission rate to obtain higher end-to-end throughput are effectively solved. The multi-path route mode obtained by a DSMA (Multi-rate Any-path Routing with Directional Antennas) algorithm is optimized. Compared with a single-rate multi-path route mode, the DSMA has the advantage that higher end-to-end throughput can be obtained. The end-to-end average time delay can be reduced.

This invention provides a load-balancing structure for packet switches and its constructing method. In this method, the structure based on self-routing concentrators is divided into two stages, that is, a first stage and a second stage fabric. A virtual output group queue (VOGQ) is appended to each input group port of the first stage fabric, and a reordering buffer (RB) is configured behind each output group port of the second stage fabric. Packets stored in the VOGQ are combined into data blocks with preset length, which is divided into data slices of fixed size, finally each data slice is added an address tag and is delivered to the first stage fabric for self-routing. Once reaching the RB, data slices are recombined into data blocks. This invention solves the packet out-of-sequence problem in the load-balancing Birkhoff-von Neumann switching structure and improves the end-to-end throughput.

This invention discloses a method for scheduling efficient resource of a minisatellite network based on earth observation tasks, and solves the problems that the end-to-end throughput capacity is low and the utilization efficiency of the network resource is low because the network resource is not fully considered during the scheduling process in the earth observation scene of the resource-limited minisatellite network. The method comprises the implementation processes of: according to an initial network topology, determining a node number; at the same time, initializing a network resource scheduling planning time set; according to current network state and resource scheduling conflict restraint, constructing a link scheduling conflict graph by a ground control center; solving a maximal independent set corresponding to the conflict graph to acquire a network conflict-free scheduling link set; by using the link set and a linear programming, solving a resource allocation scheme and a data transmission method capable of mostly optimizing the network efficiency till a time slot is ended. The method improves the resource utilization ratio, increases the returning efficiency of important task data, improves the earth observation network performance of the minisatellite, and is used for scheduling the efficiently transmitted resource of earth observation system data.

The invention belongs to the technical field of a multi-hop wireless network, and provides a single-path routing method using the reusability of spectrum spaces. The method comprises the steps that whether the spaces of links are reusable or not is judged, the reusability of the spectrum spaces among the links is quantized to obtain the routing metric value of a reusable unit; then modeling is conducted on the routing metric value of the reusable unit; an SASR-MIN algorithm or an SASR-FF algorithm is used for calculating the routing metric value of a path; at last, a destination node finds out a final path used for transmitting a data package and conducts data transmission according to the routing metric value. The reusability of the spaces among the links is considered when the routing metric value of the path is determined, a chosen routing path is made to achieve higher end-to-end throughput, and excess energy consumption is not extra introduced.

The invention discloses a method for allocating time slots supporting multi-hop streaming services in an ad hoc network. The steps for realizing the invention are: (1) a source node triggers time slot reservation; (2) an intermediate node forwards an SREQ frame; (3) ) The destination node performs end-to-end time slot allocation; (4) Planning the time slot allocation results. Because the destination node of the present invention performs unified end-to-end time slot allocation through the aggregated information of available time slot sets of all nodes on the multi-hop service flow path, it overcomes the high and complex computing power requirements of centralized time slot allocation in the prior art The problem of low end-to-end throughput of multi-hop service flow in distributed time slot allocation is high. The invention has the advantages that the method is simple and easy to realize, and can improve the end-to-end throughput of the multi-hop service flow, and can be used for the time slot allocation of the time division multiple access protocol in the wireless ad hoc network.