IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
UP-0180978
(2008-07-28)
|
등록번호 |
US-7676236
(2010-04-21)
|
발명자
/ 주소 |
- Nanda, Sanjiv
- Walton, Jay Rodney
|
출원인 / 주소 |
|
대리인 / 주소 |
|
인용정보 |
피인용 횟수 :
25 인용 특허 :
10 |
초록
▼
An ad hoc network with distributed hierarchical scheduling is disclosed. In one aspect, stations in a network mesh detect interfering neighbor stations and form interference lists. Stations transmit their interference lists. Scheduling stations schedule allocations for child stations in response to
An ad hoc network with distributed hierarchical scheduling is disclosed. In one aspect, stations in a network mesh detect interfering neighbor stations and form interference lists. Stations transmit their interference lists. Scheduling stations schedule allocations for child stations in response to interference lists, received remote allocations, or a combination thereof. Coordination messages are transmitted including frame structure, allocations, and interference lists, among others. In another aspect, an ad hoc mesh network may be organized into a tree topology. In an example wireless backhaul network, this matches traffic flow. Distributed, hierarchical scheduling is provided where parents schedule communication with children while respecting already scheduled transmissions to/from interferers and to/from interferers of their respective children. Procedures to construct interference constraints for distributed, hierarchical scheduling are described, resulting in efficient scheduling and reuse in an ad hoc wireless network, without centralized scheduling. Various other aspects are also disclosed.
대표청구항
▼
What is claimed is: 1. A computer program product, comprising a computer usable medium having a computer readable program code embodied therein, said computer readable program code adapted to be executed by a processor to implement a method for forming a message, the method comprising: generating a
What is claimed is: 1. A computer program product, comprising a computer usable medium having a computer readable program code embodied therein, said computer readable program code adapted to be executed by a processor to implement a method for forming a message, the method comprising: generating an interference list field comprising a list of one or more interfering remote stations; generating a transmit allocation field comprising one or more allocations for transmission, on a shared medium, by one or more child remote stations; generating a receive allocation field comprising one or more allocations for receiving, on the shared medium, by the one or more child remote stations; and forming the message, wherein the message comprises: the interference list field; the transmit allocation field; and the receive allocation field. 2. The method of claim 1, wherein the message further comprises a superframe identification field. 3. The method of claim 1, wherein the message further comprises a contention period field. 4. The method of claim 1, wherein the message further comprises a system identification field. 5. A mesh network comprising: a first mesh station for: establishing a superframe; and transmitting a first coordination message, the first coordination message identifying the superframe and comprising one or more allocations; and one or more second mesh stations for: receiving the first coordination message; and transmitting or receiving in accordance with the one or more allocations. 6. The mesh network of claim 5, wherein the one or more of the second mesh stations are also for transmitting a second coordination message, the second coordination message identifying the superframe, and comprising one or more second allocations, the one or more second allocations determined to avoid conflicting with the one or more allocations in the first coordination message. 7. The mesh network of claim 6, further comprising: the one or more third mesh stations for: receiving the second coordination message; and transmitting or receiving in accordance with the one or more second allocations in the second coordination message. 8. The mesh station network of claim 7, wherein each of the one or more third mesh stations is a child to at least one of the one or more second mesh stations. 9. The mesh network of claim 6, wherein conflicting with the one or more allocations in the first coordination message comprises the one or more allocations and the one or more second allocations being scheduled such that interfering transmissions are in overlapping time periods. 10. The mesh network of claim 5, further comprising the first mesh station transmitting a beacon signal prior to transmitting the coordination message. 11. The mesh network of claim 5, wherein the first mesh station is associated with a first level in a hierarchy of levels in the mesh network and each of the one or more second mesh stations is associated with a second level in the hierarchy of levels in the mesh network, the first level being associated with a highest level indicative of a root level, and the second level being associated with a level lower than the first level. 12. The mesh network of claim 5, wherein the first mesh station is a root backhaul mesh station. 13. The mesh station network of claim 5, wherein establishing the superframe comprises transmitting a period for the superframe and a start time for the superframe.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.