CN105764107A - Wireless terminal and method of communication between wireless terminals - Google Patents

Wireless terminal and method of communication between wireless terminals Download PDF

Info

Publication number
CN105764107A
CN105764107A CN201610101142.6A CN201610101142A CN105764107A CN 105764107 A CN105764107 A CN 105764107A CN 201610101142 A CN201610101142 A CN 201610101142A CN 105764107 A CN105764107 A CN 105764107A
Authority
CN
China
Prior art keywords
node
routing table
nodes
local
entry
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
Application number
CN201610101142.6A
Other languages
Chinese (zh)
Inventor
吴飞鹏
陈姝
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
BEIJING ZHONGXIANG BIT TECHNOLOGY Co Ltd
Original Assignee
BEIJING ZHONGXIANG BIT TECHNOLOGY Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by BEIJING ZHONGXIANG BIT TECHNOLOGY Co Ltd filed Critical BEIJING ZHONGXIANG BIT TECHNOLOGY Co Ltd
Priority to CN201610101142.6A priority Critical patent/CN105764107A/en
Publication of CN105764107A publication Critical patent/CN105764107A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/74Address processing for routing

Abstract

The invention relates to a method of communication between wireless terminals, comprising the following steps: S1, a routing table is configured for each wireless terminal to be involved in communication, wherein each routing table includes a target node, a next-hop node and the routing distance; and S2, the wireless terminals forward a message based on the routing tables, wherein the message contains the information of a message receiving node. The invention further discloses a corresponding wireless terminal. The efficiency of connection before communication between communication individuals is improved, and barriers to two-side communication caused by spatial connection failure are overcome.

Description

A kind of means of communication between wireless terminal and wireless terminal
Technical field
The present invention relates to field of wireless communication, particularly relate to a kind of wireless terminal that can be direct-connected, further relate to the means of communication between a kind of wireless terminal.
Background technology
At some environment without the Internet, or can not use under the occasion of the Internet, also have communication need.Mobile equipment can rely on the wifi carried, p2p, bluetooth to communicate with one another.In this case requiring have between the mobile equipment of communication need and need to set up to connect, greatly waste the time, inconvenience spatially simultaneously is also possible to the connection restricted from each other.At this moment need exist for a kind of new mechanism to realize being mutually connected to each other between mobile equipment carrying out communication, such as: mobile device A is connected with mobile equipment B, mobile equipment B is connected with mobile equipment C, in this case, A and C can also carry out communication and not require that A and C must first set up connection.
Summary of the invention
For between mobile terminal under the premise not using the Internet, it is necessary to adopt point-to-point connection just can carry out the mode of communication, it is proposed that the means of communication that a kind of non-point-to-point connection realizes.
For achieving the above object, the invention provides the means of communication between a kind of wireless terminal, including: step S1, each wireless terminal for treating communication configures a routing table, and described routing table includes following information: destination node, down hop trochanterion and route distance;Step S2, described wireless terminal forwards message based on described routing table, includes message recipient node information in wherein said message.
The present invention also provides for a kind of wireless terminal, including: memorizer and routing table, described routing table stores in memory, and described routing table includes following information: destination node, down hop trochanterion and route distance;And wireless communication module, described wireless communication module is able to receive that message and forwards message based on described routing table, includes message recipient node information in wherein said message.
The present invention can in the Internet can not unobstructed time, will quickly realize the communication between all terminals by interconnection from head of the queue to tail of the queue between communication apparatus;When preventing the network information to be monitored, secrecy terminal can also be formed little net each other and carries out communication.Really think that the both sides of session communication first need not directly set up connection, and have only to search whether the other side can carry out communication in the network of oneself.
Accompanying drawing explanation
Fig. 1 is the flow chart of an embodiment of the means of communication between the wireless terminal of the present invention.
Fig. 2 is the link topology between the wireless terminal of the present invention.
Fig. 3 is the flow chart of another embodiment of the means of communication between the wireless terminal of the present invention.
Fig. 4 is the link topology of the wireless terminal in the embodiment shown in Fig. 3.
Fig. 5 is the flow chart of the further embodiment of the means of communication between the wireless terminal of the present invention.
Fig. 6 is the flow chart of the further embodiment of the means of communication between the wireless terminal of the present invention.
Fig. 7 is the link topology of the wireless terminal in the embodiment shown in Fig. 6.
Fig. 8 is the flow chart of the further embodiment of the means of communication between the wireless terminal of the present invention.
Fig. 9 is the flow chart of the further embodiment of the means of communication between the wireless terminal of the present invention.
Detailed description of the invention
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is clearly and completely described, it is clear that described embodiment is only a part of embodiment of the present invention, rather than whole embodiments.Based on the embodiment in the present invention, the every other embodiment that those of ordinary skill in the art obtain under not making creative work premise, broadly fall into the scope of protection of the invention.
As it is shown in figure 1, in step S1, each wireless terminal for treating communication configures a routing table, and described routing table includes following information: destination node, down hop trochanterion and route distance.Wherein,
Node: represent wireless terminal;
Destination node: represent that this node can send the node of information;Can be other all nodes, it is also possible to be other part of nodes;
Down hop trochanterion: represent information forward node.
Route distance: represent the node number the communication path from destination node to down hop trochanterion.If route distance is 0, then show that two nodes are direct-link node, it is possible to directly mutual messaging is without forwarding;Otherwise, two nodes are indirectly connected node, it is necessary to other nodes forward message.
Direct-link node: the route distance of two nodes is 0, is called direct-link node mutually.
In step S2, described wireless terminal forwards message based on described routing table, includes message recipient node information in wherein said message.
First embodiment (sends a message to a node)
One example of routing table is as in figure 2 it is shown, for node N1, the routing table of its storage includes a plurality of record, and every record is made up of destination node, down hop trochanterion and route distance.The routing table of node N1 currently has two records.
Article 1, record represents: node N1 can send information to node N2;When node N1 sends information to node N2, it does not have information forward node, namely node N1 and node N2 is direct-connected;Route distance between node N1 and node N2 is 0, namely need not forward by intermediate node during both communications.
Article 1, record represents: node N1 can send information to node N4;When node N1 sends information to node N4, it does not have information forward node, namely node N1 and node N4 is direct-connected;Route distance between node N1 and node N4 is 0, namely need not forward by intermediate node during both communications.
Article 3 record represents: node N1 can send information to node N3;When node N1 sends information to node N3, node N2 is information forward node, and namely node N3 connects node N1, another side connection node N2;Route distance between node N3 and node N2 is 1, namely needs an intermediate node to forward during both communications.
Based on above description, under current loop (N1-N2-N3) configures, can easily understand that the routing table of Fig. 2 interior joint N2 and node N3, no longer illustrate at this.
Thus, a communication network of each node composition.
Preferably, for communication efficiency problem, in described routing table, destination node number is not to be exceeded 300.It is highly preferred that route distance is less than 10.
Wireless terminal in step S2, communication loop utilizes described routing table wirelessly to carry out communication with other-end.Described wireless terminal has wireless communication module, and described wireless communication module can carry out data interaction based on modes such as bluetooth, infrared, wifi.
After having had routing table, message can be sent between each node, the process of a node messaging is described below.As it is shown on figure 3,
In step S11, for localized nodes X, pending messages for one, described pending messages in comprise destination node Y, localized nodes X and determine that destination node Y is localized nodes, then jump to step S12, otherwise jump to step S13.
In step S12, localized nodes X carries out Message Processing.
In step S13, localized nodes X inquires about the routing table of oneself.
Judge whether destination node Y and localized nodes X is direct-link node, if it is, jump to step S15, otherwise jumps to step S16 in step S14, localized nodes X.
In step S15, localized nodes X forwards the messages to destination node Y.
In the down hop trochanterion Z that step S16, localized nodes X then forward the messages in routing table in destination node Y correspondence entry.
Preferably, down hop trochanterion Z, as new localized nodes X ', repeats step S11-S16, until message reaches destination node Y.So realize passing on of message.
Second embodiment (sends a message to a node)
Replacing in embodiment at one, the example of routing table is as shown in Figure 4.With the first embodiment the difference is that, the information in the routing table of each node maintenance only records the direct-link node routing iinformation of oneself.
For node N1, the routing table of its storage includes a plurality of record, and every record is made up of destination node, down hop trochanterion and route distance.In the present embodiment, down hop trochanterion is empty, and route distance is 0.Node N1 and node N1, N4 are direct-connected.Based on above description, under current loop (N1-N2-N3) configures, can easily understand that the routing table of Fig. 2 interior joint N2 and node N3, no longer illustrate at this.Thus, a communication network of each node composition.
Information repeating process under this embodiment is described below.
After having had routing table, message can be sent between each node, the process of a node messaging is described below.As it is shown in figure 5,
In step S21, for localized nodes X, pending messages for one, wherein said pending messages in comprise destination node Y, localized nodes X and determine that destination node Y is localized nodes, then jump to step S22, otherwise jump to step S23.
In step S22, localized nodes X carries out Message Processing.
In step S23, localized nodes X inquires about the routing table of oneself.
Forward the messages to the destination node X ' in routing table in step S25, localized nodes X, be actually all direct-link nodes message being forwarded to localized nodes X.
Preferably, destination node X ', as new localized nodes, repeats step S21-S25, until message reaches destination node Y.So realize passing on of message.
3rd embodiment (increases and deletion of node)
In communication, another important aspect is the renewal of routing table, if increasing or deleting a node, it is important that how to carry out the renewal of routing table.Below based on the configuration scheme of the first embodiment shown in Fig. 2, when increase by one node is described in detail and deletes a node, how to update routing table.
Increase a node
As shown in Figure 6, in step S31, local node N1 judges that adding new node X actively adds as local or receive interpolation information from other nodes, if it is jumps to step S32, otherwise, jumps to step S36.
New route entry " (N--0) " is increased in the routing table in step S32, local node N1.It practice, local node N1 actively adds new node N, then acquiescence new node N is the direct-link node of local node N1.
Generating a new routing table in step S33, local node N1, this routing table includes: the down hop trochanterion in the former original entry of the routing table by local node N1 is set to local node N1 and adds 1 by route distance;Newly-increased entry " (N1--0) ".
In step S34, local node N1, described new routing table is sent to new node X.
In step S35, local node N1, new route entry " (XN11) " is sent the down hop trochanterion to the route entry of oneself former routing table.In a preferred embodiment, new route entry " (XN11) " is sent the direct-link node to the route entry of the former routing table of oneself by local node N1.
Preferably, in step S351, described down hop trochanterion adds the routing table of oneself to after receiving described new route entry;Down hop trochanterion in described new route entry is replaced by oneself, and route distance adds 1;Be then forwarded to oneself routing table route entry in down hop trochanterion.So, broadcast type updates the routing iinformation of all nodes.
Preferably, in step S352, described down hop trochanterion for the identical route entry of destination node in the routing table of oneself, the shortest one of reserved route distance.
Preferably, the down hop trochanterion in a certain route entry of the routing table of described down hop trochanterion is informed source node, then the route distance of this route entry needs to update.If not informed source node, then described down hop trochanterion is for the identical route entry of destination node in the routing table of oneself, the shortest one of reserved route distance.
In step S36, local node N1, the down hop trochanterion in this route entry is revised as oneself, route distance is added 1, send other nodes to oneself routing table.Preferably, routing iinformation source Nodes is not retransmited.
Fig. 7 shows the process in routing table update and after renewal.As it is shown in fig. 7, at no point in the update process, node N4 is likely to receive two new route entrys, node N4 can reserved route apart from minimum that, for instance retain node N1 (XN11) sent, cast out node N2 (XN22) sent
Basically, in described routing table, data more new regulation is, for the data received, if do not recorded in routing table, data is directly promoted in table.Preferably, when next-hop node is identical with destination node, or when next-hop node and sending node differ and distance just renewal less than 10.
Delete a node
For the topological structure shown in Fig. 7, the process deleting a node is described below.
As shown in Figure 8, actively delete in step S41, local node N1 decision node X for local or receive deletion information from other nodes, if it is jumping to step S42, otherwise, jump to step S44.
Deleting destination node in the routing table of oneself in step S42, local node N1 is the entry of nodes X, and down hop trochanterion is the entry of nodes X.
In step S43, the entry of deletion is sent to other nodes by local node N1, it is preferable that be sent to direct-link node.
In step S44, local node N1 delete target node is the entry of nodes X.Preferably, if deleting unsuccessful, then messaging is to informed source node.
In step S45, local node N1, the entry of deletion is sent to other nodes (being preferably direct-link node), it is preferable that remove informed source node.Preferably, if not comprising deletion of node X in the routing table of local node N1, then it is assumed that delete and arrived terminal, local routing table is sent the informed source node to the information of deletion by local node N1.
4th embodiment (search node)
Describe referring to Fig. 9 and how to search a node.
In step S51, it is judged that local node N1 this locality active searching nodes X, or receive search message from other nodes, if it is jump to step S52, otherwise jump to step S53.
In step S52, local node N1 sends search message to direct-link node.
Judging whether oneself is the destination node searched in step S53, local node N1, if it is jumping to step is S54, otherwise jumps to step S55.
In step S54, sending feedback message to informed source node, informed source node adds local node N1 to routing table after receiving described feedback message.
In step S55, local node N1 forwards search message to direct-link node.Preferably, local node N1 starts intervalometer simultaneously, when can not receive feedback message in the setting time, then it is assumed that can not find destination node to be searched.
On the other hand, the present invention also proposes a kind of wireless terminal.It has memorizer and routing table, and described routing table stores in memory.Described routing table includes following information: destination node, down hop trochanterion and route distance.
Described wireless terminal has: wireless communication module, and described wireless communication module is able to receive that message and forwards message based on described routing table, includes message recipient node information in wherein said message.Described wireless communication module can carry out data interaction based on modes such as bluetooth, infrared, wifi.
Described wireless communication module is capable of the flow process described in first to fourth embodiment noted earlier, is not described in detail in this.Embodiment described above, the simply present invention more preferably detailed description of the invention, the usual variations and alternatives that those skilled in the art carries out within the scope of technical solution of the present invention all should be included in protection scope of the present invention.

