CN102413058B - Odor routing method - Google Patents
Odor routing method Download PDFInfo
- Publication number
- CN102413058B CN102413058B CN201110439713.4A CN201110439713A CN102413058B CN 102413058 B CN102413058 B CN 102413058B CN 201110439713 A CN201110439713 A CN 201110439713A CN 102413058 B CN102413058 B CN 102413058B
- Authority
- CN
- China
- Prior art keywords
- smell
- packet
- interface
- time
- odor
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The invention provides an odor routing method which is especially applicable to a network with more mobile subscribers. In the method, the specific 'odor' of objects such as a user, content, service and the like in the network is left and enhanced in a router along the way during session; the odor of the objects such as the user, the content, the service and the like which passively wait for access can be also given off in a surrounding environment, and the odor is reduced along with increase of distance and time; and the user can find out the specific objects such as the user, the content, the service and the like along the path with the highest odor concentration. By adopting the odor routing method provided by the invention, the odor of the objects such as the super user, the content, the service and the like can be preserved within a wide range for a long time so that the objects can be addressed more easily; and meanwhile the network can adapt to a large scale and dynamic change, support the mobility of the objects such as the user, the content, the service and the like, and can be taken as a basic architecture of the future Internet.
Description
Technical field
The invention belongs to network route technology field, relate to user in network and search the method for routing of the objects such as object user, content, service, particularly in network, have the method for routing of mobile node.
Technical background
The more common Routing Protocol in the Internet can be divided at present: the Routing Protocol based on distance vector (Distance-Vector) and the Routing Protocol based on Link State (Link-State).The former typical protocol is routing information protocol RIP (Routing Information Protocol), the latter's typical protocol is that Open Shortest Path First OSPF (Open Shortest Path First).
The core algorithm of routing information protocol RIP is bellman-ford algorithm, its main thought is that router carries out addressing according to IP address, between neighboring router, can regularly or in the time that network topology changes, intercourse routing table, the main information that routing table comprises has: object network, to distance, the next hop router etc. of object network.Although routing information protocol RIP is exchanging routing information between neighboring router just, but fact proved that RIP agreement can restrain, after repeatedly Routing Information Exchange after a while, the each router in network can maintain a routing table to network others node.
The core algorithm of Open Shortest Path First OSPF is dijkstra's algorithm, its main thought is only in the time that network topology changes, router just sends information by the mode of inundation to the all-router in network, the information of this transmission is different from the routing table (comprising all information of network) that RIP agreement sends, in ospf protocol, router only sends the state of all links adjacent with this router.
All there are some common problems in two class Routing Protocols above, such as, when network topology structure changes when very fast, Routing Protocol need to transmit a large amount of route control messages, thereby has taken a large amount of bandwidth.Because above Routing Protocol is all to carry out addressing according to IP address, in the time having mobile user in network, the well mobility of node in network enabled.In the time that network size is larger, or network topology change is when very fast, can produce a large amount of route entrys, makes the routing table of Routing Protocol very large.
Summary of the invention
The present invention proposes a kind of brand-new route thought, preferably resolve routing table in Routing Protocol above huge and do not support the problems such as user mobility.In method for routing of the present invention, mobile subscriber and non-moving user, content, service etc. are called object; Mobile subscriber and non-moving user are referred to as user.Stay and strengthen smell, smell and decay in time and by aspects such as odorousness forwardings, the method for routing that the present invention proposes be described from name, passive wait request and access object giving forth fragrance, object respectively below.
One, name:
Existing Internet tradition Routing Protocol all addresses main frame, use be the address of network layer, i.e. IP address.By searching the IP address of main frame, thereby find main frame to find needed data.Use the identifier IP address of network layer to carry out mark to node and can bring a lot of shortcomings, such as mobility of support node well etc., these shortcomings can make the performance of network seriously reduce in some applications.
The present invention uses the objects such as mobile subscriber in unique ID marked network and non-moving user, content, service.
Two, giving forth fragrance:
In network, some user can initiatively search the objects such as other user, content, service, and some object is almost passive wait request and access always.The objects such as the user of passive wait request and access, content, service, in order to facilitate other user to find them, can be on one's own initiative, periodically in network, distribute towards periphery the smell of oneself by the mode of broadcasting; And the concentration of the smell distributing decays along with the increase of jumping figure.The radius of broadcast is by they own decisions, represents with r.
Three, stay and strengthen smell:
(1) stay by number of times or strengthen smell:
In network, user searches the object Shi Hui such as other user, content, service and stays the smell of oneself on the way.The objects such as user, content, service, in first request bag or respond packet sending, all provide a scent marking in the time that each communication starts; When node on the way is often seen this mark, just leave or strengthen the smell of this object at the interface of receiving this packet; Same interface in same node is received from the number of times of the bag of the scent of mark of same object more, and the smell of this object is just denseer.
(2) strengthen smell by the time:
Between object, along with the lengthening of call duration time, every a time cycle, each object provides a scent marking in certain packet sending; Node on the way, in the time seeing this mark, is just strengthened the smell of this object at the interface of receiving this packet.
Four, smell is decayed in time:
Thought about the decay of time is based in a node, and the smell of all objects is along with passage of time all will slowly be disappeared; It is 0 that the smell not being reinforced in this process will be attenuated.
Five, forward by odorousness:
In the time that a node is received a packet, want the object of addressing according to this packet, in its total interface, search the smell of this object, and this packet is forwarded to the interface with the breast-high scent of this object; If total interface all has the smell of this object equal concentrations or 0 concentration, select at random an interface to forward.
Illustrate the present invention below by accompanying drawing.
Accompanying drawing explanation
Fig. 1 is the schematic diagram that records the form of the odorousness that object stays at each interface.
Fig. 2 is the schematic diagram of smell bag and non-smell bag.
Fig. 3 finds process and the schematic diagram of the mode of scent on the way at random.
Fig. 4 is the situation of smell is strengthened in two telex networks schematic diagram by the time.
Embodiment
The present invention is the objects such as mobile subscriber in Network Based and non-moving user, content, service, capital leaves or distributes distinctive smell separately in network, makes a kind of odor routing method that just can find the thought of these objects to propose by pursuing smell.When user in network communicates by letter each other or user, content, the service of passive wait request and access want other user to access oneself, can there is the regular hour with the form of self smell in their information, other user can remove to find the objects such as the user, content, service of scent by this smell when needed in network.
Illustrate implementation method of the present invention from three aspects: below:
First, the concrete method for expressing of the name to object in network and object smell.
In network, use unique ID to name objects such as user, content, services.ID is the long character string of an on-fixed, identifies uniquely the objects such as a user, content, service; This character string can be semantic meaning representation, service describing, Service Properties, user ID, user characteristics of name, URL, URI, content itself, the content of address, name, stratification etc.This ID is different from the IP address (working in network layer) of present network, has good effect at aspects such as supporting mobility.
In network, the concrete method for expressing of the smell of object is, if id is the mark of an object, its smell can be with a k dimensional vector (h
1, h
2..., h
k) represent:
h
j＝hash
j(id)，for all j＝1，2，...，k (1-1)
Wherein hash
j(), j=1 ..., k, is k different hash function, h
jto be more than or equal to 0 integer.The possibility of result obtaining due to hash function has conflict, in order to make false positive rate (false positive rate) little of acceptable degree, and h
jmaximum, i.e. max{h
j, the most multiple smell number that will remember than each interface is much larger, j=1 ..., k.
The smell of object is that the each interface i in node is arranged to k smell table: D in the method for each nodes records
i, 1, D
i, 2..., D
i, k.K dimensional vector (h
1, h
2..., h
k) what represent is the smell of the object sequence number in smell table, specifically, is exactly the smell of the object position in smell table.Be h
1indicated object smell is at smell table D
i, 1in h
1individual position, h
2indicated object smell is at smell table D
i, 2in h
2individual position ..., h
kindicated object smell is at smell table D
i, kin h
kindividual position.The occurrence of object odorousness is by D
i, j(h
j) represent, j=1,2 ..., k.As shown in Figure 1, the concentration value D of each smell in this figure
i, j(h
j) be one and be more than or equal to 0 number, wherein h
1=0, h
2=11 ..., h
k=4; D
i, 1(h
1)=2.1, D
i, 2(h
2)=4.2 ..., D
i, k(h
k)=3.3.
If need to increase the smell value of certain object, added value can be joined to D
i, j(h
j) in.Such as, when receiving from interface i while coming from packet with scent marking of of object id, order
D
i，j(h
j)+＝d，for all j＝1，2，...，k (1-2)
Wherein, d is smell added value.For different reinforcement smell situations, the expression of d is different, after be described in detail.
Secondly, the smell of object is how to distribute, stay, strengthen and decay in network.
Realize for convenience these mechanism, in network packet, added a bit flag (flag).Distinguish which packet with this and need to do smell processing, as shown in Figure 2.In the time that this flag bit is 1, this bag is smell bag, and intermediate router node can extract srcID, is obtained the smell vector (h of this srcID by formula (1-1)
1, h
2..., h
k), then use formula (1-2) to strengthen its smell in the smell table corresponding with the interface that receives this smell bag; In the time that this flag bit is 0, this packet is non-smell bag, and intermediate router does not do smell processing to it.Flag bit is 1 or 0 to be self-determining by the object that sends this packet.Concrete mechanism as below.
Giving forth fragrance:
The objects such as the content of passive wait request and access, service, user, in order to facilitate other user to find them, can be on one's own initiative, periodically in network, distribute towards periphery the smell of oneself by the mode of broadcasting; The concentration of the smell distributing decays along with the increase of jumping figure.The radius of broadcast is by they own decisions, represents with r.
Odoriferous method is, every a period of time T
1(size is determined by user oneself), produce a smell broadcast packet, even the flag position of its head is 1, dstID is " broadcast ", the radius that simultaneously comprises an integer r representative permission odor dispersion at its head (is jumping figure, for example r=2 represents 2 jumpings), and make its TTL=r, then this broadcast packet is broadcasted away from all interfaces.
In the time that certain node is received this broadcast packet from interface i, first check whether this packet is received for the first time (according to parameter judgements such as its dstID, srcID and sequence number SN).If not receiving for the first time, delete this packet; If receive for the first time, make d=α
(r-TTL), and with following formula record with strengthen its smell
D
i，j(h
j)+＝α
(r-TTL)，for all j＝1，2，...，k (1-3)
Wherein 0 < α < 1 is given attenuation coefficient.Then, make TTL subtract 1; At this moment, if TTL=0 deletes this broadcast packet, otherwise this broadcast packet is broadcasted away to the total interface except interface i.
Scent when user searches object:
In network, user searches the object Shi Hui such as other user, content, service and stays the smell of oneself on the way., the objects such as user, content, service, in first request bag or respond packet sending, all provide a scent marking (flag position is 1) in the time that each communication starts; When node is on the way seen this mark, just leave the smell of this object at the interface of receiving this packet.As shown in Figure 3.
The method of scent is, in the time that node is received a packet with scent marking from meeting i, finds its source srcID from this packet head, makes d=1, and leaves its smell by formula (1-4)
D
i，j(h
j)+＝1，for all j＝1，2，...，k (1-4)
Between the object of two long-time communications, strengthen smell:
Between some object, can keep for a long time communication, now between object along with the lengthening of call duration time, every a period of time T
2, each object provides a scent marking (flag position is 1) in certain packet sending.Node on the way, in the time seeing this mark, is just strengthened the smell of this object at the interface of receiving this packet.Reinforcement smell mechanism is in this case also to realize by above formula.
Object A as shown in Figure 4 has long-time communication respectively with between B, C.In communication process, every a period of time T
2, the odor identification flag its head in certain packet that object A, B, C can send at oneself is made as 1, does strengthen smell processing on the way.
Smell is decayed in time:
Thought about the decay of time is based in a node, and the smell of other object is along with passage of time will slowly be disappeared, and in node, institute's scent of table of total interface is decayed together; The smell not being reinforced in this process will be decayed to 0 gradually.The method that smell is decayed is in time, every a period of time T
3, to the given coefficient 0 < β < 1 of value decay in institute's scent of table of total interface, even:
D
i，j(h
j)×＝β，for all i and j＝1，2，...，k (1-5)
Wherein β is time decay factor; T
3be a time interval parameter, represent every time interval T of crossing
3smell is just decayed once.
Again, router is forwarding data bag how.
In router, for each interface, maintain one group of smell table for forwarding data bag.In the time going to the packet of certain destination object to arrive router, query router is its smell table of establishing for each interface once, finds out the strongest interface of destination object smell by judgement, then from this interface, Datagram forwarding is gone out.If in total interface smell table the smell of destination object equate or be all 0, select randomly an interface to forward.
This method forwarding by odorousness, specific practice is in the time that node is received the packet that an object object is dstID, obtains its odor identification (h by formula (1-1)
1, h
2.., h
k), then in all interfaces, extract its odorousness, even
The meaning of formula (1-6) is, because hash function may exist conflict, therefore the hashed value obtaining with different dstID in smell table is likely identical, and now the smell in smell table not only has the smell of destination object, also has the smell of other object.Therefore through type (1-6) is got smell minimum value, and the smell now comprising is only the smell of destination object.
Find again the interface that contains its breast-high scent
The meaning of formula (1-7) is that through type (1-6) is found out after the smell value of destination object in each interface, finds out the interface of destination object smell value maximum.Then, the interface i from destination object smell value maximum this packet
*forward; If s
i=c or 0, for all i, select an interface to forward randomly.
In addition, in network, the object such as user, content, service can be mobile, and method for routing of the present invention is the mobility of support target well.
For mobile object, there is following mechanism:
In the time that an object moves, if there is packet to send, give scent marking on this data band, the packet odor identification flag that it sends is 1.If do not have packet to send, send a broadcast packet with scent marking and distribute its smell.
Claims (3)
1. an odor routing method, is characterized in that comprising following operation:
One, name:
Use the object in unique id marked network, described object comprises mobile subscriber and non-moving user, content and/or service, wherein mobile subscriber and non-moving user is referred to as to user; A k dimensional vector (h is set
1, h
2..., h
k) identify the position of smell in smell table: h
j=hash
j(id), j=1,2 ..., k formula (1), described hash
j(), j=1,2 ..., k, is k different hash function, h
jto be more than or equal to 0 integer; The method of each nodes records smell is that the each interface i in node is arranged to k smell table: D
i, 1, D
i, 2..., D
i, k, when receiving from interface i while coming from packet with scent marking of of object id, make D
i, j(h
j)=D
i, j(h
j)+d, j=1,2 ..., k formula (2), wherein, d is smell increment; D
i, j(h
j) occurrence of indicated object odorousness;
Two, giving forth fragrance:
Wait for the object of request and access, adopt the mode of broadcast in network, to distribute towards periphery the smell of representative object oneself, the concentration of the smell distributing decays along with the increase of jumping figure, odoriferous method is, every a time cycle, produce a broadcast packet, its head comprises an integer r and represents the radius of odor dispersion, and make its TTL=r, then this broadcast packet is broadcasted away from all interfaces; If certain node is received this broadcast packet from interface i, first check whether this broadcast packet is received for the first time; If not receiving for the first time, delete this broadcast packet; If receive for the first time, make d=α
(r-TTL)and record its smell with formula (2), wherein 0< α <1 is given attenuation coefficient; Then, make TTL subtract 1; If TTL=0, deletes this broadcast packet, otherwise this broadcast packet is broadcasted away to the total interface except interface i, wherein, TTL is a variable;
Three, stay and strengthen smell:
In first request bag or respond packet that object sends in the time that each communication starts, all provide a scent marking; After this,, along with the lengthening of call duration time, every a time cycle, each object provides a scent marking in certain packet sending; Node on the way, in the time seeing this mark, just leaves or strengthens the smell of this object at the interface of receiving this packet; Same interface in same node is received from the number of times of the bag of the scent of mark of same object more, and the smell of this object is just denseer; The method staying and strengthen smell is, in the time that node is received a packet with scent marking from interface i, finds its source id from this packet head, makes d=1, and stays or strengthen its smell with formula (2);
Four, smell is decayed in time:
Institute's scent of is all along with time decay; It is 0 that the smell not being reinforced will be attenuated; The method that smell is decayed is in time, every a time cycle, and to the given coefficient 0< β <1 of value decay in institute's scent of table of total interface, even:
D
i, j(h
j)=D
i, j(h
j) × β, j=1,2 ..., k formula (3), wherein, i represents interface sequence number;
Five, forward by odorousness:
In the time that a node is received a packet, want the object of addressing according to this packet, in its total interface, search the smell of this object, and this packet is forwarded to the interface with the breast-high scent of this object; If total interface all has the smell of this object of equal concentrations, select at random an interface to forward; Particularly, in the time that node receives that a destination is the packet of object id, obtain its odor identification (h with formula (1)
1, h
2..., h
k), then in all interfaces, extract its odorousness, even
Find again the interface that contains its breast-high scent
Then, this packet is forwarded from interface i*; If all S
iall equate, select randomly an interface to forward.
2. odor routing method as claimed in claim 1, is characterized in that: id is the long character string of an on-fixed, identifies uniquely an object; This character string adopts semantic meaning representation, service describing, Service Properties, user id or the user characteristics of address, name, content itself, content.
3. odor routing method as claimed in claim 1, is characterized in that: to as if mobile, in the time that an object moves, if there is packet to send, give scent marking on this data band; If do not have packet to send, send a broadcast packet with scent marking and distribute its smell.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110439713.4A CN102413058B (en) | 2011-12-23 | 2011-12-23 | Odor routing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110439713.4A CN102413058B (en) | 2011-12-23 | 2011-12-23 | Odor routing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102413058A CN102413058A (en) | 2012-04-11 |
| CN102413058B true CN102413058B (en) | 2014-05-21 |
Family
ID=45914917
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110439713.4A Expired - Fee Related CN102413058B (en) | 2011-12-23 | 2011-12-23 | Odor routing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102413058B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104767678B (en) * | 2014-01-02 | 2018-08-14 | 中国科学院声学研究所 | The method for routing realized in the content based on contents attribute in name in heart network |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101179490A (en) * | 2007-11-21 | 2008-05-14 | 湖南大学 | Event perception based wireless sensor network anycast routing method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8867539B2 (en) * | 2009-09-18 | 2014-10-21 | At&T Intellectual Property I, L.P. | Multicast-unicast protocol converter |
-
2011
- 2011-12-23 CN CN201110439713.4A patent/CN102413058B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101179490A (en) * | 2007-11-21 | 2008-05-14 | 湖南大学 | Event perception based wireless sensor network anycast routing method |
Non-Patent Citations (4)
| Title |
|---|
| "蚁群算法及其在QoS路由上的应用";王菁;《中国优秀硕士学位论文全文数据库信息科技辑》;20090815;第3页第9行到第9页第9行，第16页第1行到第19页第10行 * |
| "选播路由及其关键技术研究";李领治;《中国博士学位论文全文数据库信息科技辑》;20071215;第4页第2行到第10页第33行 * |
| 李领治."选播路由及其关键技术研究".《中国博士学位论文全文数据库信息科技辑》.2007,第4页第2行到第10页第33行. |
| 王菁."蚁群算法及其在QoS路由上的应用".《中国优秀硕士学位论文全文数据库信息科技辑》.2009,第3页第9行到第9页第9行，第16页第1行到第19页第10行. |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102413058A (en) | 2012-04-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6990075B2 (en) | Scalable unidirectional routing with zone routing protocol extensions for mobile AD-HOC networks | |
| Wadhwa et al. | Extended shortcut tree routing for ZigBee based wireless sensor network | |
| US20140129736A1 (en) | Data Routing | |
| CN103826283B (en) | A kind of method for routing and device of wireless self-networking interior joint | |
| ATE429112T1 (en) | METHOD, COMMUNICATION SYSTEMS AND MOBILE ROUTERS FOR ROUTING DATA PACKETS FROM A MOVING NETWORK TO A HOME NETWORK OF THE MOVING NETWORK | |
| CN101296180A (en) | Wireless Mesh network self-adapting routing method based on throughput performance | |
| Kim et al. | TOP-CCN: Topology aware content centric networking for mobile ad hoc networks | |
| CN108696438A (en) | The retransmission method and device of BIER messages | |
| Boushaba et al. | Optimization on OLSR protocol for reducing topology control packets | |
| CN101106520A (en) | Multi-routing technology with several independent root nodes based on AODV | |
| Han et al. | Best route, error broadcast: a content-centric forwarding protocol for MANETs | |
| CN110943918A (en) | Networking method of centerless multi-channel concurrent transmission system | |
| Yang et al. | Hybrid routing protocol for wireless mesh network | |
| Jodra et al. | Service discovery mechanism over OLSR for mobile ad-hoc networks | |
| Yan et al. | D-ODMRP: a destination-driven on-demand multicast routing protocol for mobile ad hoc networks | |
| CN102413058B (en) | Odor routing method | |
| Minh et al. | Performance evaluation of MANET based on named data networking using hybrid routing mechanism | |
| Chen et al. | Shortcut anycast tree routing in MANETs | |
| CN101383758B (en) | Multi-address space mobile network structure, router device and data transmitting method | |
| Ramanuj et al. | Enhanced Expanding Ring Search Algorithm for AODV | |
| CN106060890B (en) | A kind of path selecting method and device based on reputation value | |
| Quang et al. | Proposal and performance analysis of hybrid NDN based ad hoc routing combining proactive and reactive mechanisms | |
| Singh et al. | Comparison and study of aomdv and dsdv routing protocols in manet using ns-2 | |
| Chen et al. | An entropy-based long-life multicast routing protocol in maodv | |
| Pereira et al. | Named data for mobile AdHoc networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140521 Termination date: 20201223 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |