CN105491508A - Networking and routing algorithm based on Bluetooth technology for mobile phone ad hoc communication network CellNet - Google Patents
Networking and routing algorithm based on Bluetooth technology for mobile phone ad hoc communication network CellNet Download PDFInfo
- Publication number
- CN105491508A CN105491508A CN201510381635.5A CN201510381635A CN105491508A CN 105491508 A CN105491508 A CN 105491508A CN 201510381635 A CN201510381635 A CN 201510381635A CN 105491508 A CN105491508 A CN 105491508A
- Authority
- CN
- China
- Prior art keywords
- node
- packet
- message
- networking
- network
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a networking and routing algorithm based on a Bluetooth technology for a mobile phone ad hoc communication network CellNet. The method comprises the following steps: (a) networking stage: making a node access a Bluetooth network, and updating neighbor nodes in a contactlist of the node; (b) updating stage: updating information of the neighbor nodes in the contactlist of the current node in real time; (c) sending stage: sending a normal text message or a system message to a next node by the current node; (d) routing stage: when one node receives a data packet forwarded by another node, checking whether the data packet is already processed or not through a processed data packet table, if so, discarding the data packet, and otherwise carrying out a next step; and (e) receiving stage: making corresponding response actions by the next node according to different types of received messages. Through adoption of the method, the routing overhead can be reduced; the network burden is relieved; and network congestion is avoided.
Description
Technical field
The present invention relates to wireless self-networking field, specifically based on networking and the routing algorithm of the mobile phone self-assembly network C ellNet of Bluetooth technology.
Background technology
At present, research about wireless self-networking is a lot, describe a lot of algorithms in such as " linguistic term of Ad-Hoc network routing protocol and the research of wireless Mesh netword route technology ", wherein just have DSDV, OLSR, DSR, AOVD, TORA, LAR, GRSR etc.But, all there are some inferior positions in these algorithms, such as DSDV and OLSR algorithm, they are based on Table Driven, need the route at the whole network of each node maintenance, when network is increasing time, the size of the table of each node will be increasing, when safeguarding this table, also needs the nodal information sending oneself to the node in network, add the burden of network, probably cause congested.Such as DSR, AOVD, TORA algorithm again, these three agreements are all need when transmitting data, start the process of route discovery, then a paths is found, then data are sent according to this path, such a process, time network topological diagram change is very fast, the expense of route maintenance is very large, and the arrival rate of packet is also very low.GRSR algorithm for another example, its complete position-based, select from destination node more close to node as the node of down hop, this is also the positional information needing Maintenance Point, this agreement also can send own node information by inundation, and this agreement may cause present node cannot find than own node more near the down hop of destination node.
Summary of the invention
The object of the present invention is to provide networking and the routing algorithm of a kind of mobile phone self-assembly network C ellNet based on Bluetooth technology, solve current Wireless Mesh Net routing algorithm and there is the problem that route maintenance expense is large, packet arrival rate is lower, also may exist simultaneously and cause that network burden is comparatively large, the problem of network congestion.
Object of the present invention is achieved through the following technical solutions: based on networking and the routing algorithm of the mobile phone self-assembly network C ellNet of Bluetooth technology, comprise the following steps:
(a) networking stage: node is linked in blueteeth network, and upgrade the neighbor node in the contactlist of this node;
B () be the new stage more: the information of each neighbor node in the contactlist of real-time update present node;
(c) transmission phase: general data bag or system data bag are sent to next node by present node;
(d) routing phase: when a node receives the packet of another node forwarding, check that whether this packet is processed by reduced data bag table, if so, then abandon this packet;
If the not processed mistake of this packet, then check whether the forwarding destination of this packet is this node, if so, then this packet of this node processing, and do not carry out data retransmission;
If the forwarding destination of this packet is not this node, then checks whether the message time-to-live TTL in packet is greater than 20hop, if TTL is greater than 20hop, then directly abandon this packet, otherwise this node carries out routing forwarding;
E () receives the stage: next node, according to the type of data packet received, is made and responded action accordingly.
Further, preferably, the detailed process in described networking stage is:
(a1) when there being node to attempt access blueteeth network, this node can send request signal, and the node in this blueteeth network can according to receiving request signal and replying acknowledge message or refuse information; If what this node received is acknowledge message, then represent that this node can add this blueteeth network, and according to the contactlist of this node of confirmation information updating received, the node sending acknowledge message also upgrades the contactlist of oneself simultaneously;
(a2) if this node receives is refuse information, then networking failure.
Further, preferably, the detailed process of described more new stage is:
When a certain node starts, this node periodically sends heartbeat message to each node in its contactlist, whether makes the state of replying and upgrading each node in this node contactlist according to each node;
If a node reverts back confirmation, then continue the neighbor node this node being considered as this node;
If a node does not reply acknowledge message, then this node is concentrated from the neighbor node of this node and delete.
Further, preferably, described transmission phase comprises general data bag and sends and the transmission of system data bag, and the process of transmitting of described general data bag is:
(c11) judge the source address of general data bag, if source address is identical with local address, then increases retransmission mechanism and send message;
(c12) if forward, then directly send;
The process of transmitting of described system message is:
(c21) from node, take out this system message, and directly send.
Further, preferably, in described routing phase, the detailed process that node carries out routing forwarding is:
(d1) set of node that packet has been got rid of is obtained;
(d2) obtained the neighbor node collection of this node by the contactlist of this node, and according to the set of node got rid of, concentrate the node filtering out and be not excluded from neighbor node;
(d3) these nodes be not excluded are joined in data to be forwarded bag, obtain new packet, then new packet is transmitted to all nodes in the set of node be not just excluded.
Further, preferably, in described step (d3), the detailed process joined by the node be not excluded in data to be forwarded bag is:
(d31) when there being node to want to join in ExRouting, the position pointed by this node city to InsertP, now InsertP moves a position automatically backward, when InsertP arrives end, then again points to first position of ExRouting; Wherein, ExRouting and InsertP is two fields in outgoing data bag, and ExRouting refers to the node listing got rid of in the packet; InsertP refers to that next node joins the position in ExRouting;
(d32) when the node that will add exists in ExRouting, then this node can not add again.
The present invention has following beneficial effect:
(1) the present invention is by adopting special routing mode, in Packet Generation process, achieve the dynamic generation of routed path, simultaneously, by all nodes of packet data recording route process, just no longer forward to the node receiving this packet when node receives packet, avoid packet repeatedly route on certain node, thus significantly reduce the time of Route Selection, also mitigate the network burden caused owing to repeating transmission packet.
(2) the present invention is when networking and Route Selection, only need the information of neighbor nodes safeguarding each node, without the need to safeguarding all nodal informations of whole network at any Nodes, thus reduce the time of node maintenance, it also avoid and store the problems such as mobile phone EMS memory that great deal of nodes information causes is not enough.
Accompanying drawing explanation
Fig. 1 is the flow chart of the thread corresponding with handShake agreement;
Fig. 2 is the flow chart of the thread corresponding with heartbeat agreement;
Fig. 3 is the flow chart of the thread corresponding with send_Syn agreement;
Fig. 4 is the flow chart of the thread corresponding with send_Sys agreement;
Fig. 5 is the flow chart of the thread corresponding with receive_msg agreement;
Fig. 6 is the flow chart of routing procedure;
Fig. 7 is the graph of a relation of query thread and other thread;
Fig. 8 is the graph of a relation of heartbeat thread and other thread;
Fig. 9 is the graph of a relation of service thread and other thread;
Figure 10 is networking and routing procedure schematic diagram.
Embodiment
Below in conjunction with embodiment, the present invention is described in further detail, but embodiments of the present invention are not limited only to this.The mobile phone terminal that the node below mentioned and the present invention will express is a concept, and both are the different calls of different aspects.
Embodiment:
The networking of the mobile phone self-assembly network C ellNet based on Bluetooth technology described in the present embodiment and routing algorithm, comprise the following steps:
(a) networking stage: node is linked in blueteeth network, and upgrade the neighbor node in the contactlist of this node;
B () be the new stage more: the information of each neighbor node in the contactlist of real-time update present node;
(c) transmission phase: general data bag or system data bag are sent to next node by present node, system data bag refers to the packet relevant with heartbeat that network, the packet relevant with heartbeat that network is relevant with heartbeat agreement (heart-beat protocol) to the handShake agreement (Handshake Protocol) will mentioned below, general data bag refers to the packet beyond system data bag, such as plain text information, system information etc.;
(d) routing phase: when a node receives the packet of another node forwarding, check that whether this packet is processed by reduced data bag table, if so, then abandon this packet;
If the not processed mistake of this packet, then check whether the forwarding destination of this packet is this node, if so, then this packet of this node processing, and do not carry out data retransmission;
If the forwarding destination of this packet is not this node, then checks whether the message time-to-live TTL in packet is greater than 20hop, if TTL is greater than 20hop, then directly abandon this packet, otherwise this node carries out routing forwarding;
E () receives the stage: next node, according to the type of data packet received, is made and responded action accordingly.
Particularly, the detailed process in networking stage is:
(a1) when there being node to attempt access blueteeth network, this node can send request signal, and the node in this blueteeth network can according to receiving request signal and replying acknowledge message or refuse information; If what this node received is acknowledge message, then represent that this node can add this blueteeth network, and according to the contactlist of this node of confirmation information updating received, the node sending acknowledge message also upgrades the contactlist of oneself simultaneously;
(a2) if this node receives is refuse information, then networking failure.
Particularly, more the detailed process of new stage is:
When a certain node starts, this node periodically sends heartbeat message to each node in its contactlist, whether makes the state of replying and upgrading each node in this node contactlist according to each node; ;
If a node reverts back confirmation, then continue the neighbor node this node being considered as this node;
If a node does not reply acknowledge message, then this node is concentrated from the neighbor node of this node and delete.
Particularly, transmission phase comprises general data bag and sends and the transmission of system data bag, and the process of transmitting of described general data bag is:
(c11) judge the source address of general data bag, if source address is identical with local address, then increases retransmission mechanism and send message;
(c12) if forward, then directly send;
The process of transmitting of described system message is:
(c21) from node, take out this system message, and directly send.
Particularly, in described routing phase, the detailed process that node carries out routing forwarding is:
(d1) set of node that packet has been got rid of is obtained;
(d2) obtained the neighbor node collection of this node by the contactlist of this node, and according to the set of node got rid of, concentrate the node filtering out and be not excluded from neighbor node;
(d3) these nodes be not excluded are joined in data to be forwarded bag, obtain new packet, then new packet is transmitted to all nodes in the set of node be not just excluded.
Particularly, in step (d3), the detailed process joined by the node be not excluded in data to be forwarded bag is:
(d31) when there being node to want to join in ExRouting, the position pointed by this node city to InsertP, now InsertP moves a position automatically backward, when InsertP arrives end, then again points to first position of ExRouting; Wherein, ExRouting and InsertP is two fields in outgoing data bag, and ExRouting refers to the node listing got rid of in the packet; InsertP refers to that next node joins the position in ExRouting;
(d32) when the node that will add exists in ExRouting, then this node can not add again.
By a specific embodiment, implementation procedure of the present invention is described below, specific as follows:
First, in order to realize the transmission of data between mobile phone terminal (node), we carry out clear and definite agreement to the data format between node.The data format of CellNet is as table 1.
Table 1MeshNet data format
Wherein:
(1) Type represents type of message, takies 1Byte, can value as follows:
A) 00000001=SYN, common message
B) 00000010=HB, heartbeat message
C) 00000011=Query, query message
D) 00000100=ACK, to the acknowledge message of common message
E) 00000101=HBACK, to the acknowledge message of heartbeat message
F) 00000110=QACK, to the acknowledge message of query message
G) 00000111=NQACK, to the refuse information of query message
(2) what NetID represented is network number, takies 1Byte, when there being node to attempt certain network of access, judges to reply QACK or NQACK when the node in this network receives Query signal according to its From_ID;
(3) From_ID and To_ID represents source and the destination of message respectively, the NickName of the SequenceNO. intrinsic according to mobile phone and user's input determines, SN is the decimal number of 12, and NickName is no more than 20 letters, so From_ID takies 32Byte;
(4) what Seq_NO represented is message SN, takies 2Byte, wherein 65535, namely
111111111111 1111represent that transmission of messages terminates;
(5) ACK_NO represents that current message is is the determination of the message of ACK_NO to a upper sequence number, takies 2Byte;
(6) what TTL represented is the longest " time " that message is survived in a network, and weighing with jumping figure, is to prevent some message pitch of the laps in a network, taking 1Byte;
(7) CheckSum represents the School Affairs of this message, when message initialization, calculates according to message header, again calculate new ChekSum according to message header when a message is received, relatively, if coupling, represent that this transmission does not have mistake, otherwise represent loading error occurring.Take 2Byte;
(8) InsertP represents the position of the ExRouting that upgrade
(9) Content represents message body, and real data message is put into wherein, and regulation message maximum length is no more than 128Byte;
(10) ExRouting, i.e. ExcludeRouting, represent the neighbor node of the route that this message has been passed through and these routes, is equivalent to a set, and the length of this field is enough to accommodation 20 Termination ID, i.e. 640Byte.
In addition, in order to ensure that in network, each mobile phone terminal (node) can realize reliable transfer of data, except the data format of regulation, certain agreement is also needed to ensure, as the ICP/IP protocol in computer network.CellNet of the present invention also has oneself agreement a set of to support, comprise handShake agreement, heartbeat agreement, receive_msg agreement, send_Syn agreement, send_Sys agreement and routing agreement, wherein agreement all can relate to concrete message format and different threads processes, also can safeguard contactList table at each mobile phone terminal, what deposit in this table is the neighbor node (namely can allow the node that message directly arrives) of current phone terminal simultaneously.
(1) handShake agreement
The problem that what handShake agreement mainly solved is when terminal attempts access network.When terminal attempts access network, it can send Query message by peripherad network, represent that this terminal can add existing network, according to the contactList of the QACK information updating present terminal received when receiving to when the acknowledge message of Query message and QACK message.
(1) corresponding with handShake agreement message format is as shown in table 2,
Table 2Query message format
| Query | NetID | From_ID | ALL | Seq_NO | 00...00 | 1 | CheckSum | PRouting |
(2) flow chart of corresponding with handShake agreement thread as shown in Figure 1.
(2) heartbeat agreement
The problem that heartbeat agreement mainly solves is the information of each node in real-time update contactList table.When mobile phone terminal starts, mobile phone terminal periodically will send HB message to each node in its contactList table, then dynamically updates contactList table according to the response condition of these nodes.
The form of message corresponding to heartbeat agreement is as shown in table 3,
Table 3HB message format
| HB | NetID | From_ID | To-ID | Seq_NO | 00..00 | 1 | CheckSum | PRouting |
(1) flow chart of thread heartbeat thread corresponding to heartbeat agreement as shown in Figure 2.
(3) send_Syn agreement
What send_Syn agreement mainly solved is the problem sending ordinary text message, when having data to be sent in the Send_Syn of terminal, the send_Syn thread corresponding with send_Syn agreement will send message, and this thread can take Different Strategies according to the type of sent message.
(1) flow chart of corresponding with send_Syn agreement send_Syn thread as shown in Figure 3.
(4) send_Sys agreement
What send_Sys agreement mainly solved is the problem sending Query message and HB message, when having data to be sent in the Send_Sys of terminal, the send_Sys thread corresponding with send_Sys agreement will send message, and this thread can take Different Strategies according to the type of sent message.
(1) flow chart of corresponding with send_Sys agreement send_Sys thread as shown in Figure 4.
(5) receive_msg agreement
The problem of what receive_msg agreement mainly solved is receipt message, mainly respond action accordingly according to the different messages type received, the receive_msg thread corresponding with receive_msg agreement is responsible for a series of actions of receipt message.
(1) flow chart of receive_msg thread as shown in Figure 5.
(6) routing agreement
1. summarize
This section describes CellNet Routing Protocol, formulate the forwarding rule of packet in CellNet network.The utilization of this agreement is being transmitted based on bluetooth or WLAN data, and the namely transmission of packet utilizes bluetooth or WLAN to carry out, and the agreement applied on each node described by this section carries out data retransmission.
2. restrictive condition
Bluetooth: a kind of radiotechnics of support equipment short haul connection, transmission range farthest can expand 100m at present.
WLAN: utilize wireless technology to transmit data, speech and vision signal aloft.Current transmission range also reaches 100m.
Neighbor node maximum number: each node allows oneself some neighbor nodes, but each node can only hold maximum 20 neighbor nodes.
Order ground node: the node that packet finally will be transferred to.
Packet TTL: packet is at most in a network through 20hop.
The data survival time in reduced data bag table: maximum can not more than 8s.
3. agreement describes
(1) routing procedure
In whole CellNet network, each node carries the function of data receiver and data retransmission.Each node maintenance two table, one is by HeartBeat mechanism maintenance of neighbor node table (see table 4), allows maximum nodes to be 20; An other table is reduced data bag table (see table 5), 8 seconds maximum times that a record allows.
If node receives another one node when forwarding the packet come, and is first checked processed, then abandoning whether this packet processed this packet, otherwise carrying out next step by reduced data bag table.
If do not process this packet, then checked whether the forwarding destination of this packet is this node, if it is this packet of this node processing, and do not carry out data retransmission; If the forwarding destination of this packet is not this node, then check whether the value of the TTL in packet is greater than 20, be greater than 20 and just directly abandon this packet, otherwise this node carries out routing forwarding.
If a node carries out routing forwarding, first (node of eliminating refers in the process that this packet forwards afterwards to obtain according to the ExRouting field in packet the set of node that this packet got rid of, the node got rid of can not be transmitted to), then from neighbor node table, obtain the neighbor node collection of this node, then the set of node according to having got rid of is concentrated to filter out the node be not excluded at neighbor node, these nodes be not excluded are joined in the ExRouting field of data to be forwarded bag, after adding, just the packet of amendment is transmitted to all nodes in the set of node be not just excluded.Related procedure can see Fig. 6.
(2) neighbor node table
Table 4 neighbor node table
If node just can pass to the other side data through 1hop, then both sides are called neighbor node mutually.The dominant record number that this table allows is 20.
If a node is wanted to add a network, when after transmission query message, after receiving QACK message back, then the node of replying message is added neighbor node table.
If nodes receives after another wants to add the query message that network node sends, if adhereed to, then this node is added in the neighbor node table of oneself.
Maintenance of neighbor node table is carried out with heartbeat.
(3) reduced data bag table
Table 5 reduced data bag table
When the destination of packet is that this node or this node forward this packet, then the relevant information of packet is recorded in reduced data bag table.Article one, the maximum time that record exists is 8 seconds, if exceeded this time, then this record is removed.
(4) ExRouting field node adition process
In the packet, having two fields, is ExRouting and InsertP respectively.ExRouting refers to the node listing got rid of in the packet; InsertP refers to that next node joins the position in ExRouting.When wanting when there being node to join ExRouting, just the position pointed by this node city to InsertP, now InsertP moves a position automatically backward, when InsertP arrives end, then again can point to first position of ExRouting.
If the node added is when Exrouting exists, then this node can not add again.
(5) route implementing
1. thread
Routing Protocol is made up of three threads, and thread is that routing is used for route, and thread is that heartbeat thread is used for maintenance of neighbor node table, and a thread is that check_pack_time is used for safeguarding reduced data bag table.
When receive_msg thread receives the packet that is wanted route, then notify route thread routing, and data packet delivery to routing thread, if need to forward this packet, then routing thread notice send_msg thread, new data packet delivery to send_msg thread.
In CellNet, each thread completes different functions, except above-mentioned thread, also has a thread to be used for message request---the service thread of upper strata APP in CellNet.Effectively cooperate to enable each thread, CellNet creates the resources such as Send_Syn, Send_Sys, Msg_Queue, ACK_Queue, HBACK_Queue, QACK_Queue, ContactList in main thread, thus make between thread can effective interaction data.Wherein,
(1) Send_Syn is for depositing the text message that will send;
(2) Send_Sys is used for storage system message, as HB message and Query message;
(3) Msg_Queue is for depositing the common message received;
(4) ACK_Queue is for depositing the message confirmed common message;
(5) HBACK_Queue is for depositing the reply message of HB message;
(6) QACK_Queue is for depositing the reply message of Query message.
(2) cross-thread relation summary is as table 6,
Table 6 thread relationship
| Thread | Corresponding agreement | Function | The thread relied on |
| query | handShake | Send Query message | send_msg、receive_msg |
| heartbeat | heartbeat | Send HB message | send_msg、receive_msg |
| service | Send SYN message | All threads | |
| send_msg | send_msg | Send message | All threads |
| receive_msg | receive_msg | Receipt message | Nothing |
(1) relation of query thread and other thread is as shown in Figure 7,
The logical order of thread execution is as follows:
1. Query message to be sent is put into Send_Queue by query thread, then waits for the QACK message of this message;
2. send_msg thread takes out Query message to be sent, transmission from Send_Queue;
3. the QACK message be subject to is put into QACK_Queue by receive_msg thread;
4. query thread will take out to the QACK message of Query message authentication, upgrade the contactList table of present terminal from QACK_Queue.
(2) relation of heartbeat thread and other thread is as shown in Figure 8,
The logic execution sequence of thread is as follows:
1. heartbeat thread puts into Send_Queue by little for HB, then waits for the HBACK_Queue message to these message responses;
2. send_msg thread takes out HB message, transmission from Send_Queue;
3. the HBACK message received is put into HBACK_Queue by receive_msg thread;
4. heartbeat thread takes out HBACK message, the renewal contactList table to HB response from HBACK_Queue.
(3) relation of service thread and other thread is as shown in Figure 9,
Upper layer application directly by calling the service that service thread provides, puts into Send_Queue message to be sent, and the message in Msg_Queue is taken out.
As shown in Figure 10, A node is start node, node for the purpose of B node, A node sends packet to next node, next node is when receiving packet, first judge that whether this packet is by this node processing mistake by the reduced data bag table of self, if not processed mistake, whether the forwarding destination then checking this packet is this node, if not, then upgrade the sending node in this packet and be transmitted to these sending nodes, to the last packet is forwarded to destination node B, thus achieve packet whole routed path A → B of dynamic generation in process of transmitting.
The present invention is illustrated by above-described embodiment, but should be understood that, above-described embodiment just for the object of illustrating and illustrate, and is not intended to the present invention to be limited in described scope of embodiments.In addition, it will be appreciated by persons skilled in the art that the present invention is not limited to above-described embodiment, more kinds of variants and modifications can also be made according to instruction of the present invention, within these variants and modifications all drop on the present invention's scope required for protection.
Claims (6)
1., based on networking and the routing algorithm of the mobile phone self-assembly network C ellNet of Bluetooth technology, it is characterized in that: comprise the following steps:
(a) networking stage: node is linked in blueteeth network, and upgrade the neighbor node in the contactlist of this node;
B () be the new stage more: the information of each neighbor node in the contactlist of real-time update present node;
(c) transmission phase: general data bag or system data bag are sent to next node by present node;
(d) routing phase: when a node receives the packet of another node forwarding, check that whether this packet is processed by reduced data bag table, if so, then abandon this packet;
If the not processed mistake of this packet, then check whether the forwarding destination of this packet is this node, if so, then this packet of this node processing, and do not carry out data retransmission;
If the forwarding destination of this packet is not this node, then checks whether the message time-to-live TTL in packet is greater than 20hop, if TTL is greater than 20hop, then directly abandon this packet, otherwise this node carries out routing forwarding;
E () receives the stage: next node, according to the type of data packet received, is made and responded action accordingly.
2. the networking of the mobile phone self-assembly network C ellNet based on Bluetooth technology according to claim 1 and routing algorithm, is characterized in that: the detailed process in described networking stage is:
(a1) when there being node to attempt access blueteeth network, this node can send request signal, and the node in this blueteeth network can according to receiving request signal and replying acknowledge message or refuse information; If what this node received is acknowledge message, then represent that this node can add this blueteeth network, and according to the contactlist of this node of confirmation information updating received, the node sending acknowledge message also upgrades the contactlist of oneself simultaneously;
(a2) if this node receives is refuse information, then networking failure.
3. the networking of the mobile phone self-assembly network C ellNet based on Bluetooth technology according to claim 1 and routing algorithm, is characterized in that: the detailed process of described more new stage is:
When a certain node starts, this node periodically sends heartbeat message to each node in its contactlist, whether makes the state of replying and upgrading each node in this node contactlist according to each node;
If a node reverts back confirmation, then continue the neighbor node this node being considered as this node;
If a node does not reply acknowledge message, then this node is concentrated from the neighbor node of this node and delete.
4. the networking of the mobile phone self-assembly network C ellNet based on Bluetooth technology according to claim 1 and routing algorithm, it is characterized in that: described transmission phase comprises general data bag and sends and the transmission of system data bag, and the process of transmitting of described general data bag is:
(c11) judge the source address of general data bag, if source address is identical with local address, then increases retransmission mechanism and send message;
(c12) if forward, then directly send;
The process of transmitting of described system message is:
(c21) from node, take out this system message, and directly send.
5. the networking of the mobile phone self-assembly network C ellNet based on Bluetooth technology according to claim 1 and routing algorithm, it is characterized in that: in described routing phase, the detailed process that node carries out routing forwarding is:
(d1) set of node that packet has been got rid of is obtained;
(d2) obtained the neighbor node collection of this node by the contactlist of this node, and according to the set of node got rid of, concentrate the node filtering out and be not excluded from neighbor node;
(d3) these nodes be not excluded are joined in data to be forwarded bag, obtain new packet, then new packet is transmitted to all nodes in the set of node be not just excluded.
6. the networking of the mobile phone self-assembly network C ellNet based on Bluetooth technology according to claim 5 and routing algorithm, it is characterized in that: in described step (d3), the detailed process joined by the node be not excluded in data to be forwarded bag is:
(d31) when there being node to want to join in ExRouting, the position pointed by this node city to InsertP, now InsertP moves a position automatically backward, when InsertP arrives end, then again points to first position of ExRouting; Wherein, ExRouting and InsertP is two fields in outgoing data bag, and ExRouting refers to the node listing got rid of in the packet; InsertP refers to that next node joins the position in ExRouting;
(d32) when the node that will add exists in ExRouting, then this node can not add again.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510381635.5A CN105491508A (en) | 2015-06-30 | 2015-06-30 | Networking and routing algorithm based on Bluetooth technology for mobile phone ad hoc communication network CellNet |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510381635.5A CN105491508A (en) | 2015-06-30 | 2015-06-30 | Networking and routing algorithm based on Bluetooth technology for mobile phone ad hoc communication network CellNet |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105491508A true CN105491508A (en) | 2016-04-13 |
Family
ID=55678157
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510381635.5A Pending CN105491508A (en) | 2015-06-30 | 2015-06-30 | Networking and routing algorithm based on Bluetooth technology for mobile phone ad hoc communication network CellNet |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105491508A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106658355A (en) * | 2016-09-26 | 2017-05-10 | 珠海格力电器股份有限公司 | Method for forwarding broadcast packet in bluetooth BLE networking and system thereof |
| CN108123873A (en) * | 2017-12-29 | 2018-06-05 | 安凯(广州)微电子技术有限公司 | Data forwarding paths selection method and device, storage medium, server-side |
| CN108173966A (en) * | 2018-01-23 | 2018-06-15 | 南京邮电大学 | BLEMesh automatic network-building methods based on user collaboration |
| CN109348461A (en) * | 2018-11-12 | 2019-02-15 | 苏州纽克斯电源技术股份有限公司 | The bluetooth grid means of communication, device, adjusting device and computer storage medium |
| CN110278547A (en) * | 2018-03-13 | 2019-09-24 | 博通集成电路（上海）股份有限公司 | Device and method for establishing low-power consumption bluetooth mesh network |
| WO2020177580A1 (en) * | 2019-03-06 | 2020-09-10 | 乐鑫信息科技（上海）股份有限公司 | Method for processing data packets at node in bluetooth mesh network |
| CN112235733A (en) * | 2020-09-29 | 2021-01-15 | 北京海益同展信息科技有限公司 | Multi-device cooperation method, device, system and medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101127537A (en) * | 2007-09-30 | 2008-02-20 | 东南大学 | Multi-jump voice transmission method based on Bluetooth technology |
| CN101414965A (en) * | 2008-12-04 | 2009-04-22 | 天津大学 | Method for saving node energy of delay-tolerant network and intermittently-connected network |
| CN103401692A (en) * | 2009-04-02 | 2013-11-20 | 华为技术有限公司 | Broadcasting method and communication device |
| CN104378290A (en) * | 2014-10-31 | 2015-02-25 | 北京盈进科技有限公司 | Message forwarding method and device |
-
2015
- 2015-06-30 CN CN201510381635.5A patent/CN105491508A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101127537A (en) * | 2007-09-30 | 2008-02-20 | 东南大学 | Multi-jump voice transmission method based on Bluetooth technology |
| CN101414965A (en) * | 2008-12-04 | 2009-04-22 | 天津大学 | Method for saving node energy of delay-tolerant network and intermittently-connected network |
| CN103401692A (en) * | 2009-04-02 | 2013-11-20 | 华为技术有限公司 | Broadcasting method and communication device |
| CN104378290A (en) * | 2014-10-31 | 2015-02-25 | 北京盈进科技有限公司 | Message forwarding method and device |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106658355A (en) * | 2016-09-26 | 2017-05-10 | 珠海格力电器股份有限公司 | Method for forwarding broadcast packet in bluetooth BLE networking and system thereof |
| CN106658355B (en) * | 2016-09-26 | 2019-11-12 | 珠海格力电器股份有限公司 | A kind of method and system forwarding broadcast packet in bluetooth BLE networking |
| CN108123873A (en) * | 2017-12-29 | 2018-06-05 | 安凯(广州)微电子技术有限公司 | Data forwarding paths selection method and device, storage medium, server-side |
| WO2019128384A1 (en) * | 2017-12-29 | 2019-07-04 | 安凯(广州)微电子技术有限公司 | Data forwarding path selection method and device, storage medium and server |
| CN108173966A (en) * | 2018-01-23 | 2018-06-15 | 南京邮电大学 | BLEMesh automatic network-building methods based on user collaboration |
| CN110278547A (en) * | 2018-03-13 | 2019-09-24 | 博通集成电路（上海）股份有限公司 | Device and method for establishing low-power consumption bluetooth mesh network |
| CN110278547B (en) * | 2018-03-13 | 2022-04-08 | 博通集成电路（上海）股份有限公司 | Apparatus and method for establishing a bluetooth low energy mesh network |
| CN109348461A (en) * | 2018-11-12 | 2019-02-15 | 苏州纽克斯电源技术股份有限公司 | The bluetooth grid means of communication, device, adjusting device and computer storage medium |
| WO2020177580A1 (en) * | 2019-03-06 | 2020-09-10 | 乐鑫信息科技（上海）股份有限公司 | Method for processing data packets at node in bluetooth mesh network |
| CN112235733A (en) * | 2020-09-29 | 2021-01-15 | 北京海益同展信息科技有限公司 | Multi-device cooperation method, device, system and medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105491508A (en) | Networking and routing algorithm based on Bluetooth technology for mobile phone ad hoc communication network CellNet | |
| US8831023B2 (en) | Low latency mesh network | |
| US8005054B2 (en) | Communication system, communication method, communication terminal device, control method thereof, and program | |
| ES2339782T3 (en) | HYBRID PROTOCOL OF ROADING FOR A NETWORK WITH MESH TOPOLOGY. | |
| Gupta et al. | An adaptive protocol for reliable multicast in mobile multi-hop radio networks | |
| EP2421206B1 (en) | Flooding-based routing protocol having database pruning and rate-controlled state refresh | |
| US20110211535A1 (en) | Network communication system, node device, routing method and routing program | |
| US9001826B2 (en) | Method, apparatus, system, and article of manufacture for reliable low-bandwidth information delivery across mixed-mode unicast and multicast networks | |
| US20050122955A1 (en) | Method and system for route selection and method for route reconstruction | |
| US9001645B2 (en) | System and method for packet delivery backtracking | |
| US8559442B2 (en) | Diverse path forwarding through trial and error | |
| CN103200639B (en) | Method of self-organizing network directed route in air | |
| US8774051B2 (en) | Path notification | |
| US20100177753A1 (en) | Method for Operating a Wireless Mesh Data Network with Multiple Nodes | |
| CN103338207B (en) | Real-time video multi-hop relay method in wireless self-organization network | |
| CN107071850A (en) | A kind of improved AODV Routing Protocols for being suitable for different motion scene | |
| CN105763443A (en) | HWMP-based double route cooperation method | |
| US20030012193A1 (en) | Methods and apparatus for updating subsource addressing multicast routing records in a communications network | |
| JP2010074691A (en) | Ad-hoc network wireless communication method | |
| CN101867973B (en) | Multidimensional network and data transmission method thereof | |
| Yan et al. | D-ODMRP: a destination-driven on-demand multicast routing protocol for mobile ad hoc networks | |
| CN110300426A (en) | Route selection method and device in a kind of wireless self-networking | |
| CN102098729A (en) | Construction method and related packet forwarding method for tree backbone structure in wireless network | |
| CN104320825A (en) | Ad hoc network route selection method based on repeated game | |
| CN101662374B (en) | Broadcasting method for mobile ad hoc network |
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: 20160413 |