CN112929950A - Self-organizing network access method based on preamble - Google Patents
Self-organizing network access method based on preamble Download PDFInfo
- Publication number
- CN112929950A CN112929950A CN202110265130.8A CN202110265130A CN112929950A CN 112929950 A CN112929950 A CN 112929950A CN 202110265130 A CN202110265130 A CN 202110265130A CN 112929950 A CN112929950 A CN 112929950A
- Authority
- CN
- China
- Prior art keywords
- node
- preamble
- pte
- slave node
- slave
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W48/00—Access restriction; Network selection; Access point selection
- H04W48/16—Discovering, processing access restriction or access information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
- H04L5/0048—Allocation of pilot signals, i.e. of signals known to the receiver
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention provides a self-organizing network access method based on a preamble, which comprises the following steps: the master node initiates a preamble time exchange process to acquire the time difference between receiving the PTE preamble and replying the PTE preamble by the slave node; the master node initiates a leader T-Query process, sends a data packet containing time difference to the slave node replying PTE leader, and receives feedback information of the slave node; and the master node initiates a NWK-Ctrl network configuration process, and allocates an address for the slave node according to the feedback information of the slave node, so that the slave node is accessed. The self-organizing network access mechanism based on the preamble defined by the invention greatly reduces the time of network establishment and maintenance, and can realize the promotion of two orders of magnitude according to typical calculation.
Description
Technical Field
The invention relates to the field of wireless communication, in particular to a self-organizing network access method based on a preamble.
Background
With the progress of the times, the requirements of people on the network are higher, the scale of the network is larger and larger, and more nodes are provided. The wireless local area network has the characteristics of strong mobility, good expandability and simple wiring. How the wireless local area network is organized is to carry out networking and network maintenance according to a network protocol.
The traditional MAC layer protocol of the multi-level ad hoc network based on central control adopts the CSMA/CA protocol proposed in the IEEE 802.11 standard, i.e., carrier sense multiple access with collision detection, to form a tree-like network topology and allow a backup route to improve the stability of network transmission. However, the CSMA/CA protocol uses a data transmission method for contention access, and the length of the data frame is too long, which results in long time for establishing and maintaining the network, and the time cost for networking and maintaining the network with many network nodes is very high.
Disclosure of Invention
Aiming at the defects in the prior art, the invention aims to provide a self-organizing network access method based on preamble, which adopts Preamble Time Exchange (PTE) to improve the efficiency of network establishment and solve the problem of overlong networking Time in the prior art.
The technical scheme provided by the invention is as follows:
a preamble-based ad hoc network access method, comprising:
the master node initiates a leader Time exchange process PTE (preamble Time exchange) to acquire the Time difference between the receiving of the PTE leader from the slave node and the replying of the PTE leader; the master node and the slave node can record the time difference, and under the condition that the preamble transmission is effective, the time difference information can be known at the sending node and the receiving node;
the master node initiates a leader T-Query process, sends a data packet containing time difference to the slave node replying PTE leader, and receives feedback information of the slave node;
and the master node initiates a NWK-Ctrl network configuration process, and allocates an address for the slave node according to the feedback information of the slave node, so that the slave node is accessed.
The invention is further improved in that in the preamble time exchange process, the slave node receiving the PTE preamble replies to the PTE preamble in a competition access mode, and records the time difference between the receiving of the PTE preamble and the replying of the PTE preamble.
A further improvement of the invention is that the preamble of the PTE may employ different combinations of SYNCP to discriminate whether the frame is in PTE mode or data transmission mode.
One design way is as follows: the PTE preamble sequentially comprises a SYNCP, a SYNCP empty position, a SYNCP and a SYNCP empty position; the data transmission preamble includes four SYNCPs; through cross-correlation calculation in frame detection, the SYNCP can generate Peak, and the position without the SYNCP has no Peak, so as to determine whether the PTE preamble or the data transmission preamble;
the other design mode is as follows: the PTE preamble includes two SYNCPs and two SYNCMs, and the data transmission preamble includes three SYNCPs and one SYNCM, and the pattern is determined by judging the change position. In the present invention, both SYNCP and SYNCM are OFDM symbols.
A further improvement of the invention is that, during the preamble time exchange,
the master node directly sends the PTE preamble to the slave node, and the method is suitable for single-stage networks;
or the master node transmits the PTE preamble to the slave node through a relay node directly connected with the slave node in communication, and the method is suitable for a multi-level network.
A further improvement of the present invention is that the master node causes the relay node to transmit a PTE preamble to the slave node by transmitting a P beacon to the relay node.
The invention has the further improvement that in the process of the preamble T-Query, if the time difference in the data packet sent by the main node is consistent with the time difference recorded by the slave node, the slave node sends feedback information to the main node; if the slave node is not accessed, the feedback information includes the MAC address of the slave node and does not include the SID address.
The further improvement of the present invention is that in the NWK-Ctrl network configuration process, the master node determines whether a slave node has been accessed, and if not, the master node allocates a SID address to the slave node and sends the SID address to the slave node, so that the slave node binds the SID address and the MAC address to implement access.
The triggering time of the NWK-Ctrl network configuration process has two forms: if fair access is needed, after all slave nodes finish the PTE process and the leading T-Query process, starting the NWK-Ctrl network configuration process for all the slave nodes, and determining which slave nodes are accessed to the network while distributing the SID addresses; if the access is fast, after the T-Query process is performed, the NWK-Ctrl network configuration process can be directly performed, the SID address is allocated, and whether the access is performed or not is determined.
The invention is further improved in that the master node is a gateway, the slave nodes are primary nodes in direct communication connection with the master node, and the master node constructs a primary node network according to channel quality.
The invention is further improved in that, in a multi-stage network, for any node to be accessed with more than two stages, the master node takes the node as a slave node, takes the network node at the upper stage of the node as a relay node, and constructs a node network according to the channel quality. For a multi-stage network, each first-stage node directly connected with a main node (gateway) is accessed in the accessing process, then the first-stage node is taken as a relay node, each second-stage node is accessed by adopting the method of the invention, and the process is repeated until all the stages of nodes finish accessing.
The invention has the further improvement that after the slave node is accessed, the network maintenance is carried out by setting a heartbeat cycle, and if the heartbeat cycle is exceeded and the heartbeat signal cannot be received, the network is automatically quitted; and the master node prolongs the survival period of the slave nodes through an NWK-Ctrl network configuration process.
For the networking time analysis in the networking protocol of the invention:
according to typical calculations, it is assumed that a packet is 12 OFDM symbols, each symbol has 1024 data, 64 cyclic prefixes, and the packet size is 13056. The SYNCP performs slot calculations for 64 symbols at a 1.25MSPS sampling rate. From this, a preamble length of 4x 64x 1/1.25us, i.e., 204.8us, can be derived.
A reasonable single preamble detection slot, i.e. a transmission slot, is 220us in number. The preamble contention slot is set to 256 slots at maximum, and is 256 × 220us, i.e., 56.32 ms. Considering 64 or 256 nodes in a partition, the PTE takes 3.6s or 14.42 s. The other times are substantially TDMA time slot efficient. In the process of network establishment and maintenance, the handshake delay is carried out according to 40ms, and because the P-MAC access uses the preamble to replace the data packet for competitive access, the P-MAC handshake occupation time is 5.12s or 20.48s at most.
Compared with the traditional CSMA/CA mechanism, the single access time of the mechanism is related to the length of a data packet, the competition time slot of the data packet is set according to the maximum 256 slots, the length of the data packet is 13056/1.25us (namely 10.44 ms) according to the sampling rate of 1.25MSPS, and the processing time of each slot is assumed to be 20ms because an upper computer needs to accept and demodulate. So for the conventional CSMA/CA mechanism, its single access time is 256x 20ms, i.e. 5.12 s. If 64 or 256 nodes, the whole is 327.68s or 1310.72 s. According to the P-MAC protocol, the efficiency of establishing and maintaining the network is greatly optimized.
The self-organizing network access mechanism based on the preamble defined by the invention greatly reduces the time of network establishment and maintenance, and can realize the promotion of two orders of magnitude according to typical calculation.
Drawings
Other features, objects and advantages of the invention will become more apparent upon reading of the detailed description of non-limiting embodiments with reference to the following drawings:
fig. 1 is a flow chart of a preamble-based ad hoc network access method;
FIG. 2 is a network link topology diagram;
fig. 3 is a schematic diagram of an example of a network establishment process based on the network shown in fig. 2.
FIG. 4 is a network link topology diagram;
fig. 5 is a schematic diagram of an example of a network maintenance process based on the network shown in fig. 4.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and the described embodiments are only a part of the embodiments of the present invention, but not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Fig. 2 and 3 show an example of a network establishment process proposed by the present invention, in which 4 nodes form a two-level network. In this embodiment, the gateway is a master node, and each slave node implements network access through the process shown in fig. 3.
The network link scenario in fig. 2 is shown in a topological diagram, where a gateway may communicate with nodes 1 and 2, node 1 may communicate with nodes 3 and 4, and node 2 may communicate with nodes 3 and 4. As shown in fig. 1 to 3, the network establishment procedure is initiated by the gateway, which initiates the PTE, and the nodes 1, 2 reply to the preamble. The gateway initiates T-Query handshake (T-Query preamble time difference Query process), sends time difference information, matches with the node 1, and acquires the MAC address. The gateway continues to initiate T-Query handshake, sends time difference information, matches with the node 2 and acquires the MAC address. The gateway initiates a NWK-Ctrl network configuration process according to the channel quality condition in the T-Query handshake stage, sends a binding SID address and NWKID confirmation network access through the MAC address of the node 1, and the node 1 replies confirmation. The gateway continues to initiate the NWK-Ctrl network configuration process, sends out the binding SID address and the NWKID confirmation access through the MAC address of node 2, and node 2 replies the confirmation. Thus, the construction of the first-level network is completed.
The gateway initiates a P beacon to the node 1, the node 1 initiates PTE after receiving, the nodes 3 and 4 reply the preamble, and the node 1 replies the time difference information to the gateway. And the gateway initiates T-Query handshake, the node 1 initiates T-Query handshake after receiving the time difference information, matches with the node 3, acquires the MAC address and replies to the gateway. The gateway continues to initiate T-Query handshake, the node 1 initiates T-Query handshake after receiving, sends time difference information, matches with the node 4, acquires MAC address, and replies to the gateway.
The gateway initiates a P beacon to the node 2, the node 2 initiates PTE after receiving, the nodes 3 and 4 reply the preamble, and the node 2 replies the time difference information to the gateway. And the gateway initiates T-Query handshake, the node 2 initiates T-Query handshake after receiving the time difference information, matches the time difference information with the node 3, acquires the MAC address and replies to the gateway. The gateway continues to initiate T-Query handshake, the node 2 initiates T-Query handshake after receiving, sends time difference information, matches with the node 4, acquires MAC address, and replies to the gateway.
The gateway selects route 1 as the communication route according to the communication channel quality with node 3 twice (route 1: gateway, node 1, node 3; route 2: gateway, node 2, node 3). The gateway initiates the NWK-Ctrl network configuration process to the node 3 through the node 1, sends a binding SID address and an NWKID confirmation network access through the MAC address of the node 3, and the node 3 replies the confirmation. The gateway selects route 2 as the communication route according to the communication channel quality with node 4 twice (route 1: gateway, node 1, node 4; route 2: gateway, node 2, node 4). The gateway initiates the NWK-Ctrl network configuration process to the node 4 through the node 2, sends a binding SID address and an NWKID confirmation network access through the MAC address of the node 4, and the node 4 replies the confirmation.
Thus, the construction of the second-level network, that is, the construction of the two-level network, is completed.
Fig. 4 and 5 illustrate an example of network maintenance process according to the present invention, which analyzes an example of network maintenance with 4 nodes.
Wherein the network link is shown in a topological graph, the gateway is in communication with nodes 1 and 2, the node 1 is in communication with nodes 3 and 4, and the node 2 is in communication with nodes 3 and 4. And analyzing how to maintain the network after the lost nodes 2 and 4 of the network are lost, and meanwhile, re-accessing the lost nodes. The network maintenance process is initiated by the gateway, the gateway initiates PTE, the node 2 replies the preamble, and the node 1 does not participate in the PTE because of network access. And the gateway initiates T-Query handshake, sends time difference information, matches with the node 2 and acquires the MAC address. And the gateway initiates an NWK-Ctrl network configuration process to the node 1 according to the accessed network node list, prolongs the survival period of the node 1 and replies confirmation to the node 1. The gateway initiates a NWK-Ctrl network configuration process according to the channel quality condition in the T-Query handshake stage, sends a binding SID address and NWKID confirmation network access through the MAC address of the node 2, and the node 2 replies confirmation. Thus, the maintenance of the first-level network is completed.
The gateway initiates a P beacon to the node 1, the node 1 initiates PTE after receiving, the node 4 replies a preamble, the node 1 replies the time difference information to the gateway, and the node 3 does not participate in the PTE due to network access. And the gateway initiates T-Query handshake, the node 1 initiates T-Query handshake after receiving the time difference information, matches with the node 4, acquires the MAC address and replies to the gateway.
The gateway initiates a P beacon to the node 2, the node 2 initiates PTE after receiving, the node 4 replies a preamble, the node 2 replies the time difference information to the gateway, and the node 3 does not participate in the PTE due to network access. And the gateway initiates T-Query handshake, the node 2 initiates T-Query handshake after receiving the time difference information, matches with the node 4, acquires the MAC address and replies to the gateway.
And the gateway initiates an NWK-Ctrl network configuration process to the node 3 through the node 1 according to the accessed network node list, prolongs the survival period of the node 3 and replies confirmation to the node 3. The gateway selects route 2 as the communication route according to the communication channel quality with node 4 twice (route 1: gateway, node 1, node 4; route 2: gateway, node 2, node 4). The gateway initiates the NWK-Ctrl network configuration process to the node 4 through the node 2, sends a binding SID address and an NWKID confirmation network access through the MAC address of the node 4, and the node 4 replies the confirmation.
Thus, the maintenance of the second-level network, that is, the maintenance of the two-level network, is completed.
Claims (10)
1. A preamble-based ad hoc network access method, comprising:
the master node initiates a preamble time exchange process to acquire the time difference between receiving the PTE preamble and replying the PTE preamble by the slave node;
the master node initiates a leader T-Query process, sends a data packet containing time difference to the slave node replying PTE leader, and receives feedback information of the slave node;
and the master node initiates a NWK-Ctrl network configuration process, and allocates an address for the slave node according to the feedback information of the slave node, so that the slave node is accessed.
2. The preamble-based ad hoc network access method according to claim 1, wherein: in the process of preamble time exchange, the slave node receiving the PTE preamble replies to the PTE preamble in a competition access mode and records the time difference between receiving the PTE preamble and replying the PTE preamble.
3. The preamble-based ad hoc network access method according to claim 1, wherein:
the PTE preamble sequentially comprises a SYNCP, a SYNCP empty position, a SYNCP and a SYNCP empty position; the data transmission preamble includes four SYNCPs;
alternatively, the PTE preamble includes two SYNCPs and two SYNCMs, and the data transmission preamble includes three SYNCPs and one SYNCM.
4. The preamble-based ad hoc network access method according to claim 1, wherein in the preamble time exchange process,
the master node transmits a PTE preamble directly to the slave node,
or the master node transmits the PTE preamble to the slave node through a relay node directly connected with the slave node in communication.
5. A preamble-based ad hoc network access method according to claim 4, wherein said master node causes said relay node to transmit a PTE preamble to said slave node by transmitting a P beacon to said relay node.
6. The preamble-based ad hoc network access method of claim 1, wherein in a preamble T-Query process, if a time difference in a data packet sent by the master node is consistent with a time difference recorded by a slave node, the slave node sends feedback information to the master node; if the slave node is not accessed, the feedback information includes the MAC address of the slave node and does not include the SID address.
7. The preamble-based ad hoc network access method of claim 1, wherein during NWK-Ctrl network configuration, the master node determines whether a slave node has accessed, and if not, the master node assigns a SID address to the slave node and sends the SID address to the slave node, so that the slave node binds the SID address and a MAC address to implement access.
8. The preamble-based ad hoc network access method of claim 1, wherein the master node is a gateway, the slave nodes are primary nodes directly connected to the master node, and the master node constructs a primary node network according to channel quality.
9. The preamble-based ad hoc network access method of claim 8, wherein in a multi-level network, for any node to be accessed with more than two levels, the master node uses the node as a slave node, uses a network node at the previous level of the node as a relay node, and constructs a node network according to channel quality.
10. The preamble-based ad hoc network access method according to claim 1, wherein after the slave node accesses, a heartbeat cycle is set for network maintenance, and if a heartbeat signal is not received after exceeding the heartbeat cycle, the network is automatically quitted; and the master node prolongs the survival period of the slave nodes through an NWK-Ctrl network configuration process.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110265130.8A CN112929950B (en) | 2021-03-11 | 2021-03-11 | Self-organizing network access method based on preamble |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110265130.8A CN112929950B (en) | 2021-03-11 | 2021-03-11 | Self-organizing network access method based on preamble |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112929950A true CN112929950A (en) | 2021-06-08 |
| CN112929950B CN112929950B (en) | 2023-03-17 |
Family
ID=76172660
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110265130.8A Active CN112929950B (en) | 2021-03-11 | 2021-03-11 | Self-organizing network access method based on preamble |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112929950B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070064692A1 (en) * | 2005-08-23 | 2007-03-22 | Zhouyue Pi | Method and apparatus for providing addressing in a multi-carrier communication system |
| CN101374082A (en) * | 2007-08-24 | 2009-02-25 | 浙江工商大学 | Single bus sensor network protocol |
| CN102378302A (en) * | 2010-08-12 | 2012-03-14 | 华为技术有限公司 | Network access method and system |
| EP2667675A1 (en) * | 2011-09-26 | 2013-11-27 | Huawei Technologies Co., Ltd. | Method and user equipment for ensuring parallel data random access |
| EP3167663A1 (en) * | 2014-07-07 | 2017-05-17 | Nokia Solutions and Networks Oy | Secondary cell group configuration |
| CN106686651A (en) * | 2016-12-09 | 2017-05-17 | 南京邮电大学 | Random access control method of M2M terminal grouping based on energy state awareness |
| US20180007590A1 (en) * | 2015-01-13 | 2018-01-04 | Telefonaktiebolaget Lm Ericsson (Publ) | Network node, wireless device and method for use in a random access procedure therebetween in a cell of the network node |
| CN108391319A (en) * | 2017-02-03 | 2018-08-10 | 华为技术有限公司 | A kind of method and its device sending random access guiding |
-
2021
- 2021-03-11 CN CN202110265130.8A patent/CN112929950B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070064692A1 (en) * | 2005-08-23 | 2007-03-22 | Zhouyue Pi | Method and apparatus for providing addressing in a multi-carrier communication system |
| CN101374082A (en) * | 2007-08-24 | 2009-02-25 | 浙江工商大学 | Single bus sensor network protocol |
| CN102378302A (en) * | 2010-08-12 | 2012-03-14 | 华为技术有限公司 | Network access method and system |
| EP2667675A1 (en) * | 2011-09-26 | 2013-11-27 | Huawei Technologies Co., Ltd. | Method and user equipment for ensuring parallel data random access |
| EP3167663A1 (en) * | 2014-07-07 | 2017-05-17 | Nokia Solutions and Networks Oy | Secondary cell group configuration |
| US20180007590A1 (en) * | 2015-01-13 | 2018-01-04 | Telefonaktiebolaget Lm Ericsson (Publ) | Network node, wireless device and method for use in a random access procedure therebetween in a cell of the network node |
| CN106686651A (en) * | 2016-12-09 | 2017-05-17 | 南京邮电大学 | Random access control method of M2M terminal grouping based on energy state awareness |
| CN108391319A (en) * | 2017-02-03 | 2018-08-10 | 华为技术有限公司 | A kind of method and its device sending random access guiding |
Non-Patent Citations (2)
| Title |
|---|
| 李辉, 《中国优秀博硕士学位论文全文数据库 (硕士)》 * |
| 熊轲等: "基于分簇的Ad Hoc网络媒体接入控制协议C-USAP", 《北京交通大学学报》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112929950B (en) | 2023-03-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108401041B (en) | Dual-mode heterogeneous network networking communication method for power information acquisition system | |
| CN110572187B (en) | Networking method for broadband power line communication network | |
| EP1592177B1 (en) | Method and system for communication between coordinator-based wireless networks | |
| US7443822B2 (en) | Method for multihop routing for distributed WLAN networks | |
| US6590928B1 (en) | Frequency hopping piconets in an uncoordinated wireless multi-user system | |
| CN103220788B (en) | Method, node and the access point that node is grouped | |
| US7391789B2 (en) | Ad-hoc network wireless communication system and method thereof | |
| CN111970030B (en) | Signal transmitting method of broadband carrier communication network | |
| KR100585327B1 (en) | Method for adaptively reassigning addresses of nodes according to changes in volumn of wireless network | |
| CN110661551B (en) | Method for adaptively adjusting beacon period time slot number | |
| CN109788444B (en) | Node networking method applied to high-density multi-hop network | |
| KR101413777B1 (en) | TDMA frame structure of Ad-Hoc network and dynamic time slot assignment method using the same | |
| JP2015056893A (en) | Method and device for time-slot allocation | |
| CN112929950B (en) | Self-organizing network access method based on preamble | |
| CN110351885A (en) | Wireless distributed contract network chance channel access method based on threshold metric | |
| Shi et al. | A preamble-based MAC mechanism in ad-hoc network | |
| CN107454652A (en) | GSM based on wireless self-organization network | |
| CN214380929U (en) | Gateway equipment for connecting Internet of things sensing equipment and electric power information acquisition equipment | |
| CN114745613A (en) | Meter reading method for broadband carrier network | |
| CN106131970B (en) | Protocol sequence channel access algorithm based on feedback | |
| Kanzaki et al. | An efficient TDMA slot assignment protocol in mobile ad hoc networks | |
| LU501337B1 (en) | Underwater Broadcast Transmission Method Based on Hierarchy and State | |
| Shih et al. | Rhythm: Achieving scheduled WiFi using purely distributed contention in WLANs | |
| Clausen et al. | A simple address autoconfiguration mechanism for OLSR [MANET Routing Protocol] | |
| Ni et al. | Non-saturated performance analysis of IEEE 802.11 broadcast in 2-D mobile ad hoc networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |