摘要:
A method and an apparatus provide for controlled access to a shared communication medium. Time slots on a forward channel include information regarding status useful for remote units to determine whether a reverse channel is available for seizure. Additionally, information along the forward channel provides guidance to the remote units to control attempts to seize the reverse channel. In one embodiment a remote unit divides a data package into a plurality of portions and attempts to seize the reverse channel using a single portion of the data package which corresponds to one time slot on the reverse channel. It then waits until it receives notification along the forward channel that the first data portion was successfully received before it attempts to send any of the remainder of its data in consecutive time slots on the reverse channel.
摘要:
A method and an apparatus provide for controlled access to a shared communication medium. Time slots on a forward channel include information regarding status useful for remote units to determine whether a reverse channel is available for seizure. Additionally, information along the forward channel provides guidance to the remote units to control attempts to seize the reverse channel. In one embodiment a remote unit divides a data package into a plurality of portions and attempts to seize the reverse channel using a single portion of the data package which corresponds to one time slot on the reverse channel. It then waits until it receives notification along the forward channel that the first data portion was successfully received before it attempts to send any of the remainder of its data in consecutive time slots on the reverse channel.
摘要:
A method and an apparatus provide for controlled access to a shared communication medium. Time slots on a forward channel include information regarding status useful for remote units to determine whether a reverse channel is available for seizure. Additionally, information along the forward channel provides guidance to the remote units to control attempts to seize the reverse channel. In one embodiment a remote unit divides a data package into a plurality of portions and attempts to seize the reverse channel using a single portion of the data package which corresponds to one time slot on the reverse channel. It then waits until it receives notification along the forward channel that the first data portion was successfully received before it attempts to send any of the remainder of its data in consecutive time slots on the reverse channel.
摘要:
A method and an apparatus provide for controlled access to a shared communication medium. Time slots on a forward channel include information regarding status useful for remote units to determine whether a reverse channel is available for seizure. Additionally, information along the forward channel provides guidance to the remote units to control attempts to seize the reverse channel. In one embodiment a remote unit divides a data package into a plurality of portions and attempts to seize the reverse channel using a single portion of the data package which corresponds to one time slot on the reverse channel. It then waits until it receives notification along the forward channel that the first data portion was successfully received before it attempts to send any of the remainder of its data in consecutive time slots on the reverse channel.
摘要:
A method and an apparatus provide for controlled access to a shared communication medium. Time slots on a forward channel include information regarding status useful for remote units to determine whether a reverse channel is available for seizure. Additionally, information along the forward channel provides guidance to the remote units to control attempts to seize the reverse channel. In one embodiment a remote unit divides a data package into a plurality of portions and attempts to seize the reverse channel using a single portion of the data package which corresponds to one time slot on the reverse channel. It then waits until it receives notification along the forward channel that the first data portion was successfully received before it attempts to send any of the remainder of its data in consecutive time slots on the reverse channel.
摘要:
A method and an apparatus provide for controlled access to a shared communication medium. Time slots on a forward channel include information regarding status useful for remote units to determine whether a reverse channel is available for seizure. Additionally, information along the forward channel provides guidance to the remote units to control attempts to seize the reverse channel. In one embodiment a remote unit divides a data package into a plurality of portions and attempts to seize the reverse channel using a single portion of the data package which corresponds to one time slot on the reverse channel. It then waits until it receives notification along the forward channel that the first data portion was successfully received before it attempts to send any of the remainder of its data in consecutive time slots on the reverse channel.
摘要:
A conditional e-coupon distribution method distributes e-coupons predefined by sellers to mobile users only if the number of mobile users requesting such e-coupons equals or exceeds a threshold. The method receives a request to browse e-coupons from a mobile user. The method receives the location of the mobile user and determines a plurality of sellers local to the mobile electronic device and a plurality of corresponding e-coupons available from the local sellers. The method receives a request for a particular e-coupon from a seller and authorizes the provision of said e-coupon to the mobile user. At the end of a processing cycle, the mobile user receives the requested e-coupon if all conditions, such as a period of time and threshold, have been met. A computer-usable medium having computer-readable program code embodied therein allows for storage of the method.
摘要:
In a wireless network or other communication system, admission of users to the system is based on predicted scheduling gain. A scheduler is configured to manage access to network resources for users already admitted to the system. An admission control module is coupled to the scheduler, and determines a predicted scheduling gain of the scheduler under an operating scenario involving admission of at least one additional user to the system. The predicted scheduling gain is processed to generate at least one performance metric which is used to make an admission control decision regarding admission of the at least one additional user to the system.
摘要:
A method and apparatus for a high-capacity cellular network by improved sectorization and interleaved channel assignment is presented. Data transmission over a cellular network is carried out by implementation of a sectorization scheme, called the Narrow-Beam Quad-sector Cell (NBQC) sectorization scheme, and the corresponding Interleaved Channel Assignments (ICA). The NBQC sectorization scheme calls for each cell of a cellular network to be divided into four sectors, with each sector covered by a 60 degree antenna. Use of the NBQC sectorization scheme allows for implementation of the corresponding ICA, in which assignment of transmission channels to each cell is based on a re-use factor of N=2. Accordingly, the interleaved channel assignments allow for the use of the transmission channels in cells which are adjacent in the cellular network.
摘要:
A data synchronization system, which in one embodiment, uses a ShuffleNet topology requiring an even number, N=2m, of nodes in the system. These nodes are organized into two sets, X=x.sub.0, . . . , x.sub.m-1 and Y=y.sub.0, . . . , y.sub.m-1, wherein the subscripts are always to be taken modulo m. Each "round" of communication entails simultaneously synchronizing the nodes in X with nodes in Y according to a matching between the two sets. The rounds are grouped into two "batches," batch B.sub.j which consists of rounds R.sub.2j-1 and R.sub.2j-2 for j.gtoreq.1. During each odd batch B.sub.2j-1, each x.sub.i synchronizes with y.sub.2i+2j-2 and with y.sub.2i+2j-1. In another embodiment, the data synchronization is based on a hypercube scheme, wherein each node is labeled by a binary string and any two nodes with their labels differing by one bit are connected by an edge and only adjacent nodes, i.e. those nodes connected by an edge, can communicate and exchange data directly according to an update schedule. In a third embodiment, a hypercube scheme is used, but the number of nodes is assumed to be a power of 2 or N=2.sup.m. This embodiment, like the second embodiment, uses the labeling of nodes by their binary representation, but the matchings of nodes used to determine the update schedule is not confined to the hypercube edges. Instead, a general cyclic matching scheme is used.