Abstract: A method for multiple input multiple output wireless communication begins by determining protocols of wireless communication devices within the proximal region. The method continues by determining whether the protocols of the wireless communication devices within a proximal region are of a like protocol. The method continues by determining the a number of transmit antennas. The method continues, when the protocols of the wireless communication devices within a proximal region are of the like protocol, formatting preamble of a frame of a wireless communication utilizing at least one of cyclic shifting of symbols, cyclic shifting of tones, sparse tone allocation, and sparse symbol allocation based on the number of transmit antennas.

Abstract: A method for determining a number of ranging slots by a base station (BS) in a broadband wireless access (BWA) communication system. The method includes counting the number of mobile stations (MSs) that succeeded in ranging in a current frame, determining a ranging slot occupation ratio in the current frame, comparing a ranging slot occupation ratio of a previous frame with the ranging slot occupation ratio of the current frame, detecting an increase in the number of ranging-requesting MSs, if the ranging slot occupation ratio of the current frame is greater than the ranging slot occupation ratio of the previous frame, and determining the number of ranging slots of a next frame such that the number of ranging slots of the next frame is greater than the number of ranging slots of the current frame.

Abstract: A communication device communicates by reserving a Medium Access Slot (MAS) based on WiMedia_Alliance. The communication device includes a control part that generates negotiation request information, the negotiation request information requesting a reservation change so that an own device uses a MAS having been reserved by other communication device, and a host controller that sends the negotiation request information to the other communication device and receives a response accommodating the reservation change from the other communication device. After receiving the response, the control part sets a MAS reserved by the other communication device to as a MAS used by the own device.

Abstract: The present invention is to provide each communication station with a transmission prioritised period without any useless latency in an ad-hoc communication environment including no control station. For this end, each communication station periodically transmits the beacon signal and acquires the transmission prioritised period immediately after transmission of the beacon. If the number of communication stations in the network is small, a communication station transmit a supplementary beacon within the super frame period, thereby effectively shortening the beacon interval and reducing latency at the start of transmission. At the time when a new communication station enters the network, the supplementary beacon is released in order to accommodate such new communication station.

Abstract: A method for providing network access to a shared access communications medium for a plurality of users includes the steps of conducting predictive admission control by arbitrating user requests for access to the shared medium based on predicted aggregate demands, conducting lookahead scheduling for use in making user channel assignments by forecasting schedule transmission opportunities one or more channels of the shared medium, and balancing load by making channel assignments such that a plurality users are each assigned a respective channel of the shared medium based upon a predicted need. Congestion parameters can predicted for each channel of the shared medium and mapped to a congestion measure using a mathematical function that takes into account packet loss rate, packet delay, packet delay jitter, and available capacity.

Abstract: A system and method is directed to enabling a collision-free transmission of a packet in a network by employing an access-point tree optimized MAC (ATOM) mechanism. The system enables a node in an ad hoc network to determine a collision-free transmission schedule based in part on information the node has about a distance to an access point along a routing tree rooted at the access point. The node may be assigned a time slot for collision-free transmission based in part on a bandwidth demand at the node, and traffic the node has to forward on behalf of a neighbor node.

Abstract: A method for providing network access to a shared access communications medium for a plurality of users includes the steps of conducting predictive admission control by arbitrating user requests for access to the shared medium based on predicted aggregate demands, conducting lookahead scheduling for use in making user channel assignments by forecasting schedule transmission opportunities one or more channels of the shared medium, and balancing load by making channel assignments such that a plurality users are each assigned a respective channel of the shared medium based upon a predicted need. Congestion parameters can predicted for each channel of the shared medium and mapped to a congestion measure using a mathematical function that takes into account packet loss rate, packet delay, packet delay jitter, and available capacity.

Abstract: Control systems and methods for independent control of power systems, particularly lighting network branches, and separate control of individual branch components. Multi-branch systems comprise independently controllable branches that inter-communicate via PLC communications. In each branch, components such as ballasts, local control units, sensors, actuators, and repeaters, may exchange commands and queries independently of a branch remote control unit (BRCU). Alternatively, a BRCU may manage or arbitrate communications, or interact with other BRCUs, other control units and external management systems. Ballasts include a multi-channel ballast that enables close-loop control of individual fixtures, or of individual dimmable or non-dimmable lamps within a fixture. The close-loop control is facilitated by sampling circuits/sensors co-located with each controlled fixture or lamp. All controllers are preferably implemented using an integrated digital controller.

Abstract: The invention provides a method of encoding a data packet for encapsulation in one or more frames for communication from a transmitter to a receiver in a network interface. The method includes dividing the data packet into one or more data chunks and determining the length of a data chunk as the lesser of the number of bytes available in a current frame, the number of bytes remaining in the data packet, or a predetermined number of bytes. The method includes determining if the data chunk is the end-of-the-packet (EOP) and when the data chunk is not the EOP, the method includes prepending the data chunk with a control character representing the length of the data chunk and non-EOP.

Abstract: A method of providing contention access to a communication medium in a communications network includes transmitting priority information with each of a plurality of network nodes prior to a shared-contention transmission opportunity. The priority information for each node indicates a priority level of a frame that the node intends to transmit on the communication medium during the shared-contention transmission opportunity. At least one of the nodes is assigned to a contention window of a plurality of contention windows within the transmission opportunity based on the transmitted priority information.

Abstract: In general, in one aspect, a switching device includes a plurality of ingress ports to receive data from external sources and a plurality of egress ports to transmit data to external destinations. The switching device also includes a plurality of queues to store data waiting to be transmitted from a particular ingress port to a particular egress port. A request generator generates requests for permission to transmit data for the queues. A request indicates a cumulative amount of data contained in a respective queue. A switching matrix provides selective connectivity between the ingress ports and the egress ports. The switching device further includes a scheduler to receive the requests, generate grants based thereon, and configure the switching matrix. The scheduler operates on a pipeline schedule and modifies the requests received to account for grants generated in current period or previous period not reflected in the queues.

Abstract: A data communication system, comprising an access control agent arranged on a network to allocate network resources on one or more UE (user equipment) devices on the network according to one or more parameters, the access control agent being remote from the UE.

Abstract: Apparatus, and an associated method, for allocating communication resources in a data radio communication system, such as a communication system that provides for EDGE data communication services. A multi-carrier radio resource control logic element includes an analyzer that analyzes communication resource requirements to carry out a communication service, and a resource allocator allocates communication resources to be used by which to communicate the data. The communication resources are allocated across a plurality of mobile allocation index offsets, increasing the likelihood that increased amounts of communication resources can be allocated to perform a particular data communication service. A communication station that embodies the control logic element includes a wideband radio frequency transceiver from which the data is communicated during performance of the communication service.

Abstract: A protocol for resolving shared spectrum contentions in cognitive radio wireless access networks is presented. Using medium access control level messaging a request for access to a shared spectrum is conveyed to the current occupier of the spectrum. Each request is associated with a unique and random spectrum access priority number. At the end of a request window the priority numbers associated with each request are compared and a winner is declared. The winning cell, informed of its newly gained access to the shared spectrum, sends a reply to the current occupier of the shared spectrum with a proposed time of acquisition/release of the shared spectrum. The proposed time is confirmed and announced, and upon arrival of the designated time the shared spectrum is released by the current occupier of the shared spectrum and acquired by the requesting cell.

Abstract: A method and system for transmitting messages over an F-SCCH in wireless communication field are disclosed. The method includes the following steps: acquiring a transmission type according to a negotiation between a terminal and a network during a link initialization; configuring a bit number occupied by a message type of messages of the F-SCCH; communicating, by the network, messages with the terminal according to the configured bit number of the message type based on the determined transmission type. With the present invention, redundancy of channel configuration may be decreased, channel configuration of the conventional art is simplified, hence reducing resource occupancy and improving resource utilization of channels.

Abstract: A base station transmits a random access response in response to a random access request (random access preamble) of a user equipment. The random access response includes information about a time when the random access request is transmitted and sequence number information of the random access request (random access preamble). The user equipment checks whether the received random access response is the response of the random access request transmitted by the user equipment, using the information about the time when the random access request is transmitted and the sequence number information included in the received random access response.