Claims (10)

1. the means of communication between a wireless terminal, it is characterised in that including:
Step S1, each wireless terminal for treating communication configures a routing table, and described routing table includes following information: destination node, down hop trochanterion and route distance, and described node represents a wireless terminal;
Step S2, described wireless terminal forwards message based on described routing table, includes message recipient node information in wherein said message.
2. the means of communication between wireless terminal according to claim 1, it is characterised in that described step S2 also includes:
Step S11, for localized nodes X, pending messages for one, described pending messages in comprise destination node Y, localized nodes X and determine that destination node Y is localized nodes, then jump to step S12, otherwise jump to step S13;
Step S12, localized nodes X carries out Message Processing;
Step S13, localized nodes X inquires about the routing table of oneself;
Step S14, localized nodes X judge whether destination node Y and localized nodes X is direct-link node, if it is, jump to step S15, otherwise jumps to step S16;
Step S15, localized nodes X forwards the messages to destination node Y;
Step S16, localized nodes X then forward the messages to the down hop trochanterion Z in routing table in destination node Y correspondence entry.
3. the means of communication between wireless terminal according to claim 1, it is characterised in that when needing to add a new node between described wireless terminal, also include:
Step S31, local node N1 judge that adding new node X actively adds as local or receive interpolation information from other nodes, if it is jumps to step S32, otherwise, jumps to step S36;
Step S32, local node N1 increase new route entry (N--0) in the routing table;
Step S33, local node N1 generate a new routing table, and this routing table includes: the down hop trochanterion in the former original entry of the routing table by local node N1 is set to local node N1 and adds 1 by route distance;Newly-increased entry (N1--0);
Described new routing table is sent to new node X by step S34, local node N1;
New route entry (XN11) is sent the down hop trochanterion to the route entry of oneself former routing table by step S35, local node N1;Preferably, new route entry is sent only to the direct-link node of local node N1, and step S5 includes:
Step S351, described down hop trochanterion adds the routing table of oneself to after receiving described new route entry;Down hop trochanterion in described new route entry is replaced by oneself, and route distance adds 1;Be then forwarded to oneself routing table route entry in down hop trochanterion;
Step S352, described down hop trochanterion for the identical route entry of destination node in the routing table of oneself, the shortest one of reserved route distance;
Down hop trochanterion in this route entry is revised as oneself by step S36, local node N1, adds 1 by route distance, sends other nodes to oneself routing table.
4. the means of communication between wireless terminal according to claim 1, it is characterised in that when needing to delete a node between described wireless terminal, also include:
Step S41, local node N1 decision node X actively delete for local or receive deletion information from other nodes, if it is jump to step S42, otherwise, jump to step S44;
It is the entry of nodes X that step S42, local node N1 delete destination node in oneself routing table, and down hop trochanterion is the entry of nodes X;
Step S43, the entry of deletion is sent to other nodes by local node N1, it is preferable that be sent to direct-link node;
Step S44, local node N1 delete target node is the entry of nodes X, it is preferable if delete unsuccessful, then messaging is to informed source node;
In step S45, the entry of deletion is sent to other nodes by local node N1, remove informed source node, preferably, the entry of deletion is sent only to direct-link node by local node N1, preferably, if not comprising deletion of node X in the routing table of local node N1, then local routing table is sent the informed source node to the information of deletion by local node N1.
5. the means of communication between wireless terminal according to claim 1, it is characterised in that when needing one node of search between described wireless terminal, also include:
Step S51, it is judged that local node N1 this locality active searching nodes X, or receive search message from other nodes, if it is jump to step S52, otherwise jump to step S53;
Step S52, local node N1 sends search message to direct-link node;
Step S53, local node N1 judge whether oneself is the destination node searched for, and if it is jumping to step is S54, otherwise jumps to step S55;
Step S54, sends feedback message to informed source node, and informed source node adds local node N1 to routing table after receiving described feedback message;
In step S55, local node N1 forwards search message to direct-link node, it is preferable that local node N1 starts intervalometer simultaneously, when can not receive feedback message in the setting time, then it is assumed that can not find destination node to be searched.
6. a wireless terminal, it is characterised in that including: memorizer and routing table, described routing table stores in memory, and described routing table includes following information: destination node, down hop trochanterion and route distance;And wireless communication module, described wireless communication module is able to receive that message and forwards message based on described routing table, includes message recipient node information in wherein said message.
7. wireless terminal according to claim 6, it is characterised in that described wireless communication module is configured to realize:
Step S11, for localized nodes X, pending messages for one, described pending messages in comprise destination node Y, localized nodes X and determine that destination node Y is localized nodes, then jump to step S12, otherwise jump to step S13;
Step S12, localized nodes X carries out Message Processing;
Step S13, localized nodes X inquires about the routing table of oneself;
Step S14, localized nodes X judge whether destination node Y and localized nodes X is direct-link node, if it is, jump to step S15, otherwise jumps to step S16;
Step S15, localized nodes X forwards the messages to destination node Y;
Step S16, localized nodes X then forward the messages to the down hop trochanterion Z in routing table in destination node Y correspondence entry.
8. wireless terminal according to claim 6, it is characterised in that when needing to add a new node between described wireless terminal, described wireless communication module is configured to realize:
Step S31, local node N1 judge that adding new node X actively adds as local or receive interpolation information from other nodes, if it is jumps to step S32, otherwise, jumps to step S36;
Step S32, local node N1 increase new route entry (N--0) in the routing table;
Step S33, local node N1 generate a new routing table, and this routing table includes: the down hop trochanterion in the former original entry of the routing table by local node N1 is set to local node N1 and adds 1 by route distance;Newly-increased entry (N1--0);
Described new routing table is sent to new node X by step S34, local node N1;
New route entry (XN11) is sent the down hop trochanterion to the route entry of oneself former routing table by step S35, local node N1;Preferably, new route entry is sent only to the direct-link node of local node N1, and step S5 includes:
Step S351, described down hop trochanterion adds the routing table of oneself to after receiving described new route entry;Down hop trochanterion in described new route entry is replaced by oneself, and route distance adds 1;Be then forwarded to oneself routing table route entry in down hop trochanterion;
Step S352, described down hop trochanterion for the identical route entry of destination node in the routing table of oneself, the shortest one of reserved route distance;
Down hop trochanterion in this route entry is revised as oneself by step S36, local node N1, adds 1 by route distance, sends other nodes to oneself routing table.
9. wireless terminal according to claim 6, it is characterised in that when needing to delete a node between described wireless terminal, described wireless communication module is configured to realize:
Step S41, local node N1 decision node X actively delete for local or receive deletion information from other nodes, if it is jump to step S42, otherwise, jump to step S44;
It is the entry of nodes X that step S42, local node N1 delete destination node in oneself routing table, and down hop trochanterion is the entry of nodes X;
Step S43, the entry of deletion is sent to other nodes by local node N1, it is preferable that be sent to direct-link node;
Step S44, local node N1 delete target node is the entry of nodes X, it is preferable if delete unsuccessful, then messaging is to informed source node;
In step S45, the entry of deletion is sent to other nodes by local node N1, remove informed source node, preferably, the entry of deletion is sent only to direct-link node by local node N1, preferably, if not comprising deletion of node X in the routing table of local node N1, then local routing table is sent the informed source node to the information of deletion by local node N1.
10. wireless terminal according to claim 6, it is characterised in that when needing one node of search between described wireless terminal, described wireless communication module is configured to realize:
Step S51, it is judged that local node N1 this locality active searching nodes X, or receive search message from other nodes, if it is jump to step S52, otherwise jump to step S53;
Step S52, local node N1 sends search message to direct-link node;
Step S53, local node N1 judge whether oneself is the destination node searched for, and if it is jumping to step is S54, otherwise jumps to step S55;
Step S54, sends feedback message to informed source node, and informed source node adds local node N1 to routing table after receiving described feedback message;
In step S55, local node N1 forwards search message to direct-link node, it is preferable that local node N1 starts intervalometer simultaneously, when can not receive feedback message in the setting time, then it is assumed that can not find destination node to be searched.
CN201610101142.6A 2016-02-24 2016-02-24 Wireless terminal and method of communication between wireless terminals Pending CN105764107A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610101142.6A CN105764107A (en) 2016-02-24 2016-02-24 Wireless terminal and method of communication between wireless terminals

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610101142.6A CN105764107A (en) 2016-02-24 2016-02-24 Wireless terminal and method of communication between wireless terminals

