CN101163158B - Cluster based service issuing and discovering method in self-organizing network facing to service - Google Patents
Cluster based service issuing and discovering method in self-organizing network facing to service Download PDFInfo
- Publication number
- CN101163158B CN101163158B CN2007101707876A CN200710170787A CN101163158B CN 101163158 B CN101163158 B CN 101163158B CN 2007101707876 A CN2007101707876 A CN 2007101707876A CN 200710170787 A CN200710170787 A CN 200710170787A CN 101163158 B CN101163158 B CN 101163158B
- Authority
- CN
- China
- Prior art keywords
- service
- bunch
- node
- information
- basic service
- 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
Landscapes
- Computer And Data Communications (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention belongs to the technical field of self-organization network, in particular to a sub-cluster-based service distribution and discovering method on the self-organization network facing service. The method is divided into three parts comprising a sub-cluster maintenance, a service distribution and a service discovering. The cluster maintenance is divided into two parts comprising a sub-cluster and a cluster updating; the service distribution comprises a service information establishment and a service information updating; the service discovering means after finishing the sub-clusterand the service distribution, a node discovers basic service on the self-organization network through a cluster head. The invention can effectively avoid the broadcast storm phenomenon of the prior service distribution and the service discovering method; the method can also use replaceable service to enhance the efficiency of the service discovering.
Description
Technical field
The invention belongs to the self-organization network technology field, be specifically related in a kind of service-oriented self-organizing network service distribution and discover method based on sub-clustering.
Background technology
Along with rapid development of network technology, user's demand develops into function how to utilize other Web website to provide from initial information sharing gradually.Correspondingly, service science is suggested as the subject that effectively carries out funcall.Service be a kind ofly be deployed on the network, self-contained, modular application program, it can be described in network, issue, search and call.The proposition of service has realized can offering any hardware on various device or the platform or software entity resource or function a kind of abstract of other device accesses.Can synthetic one of several simple relatively services can be accomplished the more service of complex task through the service combination.Service combination at present is that software field realizes resource-sharing, an important way that improves resource utilization and improve software quality.
Self-organizing network is a kind of wireless network that does not need fixed infrastructure, under mobile or fixed environment, can dispose fast.Node in the network utilizes self radio transceiver exchange message, when each other not in communication range each other, can realize multi-hop communication by other intermediate node relayings.This network topology is compared with the network topology that foundation structure is arranged has that scalability is big, flexibility good, be easy to characteristics such as control, reliability height; Mainly be used in military field; As be used for the transmission of information on the battlefield; Also the transmission that civil area carries out voice-and-data be can be used in, as intelligent transportation monitoring, environmental monitoring and office cooperation etc. are used for.
Because computing capability, storage capacity and the energy resource of self-organizing network individual node are limited, the service function of individual node is also limited, but exists great deal of nodes that identical or different service can be provided in the network simultaneously.If can the service that these nodes provide be made up, just can be the user complicated more service is provided, improve the utilance of network and Service Source, meet consumers' demand better.In self-organizing network, the service combination is mainly carried out three processes through service discovery, service combination and service and is realized.Service discovery is position of serving in the requester network and the process of collecting relevant information.
Service discovery mechanisms under the present general environment mainly contains Jini, Upnp, Salutation/Salutation-lite, SLP.Jini is a kind of distributed service discovery architecture by the exploitation of SUN company; Its target is to convert legacy network into a kind of flexible, manageable instrument; Make the user can find service easily; Its core is JLS (Jini Lookup Service), safeguards the multidate information of available service.Upnp has expanded the model of Microsoft about the external equipment plug and play, supports the service discovery that different vendor's network equipment provides.Upnp adopts SSDP (Simple Service Discovery Protocol) on IP network, to find service.Salutation be a kind of open standard, with the service discovery and the session management protocol of platform independence; Its target is to solve the service discovery of large number quipments and the problem of utilization in wide area or mobile environment, and wherein SalutationLookup Manager is as the agency who serves in the network.Salutation-lite is for adapting to the simplification prototype of the Salutation that skinny device designs.SLP is a kind of and agreement language independent, on IP network, carries out automated service discovery, and three types agency (user agent, service broker and discovery agency) is arranged.We can find on above-mentioned agreement; These agreements all only are useful on the network of foundation structure; Because they need center service and find that the agency assists to accomplish the function of service distribution and discovery, this mechanism also is not suitable for the network of this type of self-organizing network foundation-free structure.Characteristics such as Ninja is the service discovery system of Berkeley university research, is made up of user, service and SDS server, and that system has is scalable, fault-tolerant, safety is available are supported local or wide-area services; User, service adopt overall SDS Multicast Channel and SDS server to communicate.Bluetooth Service Discovery Protocol is the simple services discovery mechanism in the P2P network; Realize the directory service of no center; Information on services be stored in each move/local service on the static device finds on the server; But this server does not indicate the access method to service, just answer be on this equipment, whether serve available.(why inapplicable are these two agreements?)
Now the service discovery on the self-organizing network mainly is through the mode of flooding node broadcasts services request towards periphery, but the efficient of this overall situation broadcasting is lower, and causes broadcast storm (broadcast storm) easily.To above problem, the present invention proposes based on the service distribution of sub-clustering and the method for service discovery.
Summary of the invention
The objective of the invention is to improve broadcasting efficiency, avoid service distribution and discover method in the self-organizing network of broadcast storm.
The method that the present invention proposes is based on the service distribution of sub-clustering and the method for discovery.In the process that forms sub-clustering, just can carry out service distribution, and in bunch head, deposit the basic service information in the intra-cluster of n (1＜=n＜=10) jumping on every side.N confirms according to the current state and the quality of service requirement of interdependent node in the network.After sub-clustering forms, in conjunction with answering two kinds of strategies of formula and reaction equation earlier: bunch in, through bunch head bunch in broadcasting or by node to a bunch head request; Bunch between, adopt the method for broadcasting between bunch head, in network, carry out dynamic service discovery.
Introduce basic concepts below.
Self-organizing network is meant the autonomous system that multi-hop is provisional that some terminals that have wireless transmitter are formed.It has the circumscribed characteristics of independent networking, no center, self-organizing, multi-hop route, dynamic topology and portable terminal.
The sub-clustering algorithm is according to certain rule network to be divided into many bunches that can be interconnected and cover all nodes according to system requirements, and when network configuration changes, upgrades the normal function of clustering architecture with maintaining network.
Bunch head is to select according to certain sub-clustering algorithm or rule to be responsible for coordinating and to manage all nodes in its place bunch, in bunch except bunch head all the other nodes be called the member.Has only a bunch of head in one bunch.
It is to be used for the self-organizing network of share service that service-oriented self-organizing network refers in particular to major function.
In self-organizing network, there is a large amount of smart machines that different information and service are provided.One of basic purpose of user access network is to obtain the service that miscellaneous equipment provided in the network or to miscellaneous equipment service is provided through network.Design the service discovery protocol that a kind of ability is fit to self-organizing network environment, so that find that with efficient the service of position-based and sight is most important fast.The present invention proposes in the service-oriented self-organizing network service distribution and discover method based on sub-clustering.This sub-clustering strategy directly applies to network layer.The advantage of this method has been to reduce the Network Transmission cost when service distribution is with discovery in the self-organizing network.Concrete steps are divided into: bunch maintenance, service distribution and three major parts of service discovery.Be described in detail in the face of these three steps down.
1. bunch maintenance
Bunch maintenance comprises two steps: election of cluster head and sub-clustering, bunch renewal.
(1) election of cluster head and sub-clustering
Election of cluster head is undertaken by the principle of " at most contiguous basic service number preferential ", promptly elects around those node conduct bunch head of (comprising present node itself) basic service most number in n (1＜=n＜=10) hop neighbor.The basic service number of each node overseas broadcast self is at first known the basic service number in the n hop neighbor on every side up to each node.Node with maximum contiguous basic service numbers becomes a bunch head; And to broadcast towards periphery self be the information of bunch head; The node that all n jump in the scope all is bunch member of this bunch head; Simultaneously these nodes are not participated in the election process of bunch head, repeat this process, till all nodes in self-organizing network add bunch.
(2) bunch renewal
Bunch first watch newly is the process of one-period property, divides two kinds of situation: bunch of existing another one bunch head of hair is present in (because node mobility) in this bunch, can begin to upgrade the structure of this bunch, re-elects a bunch head, rebulids new bunch; A node finds that this node is not in any one bunch, explains that bunch head of this bunch might lose efficacy, and also initiates the process of setting up of bunch head again.These two types bunches nose heave election process generally are in subrange, are not the renewals of the overall situation, and the Network Transmission cost can be less, and speed also can be very fast.
2. service distribution
Service distribution comprises two steps: the foundation of information on services and the renewal of information on services.Specifically describe as follows:
(1) information on services is set up: bunch head is through the basic service information (quality of service information that comprises service, the label of node, the distance between node and bunch head, the stable information of node) on mutual all nodes (comprising self) that obtain in this bunch.If a plurality of nodes can both provide some basic services; Then bunch head is only stored the information of the individual basic service of k (1＜=k＜=10) of optimum (comprehensively being determined by the dump energy of the service quality of basic service, node and bunch head and euclidean distance between node pair), preserves remaining basic service information a at bunch head again.
(2) information on services upgrades: information on services upgrades mainly to be accomplished by periodic renewal, and bunch interior nodes is periodically given the information on services of self to bunch hair, and bunch head upgrades the buffer memory of the basic service of own internal maintenance after the information of receiving.If a basic service in the buffer memory is not also received the update package that certain node sends after surpassing the periodic time of upgrading, then from buffer memory, delete this basic service.
3. service discovery
This method can improve the efficient of service discovery effectively.The main process of service discovery is following: node finds that request is broadcast to all leader cluster nodes to the basic service of composite services.After leader cluster node is received this service discovery request bag, search the information of the basic service in the local cache, if can find basic service in this locality, the information of directly returning basic service is given the requesting node of service discovery; If can not find basic service, then attempt selecting alternative basic service (for example the laser printing service is the alternative service of inkjet printing service), if attempt failure, this bunch head is not done other processing.In above service discovery process, no longer broadcast in bunch, therefore generally, bunch service discovery can effectively reduce the amount of information of broadcasting, reduce the load of network.
This method is carried out sub-clustering based on the position distribution of service to self-organizing network, has improved the efficient of service distribution and discovery in the self-organizing network greatly.Utilize the service substitutability simultaneously, can make basic service find some alternative basic services, further improved the availability of service distribution information.
Description of drawings
Shown in Figure 1 is 10 self-organizing networks that the client forms, wherein N in the conference scenario
iIt is mobile device number.
Shown in Figure 2 is self-organizing network after Fig. 1 sub-clustering, wherein N
iIt is mobile device number.
Embodiment
Be without loss of generality, the present invention is combined into example with the service groups under the conference scenario and comes to introduce in detail whole service distribution and discover method, further sets forth the object of the invention, feature and advantage.But protection scope of the present invention is not limited to following instance.
In a conference scenario, have in ten client's to meeting rooms and open discussion, each client has the mobile device of oneself; Or PDA, or laptop computer, the scene of whole network is as shown in Figure 2; Be that multi-hop connects between the mobile device, form a self-organizing network.
All have certain service on each node, table 1 is seen in concrete service and position.
The service list of mobile device on table 1 conference scenario
| Mobile device number | Service on the mobile device |
| N 1 | Download thing from outer net; The laser printing service; |
| N 2 | The decompress(ion) service; |
| N 3 | The laser printing service; The PDF projection; |
| N 4 | PS is converted into PDF; |
| N 5 | Download thing from outer net; PS is converted into PDF; |
| N 6 | The decompress(ion) service; The projection of PDF; |
| N 7 | PS is converted into PDF; The inkjet printing service; |
| N 8 | Download thing from outer net; |
| N 9 | Compression service; |
| N 10 | The decompress(ion) service; |
Step 1: bunch maintenance of information
At first all nodes on the node in this scene carry out sub-clustering, are without loss of generality, and n is taken as 1 and sets up bunch here.In this scene, node N
3The next door in the 1 jumping scope number of services maximum, so node N
3Be a bunch head, simultaneously 1 hop neighbor around its all be bunch in the member.And the like, node N
10With node N
6It also is a bunch head.We can be distributed on the information on services in all bunches on bunch head simultaneously.Node N
6Buffer memory has projection and the compression service of decompress(ion) service, PDF; Node N
3Have laser printing service, PDF projection, from outer net download thing, PS is converted into PDF, inkjet printing service and compression service.Node N
10Last buffer memory decompress(ion) is served, is downloaded thing and laser printing service from outer net.
Now because node N
3On the user to carry out inkjet printing to the file that he is placed on the office network, promptly need carry out composite services: download a file from outer net, and carry out inkjet printing to this file.Here we use S
1Representative is from outer net download service, S
2Represent inkjet printing.Carry out this composite services, must find node N to these two basic services earlier
3Can submit to all leader cluster nodes to this request, i.e. node N
3, N
10And N
6, node N
3Find to have certainly S on one's body
1And S
2Service, node N
6Find not have certainly this two services, node N on one's body
10Find to have certainly S on one's body
1Service, but S
2Service has alternative laser printing service.After these three bunches of heads find service, directly give service requesting node the basic service feedback information, not can information bunch in broadcast.
Can find out that from top example this method has effectively utilized the characteristics of sub-clustering, make service distribution and discovery procedure avoid flooded broadcast, reduce the load of network effectively.
Claims (1)
- In the service-oriented self-organizing network based on the service distribution and the discover method of sub-clustering, it is characterized in that concrete steps are divided into: bunch maintenance, service distribution and three parts of service discovery, wherein:Described bunch of maintenance comprises election of cluster head and sub-clustering, bunch two parts of renewal:(1) election of bunch head and sub-clustering: election of cluster head is undertaken by the principle of " contiguous at most basic service number is preferential "; Promptly elect around those in hop neighbor the node of basic service most number as bunch head: the basic service number of each node overseas broadcast self at first, know the basic service number in the n hop neighbor on every side up to each node; Node with maximum contiguous basic service numbers becomes a bunch head; And to broadcast towards periphery self be the information of bunch head; The node that all n jump in the scope all is bunch member of this bunch head, and these nodes are not participated in the election process of bunch head simultaneously, repeat this process; Till all nodes in self-organizing network add bunch, 1＜=n＜=10;(2) bunch renewal: divide two kinds of situation: bunch of existing another one bunch head of hair is present in this bunch, can begin to upgrade the structure of this bunch, re-elects a bunch head, rebulids new bunch; A node finds that this node is not in any one bunch, explains that bunch head of this bunch might lose efficacy, and also initiates the process of setting up of bunch head again;Described service distribution comprises that information on services is set up and two steps of renewal of information on services:(1) information on services is set up: bunch head is through the basic service information on mutual all nodes that obtain in this bunch; If a plurality of nodes can both provide some basic services, then bunch head is only stored the information of k optimum basic service, and 1＜=k＜=10 are preserved remaining basic service information a again at bunch head; Wherein, said optimum is comprehensively determined by the dump energy of the quality of basic service, node and bunch head and euclidean distance between node pair;(2) information on services upgrades: information on services upgrades by periodic renewal to be accomplished, and bunch interior nodes is periodically given the information on services of self to bunch hair, and bunch head upgrades the buffer memory of the basic service of own internal maintenance after the information of receiving; If a basic service in the buffer memory is not also received the update package that certain node sends after surpassing the periodic time of upgrading, then from buffer memory, delete this basic service;The process of described service discovery is following: node finds that request is broadcast to all leader cluster nodes to the basic service of composite services, after leader cluster node is received this service discovery request bag, searches the information of the basic service in the local cache; If can find the basic service of being asked in this locality, the information of directly returning the basic service of being asked is given the requesting node of service discovery; If can not find the basic service of being asked, then attempt selecting alternative basic service, if attempt failure, this bunch head is not done other processing.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101707876A CN101163158B (en) | 2007-11-22 | 2007-11-22 | Cluster based service issuing and discovering method in self-organizing network facing to service |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101707876A CN101163158B (en) | 2007-11-22 | 2007-11-22 | Cluster based service issuing and discovering method in self-organizing network facing to service |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101163158A CN101163158A (en) | 2008-04-16 |
| CN101163158B true CN101163158B (en) | 2012-02-29 |
Family
ID=39297979
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007101707876A Expired - Fee Related CN101163158B (en) | 2007-11-22 | 2007-11-22 | Cluster based service issuing and discovering method in self-organizing network facing to service |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101163158B (en) |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101267404B (en) * | 2008-05-13 | 2010-06-02 | 北京科技大学 | An assister-based clustering method in Ad Hoc network |
| CN101437304B (en) * | 2008-12-17 | 2011-06-01 | 西安交通大学 | Loose virtual cluster division method for power heterogeneous point Ad Hoc network |
| CN101645925B (en) * | 2009-05-15 | 2012-07-25 | 中国科学院声学研究所 | Selection method of neighbor nodes related to physical topology in P2P system |
| CN101917475B (en) * | 2010-08-18 | 2013-01-02 | 天津理工大学 | P2P (Peer-to-Peer) mode based PSRD (Program Support Requirements Document) universal service resource discovery method |
| CN102694859B (en) * | 2012-05-25 | 2015-01-28 | 浙江工业大学 | Vehicular self-organization network region content distribution method based on network codes |
| EP2856728B1 (en) * | 2012-05-28 | 2020-06-24 | Nokia Technologies Oy | A method, a server and a computer program for local discovery |
| CN104219301B (en) * | 2014-08-29 | 2017-06-30 | 南京邮电大学 | A kind of service discovery protocol applied in 6LoWPAN |
| CN105553953B (en) * | 2015-12-09 | 2019-01-25 | 许继电气股份有限公司 | The implementation method of data service in a kind of HVDC transmission system based on broadcast |
| CN105847387A (en) * | 2016-04-21 | 2016-08-10 | 湖北文理学院 | Semantics-based wireless sensor network service discovery method |
| CN107071843B (en) * | 2016-12-28 | 2020-04-28 | 上海海事大学 | Mobile self-organizing network clustering method |
| CN108966281B (en) | 2018-07-20 | 2021-07-06 | 乐鑫信息科技（上海）股份有限公司 | Mesh network processing method, device, equipment and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101013976A (en) * | 2007-02-05 | 2007-08-08 | 南京邮电大学 | Mixed intrusion detection method of wireless sensor network |
| CN101035040A (en) * | 2007-02-02 | 2007-09-12 | 南京邮电大学 | Radio sensor network data collection method based on multi-agent negotiation |
-
2007
- 2007-11-22 CN CN2007101707876A patent/CN101163158B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101035040A (en) * | 2007-02-02 | 2007-09-12 | 南京邮电大学 | Radio sensor network data collection method based on multi-agent negotiation |
| CN101013976A (en) * | 2007-02-05 | 2007-08-08 | 南京邮电大学 | Mixed intrusion detection method of wireless sensor network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101163158A (en) | 2008-04-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101163158B (en) | Cluster based service issuing and discovering method in self-organizing network facing to service | |
| Liu et al. | Efficient naming, addressing and profile services in Internet-of-Things sensory environments | |
| Conti et al. | A cross-layer optimization of gnutella for mobile ad hoc networks | |
| CN103404109B (en) | The equity managed in cellular network is shared | |
| CN102939599B (en) | For the method and apparatus processing the reciprocity end in peer-to-peer network with dynamic IP connection status | |
| Abidoye et al. | Energy-efficient hierarchical routing in wireless sensor networks based on fog computing | |
| CN102067563A (en) | Methods and apparatus for optimal participation of devices in a peer-to-peer overlay network | |
| Wang et al. | Computational offloading with delay and capacity constraints in mobile edge | |
| JP4954328B2 (en) | Method and system for data management in a communication network | |
| CN101478352A (en) | Cognitive wireless network system and cognitive network element equipment | |
| Kulkarni et al. | Q-MOHRA: QoS assured multi-objective hybrid routing algorithm for heterogeneous WSN | |
| CN103618674A (en) | A united packet scheduling and channel allocation routing method based on an adaptive service model | |
| Lyu et al. | Demystifying traffic statistics for edge cache deployment in large-scale WiFi system | |
| Amirazodi et al. | An adaptive algorithm for super-peer selection considering peer’s capacity in mobile peer-to-peer networks based on learning automata | |
| CN101808338B (en) | Quality overhead ratio hop cluster-based service discovery method and mobility model establishing method | |
| Chaturvedi et al. | Energy efficient cluster head selection for cross layer design over wireless sensor network | |
| Munir et al. | Mobile wireless sensor networks: Architects for pervasive computing | |
| CN102035870B (en) | Polar coordinate division management-based service discovery method in wireless mobile network | |
| Salehi et al. | Mobile cloud management: A new framework | |
| CN103260181A (en) | Service-oriented discovered mobile node group maintenance method | |
| Deepa et al. | A service discovery model for mobile ad hoc networks | |
| Gurses et al. | Maximum utility peer selection for p2p streaming in wireless ad hoc networks | |
| Yadav et al. | Performance evaluation using hybrid glowworm swarm-Pareto optimization in the smart communication system | |
| Andronache et al. | Multimedia content distribution in hybrid wireless networks using weighted clustering | |
| Zafeiropoulos et al. | Interconnecting smart objects through an overlay networking architecture |
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: 20120229 Termination date: 20141122 |
|
| EXPY | Termination of patent right or utility model |