Abstract: An arbitration unit grants access to a shared resource to one of a plurality of devices. A consecutive access register corresponds to each device. A consecutive access counter is operable to load data stored in a selectable consecutive access register and count down each operating cycle. An arbitration control unit selects one device for access to the shared resource from among all currently requesting access. Upon selection, the consecutive access counter is loaded from the corresponding consecutive access register. Access is re-arbitrated upon count down to zero. Time out registers and corresponding time out counters for each device permit advance to a higher priority after a time out following an ungranted request.

Abstract: Disclosed is a method for distributing contention among terminals in a Contention Access Period (CAP) of a superframe in regard to a Medium (or Media) Access Control (MAC) layer employing a beacon-enabled mode in IEEE 802.15.4 standard. The method includes: dividing the CAP or the superframe into a plurality of sub-periods, all having the same size; receiving an association request message from a relevant terminal; and allocating one of the plurality of sub-periods to the relevant terminal, and transferring information on the sub-periods to the relevant terminal through a beacon frame, by a Personal Area Network (PAN) coordinator.

Abstract: A cable modem termination system is disclosed with flexible mapping of upstreams to downstreams and flexible mapping of downstreams to optical nodes and optical nodes to upstream receivers and the ability to add singe upstreams or downstreams as needed for load balancing. Multiple downstreams can share the same upstream. Multiple receivers can be coupled to the same upstream. Monitoring of upstream performance for overperforming or underperforming modems can be carried out, and new upstreams with higher and/or lower throughtput can be created to service the overperformers and/or underperformers. Modems can be grouped into logical groups with different performance levels and serviced by different upstreams or different upstream logical channels on the same upstream physical channel. An upstream linecard with a digital crosspoint switch is disclosed with the switch operated during contention intervals to allow reception with or without aggregation of noise where multiple upstream share the same receiver.

Abstract: A method is provided for a master device (601) to allocate channel time. The master device sends a polling frame (240) to a current destination slave device (602) and a current polled slave device (603). The polling frame includes a current destination slave device address (350), a current polled slave device address (360), and a current payload (330). The master device receives a poll acknowledgement frame (280) if the current polled slave device does not wish to transmit data. However, if no poll acknowledgement frame is received, the master device waits for a set duration then sets the current destination device address to be equal to a new destination device address, sets the current polled device address to be equal to a new polled slave device address, and sets a current payload to be equal to a new payload. This can be repeated until a channel time allocation ends.

Abstract: An image processing system as disclosed, including at least one input processing device functionally coupled to at least one output processing device, document information configured in a format such as scanning format or a document creating format converted to a common exchange format, and a common exchange format being converted to a format such as a document viewing format or document printing format. An image processing method also disclosed, including inputting document information, converting inputted document information configured in a document format such as a scanning format or a document creating format to a common exchange format, and converting the common exchange format to a document format such as a document viewing format or a document marking format.

Abstract: In a bandwidth allocation protocol for a mobile communications network, mobile terminals indicate the total quantity of data awaiting transmission, the maximum delay time of the most urgent portion of the data, and the maximum delay time of the least urgent portion. If a collision occurs between transmission by two mobiles, the mobiles wait for an interval controlled by the network before attempting another contention-based access transmission. The network periodically varies the contention-based access capacity available according to the observed usage level and/or collision rate in the previously allocated contention-based access capacity. The network analyses the forward traffic to individual mobiles and predicts likely return bandwidth requirements.

Abstract: An off-load engine for processing a packet conveyed between a target and a network over a transport connection, the packet including a payload and a header. The engine includes a payload buffer, for holding data exchanged between the off-load engine, the network, and the target for inclusion in the payload, and a packet processor, for processing context of the transport connection. The engine also includes a context buffer, for holding the context processed by the packet processor, a memory access multiplexer, which is coupled to convey the data in the payload buffer and the context in the context buffer to and from a memory that stores both the data and the context, and an arbiter, which controls the multiplexer by arbitrating among payload requests to convey the data between the payload buffer and the memory and context requests to convey the context between the context buffer and the memory.

Abstract: A scheduler for a packet switch in a high-speed network. In various embodiments, switch throughput and fairness is improved by operating on request data before arbitration. Other embodiments further include forms of weighted round robin (“WRR”) allocation of output bandwidth prior to arbitration. In various embodiments, the WRR allocation is performed at more than one level. For example, an output applies WRR allocation to all inputs requesting access to that output. In addition, an input applies WRR allocation to multiple classes of data on that input.