Publications (1)

Publication Number Publication Date
CN105764107A true CN105764107A (en) 2016-07-13

Family

ID=56331017

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610101142.6A Pending CN105764107A (en) 2016-02-24 2016-02-24 Wireless terminal and method of communication between wireless terminals

Country Status (1)

Country Link
CN (1) CN105764107A (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102223734A (en) * 2011-06-14 2011-10-19 广州从兴电子开发有限公司 Wireless communication network and communication method of same
CN102790963A (en) * 2012-07-20 2012-11-21 南京大学镇江高新技术研究院 Mobile ad hoc network system based on Android cell phone and construction method thereof

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102223734A (en) * 2011-06-14 2011-10-19 广州从兴电子开发有限公司 Wireless communication network and communication method of same
CN102790963A (en) * 2012-07-20 2012-11-21 南京大学镇江高新技术研究院 Mobile ad hoc network system based on Android cell phone and construction method thereof

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
佚名: "目的节点序列距离矢量(DSDV)协议", 《HTTPS://BLOG.CSDN.NET/CANDYCAT1992/ARTICLE/DETAILS/8087255/》 *
佚名: "示例化讲解RIP路由更新机制", 《HTTPS://BLOG.CSDN.NET/LYCB_GZ/ARTICLE/DETAILS/9611881》 *
梁爽: ""Ad Hoc网络路由协议和IP配置问题的研究", 《中国优秀硕士学位论文全文数据库信息科技辑》 *

Similar Documents

Publication Publication Date Title
JP4303738B2 (en) Apparatus and method for improving handover in mesh networks
CN101142793B (en) Path control method and home agent
US20050122955A1 (en) Method and system for route selection and method for route reconstruction
CN109219102B (en) Data forwarding method and device
JP4689630B2 (en) Communication terminal and communication control method
US11310716B2 (en) Method of selecting a route in an ad hoc network
US20200259736A1 (en) Peer-to-peer optimization in existing tree-based topology based on generating locally-optimized tree using confined advertisements
CN105763443A (en) HWMP-based double route cooperation method
CN103260211A (en) Improved AOMDV routing method
CN105491508A (en) Networking and routing algorithm based on Bluetooth technology for mobile phone ad hoc communication network CellNet
US20120163233A1 (en) Method for transmitting routing information and routing apparatus in wireless network
CN106658635A (en) Hierarchical routing method based on service quality in wireless multi-hop network
CN110266587B (en) Method and device for processing link state information
Wankhade et al. Ant based techniques for qos routing in mobile ad hoc network: an overview
CN106550321A (en) A kind of construction method of the mobile ad hoc network based on Hybrid communication model
CN105764107A (en) Wireless terminal and method of communication between wireless terminals
Margaryan et al. Development of an Adaptive Routing Algorithm in MANET
CN102026330A (en) Method for improving availability of ad hoc network
Tomar Modified routing algorithm for AODV in constrained conditions
CN104410985A (en) Method and device of processing topology control message
KR101065063B1 (en) Path setting apparatus and method based on attributes of an ad-hoc network
CN101635951B (en) Data packet transmission method and data packet transmission device in mobile IP technology
CN105247901A (en) Device and method for managing multicast group in wireless network
Sharma et al. Study of Routing Protocols in MANET-A Review
CN113573379A (en) Data transmission method and device

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20160713