CN103237321A - Physical layer channel analog method for testing network protocol stacks - Google Patents
Physical layer channel analog method for testing network protocol stacks Download PDFInfo
- Publication number
- CN103237321A CN103237321A CN201310166641XA CN201310166641A CN103237321A CN 103237321 A CN103237321 A CN 103237321A CN 201310166641X A CN201310166641X A CN 201310166641XA CN 201310166641 A CN201310166641 A CN 201310166641A CN 103237321 A CN103237321 A CN 103237321A
- Authority
- CN
- China
- Prior art keywords
- message
- macpdu
- physical layer
- node
- dummy node
- 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.)
- Pending
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention belongs to the technical field of mobile communication, and particularly relates to a physical layer channel analog method for testing network protocol stacks. Simultaneous operation of a plurality of peer-to-peer software protocol stacks can be supported when practically applied PHY (physical layer) layer software entity is separated by establishing a plurality of pairs of transreceiving message queues, stimulating system interrupt, stimulating interface and message conversion mechanisms between MAC (Media Access Control) and PHY, and spatial topological distribution of a plurality of virtual nodes is realized. The retransmission of messages between the virtual nodes is realized by the response of the analog physical layer to upper software protocol stack messages so as to finish the interaction of messages among the virtual nodes, and a reference basis can be provided for performance evaluation and function adjustment of the protocol stacks. The method has the beneficial effects that multi-point communication analog on a single machine platform can be realized, multi-platform multi-point analog also can be realized, and large-scale networking testing can be performed on the function and performance of the protocol stacks under the condition of being separated from the physical layer platform, so that the development cost is reduced, and the development efficiency of products is improved.
Description
Technical field
The present invention relates to wireless communication technology field, relate in particular to a kind of physical layer channel analogy method for the test of network software protocol stack.
Background technology
In network protocol stack, MAC layer and PHY layer are finished data dispatch and signal and are handled by primitive interacting message information.The MAC layer has just determined the function of physical layer (PHY) initialized the time, and provides the channel control information by the MAC/PHY interface in each frame.
Protocol stack is as a kind of delamination software aggregate, and is relatively independent between each layer.In the equipment development process, protocol stack and hardware platform may be developed simultaneously, and perhaps protocol stack is finished the basic function exploitation prior to hardware platform, at this moment, owing to there is not physical platform, can't carry out deep detection to protocol function and performance.
Current existing simulation software is often based on the ideal situation modeling, and is deep not enough to the measuring ability of Details Of Agreement, and in addition, simulation software ubiquity model transplants difficulty, to deficiencies such as the complex protocol support are not enough.
Summary of the invention
The objective of the invention is in order to realize breaking away from protocol stack function and the performance test of physical layer platform, thereby reduce development risk, reduce development cost, and solve the deficiency that general simulation software can't the detection protocol details by the interface conversion definition.
The software protocol stack physical layer that the present invention proposes and analogue system and the method for channel space comprise virtual transceiver channel, break simulation device and message parse transponder.Can communicate by letter between a plurality of dummy nodes of identical platform simulation, by the simulation to bottom stack, the function on check protocol stack upper strata realizes.
Virtual transceiver channel: virtual transceiver channel analog physical layer is to the data transmit-receive interface of MAC, and the MAC data send to the passage of sending out of this node correspondence, and the physical layer channel analogue system sends to corresponding receipts passage by resolving and decision-making with data.
The break simulation device: in real system, physical layer produces interrupts, and the control upper layer data is received and dispatched opportunity, in this physical layer analogue system, interrupts taking place by the timer simulation, and the timer reset cycle is frame length.
The message parse transponder: the message parse device is by separating control or the data-message that the parsing MAC layer sends, the acknowledge message type is if control message is the reception message structure with message conversion, and according to topology information, data are transmitted to a corresponding hop neighbor node; If data-message then according to the routing iinformation of network, sends the data to the next-hop node of routing table correspondence.
Physical layer channel analogue system job step of the present invention comprises:
Steps A: the physical layer channel analogue system starts, and reads topological scene configuration file, and the dummy node topology rule is set, and prepares follow-up parsing message and transmits message;
Step B: initialization receives message queue, and for each dummy node, according to node number, assignment messages formation and initialization used_flag are 0;
Step C: initialization sends message queue, and for each dummy node, according to node number, assignment messages formation and initialization used_flag are 0;
Step D: the initiation message treatment progress, wait for that sending message queue from dummy node receives and handle the message that it sends, after sending message queue and receiving message, generate corresponding response message and be sent to corresponding dummy node and receive message queue.
Treatment progress for described step D may further comprise the steps:
Step D1: data receive treatment progress and start;
Step D2: wait-semaphore, obtain semaphore after, travel through each dummy node and send message queue;
Step D3: message queue is not empty, enters step D4; Otherwise, if do not traveled through, get back to step D2, if traveled through, enter step D16;
Step D4: send message queue from dummy node and receive message;
Step D5: if receive successfully, enter step D6, otherwise get back to step D2;
Step D6: resolve message header, judge that according to type of message (MSG_TYPE) message is control message or data-message, if control message enters step D7, otherwise enters step D11;
Step D7: beginning control message processing;
Step D8: number obtain the informed source node according to message queue;
Step D9: the control message MACPDU.req that dummy node is sent carries out analyzing and processing, and conversion generates MACPDU.ind message;
Step D10: according to informed source node number and topological scenario definition, determine the neighbor node that message need be transmitted, send MACPDU.ind message to the corresponding neighbours' dummy node that generates and receive message queue, enter step D15;
Step D11: beginning deal with data message;
Step D12: number obtain the informed source node according to message queue;
Step D13: the data-message MACPDU.req that dummy node is sent carries out analyzing and processing, and conversion generates MACPDU.ind message;
Step D14: according to message destination node number, check local routing table, according to the next-hop node of routing table decision message, send the MACPDU.ind message that generates and jump dummy node to corresponding next and receive message queue, enter step D15;
Step D15: dispose, discharge corresponding dummy node and send the shared internal memory of just having handled in the message queue of message, empty this formation, get back to step D2;
Step D16: if formation has traveled through, the event that enters is waited for, waits for that new message arrives, and is triggered if event is blocked, and gets back to step D2 and travels through the transmission message queue again.
For receiving message process among described step D9 or the D13, may further comprise the steps:
Step D91: prepare to resolve conversion PDU.req message;
Step D92: the quantity of obtaining PDU among the PUD. req;
Step D93: obtain among the PDU.req PDU size always;
Step D94: according to the total size of PDU and PDU quantity, and physical message head, PDU.ind head and the sub-head of PDU.ind, calculate the PDU.ind size that needs generation;
Step D95: storage allocation is given PDU.ind, prepares to fill;
Step D96: fill the physics head, comprise configuration ID (config_id), physical I D(phy_id), type of message (msg_type), message-length (msg_len) information;
Step D97: fill the PDU.ind head, comprise error code (err_code) and frame number (frame_num), burst number (burst_num), regional number (zone_num), PDU quantity (pdu_num) and channel condition information;
Step D98: judging whether PDU fills finishes, if enter step D911, otherwise enter step D99;
Step D99: fill the sub-head of PDU.ind;
Step D910: copy PDU gets back to step D98 then in PDU.ind from PDU.req;
Step D911: return PDU.ind message;
Step D912: message analysis EOC.
For receiving message process among described step D10 or the D14, may further comprise the steps:
Step D101: prepare to begin to send Message Processing;
Step D102: generate MagqNode;
Step D103: the PDU.ind that step D911 generates is pointed in the msg territory of MagqNode;
Step D104: the reception message queue that MagqNode is added corresponding dummy node reads use for dummy node;
Step D105: send the end of message.
Useful technique effect of the present invention is: can realize the multi-point simulation on the unit platform, also can realize multi-platform multiple spot simulation, can under disengaging physical layer platform situation, carry out the large-scale network-estabilishing checking to protocol stack function and performance, thereby reduce development cost, improve product development efficiency.
Description of drawings
Fig. 1 is actual MESH node protocol stack and analogue system comparison diagram.
Fig. 2 is the process chart that dummy node and analogue system reach analogue system alternately.
Fig. 3 is analogue system initialization procedure figure.
Fig. 4 is analogue system reception dummy node message and the procedure chart that processes conversion.
Fig. 5 is that analogue system is to the flow path switch figure of message.
Fig. 6 is that analogue system sends message to the procedure chart of dummy node.
Fig. 7 is certain topology process of simulation system forwards virtual node information down.
Fig. 8 is certain topology route control message repeating process down.
Embodiment
In order to make purpose of the present invention, technical scheme and advantage clearer, below in conjunction with drawings and Examples, the PHY layer of a kind of MESH protocol stack of the present invention and analogue system and the method for channel space are elaborated.
Please refer to Fig. 1, Fig. 1 (a) is the actual node protocol stack structure, and Fig. 1 (b) is analogue system lower node protocol stack structure, and analogue system is mainly simulated the PHY layer function, and dummy node is formed certain predetermined topology in channel space.The MAC on analogue system and protocol stack upper strata is mutual, finishes the information interchange between the dummy node.
Please refer to Fig. 2, this figure has described the mutual and analogue system of dummy node and analogue system to the handling process of message.
Dummy node sends and receives by sending message queue and receiving the message queue analogue data, analogue system obtains the MACPDU.req message of dummy node by the transmission message queue that reads corresponding dummy node, response according to the MAC of PHY generates MACPDU.ind message again, and according to the content of MACPDU.req message, the topological setting or routing iinformation, this MACPDU.ind message is put into the reception message queue of corresponding dummy node.By these operations, just can form topology and interactive information as real node between the dummy node, form the MESH network.
Step S2.0: the initialization analogue system, wait and dummy node are mutual;
Step S2.1: dummy node generates MACPDU.req and is sent to corresponding transmission message queue;
Step S2.2: the physical layer channel analogue system receives MACPDU.req message;
Step S2.3: the physical layer channel analogue system is handled the message that receives;
Step S2.4: the physical layer channel analogue system generates PDU.ind message according to the analyzing and processing of MACPDU.req, and which dummy node this is transmitted to judge this message according to message content;
Step S2.5: MACPDU.ind message is done interference handle and transmit according to topology;
Step S2.6: the physical layer channel analogue system is put into the reception message queue with MACPDU.ind message, obtains for dummy node;
Step S2.7: dummy node reads MACPDU.ind message from receiving message queue, finishes the mutual of dummy node and analogue system.
Please refer to Fig. 3, this is PHY layer and the analogue system of channel space and the analogue system initialization procedure figure of method of MESH protocol stack of the present invention.May further comprise the steps:
Step S3.1: analogue system starts, and reads the topology definition configuration file, and the dummy node topology rule is set, and prepares follow-up parsing message and transmits message;
Step S3.2: initialization receives message queue, and for each dummy node, according to node number, assignment messages formation and initialization used_flag are 0;
Step S3.3: initialization sends message queue, and for each dummy node, according to node number, assignment messages formation and initialization used_flag are 0;
Step S3.4: start treatment progress, wait for that receiving the message of sending from dummy node transmission message queue also handles, and generates the reception message queue that response message is sent to corresponding target dummy node.
Please refer to Fig. 4, this figure has described the message of analogue system reception dummy node transmission and has processed the process of conversion, may further comprise the steps:
Step S4.1: data receive handles beginning;
Step S4.2: wait-semaphore, this semaphore are passed through the break simulation timer and are produced, and are used for analog physical layer and interrupt, and dummy node is had no progeny in obtaining to be somebody's turn to do, and data are sent to transmit queue; The physical layer analogue system is had no progeny in obtaining to be somebody's turn to do, and enters next step;
Step S4.3: travel through each dummy node and send message queue, if do not traveled through, enter step S4.4, otherwise get back to step S4.2;
Step S4.4: send message queue from dummy node and receive message;
Step S4.5: if receive successfully, enter step S4.6, otherwise get back to step S4.3;
Step S4.6: judge that message is control message or data-message, if control message enters step S4.7, otherwise enters step S4.11;
Step S4.7: beginning control message processing;
Step S4.8: number obtain the informed source node according to message queue;
Step S4.9: the control message MACPDU.req that dummy node is sent carries out analyzing and processing, and conversion generates MACPDU.ind message;
Step S4.10: according to informed source node number and topology definition, send MACPDU.ind message to the corresponding target dummy node that generates and receive message queue, enter step S4.16;
Step S4.11: beginning deal with data message;
Step S4.12: number obtain the informed source node according to message queue;
Step S4.13: the data-message MACPDU.req that dummy node is sent carries out analyzing and processing, and conversion generates MACPDU.ind message;
Step S4.14: obtain destination node according to informed source node number and message header, obtain next hop address by routing inquiry, successfully enter step S4.15, otherwise forward step S4.16 to;
Step S4.15: send MACPDU.ind message to the corresponding next-hop node that generates and receive message queue, enter step S4.16;
Step S4.16: dispose, discharge corresponding dummy node and send the shared internal memory of just having handled in the message queue of message, empty this formation; Get back to the transmission message queue that step S4.2 continues other dummy nodes of traversal.
Please refer to Fig. 5, it is step S4.9 or step S4.13 among Fig. 4 to the flow path switch of message that this figure describes analogue system in detail, may further comprise the steps:
Step S5.1: prepare to resolve conversion MACPDU.req message;
Step S5.2: the quantity of obtaining PDU among the MACPUD. req;
Step S5.3: obtain among the MACPDU.req PDU size always;
Step S5.4: according to the total size of PDU and PDU quantity, and physical message head, MACPDU.ind head and the sub-head of MACPDU.ind, calculate the MACPDU.ind size that needs generation;
Step S5.5: storage allocation is given MACPDU.ind, prepares to fill;
Step S5.6: fill the physics head, comprise configuration ID config_id, physical I D phy_id, type of message msg_type, message-length msg_len information;
Step S5.7: fill the MACPDU.ind head, comprise error code err_code and frame number frame_num, burst burst_num, regional number zone_num, PDU quantity pdu_num and rssi, cinr, snr information;
Step S5.8: judging whether MACPDU fills finishes, if enter step S5.11, otherwise enter step S5.9;
Step S5.9: fill the sub-head of MACPDU.ind;
Step S5.10: copy PDU gets back to step S5.8 then in MACPDU.ind from MACPDU.req;
Step S5.11: return MACPDU.ind message;
Step S5.12: message analysis EOC.
Please refer to Fig. 6: this figure has described analogue system and has converted and send message to the process of dummy node after the message, i.e. step S4.10 and step S4.14 among Fig. 4 may further comprise the steps:
Step S6.1: prepare to begin to send Message Processing;
Step S6.2: generate MagqNode;
Step S6.3: the MACPDU.ind that step S5.11 generates is pointed in the msg territory of MagqNode;
Step S6.4: the reception message queue that MagqNode is added corresponding dummy node reads use for dummy node;
Step S6.5: send the end of message.
With reference to Fig. 7, for topology shown in Fig. 7 (a), if dummy node A will be to dummy node C communication, data-message is at flow process such as Fig. 7 (b) of analogue system:
Step S7.1: it is B that dummy node A obtains next-hop node according to local routing iinformation, and then the information with destination node C and next-hop node B is encapsulated in route header;
Step S7.2: the data message that will have the route head mails to analogue system;
Step S7.3: analogue system is resolved according to route header, and next the jumping route that obtains arrival node C is Node B, then transmits this information and gives dummy node B;
Step S7.4: dummy node B receives post analysis information, new routing information more, and this message mail to analogue system again, analogue system is resolved according to message header, transmits this information and gives dummy node C;
Step S7.5: after dummy node C received information, return information was given source node A if desired, and then it generates and replys information and sending to analogue system; The analogue system message processing procedure is identical with the process that source node A sends data to C; Data flow is from C-〉B-〉A.
For control message, analogue system is transmitted according to topological scenario definition, and the needs according to this control message is transmitted are transmitted to one, an a plurality of or whole hop neighbor node with it.
With reference to Fig. 8, for example, under topology shown in Fig. 8 (a), dummy node C wants route messages of the whole network broadcasting, and treatment step is shown in Fig. 8 (b).
Step S8.1: dummy node C sends to routing iinformation the transmission message queue of this node correspondence in the physical layer analogue system;
Step S8.2: the physical layer analogue system receives this message;
Step S8.3: the physical layer analogue system is according to topological scenario definition, and this routing iinformation is transmitted to hop neighbor B and the D of node C;
Step S8.4: after dummy node B and dummy node D receive this message, handle rules according to route messages, determine whether to continue to transmit this message, transmit as need, then enter step S8.5, otherwise enter step S8.6;
Step S8.5: after analogue system is received the route messages of B forwarding, this message is transmitted to a hop neighbor A, C, the D of Node B according to topology definition; Equally, analogue system is transmitted to dummy node B, C according to topology definition with this information after receiving the route messages of D forwarding.Until expanding to the whole network;
Step S8.6: route control message sends and finishes.
It is pointed out that the MAC layer must flood to avoid message the information filtering that repeats to receive in network.Divide according to network layer, this function does not realize in the physical layer analogue system.
Claims (9)
1. one kind is used for the physical layer channel analogy method that network protocol stack is tested, it is characterized in that, by the simulation of software form realization to physical layer channel, to the software protocol stack that lacks available physical layer hardware platform or need large-scale network-estabilishing to test, this analogue system can be carried out interacting message with a plurality of dummy nodes, realize the communication simulation between dummy node, check software protocol stack function;
Described dummy node comprises media access control layer and routing subsystem, media access control layer and routing subsystem; Both can simulate a plurality of dummy nodes at unit, also can be at a plurality of dummy nodes of the multi-platform simulation of multimachine;
Described physical layer analogue system comprises that network topology scene setting, data transmit-receive passage, break simulation and message parse transmit four parts; Dummy node produces medium access and route control message, after sending to the analog physical layer channel system, the analog physical layer channel system is finished message parse, finishes data according to topological scene setting and transmits, thereby reach the purpose of controlling message with other dummy nodes alternately; After data-message arrives the analog physical layer system by dummy node, the analog physical layer system by message parse conversion and routing iinformation determine message flow to, and be forwarded to the receive path of corresponding dummy node, thereby finish the data communication between dummy node.
2. according to the described physical layer channel simulation of claim 1, it is characterized in that, the physical layer channel analogue system can be simulated the communication under the different topology scene, the network scenarios setting is finished by the form that reads parameter list, parameter list is described network size and topology definition, topology definition is used for the scope of direct communication between the constraint dummy node, determines transponder to the forwarding behavior of control message; During the initialization of physical layer channel analogue system, at first read this parameter list, obtain the topology setting of whole network.
3. according to the described physical layer channel simulation of claim 1, it is characterized in that, the physical layer channel analogue system realizes the simulation of data transmit-receive passage by a series of message queues, the physical layer channel analogue system safeguards that MAX_NODE_NUM is to sending message queue and receiving message queue, system is that the dummy node of each loading is safeguarded " descending transmission " and " up reception " message queue, MAX_NODE_NUM is the network maximum node number, according to network size appointment is set.
4. according to the described dummy node of claim 1, it is characterized in that, actual physical layer platform can produce interruption, and node can interrupt finishing data transmit-receive according to physical layer, for the physical layer channel analogue system, physical layer interrupts realizing by the timer simulation, the timer expiry duration is set to system's frame length, and timer expiry namely produces interrupt signal, and dummy node carries out data transmit-receive according to this interrupt signal, timer is reset after producing interrupt signal immediately, to simulate next interruption.
5. physical layer channel analogue system message parse forwarding capability according to claim 1, it is characterized in that, system cycle from message queue, read data-message, and message carried out dissection process, if message needs to transmit, then according to protocol requirement, the PDU transmission request MACPDU.req primitive that dummy node is sent is converted to PDU indication MACPDU.ind primitive response message, and under defined topological constraints, send to the corresponding virtual node by the control transponder.
6. the described physical layer channel analogy method of claim 1, its workflow is as follows:
Steps A: analogue system starts, and reads the topology definition configuration file, makes up the network topological information table according to configuration file;
Step B: initialization receives and sends message queue, for each dummy node, according to node number, distributes to send and receive message queue and initialization;
Step C: initiation message processing forward process, the poll dummy node sends message queue, if all send message queue is empty, then enter the event wait state, wait for that transmit queue is not empty or interrupts arriving, to start polling procedure again, if the transmission message queue is not empty, handles the message in this transmission message queue, and generate response message, if control message, send to the reception message queue of corresponding dummy node according to topological structure; If data-message, next is jumped according to route querying, and is sent to the reception message queue of corresponding next jumping dummy node.
7. for the treatment progress of the described step C of claim 6, it is characterized in that, may further comprise the steps:
Step C1: wait for receiving the semaphore that simulation is interrupted;
Step C2: receive the semaphore that simulation is interrupted;
Step C3: travel through each dummy node and send message queue;
Step C4: it is not empty sending message queue, enters step C5; Otherwise, if do not traveled through, enter step C3, traveled through as formation, get back to step C1;
Step C5: judge that message is control message or data-message, if control message enters step C6, otherwise enters step C9;
Step C6: number obtain the informed source node according to message queue;
Step C7: the control message MACPDU.req that dummy node is sent carries out analyzing and processing, and conversion generates MACPDU.ind message;
Step C8: according to informed source node number and topology information, the MACPDU.ind message that generates is sent to the corresponding virtual node receives message queue, enter step C13;
Step C9: number obtain the informed source node according to message queue;
Step C10: the data-message MACPDU.req that dummy node is sent carries out analyzing and processing, and conversion generates MACPDU.ind message;
Step C11: according to informed source node number and destination node number, check routing iinformation, find corresponding next-hop node, send the MACPDU.ind message that generates and jump dummy node to corresponding next and receive message queue, enter step C12;
Step C12: discharge the shared internal memory of just having handled of message, empty this formation; Get back to step C3.
8. for message conversion process among the described step C7 of claim 7 or the C10, may further comprise the steps:
Step C71: resolve the MACPDU.req message header;
Step C72: the quantity of obtaining PDU among the PUD. req;
Step C73: obtain among the MACPDU.req PDU size always;
Step C74: according to the total size of MACPDU and MACPDU quantity, and physical message head, MACPDU.ind head and the sub-head of MACPDU.ind, calculating needs the size of the MACPDU.ind of generation;
Step C75: storage allocation is given MACPDU.indication, prepares to fill;
Step C76: fill the physics head, comprise configuration ID config_id, physical I D phy_id, type of message msg_type, message-length msg_len;
Step C77: fill the MACPDU.ind head, comprise error code err_code, frame number frame_num, burst burst_num, regional number zone_num, PDU quantity pdu_num and channel condition information;
Step C78: judging whether MACPDU fills finishes, if enter step C711, otherwise enter step C79;
Step C79: fill the sub-head of MACPDU.ind, comprise that side-play amount pdu_offset, sub-pdu length sub_pdu_len, pdu indicate pdu_flag;
Step C710: copy PDU gets back to step C78 then in MACPDU.ind from MACPDU.req;
Step C711: return MACPDU.ind message;
Step C712: message conversion finishes.
9. for message repeating process among the described step C8 of claim 7 or the C11, may further comprise the steps:
Step C81: generate information node MagqNode;
Step C82: the message pointer field of MagqNode is pointed to the MACPDU.ind that step C711 generates;
Step C83: search the destination node that this MACPDU.ind message sends;
Step C84: with the reception message queue that MagqNode puts into corresponding dummy node, wait for that this dummy node reads;
Step C85: the message repeating process finishes.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201310166641XA CN103237321A (en) | 2013-05-08 | 2013-05-08 | Physical layer channel analog method for testing network protocol stacks |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201310166641XA CN103237321A (en) | 2013-05-08 | 2013-05-08 | Physical layer channel analog method for testing network protocol stacks |
Publications (1)
Publication Number | Publication Date |
---|---|
CN103237321A true CN103237321A (en) | 2013-08-07 |
Family
ID=48885331
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201310166641XA Pending CN103237321A (en) | 2013-05-08 | 2013-05-08 | Physical layer channel analog method for testing network protocol stacks |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN103237321A (en) |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104053178A (en) * | 2014-03-26 | 2014-09-17 | 清华大学 | Hardware simulation method of MANET network and network nodes |
CN104063425A (en) * | 2014-06-04 | 2014-09-24 | 五八同城信息技术有限公司 | Method for querying data through database middleware and database middleware |
CN109379248A (en) * | 2018-09-29 | 2019-02-22 | 上海金卓网络科技有限公司 | Protocol stack test macro and method |
CN111464398A (en) * | 2020-04-09 | 2020-07-28 | 上海金卓网络科技有限公司 | Self-organizing centreless network high-level protocol testing method, equipment and storage medium |
CN115314397A (en) * | 2022-08-05 | 2022-11-08 | 中科计算技术西部研究院 | Network simulation method, system, device and storage medium for distributed training |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101035348A (en) * | 2006-03-09 | 2007-09-12 | 中兴通讯股份有限公司 | Protocol software testing system and method |
CN101588272A (en) * | 2008-05-22 | 2009-11-25 | 中兴通讯股份有限公司 | Movable self-organization network test platform and method thereof |
CN102421112A (en) * | 2011-11-18 | 2012-04-18 | 展讯通信(上海)有限公司 | Testing method of mobile terminal, mobile terminal simulator, testing equipment and testing system |
-
2013
- 2013-05-08 CN CN201310166641XA patent/CN103237321A/en active Pending
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101035348A (en) * | 2006-03-09 | 2007-09-12 | 中兴通讯股份有限公司 | Protocol software testing system and method |
CN101588272A (en) * | 2008-05-22 | 2009-11-25 | 中兴通讯股份有限公司 | Movable self-organization network test platform and method thereof |
CN102421112A (en) * | 2011-11-18 | 2012-04-18 | 展讯通信(上海)有限公司 | Testing method of mobile terminal, mobile terminal simulator, testing equipment and testing system |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104053178A (en) * | 2014-03-26 | 2014-09-17 | 清华大学 | Hardware simulation method of MANET network and network nodes |
CN104063425A (en) * | 2014-06-04 | 2014-09-24 | 五八同城信息技术有限公司 | Method for querying data through database middleware and database middleware |
CN104063425B (en) * | 2014-06-04 | 2017-09-19 | 五八同城信息技术有限公司 | The method and database middleware of data are inquired about by database middleware |
CN109379248A (en) * | 2018-09-29 | 2019-02-22 | 上海金卓网络科技有限公司 | Protocol stack test macro and method |
CN111464398A (en) * | 2020-04-09 | 2020-07-28 | 上海金卓网络科技有限公司 | Self-organizing centreless network high-level protocol testing method, equipment and storage medium |
CN115314397A (en) * | 2022-08-05 | 2022-11-08 | 中科计算技术西部研究院 | Network simulation method, system, device and storage medium for distributed training |
CN115314397B (en) * | 2022-08-05 | 2023-07-21 | 中科计算技术西部研究院 | Network simulation method, system, device and storage medium for distributed training |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Chen et al. | Wireless networked multirobot systems in smart factories | |
CN103237321A (en) | Physical layer channel analog method for testing network protocol stacks | |
Dai et al. | Multi-armed bandit learning for computation-intensive services in MEC-empowered vehicular networks | |
Tung et al. | The generic design of a high-traffic advanced metering infrastructure using ZigBee | |
EP3496346B1 (en) | Data message forwarding method and apparatus | |
CN110431809A (en) | For in the mobile communication network on multilink allocation packets method and apparatus | |
CN109618373A (en) | Link choosing method and relevant apparatus | |
CN104579961B (en) | The dispatching method and device of data message | |
CN103118439B (en) | based on the data fusion method of sensor network node universal middleware | |
US10802885B2 (en) | Method and apparatus for data processing based on multicore | |
CN110139353A (en) | A kind of method and relevant apparatus of multi-access point AP coordinating transmissions | |
US20130055257A1 (en) | Communication method and communication apparatus | |
CN105791151B (en) | A kind of dynamic flow control method and device | |
CN104486167B (en) | The method of testing of concurrent network performance and network trend based on MESH network | |
CN103607737A (en) | Heterogeneous network service flow-dividing method and system | |
JP2009206560A (en) | Sensor data collection system and method, sensor network constructing device and method, program, and recording medium | |
CN102158977A (en) | Service class indication method, device and system | |
CN106851769A (en) | Method, the device of generation routing iinformation and determination transmission path | |
CN104363581B (en) | A kind of the determination method and relevant device of associated terminal | |
CN111683384B (en) | Network optimization method for realizing dynamic weighting of communication link by artificial intelligence | |
CN108123878A (en) | A kind of method for routing, device and data transfer equipment | |
CN107181628A (en) | Two-way wireless communication method, device and terminal | |
CN105722117B (en) | A kind of method for channel allocation and router of network communication of wireless sensor | |
CN110972162A (en) | Underwater acoustic sensor network saturation throughput solving method based on Markov chain | |
CN117459537B (en) | Multi-cloud-based device interaction method, device and readable storage medium |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20130807 |