Abstract: A communication apparatus and a method for supporting carrier sense multiple access/collision detection (CSMA/CD) are disclosed.

Abstract: A wireless communication method in a network environment in which several devices are connected and wireless communications are performed through a channel synchronized by a sync signal that is broadcast from a piconet coordinate (PNC) selected among the several devices. The wireless communication method includes classifying a first frame to be transmitted to a first device among the several devices into a predetermined number of classes, calculating a waiting time before backoff depending on the classes, and determining whether the channel is used by any other device during the calculated waiting time, calculating a backoff time according to the classes and performing the backoff during the calculated backoff time, if the channel is idle during the waiting time, and transmitting the first frame when the backoff time ends. By adapting the priority to the CAP of the superframe, the control information is quickly conveyed and a high rate wireless communication is realized.

Abstract: A generic software protocol allows communication between multiple devices within an electronic control system as well as between an electronic control system and an external monitoring device. The generic software protocol is reflected in embedded software in each device in the electronic control system. By using the same protocol in all of the electronic control system devices, the protocol reduces computer processing overhead while providing a predictable, yet flexible framework for device communication.

Abstract: A method (400) of implementing floor control in a communications system (100). The method can include receiving a random symbol from each of a plurality of communication devices (104, 106, 108, 110, 112) or network nodes (204, 206, 208, 210, 212). From the plurality of random symbols, a random symbol that satisfies a criteria can be identified. Floor ownership can be granted to a selected one of the communication devices associated with the identified random symbol or from which the identified random symbol was received.

Abstract: This contention resolution method can be used in a station having a data packet to send in a wireless telecommunications network, which packet is sent (F100) after a predetermined maximum number of selection rounds preceding said sending, said method including, on each of said rounds (k), a step (F20) of drawing a value of a binary random variable (r(k)) representing authorization or prohibition of sending of said packet during said round (k). The probability (pw) of said binary random variable (r(k)) assuming a predetermined value is adjusted taking into account authorizations and prohibitions of sending said packet obtained by said station during preceding selection rounds (1, . . . , k?1).

Abstract: Method and apparatus for arbitrating prioritized cycle streams in a manner that prevents starvation. High priority and low priority arbitration pools are employed for arbitrating multiple input cycle streams. Each cycle stream contains a stream of requests of a given type and associated priority. Under normal circumstances in which resource buffer availability for a destination device is not an issue, higher priority streams are provided grants over lower priority streams, with all streams receiving grants. However, when a resource buffer is not available for a lower priority stream, arbitration of high priority streams with available buffer resources are redirected to the low priority arbitration pool, resulting in generation of grant counts for both the higher and lower priority streams.

Abstract: An embodiment of the invention provides a method for glare resolution in a network. The method first designates a master node and a slave node. The method prevents the slave node from initially allocating a first line and a first timeslot for a first sub network connection (SNC) (SNC2 or SNCs2. The master node allocates the first line and the first timeslot for the first SNC, and a second line and a second timeslot for a second SNC (SNC1 or SNCs1).

Abstract: An exemplary embodiment of the invention relates to a method, system, and storage medium for resolving contention issues by a channel in a fiber optic switch environment that occur during channel program execution. The method comprises a channel receiving a status packet indicating a device is no longer busy. The method also includes specifying whether the channel intends to re-initiate a channel program that previously resulted in the device busy status. If the channel does not intend to re-initiate the channel program, a first combination of bits in a re-initiate field of a status-acceptance packet are set which indicate that the channel will take no further action. If the channel intends to re-initiate the channel program, a second combination of bits in the re-initiate field of the status-acceptance packet are set, indicating that the channel will re-initiate the channel program. The method further includes transmitting the status-acceptance packet to a control unit.

Abstract: An 802.11 source station transmits a signal with the duration field other than that required for the transmission to prevent transmission by other stations during known sequences. Thus, the source station uses the duration field to spoof the actual time the medium will be occupied, to stations within range of the signal. A station within range of the transmitted signal will check the duration field of the transmitted signal, and update the station's network allocation vector. Thus, the station will not transmit because the station's network allocation vector indicates that the medium is in use, even though the station maybe unable to hear the carrier. Accordingly, spoofed stations may, for example, 1) delay transmission until a more critical transmission has completed, 2) allow unknown or foreign protocol to have preferential use of the medium, 3) prevent interference from hidden stations, and 4) allow sharing of the medium by overlapping basic service sets.

Abstract: A communication system includes a controller for managing a number of communications devices. The controller receives registration requests from the devices and selectively registers the devices based on various factors. The controller may support a token registration process by which a device requests a token and, in response to the controller granting a token, registers with the controller using a token registration request.

Abstract: A weighted round-robin arbitrator for a plurality of data queue includes an arbitration table comprising a plurality of entries. Each entry represents a time slot for the transmission of one data packet from a selected one of the plurality of data queues. There is one arbitration logic circuit for each of the plurality of entries in the arbitration table. Each arbitration logic circuit includes a first multiplexer receiving an output from a first table entry and an output from a second table entry in the arbitration table. A second multiplexer receives empty flags from each of the data queues, the flags indicating that there is no data to the sent from that queue.

Abstract: A scalable, two-stage rotating priority arbiter with re-circulation and bounded latency for use in multi-threaded, multi-processing devices. An apparatus implementing the two-stage arbiter includes a plurality of masters configured in a plurality of clusters, a plurality of targets, and an chassis interconnect that may be controlled to selectively connects a given master to a given target. The chassis interconnect includes multiple sets of bus lines connected between the plurality of clusters and the plurality of targets forming a cross-bar interconnect, including sets of bus lines corresponding to a command bus. A two-stage arbitration scheme is employed to arbitrate access to the command bus. The first arbitration stage is used to arbitrate between target requests issued by masters in a given cluster. The second arbitration stage is used to arbitrate between winning first-stage target requests. One embodiment of the arbitration scheme employs a rotating priority arbitration scheme at the first stage.

Abstract: A mobile communications device (30) includes a wireless transceiver (34) operable to conduct at least two data connections between the mobile communications device (30) and a wireless network (12) wherein each of the data connections is associated with a connected application operating on the mobile communications device. A processor (32) is coupled to the wireless transceiver (34). The processor (32) is operable to process a request for a data connection for an unconnected application operable on the mobile communications device (30), to release one of the data connections associated with one of the connected applications and to establish a data connection between the mobile communications device (30) and the wireless network (12) for the unconnected application. A contention manager (86) is operable to select the connected application to be released based upon a comparison of a contention parameter associated with each of the connected applications.

Abstract: A controlling method and device for data transmission including the steps of providing a system bus for connecting a first transmission channel and a second transmission channel with a command processor, adjusting a transmitting direction of the system bus according to a transmitting direction of the second transmission channel, and proceeding the data processing procedures of the second transmission channel, wherein parts of data processing procedures of the first transmission channel will last during a interval between the system bus adjusting the transmitting direction and the data processing procedures of the second transmission channel start on. The present invention ensure that the independence between every data caching and processing reduces the times of flushing the cached data from the data transmission channel and re-seeking through the source, shortening the transmission time, increasing facileness and improving the efficiency of the data transmission.

Abstract: A technique (300) and apparatus for sharing frequency spectrum amongst cognitive radios is provided. By maintaining an unoccupied spectral quantum between each CR device, the channel technique ensures that a device just beginning transmissions in the CR frequency band will have spectrum from which to start growing. The growth can continue up to the maximum the spectrum can support, when the bandwidth of each device has been reduced to one spectral quantum, and there are no available spectral quanta left.

Abstract: A system and methods for wireless computing devices to become mesh member nodes within a self-configuring mesh network includes mechanisms for neighbor discovery and sharing of a common topology database including mesh topology and mesh network information. Each mesh node may use the topology database to determine optimized routing paths within the mesh network. Mesh member nodes are configured to detect and communicate topology changes and measured mesh network attributes to other members of the self-configuring wireless network.

Abstract: A system and method for dynamically establishing lightpaths in an optical telecommunications network. The system implements tokens which are used to advertise the availability of receivers downstream. The tokens notify a source when a transmission fails. The tokens also include lightpath reservations and indicate priority of reservations. The innovative system preferably comprises a ring topology with chords that connect non-contiguous nods of the ring.

