CN101969681A - Realization method of router of large-scale mobile self-organizing network - Google Patents
Realization method of router of large-scale mobile self-organizing network Download PDFInfo
- Publication number
- CN101969681A CN101969681A CN2010105370806A CN201010537080A CN101969681A CN 101969681 A CN101969681 A CN 101969681A CN 2010105370806 A CN2010105370806 A CN 2010105370806A CN 201010537080 A CN201010537080 A CN 201010537080A CN 101969681 A CN101969681 A CN 101969681A
- Authority
- CN
- China
- Prior art keywords
- node
- route
- secondary ring
- ring
- resource
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Abstract
The invention provides a realization method of a layered shared router supporting a large-scale mobile self-organizing network. In the method, an on-demand ring domain division mechanism and a two-level layering mechanism are introduced into an MANET (Mobile Ad Hoc Network) physical network to construct a two-layer logic network architecture based on primary-secondary ring domain spaces, a series of DHT (Distributed Hash Table) routing algorithms based on a P2P (Peer-to-Peer) computation mode are designed, a resource distribution interface of the upper application is reserved, and a large-scale mobile self-organizing network system architecture with completely distributed structure, height expandability and robustness is established. The method comprises the following steps of: (1) constructing the primary-secondary ring domain spaces through the on-demand ring domain division mechanism and the two-level stratifying mechanism; (2) realizing the distributing and the sharing of the secondary ring member information in the primary ring domain space and the node routing information in the secondary ring domain space through a router resource distributing and sharing algorithm; (3) realizing the node routing and locating through a router inquiry algorithm; (4) updating the router of the network through a router maintenance algorithm; and (5) reserving the resource distribution interface of the upper application.
Description
Technical field
The invention belongs to the mobile ad-hoc network technical field of (Mobile Ad Hoc Networks is called for short MANET), be specifically related to share the design and the realization of method for routing based on the MANET layering of P2P computation schema.The method is applied in the MANET route matrix, the support to large-scale network environment can be provided, improve its network router efficiency simultaneously.
Background technology
(peer-to-peer network, P2P) to be applied in the extensive mobile ad-hoc network route matrix be theoretical foundation of the present invention to technology with computer equity the Internet.Because MANET itself has reciprocity architected features, each node has both the function of route and main frame, and its Routing Protocol adopts distributed control mode usually, and these characteristics have exactly met P2P The Application of Technology category.In recent years, Chinese scholars has been launched in a large number the P2P achievement in research to be applied to the exploration of MANET research field, and attempts to utilize the technical advantage of P2P to solve key technical problem in the MANET route.
Review is based on the network route method of P2P computation schema, and its development is broadly divided into the three generations: 1, centralized directory formula P2P method for routing (is represented agreement: Napster); 2, the non-structural P 2 P method for routing (is represented agreement: Gnutella); 3, the structural P 2 P method for routing (represent agreement: chord, CAN, Pastry, kademlia).Because the third generation has solved the anti-attack problem of the first generation, solved problems such as second generation search efficiency is low, become the method for routing that Internet goes up extensive use.Given this, third generation method for routing among the Internet is expanded the focus that becomes academia's research in mobile ad-hoc network.At present, just at the early-stage at the research based on the MANET method for routing of P2P computation schema both at home and abroad, majority is in the stage of theory study; Its research approach only is applicable to the MANET environment of middle and small scale mostly, and ubiquity detours and problems such as router efficiency is low.
The subject matter that this present invention need solve has 3 points: the one, how to shield the difference that P2P and MANET exist on physical layer, and in the MANET route matrix, merge the P2P technology effectively; The 2nd, how in MANET, to solve the intrinsic problems such as topological mismatch of structural P 2 P Routing Protocol, further improve router efficiency; The 3rd, how the support to extensive MANET environment is provided.
The present invention will propose to support the layering of extensive mobile network environment to share method for routing around above-mentioned three problems.This method has adopted the layering and the distributed sharing policy of P2P of topology Network Based, routing iinformation issued on different layers and share, make the routing inquiry complexity constantly approach O (1), set up effectively based on the mobile ad-hoc network layering of P2P computation schema and share route matrix (MANET Layered Share Routing Model Based On P2P Computing, be called for short LSRM), lay the foundation for developing efficient, practical extensive mobile ad-hoc network Routing Protocol.
Summary of the invention
The objective of the invention is in extensive MANET environment, to merge the P2P technology effectively, solution detours and the not high problem of router efficiency, provide based on the layering of P2P computation schema and share method for routing, this method will be constructed " master-secondary ring domain space " two-layer logic cover layer in extensive MANET, be gathered into ring by the node that physical location is close, and finish the issue of route resource and share at two-layer ring domain space, the problem such as detour that solves that topological mismatch causes in the structural P 2 P Routing Protocol makes router efficiency along with increasing of node number is more and more higher.
How in the MANET route matrix, to merge the P2P technology effectively, need be in conjunction with the multi-hop routing to communicate characteristic of MANET physical layer.Discover that two kinds of networks of P2P and MANET at the essential difference that physical layer exists are: P2P is based on the Internet physical structure, communicates by node IP address; And MANET sets up wireless multi-hop connection communication in transceiver limit signal spread scope.Further to distributed Sharing Theory of P2P and MANET dynamic source routing protocol (Dynamic Source Routing, discovering DSR): produce during the MANET route discovery and the multi-hop route of storage has possessed the characteristic of information resources among the P2P, also the necessary information of inter-node communication exactly.
As everyone knows, the immense success that the P2P system obtains on Internet has benefited from its distributed shared thought marrow: the storage and the computing capability that make full use of idle node, making cooperates between them jointly finishes the distributed shared of information resources, improves the efficient of network route and resource searching.The present invention is the traditional P2P resource issue of application layer and network route layer that sharing policy is transplanted to MANET of being in, and " multi-hop route " issued between node as route resource and shared.Issue and resources shared have essential different in route resource herein and the P2P system, the former issues and shares for network node obtains routing iinformation, and the latter issues and shares for network node obtains information resources (comprising video, sound, file etc.); The former is network layer node route service, and the latter is application layer resource-sharing service.Because what " multi-hop route " embodied is the characteristic of MANET physical layer, it is issued as resource and the shared distributed Sharing Theory of P2P of fully having used, therefore conception of the present invention meets P2P and the designing requirement of fusion rationally of MANET route matrix, the distributed technology of sharing advantage of P2P is incorporated in the MANET route matrix, utilize the storage and the computational resource of idle node, make cooperation jointly between them, the process that improves route discovery and share, thus effectively improve the MANET router efficiency.Simultaneously,, greatly alleviate application layer development amount, help improving the development efficiency of application system for issue of system applies layer obligate information resource and shared interface.
Because the P2P technical advantage has been merged in the present invention, the network router efficiency can be more and more faster along with increasing of node number, guaranteed the support to extensive mobile ad-hoc network.Simultaneously, the structure of " master-secondary ring domain space " is controlled at the disturbance of network part in the close secondary ring domain space of physical location and solves, and makes network have stronger stability, more can adapt to the mobile ad-hoc network environment of dynamic change.
The objective of the invention is to solve by the following technical programs:
Design object of the present invention is at the development of next generation network technology (NGN) and extensive mobile ad-hoc network application demand, and (Distributed Hash Tables DHT) has set up based on the shared mobile ad-hoc network route matrix LSRM of the layering of P2P computation schema to cooperate the distributed hash hashing algorithm.This route matrix is introduced on the MANET physical layer and is encircled territory division mechanism and two-stage layering as required, made up a two-layer logical network framework based on " master-secondary ring domain space ", and design has realized a series of routing algorithms based on DHT thereon, has reserved the resource issuing interface of upper layer application simultaneously.Finally set up an extensive mobile ad-hoc network routing architecture framework with complete distributed frame, highly scalable and robustness, Fig. 1 has illustrated layering to share the architecture of route matrix (LSRM), can be used for providing essential information service functions such as file resource positioning service, communication security service, file resource transmission service and information management service.The design principle of LSRM is described below on the whole:
1, master-secondary ring domain space
LSRM divides mechanism and two-stage layering by introducing based on the territory of ring as required of MANET physical topology, makes up the two-layer topological network framework based on " master-secondary ring domain space ".Main ring domain space (Primary ring zone wherein, being called for short PRZ) the eye node of choosing each secondary ring is gathered into the Hash main ring, secondary ring domain space (Secondary ring zone, be called for short SRZ) choose the node that the data communication demand is arranged, progressively that physical location is close node is gathered into the Hash secondary ring.While is used ring territory control lock on two-layer ring territory, make upper layer application enjoy the highest control, ensures the timely transmission of business datum on the one hand, finishes work such as node adding, resource issue and routing update on the other hand when network is idle.Master-secondary ring domain space schematic diagram is shown in Fig. 2 (a).
2, based on the DHT routing algorithm of P2P computation schema
Leading-basis of secondary ring domain space on, the LSRM model will by realize the route resource issue based on P2P computation schema DHT routing algorithm and share, functions such as node route and location.When new route resource occurring, PRZ will issue and share " inferior ring members " information that each eye node has, SRZ will issue and shared inferior ring members between " multi-hop route " information.When routing inquiry, inquiry will be carried out along the order of " source secondary ring-main ring-purpose secondary ring ".The shared inquiry schematic diagram of LSRM model is shown in Fig. 2 (b).
3, resource issuing interface
The LSRM model is except having realized the issue of route resource in the design of grid layer and having shared, information resources issue and shared interface have been reserved for application layer simultaneously, do not need to programme accordingly in application layer again, help improving the development efficiency of upper layer application system.
The present invention proposes a kind of shared route implementing method of layering of supporting extensive mobile ad-hoc network, the NS2 emulation experiment shows can effectively promote router efficiency, and the routing inquiry complexity is constantly approached O (1).The method has been filled up domestic and international blank in this field, will produce active influence to the development of extensive mobile ad-hoc network technology.
Description of drawings
Route matrix (LSRM) architecture is shared in Fig. 1 MANET layering;
Fig. 2 LSRM network topology schematic diagram;
Fig. 3 master-secondary ring domain space makes up schematic diagram;
Fig. 4 master-secondary ring domain space makes up flow process;
Fig. 5 secondary ring route resource is chosen schematic diagram
Fig. 6 secondary ring-route resource issue and share flow process;
Fig. 7 main ring-route resource issue and share flow process;
Fig. 8 routing inquiry flow process.
Embodiment
Concrete implementation step of the present invention is shared the route matrix routing algorithm by the design layering and is finished.It is based on the network layer routing algorithm of MANET, adopted DHT hash formula routing algorithm based on the P2P computation schema, on the basis of DSR routing algorithm, the Chord routing algorithm is improved, leading-the secondary ring domain space on operation based on the structuring cover layer P2P algorithm network routing of DHT, effectively realized information sharing and message communicating between mobile node.Following mask body is introduced the basic design of LSRM routing algorithm: master-secondary ring domain space makes up algorithm, route resource issue and shares algorithm, routing inquiry and route maintenance algorithm.
1, master-secondary ring domain space makes up algorithm
It serves as to drive the two-stage hierarchical topology network architecture that progressively makes up with the data communication demand that the LSRM model is one; when having avoided netinit, such mode makes up the expense that floods in a large number that bring in Hash ring territory in the network-wide basis; new routing algorithm is restrained quickly; improve network extensibility, thereby be fit to large-scale MANET environment more.
In order to describe algorithm specific design thinking easily, set following scene: n node arranged in the mobile ad-hoc network, and the secondary ring radius is that R jumps (that is: inferior ring members is to the maximum hop count of eye), any time node Ni → Nj (i, j ε n) send packet, experience K jumps during route discovery.The rule that secondary ring makes up is: with the eye node is the center of circle, chooses acyclic domain space node structure with eye distance＜=R along multihop path.The rule that main ring makes up is: the eye node with each secondary ring makes up.Hierarchical topology layer building arthmetic statement is as follows:
1) when node Ni has data to send demand, judges at first whether Ni is ring territory member, if enter step 2; Otherwise enter step 5.
2) if in the ring domain space, inquire Nj, finish data and send; Otherwise start the transmission that route discovery is finished data, enter step 3.
3) initiate the R jumping with Nj and flood, search time eye recently,, Nj is added this secondary ring if exist eye to reply; Otherwise with Nj is that eye is set up new secondary ring, as Fig. 3 (a), enters step 4.
4) judge whether main ring exists,, Nj is added main ring if exist; Otherwise set up main ring.
5) start route discovery, finish the transmission of data.If exist eye to reply in the route discovery, enter step 6; Otherwise with Ni is that eye is set up first secondary ring,
6) calculating Ni is L with the jumping figure of eye recently, when L＜=R, Ni is added this secondary ring; Otherwise with Ni is that eye is set up new secondary ring, as Fig. 3 (b).
7) judge whether to exist main ring,, Ni is added main ring if exist; Otherwise set up main ring.
Algorithm flow as shown in Figure 4.
2, LSRM route resource issue and share algorithm
Route resource is issued and is shared algorithm and merge the distributed thought of sharing and cooperating of P2P on the basis of DSR, has changed the situation that mobile node is done things in his own way in traditional MANET algorithm.New algorithm makes the node intellectuality; the node that physical location is closed on by route resource issue and shared recursive procedure constantly joins in the Hash ring territory; and when network is idle, initiatively participate in the issue and distributed sharing of route resource, router efficiency can be more and more faster along with increasing of node.(1) secondary ring route resource issue and share algorithm
Algorithm will be each time " multi-hop route " resource of obtaining of DSR route discovery issue in secondary ring according to certain rule and shared, make shortest path that each node in the secondary ring progressively acquires other node by.Secondary ring route resource issue and sharing occurs in secondary ring and sets up and finish, when route is unreachable in routing inquiry or the resource issue, initiates node by eye node or route discovery and finish.Route resource＜K, V〉to the rule of choosing be: secondary ring is set up under the performance, chooses reverse " the multi-hop route " of this secondary ring member node on the path along the path of route discovery by the eye node, as Fig. 5 (a); Under the inaccessible situation of route, initiate node is chosen this secondary ring member node on the path along the path of route discovery reverse " multi-hop route " by route discovery, as Fig. 5 (b).K represents to provide the route resource keyword of inquiry, and V represents actual path; For example: node A is to node F, and the path is " A → C → H → D → F ",＜K, V〉to being expressed as＜AF ACHDF 〉.Secondary ring route resource issue and to share arthmetic statement as follows, algorithm flow as shown in Figure 6.
1) the resource publisher node obtains secondary ring domain space control, taking-ups＜K successively from route resource issue formation, V〉right, according to the rule of Chord algorithm interpolation keyword this route resource is published to respective nodes, discharge secondary ring domain space control at last.In this process,, enter step 2 if the inaccessible situation of route takes place.
2), query-submit is arrived next-hop node by route discovery.
3) judge in the new route that route discovery produces whether have new node (acyclic domain space node), and be less than or equal to the secondary ring radius with the distance of eye.If new node obtains secondary ring domain space control with wait, new node is joined in this secondary ring successively after the acquisition, discharge secondary ring domain space control then, enter step 4; If not, directly enter step 4.
4) route discovery initiation node will newly obtain＜K, V〉to putting into route resource issue formation, continue to wait for secondary ring domain space control, so form the process of a recurrence issue route resource.
(2) main ring route resource issue and share algorithm
Algorithm makes each eye node can inquire arbitrary node in the ring domain space member node tabulation issue and shared on main ring that each eye node has.The route resource of main ring issue and sharing occurs in main ring and makes up and finish and new main link adds fashionablely, is finished by each main link.Route resource＜K, V〉to the rule of choosing be: the inferior ring members of main link place secondary ring (non-eye node) tabulation.K represents to provide the inferior ring members keyword of inquiry, the eye node of secondary ring under V represents; For example: node A belongs to the secondary ring at eye F place,＜K, V〉to being expressed as＜A F 〉.The specific implementation step is: the resource publisher node obtains main ring domain space control, taking-up＜K successively from inferior ring members issue formation, V〉right, the rule of adding keyword according to the Chord algorithm is published to respective nodes with this secondary ring node, discharge main ring domain space control at last, algorithm flow as shown in Figure 7.
3, LSRM routing inquiry algorithm
Algorithm provides the inquiry of route between node, ensures that the data of upper layer application send timely and effectively.The routing inquiry algorithm is finished routing inquiry according to the order of " source secondary ring-main ring-purpose secondary ring ".
Suppose a wireless self-organization network with N node, the node number of secondary ring is that (2≤S＜N), then the node of main ring is counted P=int (N/S) to S.When having available route in the local route-caching, the routing inquiry complexity is O (1); Otherwise the routing inquiry complexity is T.
T＝2×O(logS)+O(logP)
Because algorithm is enabled the node route-caching in query script, progressively deposit the routing iinformation that inquires in local route-caching, As time goes on, node has had increasing available route, causes the routing inquiry complexity constantly to approach O (1) from T.The mode of so continuous resettlement routing iinformation has been drawn the advantage of quick convergence of reaction equation routing policy and adaptation dynamic environment at the network initial stage, by the time drawn again after network is progressively stable and answered the high advantage of formula routing policy routing inquiry efficient earlier, embodied reaction equation and answered the reasonable fusion of two kinds of routing policies of formula earlier.On the other hand, the shortest path that obtains when all being route discovery owing to the routing iinformation that inquires has solved the problem that detours that the structural P 2 P algorithm exists.Algorithm flow as shown in Figure 8.
4, LSRM route maintenance algorithm
The adding of mobile node and withdraw from and be similar to the Chord algorithm in the route maintenance algorithm does not repeat them here.When the eye member withdrawed from, electing its successor node automatically was new eye node, upgraded simultaneously in the ring domain space and the relevant setting of this new eye node.
Claims (6)
1. the implementation method of an extensive mobile ad-hoc network route is characterized in that: may further comprise the steps:
(1) mechanism is divided in the territory and the two-stage layering makes up " master-secondary ring domain space " by encircling as required;
(2) by route resource issue with share algorithm and realize the issue of main ring domain space secondary ring information about firms and secondary ring domain space node routing iinformation and share;
(3) realize mobile node route and location by the routing inquiry algorithm;
(4) by route maintenance algorithm maintaining network state and renewal route;
(5) the resource issuing interface of reservation upper layer application.
2. the implementation method of extensive mobile ad-hoc network route according to claim 1, it is characterized in that: when step (1) makes up master-secondary ring domain space, the eye node that the main ring domain space is chosen each secondary ring is gathered into the Hash main ring, the secondary ring domain space is chosen the node that the data communication demand is arranged, and progressively that physical location is close node is gathered into the Hash secondary ring.
3. the implementation method of extensive mobile ad-hoc network route according to claim 1 is characterized in that: step (2) has realized the issue of route resource and has shared, has been divided into two aspects:
The first, secondary ring route resource issue and shared:
" multi-hop route " resource that DSR route discovery is each time obtained issue in secondary ring according to certain rule and is shared, make shortest path that each node in the secondary ring progressively acquires other node by.Route resource＜K, V〉to the rule of choosing be: secondary ring is set up under the performance, is chosen reverse " the multi-hop route " of this secondary ring member node on the path along the path of route discovery by the eye node.
The second, main ring route resource issue and shared:
Algorithm makes each eye node can inquire arbitrary node in the ring domain space member node tabulation issue and shared on main ring that each eye node has.Route resource＜K, V〉to the rule of choosing be: the inferior ring members of main link place secondary ring (non-eye node) tabulation.
4. the implementation method of extensive mobile ad-hoc network route according to claim 1 is characterized in that: step (3) is finished routing inquiry according to the order of " source secondary ring-main ring-purpose secondary ring ".In query script, enable the node route-caching, progressively deposit the routing iinformation that inquires in local route-caching.
5. the implementation method of extensive mobile ad-hoc network route according to claim 1, it is characterized in that: step (4) is safeguarded the adding of mobile node and is withdrawed from, when the eye member withdraws from, automatically electing its successor node is new eye node, and time upgrades in the ring domain space and the relevant setting of this new eye node.
6. the implementation method of extensive mobile ad-hoc network route according to claim 1, it is characterized in that: step (5) is issue of application layer obligate information resource and shared interface, do not need to programme accordingly in application layer again, help improving the development efficiency of upper layer application system.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105370806A CN101969681A (en) | 2010-11-08 | 2010-11-08 | Realization method of router of large-scale mobile self-organizing network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105370806A CN101969681A (en) | 2010-11-08 | 2010-11-08 | Realization method of router of large-scale mobile self-organizing network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101969681A true CN101969681A (en) | 2011-02-09 |
Family
ID=43548742
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010105370806A Pending CN101969681A (en) | 2010-11-08 | 2010-11-08 | Realization method of router of large-scale mobile self-organizing network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101969681A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103441918A (en) * | 2013-08-29 | 2013-12-11 | 哈尔滨工程大学 | Self-organizing cluster server system and self-organizing method thereof |
| CN104199679A (en) * | 2014-08-01 | 2014-12-10 | 百度在线网络技术（北京）有限公司 | Method and device used for obtaining updating |
| WO2020011012A1 (en) * | 2018-07-10 | 2020-01-16 | 云图有限公司 | Computing resource searching method and system for p2p network |
| CN111049746A (en) * | 2018-10-12 | 2020-04-21 | 华为技术有限公司 | Routing table item generation method, dictionary tree generation method and device |
| CN111159193A (en) * | 2019-12-27 | 2020-05-15 | 掌迅亿通(北京)信息科技有限公司 | Multi-layered consistent hash ring and its application in creating distributed database |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1691619A (en) * | 2004-04-27 | 2005-11-02 | 国家数字交换系统工程技术研究中心 | Method for implementing self-organizing network |
| CN101047550A (en) * | 2006-03-28 | 2007-10-03 | 华为技术有限公司 | Block structure of P2P network and its network set method |
-
2010
- 2010-11-08 CN CN2010105370806A patent/CN101969681A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1691619A (en) * | 2004-04-27 | 2005-11-02 | 国家数字交换系统工程技术研究中心 | Method for implementing self-organizing network |
| CN101047550A (en) * | 2006-03-28 | 2007-10-03 | 华为技术有限公司 | Block structure of P2P network and its network set method |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103441918A (en) * | 2013-08-29 | 2013-12-11 | 哈尔滨工程大学 | Self-organizing cluster server system and self-organizing method thereof |
| CN104199679A (en) * | 2014-08-01 | 2014-12-10 | 百度在线网络技术（北京）有限公司 | Method and device used for obtaining updating |
| WO2020011012A1 (en) * | 2018-07-10 | 2020-01-16 | 云图有限公司 | Computing resource searching method and system for p2p network |
| CN111049746A (en) * | 2018-10-12 | 2020-04-21 | 华为技术有限公司 | Routing table item generation method, dictionary tree generation method and device |
| CN111049746B (en) * | 2018-10-12 | 2022-04-22 | 华为技术有限公司 | Routing table item generation method, dictionary tree generation method and device |
| US11627072B2 (en) | 2018-10-12 | 2023-04-11 | Huawei Technologies Co., Ltd. | Routing entry generation method and apparatus and trie generation method and apparatus |
| CN111159193A (en) * | 2019-12-27 | 2020-05-15 | 掌迅亿通(北京)信息科技有限公司 | Multi-layered consistent hash ring and its application in creating distributed database |
| CN111159193B (en) * | 2019-12-27 | 2023-08-29 | 掌迅亿通(北京)信息科技有限公司 | Multi-layer consistent hash ring and application thereof in creating distributed database |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Abid et al. | A survey on DHT-based routing for large-scale mobile ad hoc networks | |
| CN101483670B (en) | Regional P2P computation data consistency maintenance method based on distributed hash table | |
| CN106165355A (en) | For the methods, devices and systems by realizing network association based on the peerings of hash route and/or summary route | |
| CN101163158B (en) | Cluster based service issuing and discovering method in self-organizing network facing to service | |
| CN104853398A (en) | Route optimization method for tree shape wireless sensor network | |
| CN101170499A (en) | A selection method for combined service execution path in self-organized network | |
| WO2009100637A1 (en) | Routing constructing method and apparatus | |
| CN101969681A (en) | Realization method of router of large-scale mobile self-organizing network | |
| Lee et al. | Efficient peer-to-peer information sharing over mobile ad hoc networks | |
| Papakostas et al. | Energy-aware backbone formation in military multilayer ad hoc networks | |
| Zulhasnine et al. | Towards an effective integration of cellular users to the structured peer-to-peer network | |
| Raychoudhury et al. | K-directory community: Reliable service discovery in MANET | |
| Ibrar et al. | 3-D-SIS: a 3-D-social identifier structure for collaborative edge computing based social IoT | |
| Ohnishi et al. | Incremental construction of delaunay overlaid network for virtual collaborative space | |
| Galluccio et al. | Georoy: A location-aware enhancement to Viceroy peer-to-peer algorithm | |
| Deokate et al. | Mobility-aware cross-layer routing for peer-to-peer networks | |
| CN103533597A (en) | Unstructured mobile peer-to-peer coverage network and construction and maintenance methods thereof | |
| Doss et al. | Information discovery in mission-critical wireless sensor networks | |
| Chaturvedi et al. | Energy efficient cluster head selection for cross layer design over wireless sensor network | |
| Cheklat et al. | A limited energy consumption model for p2p wireless sensor networks | |
| Kumar et al. | An optimized replica allocation algorithm amidst of selfish nodes in MANET | |
| Viana et al. | Easily-managed and topology-independent location service for self-organizing networks | |
| CN102104518B (en) | Hybrid Pastry network for voice over Internet protocol (VoIP) service | |
| Yu | RTCP: reliable topology construction protocol of bluetooth hybrid single‐hop and multi‐hop networks | |
| Zhou et al. | Smf: A novel lightweight reliable service discovery approach in manet |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20110209 |