Network channel access protocol is disclosed. More particularly, a distributed, locally determined, channel access protocol that adapts to load, avoids interference and controls access by a group of nodes to a set of shared channels is disclosed. Shared channel space is divided into a number of comm
Network channel access protocol is disclosed. More particularly, a distributed, locally determined, channel access protocol that adapts to load, avoids interference and controls access by a group of nodes to a set of shared channels is disclosed. Shared channel space is divided into a number of communication slots that are repeated at a predetermined interval. Permission to use a slot to communicate between any two nodes is dynamically adjusted by the channel access protocol, which locally: (i) estimates load to neighboring nodes; (ii) allocates or deallocates slot usage to adapt to load and avoid interference; and (iii) asserts and advertises slot usage within an interference area about itself.
대표청구항▼
What is claimed is: 1. A method for frame execution, comprising: waiting for a frame synchronization; upon frame synchronization occurring, accessing a slot of a slot allocation for a node; determining a mode associated with the slot allocation wherein the mode is one of a transmit mode, a none mod
What is claimed is: 1. A method for frame execution, comprising: waiting for a frame synchronization; upon frame synchronization occurring, accessing a slot of a slot allocation for a node; determining a mode associated with the slot allocation wherein the mode is one of a transmit mode, a none mode, and a receive mode; if the mode is transmit, transmitting using the slot allocation then checking for another slot; if the mode is none, checking for another slot; if the mode is receive, activating a receiver; checking for signal; if there is no signal, storing first error information; determining if failure rate exceeds a first threshold value for use of the slot; if there is signal, determining if information received was received within an acceptable error rate; if there is signal and if the information was received within the acceptable error rate, processing incoming data; and checking for another slot. 2. The method of claim 1 wherein the transmitting is by point-to-point communication. 3. The method of claim 1 wherein the transmitting is by point-to-multipoint communication. 4. The method of claim 1 wherein the transmitting is by broadcast communication. 5. The method of claim 1 wherein the transmitting is by at least one of point-to-point communication, point-to-multipoint communication and broadcast communication. 6. The method of claim 1 further comprising: if the information was received in excess of the acceptable error rate, storing second error information; determining if the failure rate exceeds a second threshold value for use of the slot; if the failure rate does exceed the second threshold value, canceling slot usage; informing neighboring nodes of the slot usage cancellation; characterizing an interferer; storing the interferer characterization; and checking for another slot. 7. The method of claim 6 wherein the informing is by point-to-point communication. 8. The method of claim 6 wherein the informing is by point-to-multipoint communication. 9. The method of claim 6 wherein the informing is by broadcast communication. 10. The method of claim 6 wherein the informing is by at least one of point-to-point communication, point-to-multipoint communication and broadcast communication. 11. The method of claim 1 further comprising: if the information was received in excess of the acceptable error rate, determining if the failure rate exceeds the second threshold value for use of the slot; and if the failure rate does not exceed the second threshold value, checking for another slot. 12. The method of claim 1 further comprising if the failure rate does not exceed the first threshold value for use of the slot, checking for another slot. 13. The method of claim 1 further comprising: if the failure rate exceeds the first threshold value for use of the slot, checking whether all slots for the node are failing; if all the slots are not failing, informing neighboring nodes of the slot allocation; and checking for another slot. 14. The method of claim 13 wherein the informing is by point-to-point communication. 15. The method of claim 13 wherein the informing is by point-to-multipoint communication. 16. The method of claim 13 wherein the informing is by broadcast communication. 17. The method of claim 13 wherein the informing is by at least one of point-to-point communication, point-to-multipoint communication and broadcast communication. 18. The method of claim 1 further comprising: if the failure rats exceeds the first threshold value for use of the slot, checking whether all slots associated with the node are failing; if all the slots are failing, canceling all slot allocations for the node; informing neighboring nodes of the canceling; and checking for another slot. 19. The method of claim 18 wherein the informing is by point-to-point communication. 20. The method of claim 18 wherein the informing is by point-to-multipoint communication. 21. The method of claim 18 wherein the informing is by broadcast communication. 22. The method of claim 18 wherein the informing is by at least one of point-to-point communication, point-to-multipoint communication and broadcast communication. 23. A computer-readable medium having stored thereon a plurality of instructions, the plurality of instructions including instructions which, when executed by a processor, cause the processor to perform the steps comprising: waiting for a frame synchronization; upon frame synchronization occurring, accessing a slot of a slot allocation for a node; determining a mode associated with the slot allocation wherein the mode is one of a transmit mode, a none mode, and a receive mode; if the mode is transmit, transmitting using the slot allocation then checking for another slot; if the mode is none, checking for another slot; if the mode is receive, activating a receiver; checking for signal; if there is no signal, determining if failure rate exceeds a threshold value for use of a slot of the slot allocation; and if there is signal, determining it information received was received within an acceptable error rate.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (52)
Hodzic Migdat I. ; Brennan James M., Adaptive digital wireless communications network apparatus and process.
Joseph J. Roy ; Cathal O'Scolai ; Baya Hatim ; Ismail Lakkis ; Saeid Safavi ; Deirdre O'Shea ; Hoang Xuan Bui ; Masood K. Tayebi, Elastic store for wireless communication systems.
Roy Joseph J. ; O'Scolai Cathal ; Hatim Baya ; Lakkis Ismail ; Safavi Saeid ; O'Shea Deirdre ; Bui Hoang Xuan ; Tayebi Masood K., Elastic store for wireless communication systems.
Nessett Danny M. ; Grabelsky David ; Borella Michael S. ; Sidhu Ikhlaq S., Method and system for locating network services with distributed network address translation.
Coss Michael John ; Majette David L. ; Sharp Ronald L., Methods and apparatus for a computer network firewall with dynamic rule processing with the ability to dynamically alter the operations of rules.
Ahmadi Hamid (Somers NY) Bar-Noy Amotz (Bronx NY) Kessler Ilan (Bronx NY) Krishna Arvind (Briarcliff Manor NY), Multiaccess scheme for mobile integrated local area networks.
Narad Charles E. ; Fall Kevin ; MacAvoy Neil ; Shankar Pradip ; Rand Leonard M. ; Hall Jerry J., Packet processing system including a policy engine having a classification unit.
Hrastar Scott E. ; Smith George Horkan, Router for which a logical network address which is not unique to the gateway address in default routing table entries.
Schutte Mark E. ; Hrastar Scott E., Router which dynamically requests a set of logical network addresses and assigns addresses in the set to hosts connected to the router.
Shepard Timothy Jason (Belmont MA), Scalable, self-organizing packet radio network having decentralized channel management providing collision-free packet t.
Lee Davidson ; Heino Hameleers NL; Frank Hundscheidt NL, System and method for dynamic radio resource allocation for non-transparent high-speed circuit-switched data services.
Shwed Gil,ILX ; Kramer Shlomo,ILX ; Zuk Nir,ILX ; Dogon Gil,ILX ; Ben-Reuven Ehud,ILX, System for securing the flow of and selectively modifying packets in a computer network.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.