Abstract: An ultra low power, low complexity, low collision, deterministic modulation method that also works as a massive medium access mechanism for communication systems is based on positioning data in a communication resource space, such as time and frequency, such that the position of a symbol in that space determines its value and its access to the medium. The number base of the symbol is determined by the size of the subset of the resource space it is positioning itself in and, thereby, a few sparsely located symbols can convey a large value, while the remainder of the space can be simultaneously and massively used by other sparsely resource using members of the network.

Abstract: A method and system for managing Priority Messages in a hybrid TDMA-Spread Spectrum (TDMA-SS) communication system is provided. The method and system include a HUB for generating a HUB TDMA epoch, wherein the HUB TDMA epoch includes at least one Priority Message (PM) slot. The PM slot includes a plurality of assignable PM sub-slots. The method and system also include at least one SPOKE, wherein the at least one SPOKE is adapted to transmit a Priority Message during its assigned PM sub-slot within the HUB TDMA epoch.

Abstract: Techniques for partitioning a network element into multiple virtual network elements are provided. Resources of the network element are allocated to the virtual network elements and a virtual network element manager manages the execution of the virtual network elements. The virtual network elements allow the network element to conceptually function and be customized as distinct network elements.

Abstract: A bandwidth guaranteeing, BW, process transmits data from a first group of queues to a medium. When none of the queues of the first group wishes to transmit data via the bandwidth guaranteeing process, a weighted fair queuing process is provided for dividing any excess bandwidth between a second group of queues. A mathematically simple WFQ process is described which may be interrupted by the BW process and resumed with the same order etc. between the queues.

Abstract: The present invention relates to the field of contention in a network of communicating nodes. The present invention especially relates to a master node for a communication network, to a slave node device for a communication network, to a network comprising the master node device and at least one slave node device and to a method of contention in a network of nodes. The method of contention according to the present invention is method in a network comprising slave nodes, said slave nodes comprising a group of first slave nodes, the method comprising the step of sending, by every first slave node participating in a contention, a number of two or more contention participation messages during a contention window associated with the first slave node.

Abstract: A method and apparatus provide for scheduling reverse link transmission for a mobile station in a timely manner. A base station (101) may transmit on a forward link high rate channel and a forward link low rate channel to a mobile station during a common time slot. The high rate and low rate channels may be respectively the F-PDCH and the F-PDCCH. The base station may transmit a reverse link transmission scheduling information on the low rate channel. The mobile station may schedule transmission on the reverse link channel, such as R-SCH, based on the data received on the low rate channel. Since the low rate channel has only scheduling data (16 bits) and the high rate channel may have no data (null data) at all, the base station may decide to transmit the reverse link scheduling information to the mobile station very quickly on the forward link.

Abstract: Apparatus and systems, as well as methods and articles, may operate to detect radio-frequency energy at a frequency associated with at least one wireless networking channel and to transmit a data frame responsive to determining that the radio-frequency energy is not associated with a wireless networking transmission.

Abstract: A method for interpreting timing information at a communication support entity operable to communicate wirelessly, includes the steps of: at a first time at the communication support entity, receiving an indicator of a predetermined form over a link from another communication support entity; receiving over the link data representing one or more relative times; interpreting each such relative time represented by the received data as indicating the absolute time that is offset after the first time by the respective relative time together optionally with a latency value; and determining in dependence on the received data the manner in which the communication support entity is to communicate wirelessly at that absolute time.

Abstract: A command processing method for a radio LAN system composed of a plurality of terminals and at least one base apparatus is disclosed which prevents users of the terminals from suffering from confusion or conflict between them with regard to handling of a command issued from any of the terminals and from misunderstanding that the system has failed. When a channel changing command or a like command is issued from a terminal, the base apparatus determines whether or not the received command is a competitive command whose acceptance may result in the disturbance of reception of data of any other terminal. If the received command is a competitive command, then the base apparatus rejects the command and issues a notification of the rejection to the terminal which has issued the command. When a particular condition is satisfied such as when the priority of the terminal which has issued the command is higher than that of any other terminal receiving data, then the base apparatus may accept the command.