CN105681079B - A kind of mobile P 2 P network cluster-dividing method based on node motion characteristic - Google Patents
A kind of mobile P 2 P network cluster-dividing method based on node motion characteristic Download PDFInfo
- Publication number
- CN105681079B CN105681079B CN201610016435.4A CN201610016435A CN105681079B CN 105681079 B CN105681079 B CN 105681079B CN 201610016435 A CN201610016435 A CN 201610016435A CN 105681079 B CN105681079 B CN 105681079B
- Authority
- CN
- China
- Prior art keywords
- node
- cluster
- friend
- network
- mobile
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/246—Connectivity information discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1042—Peer-to-peer [P2P] networks using topology management mechanisms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Business, Economics & Management (AREA)
- General Business, Economics & Management (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of mobile P 2 P network cluster algorithm based on node motion characteristic, this method includes, step S100, is all unique nerve of a covering marks of node distribution in mobile P 2 P network；Step S200, node calculate the ability value of itself；Step S300, calculate node and the distance of its neighbor node；Step S400, node establish the friend's node listing of oneself；Step S500, according to the moving characteristic of node, by physical location is neighbouring and friend's node division with same movement characteristic is in a cluster, and cluster head node of the strong node of an ability as this cluster is chosen in each cluster, ultimately form the more stable cluster of structure.The present invention has taken into full account the mobility of node so that the node in cluster can keep maximum stability, solve mobile P 2 P network topological structure problem of inconsistency, reduce network topology maintenance costs, improve network scalability.
Description
Technical field
The present invention relates to mobile P 2 P network technical field, more particularly to a kind of mobile P 2 P net based on node motion characteristic
Network cluster-dividing method.
Background technology
In recent years, it is mobile to use with the fast development of wireless communication technology, the continuous lifting of mobile device performance and popularization
Family can realize exchange and processing data whenever and wherever possible.The immense success obtained along with P2P networks on Inertnet,
The mobile P 2 P network of the combining wireless communication technology and P2P computing (Mobile Peer-to-Peer Networks, MP2P)
Have become current research focus.As a kind of emerging mobile data communication mode, in the nothing that mobile P 2 P network has with it
The characteristics such as the heart, self-organizing, the solution carried out data transmission under a kind of wireless environment supported in foundation-free facility is provided for people
Certainly scheme, military battlefield, rescue and relief work and user profile is shared etc., field has broad application prospects and important reality
With value.
However, because the mobility of node causes the covering etale topology of mobile P 2 P network often to change, cause to cover
Layer is inconsistent with bottom physical network topology, and this " logic " neighbour that may occur in nerve of a covering may in physical network
It is far apart, topological structure mismatch problem is produced, coating data transfer is not only resulted in and Resource orientation is poorly efficient, meeting simultaneously
Substantial amounts of redundancy flow is produced, huge bandwidth pressure is caused to bottom physical network, reduces network integral working.
Cluster-dividing method with topology ambiguity can effectively solve topological problem of inconsistency, but existing cluster-dividing method is present
Network overhead is big, lacks and node motion characteristic is considered, and actually mobile P 2 P network interior joint peer-to-peer and network are opened up
The dynamic change of structure is flutterred with society there is certain mapping relations, by being ground to node motion characteristic, Social Characteristics
Study carefully discovery, the behavior of mobile node is not usually random, but the characteristic of group activity is presented.Therefore, node motion is paid attention to
Characteristic, this potential relation is made full use of, structure is with the high mobile P 2 P network nerve of a covering of stability, to improving mobile P 2 P net
Network whole work efficiency has great importance.
The content of the invention
In view of this, the present invention provides a kind of mobile P 2 P network cluster-dividing method based on node motion characteristic, to solve
Existing cluster-dividing method considers the problem of insufficient to node motion characteristic, and reaching reduces network topology maintenance costs, improves movement
P2P network stabilizations, improve the purpose of network whole work efficiency.
The invention discloses a kind of mobile P 2 P network cluster-dividing method based on node motion characteristic, according to the position of node
The motion feature of node is studied in change, by physical location is neighbouring and node division with same movement feature is to cluster
It is interior, and cluster head node of the strong node of an ability as this cluster is chosen in each cluster so that cluster interior nodes can be maximum
Keep to degree the stability of network structure, effectively solve mobile P 2 P network topology problem of inconsistency, network scalability compared with
It is high.
The concrete technical scheme of the present invention is as follows：
A kind of mobile P 2 P network cluster-dividing method based on node motion characteristic, comprises the following steps：
Step S100, for the unique nerve of a covering mark of node distribution being added in mobile P 2 P network；
Step S200, node calculate the ability value of itself；
Step S300, calculate node and the distance of its neighbor node；
Step S400, according to node motion characteristic, node establishes the friend's node listing of oneself and establishes friend's cluster knot
Point list；
Step S500, according to the mobility of node, the cluster head node of friend's cluster is chosen, and establish friend's cluster.
A kind of mobile P 2 P network cluster-dividing method based on node motion characteristic, the step S100, it is mobile P 2 P network
In the unique nerves of a covering mark of all node distributions, specific method is：When node is added in mobile P 2 P network, pass through peace
Full hash function carries out Hash operation to the attribute of mobile device and obtains the unique nerve of a covering node identification of a whole network.
The step S200, calculate node ability value, ability value obtain formula and are：
Wherein, Ability [u] is node u ability value, and B [u] is node u effective bandwidth, and C [u] is node u CPU
Processing speed, S [u] are node u memory size, and T [u] is node u line duration, and P [u] is node u dump energy.α,
β,γ,λ,For the weight shared by each factor, and
The step S300, the distance between calculate node u and its neighbor node, specific method are：Node is periodically to week
Enclose neighbor node and send query messages, neighbor node is calculated by the intensitometer of the query messages signal received and sending node
The distance between, distance calculation formula is：
Wherein, | | uv | | represent the distance between node u and node v, PRRepresent the watt level received, PTRepresent transmission
Watt level, GTRepresent the gain of sender's antenna power, GRRepresent the gain of recipient's antenna power, λNRepresent wavelength.
The step S400, node u establish the friend's node listing of oneself, and the mutual friend of friend's node switching with it
Friendly node listing, so as to obtain the nodal information of composition friend's cluster, further comprise the steps：
Step S410, node u are carried out by carrying out n range measurement with each neighbor node around to measurement result
Denoising disposal, specific method are：Assuming that having carried out n range measurement between node u and neighbor node v, then this n times measurement is tied
The average value of fruitCalculation formula be：
Wherein, n is pendulous frequency, | | uv | |iIth measurement distance value between node u and node v, when | | uv | |i
More than system first threshold t1, then then it is considered there is noise jamming, shows that measured result is unreliable, this time should be discarded
Measurement result, wherein,
Step S420, establishes node u friend's node listing, and specific method is：It is if flat between node u and node v
Equal distanceAnd meet δ ＜ δmax, then node u node v is added in the friend's node listing of oneself, wherein, r be section
The effective propagation path of point wireless signal, δmaxFor system Second Threshold, δ calculation formula are：
The mutual friend's node listing of all friend's node switching of step S430, node u periodically with it, and establish
Friend's cluster knot point list, specific method are：Assuming that the list of friends for the node v that node u is received at node v, if node w is section
Point v friend's node, but node w not in node u friend's cluster list, then friend's cluster that node w is added to node u arranges
In table；If node w is in node u friend's cluster list, but their friend sent in the whole friend's nodes newly received
In friendly node listing, there is no node w, then node u deletes node w from friend's cluster list；
The step S500, according to the mobility of node, the cluster head node of friend's cluster is chosen, and establish friend's cluster, entered
One step comprises the following steps：
Step S510, node u compare the ability value of the ability value of itself and friend's cluster list interior joint, if node u energy
Force value is maximum, then node u upgradings turn into cluster head node, and to its friend's node broadcasts message, claims oneself to be cluster head node,
Friend's node is invited to add the cluster using the node as cluster head simultaneously；If node u ability value is not maximum, application adds friend
The node with maximum capacity value is as in friend's cluster of cluster head in cluster.
Step S520, repeat step S200- step S500, until all nodes in network or as cluster head node, or from
Belong in some friend's cluster.
A kind of mobile P 2 P network cluster-dividing method based on node motion characteristic disclosed by the invention, its feature be, not only
The proximity relations of node physical location is considered, and also contemplates the mobility of node, physical location is neighbouring and have
Friend's node division of same movement feature is in a cluster, so that the network topology structure in cluster can ensure maximum journey
Stablizing relatively for degree, efficiently solves mobile P 2 P network topological structure problem of inconsistency, reduces network topology maintenance costs,
Network data transmission efficiency is improved, improves network scalability, meanwhile, have method design simple, energy is calculated suitable for node
The mobile P 2 P network that power and battery electric quantity are limited.
Below by the drawings and specific embodiments, technical scheme is described in further detail.
Brief description of the drawings
Fig. 1 is the cluster-dividing method flow chart of the present invention.
Fig. 2 is of the invention and other two kinds of cluster-dividing methods times in node average residence cluster performance comparison figures.
Embodiment
To make the object, technical solutions and advantages of the present invention clearer, below by specific embodiment to the present invention's
Technical scheme is further described through.Obviously, described embodiment is part of the embodiment of the present invention, rather than whole realities
Apply example.Based on the embodiment in the present invention, those of ordinary skill in the art are obtained under the premise of creative work is not made
Every other embodiment, belong to the scope of protection of the invention.
The usual transmission range of mobile node is limited in mobile P 2 P network, and mobile frequent, causes network topology structure continuous
Change, nerve of a covering problem of inconsistency is occurred with physical network layer topological structure, cause data transmission efficiency low.By right
Node motion characteristic research finds that in actual application environment, node is not the motion of completely random, but according to the emerging of node
Interest, characteristics of motion etc. show certain mobile uniformity, a kind of mobile P 2 P based on node motion characteristic of the present invention
The core concept of network cluster dividing method is：From node motion characteristic, by the node rendezvous cluster with same movement characteristic,
Form friend's cluster so that node in friend's cluster is due to same movement characteristic, so as to farthest maintain cluster
The stability of structure, solve nerve of a covering and physical network topology inconsistence problems, and reduce network topology maintenance costs.
The embodiments of the invention provide a kind of mobile P 2 P network cluster-dividing method based on node motion characteristic, such as Fig. 1 institutes
Show, comprise the following steps：
Step S100, it is the unique nerve of a covering mark of node distribution in mobile P 2 P network.
It should be noted that the term " node " used in the embodiment of the present invention, " mobile node ", " mobile terminal ", " shifting
Dynamic equipment " refers to various types of mobile devices, for example, smart mobile phone, personal digital assistant (PDA), tablet personal computer (PAD),
Notebook computer etc., wherein each equipment can operate independently of each other, to each other with wireless (such as bluetooth, UMB, LTE, 4G
Deng) mode enter row data communication." peer node ", " mobile peer node " refer to that various mobile devices cover in mobile P 2 P
Mapping on network.
In embodiments of the present invention, when mobile node is added in mobile P 2 P network, first have to obtain a whole network only
One nerve of a covering node identification, the nerve of a covering mark of node can be by secure hash function (such as SHA-1) to mobile device
Attribute carries out Hash operation and obtained, and these attributes can be the IP address of mobile node, MAC Address, port address, public key etc.
The combination of several either in them.The cryptographic Hash length of SHA series hash functions is typically larger than 160, so long digit
It can ensure that the nerve of a covering mark of mobile node is hardly possible to duplicate, it is therefore contemplated that being unique.
Step S200, calculate node ability value, ability value calculation formula are：
Wherein, Ability [u] is node u ability value, and B [u] is node u effective bandwidth, and C [u] is node u CPU
Processing speed, S [u] are node u memory size, and T [u] is node u line duration, and P [u] is node u dump energy.α,
β,γ,λ,For the weight shared by each factor, and
Step S300, the distance between calculate node u and its neighbor node, specific method are：Node is periodically to adjacent around
Occupy node and send query messages, neighbor node is calculated between sending node by the intensitometer of the query messages signal received
Distance, distance calculation formula is：
Wherein, | | uv | | represent the distance between node u and node v, PRRepresent the watt level received, PTRepresent transmission
Watt level, GTRepresent the gain of sender's antenna power, GRRepresent the gain of recipient's antenna power, λNRepresent wavelength.
Step S400, node u establish the friend's node listing of oneself, and are saved with its mutual friend of friend's node switching
Point list, so as to obtain the nodal information of composition friend's cluster, further comprise the steps：
Step S410, node u are carried out by carrying out n range measurement with each neighbor node around to measurement result
Denoising disposal, specific method are：Assuming that having carried out n range measurement between node u and neighbor node v, then this n times measurement is tied
The average value of fruitCalculation formula be：
Wherein, n is pendulous frequency, | | uv | |iIth measurement distance value between node u and node v, when | | uv | |
More than system first threshold λ, then be then considered there is noise jamming, show that measured result is unreliable, this time should be discarded
Measurement result, wherein,
Step S420, establishes node u friend's node listing, and specific method is：It is if flat between node u and node v
Equal distanceAnd meet δ ＜ δmax, then node u node v is added in the friend's node listing of oneself, wherein, r be section
The effective propagation path of point wireless signal, δmaxFor system Second Threshold, δ calculation formula are：
The mutual friend's node listing of all friend's node switching of step S430, node u periodically with it, and establish
Friend's cluster knot point list, specific method are：Assuming that the list of friends for the node v that node u is received at node v, if node w is section
Point v friend's node, but node w not in node u friend's cluster list, then friend's cluster that node w is added to node u arranges
In table；If node w is in node u friend's cluster list, but their friend sent in the whole friend's nodes newly received
In friendly node listing, there is no node w, then node u deletes node w from friend's cluster list；
Step S500, according to the mobility of node, the cluster head node of friend's cluster is chosen, and establish friend's cluster, further
Comprise the following steps：
Step S510, node u compare the ability value of the ability value of itself and friend's cluster list interior joint, if node u energy
Force value is maximum, then node u upgradings turn into cluster head node, and to its friend's node broadcasts message, claims oneself to be cluster head node,
Friend's node is invited to add the cluster using the node as cluster head simultaneously；If node u ability value is not maximum, application adds friend
The node with maximum capacity value is as in friend's cluster of cluster head in cluster.
Step S520, repeat step S200- step S500, until all nodes in network or as cluster head node, or from
Belong in some friend's cluster.
The effect of the present invention is further illustrated by following emulation experiment：
Emulation experiment condition：Simulation software is MATLAB, and this experiment considers a mobile P 2 P for including 60 mobile nodes
Network, mobile node initial position are randomly dispersed in 1000m*1000m rectangular area, and the maximum translational speed of node is 5m/
S, node send a HELLO message, duration of experiment 300s, B [u], the C of each node every 1s to surroundings nodes
[u], S [u], T [u], P [u] are random between [10-100], [10-50], [100-200], [50-100], [50-100] respectively
Produce, α, β, γ, λ,Value is 0.2.Assuming that the communication radius of all nodes is equal.
Implementation result to illustrate the invention, by the mobile P 2 P network proposed by the present invention based on node motion characteristic point
Cluster method and minimum ID methods (Lin C R, Gerla M.A distributed architecture for multimedia in
Dynamic wireless networks) and maximum Connected degree method (Gerla M, Tsai T C.Multicluster,
Mobile, Multimedia Radio Network) contrast experiment has been carried out, Fig. 2 is of the invention and minimum ID methods and most Dalian
Time of degree of the connecing method in the node average residence cluster under same experimental conditions, it can be seen that proposed by the present invention to be based on node
The mobile P 2 P network cluster-dividing method of mobility, it is due to having taken into full account the mobility of node, physical distance is near and have
The node division of same movement trend is into a cluster, so that node in the cluster is due to identical kinetic characteristic, from
And the relative stability between node can be maximally maintained, therefore, the time that node is resided in cluster at most, so as to reduce
Network topology maintenance costs.
Finally it should be noted that：The above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；To the greatest extent
The present invention is described in detail with reference to the foregoing embodiments for pipe, it will be understood by those within the art that：It is still
Technical scheme described in foregoing embodiments can be modified, or which part technical characteristic is equally replaced
Change；And these modifications or replacement, the essence of appropriate technical solution is departed from the essence of various embodiments of the present invention technical scheme
God and scope.
Claims (1)
1. a kind of mobile P 2 P network cluster-dividing method based on node motion characteristic, it is characterised in that comprise the following steps：
Step S100, for the unique nerve of a covering mark of node distribution being added in mobile P 2 P network, pass through secure hash function
The Hash operation acquisition unique nerve of a covering node identification of one the whole network is carried out to the attribute of mobile device；
Step S200, node calculate the ability value of itself, and the acquisition formula of node capacity value is：
Wherein, Ability [u] is node u ability value, and B [u] is node u effective bandwidth, and C [u] is node u CPU processing
Speed, S [u] are node u memory size, and T [u] is node u line duration, and P [u] is node u dump energy；α,β,
γ,λ,For the weight shared by each factor, and
Step S300, calculate node and the distance of its neighbor node:
Node periodically sends query messages to surrounding neighbours node, and neighbor node is strong by the query messages signal that receives
Degree calculates the distance between sending node：
Wherein, | | uv | | represent the distance between node u and node v, PRRepresent the watt level received, PTRepresent the work(of transmission
Rate size, GTRepresent the gain of sender's antenna power, GRRepresent the gain of recipient's antenna power, λNRepresent that node is used for leading to
The electromagnetic wavelength of letter；
Step S400, node u establish the friend's node listing of oneself, and are arranged with its mutual friend's node of friend's node switching
Table, so as to obtain the nodal information of composition friend's cluster；
The step S400 further comprises step S410 to step S430：
Step S410, node u carry out denoising by carrying out n range measurement with each neighbor node around to measurement result
Sonication, specific method are：Assuming that carried out n range measurement between node u and neighbor node v, then this n times measurement result
Average valueCalculation formula be：
Wherein, n is pendulous frequency, | | uv | |iIth measurement distance value between node u and node v, when | | uv | |iExceed
System first threshold t1, then then it is considered there is noise jamming, shows that measured result is unreliable, this measurement should be discarded
As a result, wherein,
Step S420, establishes node u friend's node listing, and specific method is：If the average departure between node u and node v
FromAnd meet δ ＜ δmax, then node u node v is added in the friend's node listing of oneself, wherein, r be node without
The effective propagation path of line signal, δmaxFor system Second Threshold, δ calculation formula are：
The mutual friend's node listing of all friend's node switching of step S430, node u periodically with it, and establish friend
Cluster knot point list, comprises the following steps：Assuming that the list of friends for the node v that node u is received at node v, if node w is node
V friend's node, but node w is then added to node u friend's cluster list by node w not in node u friend's cluster list
In；If node w is in node u friend's cluster list, but their friend sent in the whole friend's nodes newly received
In node listing, there is no node w, then node u deletes node w from friend's cluster list；
Step S500, it is according to the moving characteristic of node, physical location is neighbouring and friend's node with same movement feature is drawn
Assign in a cluster, and cluster head node of the maximum node of a node capacity value as this cluster is chosen in each cluster, including：
Node u compares the ability value of the ability value of itself and friend's cluster list interior joint, if node u ability value is maximum, saves
Point u upgradings turn into cluster head node, and to its friend's node broadcasts message, claim that oneself is cluster head node, while invite friend
Node adds the cluster using the node as cluster head；If node u ability value is not maximum, application, which adds, has maximum in friend's cluster
The node of ability value is as in friend's cluster of cluster head；
Step S600, repeat step S200- step S500, until all nodes in network or as cluster head node, or it is subordinated to
In some friend's cluster.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610016435.4A CN105681079B (en) | 2016-01-11 | 2016-01-11 | A kind of mobile P 2 P network cluster-dividing method based on node motion characteristic |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610016435.4A CN105681079B (en) | 2016-01-11 | 2016-01-11 | A kind of mobile P 2 P network cluster-dividing method based on node motion characteristic |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105681079A CN105681079A (en) | 2016-06-15 |
| CN105681079B true CN105681079B (en) | 2018-03-27 |
Family
ID=56300093
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610016435.4A Expired - Fee Related CN105681079B (en) | 2016-01-11 | 2016-01-11 | A kind of mobile P 2 P network cluster-dividing method based on node motion characteristic |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105681079B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106790387B (en) * | 2016-11-25 | 2019-12-27 | 同济大学 | P2P network optimization method based on vernier |
| CN108449371B (en) * | 2017-02-16 | 2019-10-29 | 中国移动通信有限公司研究院 | A kind of contents access method and device |
| CN107948070B (en) * | 2017-11-27 | 2019-01-08 | 东北电力大学 | A kind of mobile P 2 P network virtual link choosing method based on QoS |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101188444A (en) * | 2007-05-25 | 2008-05-28 | 中科院嘉兴中心微系统所分中心 | A method for distributed section networking in wireless sensing network |
| CN101888671A (en) * | 2010-02-10 | 2010-11-17 | 上海交通大学 | Energy-efficient target tracking method |
| CN102413536A (en) * | 2012-01-06 | 2012-04-11 | 北京邮电大学 | Site sensing communication method of ad hoc wireless network |
| CN103118373A (en) * | 2013-01-24 | 2013-05-22 | 北京理工大学 | Wireless sensor network low energy-consumption coverage optimization algorithm |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008115221A2 (en) * | 2007-03-20 | 2008-09-25 | Thomson Licensing | Hierarchically clustered p2p streaming system |
-
2016
- 2016-01-11 CN CN201610016435.4A patent/CN105681079B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101188444A (en) * | 2007-05-25 | 2008-05-28 | 中科院嘉兴中心微系统所分中心 | A method for distributed section networking in wireless sensing network |
| CN101888671A (en) * | 2010-02-10 | 2010-11-17 | 上海交通大学 | Energy-efficient target tracking method |
| CN102413536A (en) * | 2012-01-06 | 2012-04-11 | 北京邮电大学 | Site sensing communication method of ad hoc wireless network |
| CN103118373A (en) * | 2013-01-24 | 2013-05-22 | 北京理工大学 | Wireless sensor network low energy-consumption coverage optimization algorithm |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105681079A (en) | 2016-06-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Huynh et al. | Social-aware energy efficiency optimization for device-to-device communications in 5G networks | |
| CN107529201A (en) | A kind of wireless sensor network data transmission method based on LEACH agreements | |
| CN105681079B (en) | A kind of mobile P 2 P network cluster-dividing method based on node motion characteristic | |
| Ding et al. | A rule-driven multi-path routing algorithm with dynamic immune clustering for event-driven wireless sensor networks | |
| Ho et al. | Grade diffusion algorithm | |
| Shen et al. | Organized topology based routing protocol in incompletely predictable ad-hoc networks | |
| Li et al. | MobiSN: Semantics-based mobile ad hoc social network framework | |
| Nayak et al. | Comparison of routing protocols in wsn using netsim simulator: Leach vs leach-c | |
| Wang et al. | Sustainable and efficient fog-assisted IoT cloud based data collection and delivery for smart cities | |
| Ruan et al. | A distance clustering routing algorithm considering energy for wireless sensor networks | |
| Raj et al. | Energy adaptive mechanism for P2P file sharing protocols | |
| Bala et al. | On proficiency of HEED protocol with heterogeneity for wireless sensor networks with BS and nodes mobility | |
| Wang et al. | Social-aware file-sharing mechanism for device-to-device communications | |
| Wang et al. | Distributed routing algorithm with dynamic connection partition for mobile ad hoc networks | |
| Barad et al. | DIST-LEACH: A deterministic key management scheme for securing cluster-based sensor networks | |
| Sethi et al. | A Comparative analysis of various mobile sink routing protocols and performance comparison of clustered routing protocols in mobile sink scenario | |
| Kumar et al. | Improving network lifetime & reporting delay in wireless sensor networks using multiple mobile sinks | |
| AU2018101627A4 (en) | An apparatus and method based on trust index of wireless node for multiple / best route discovery in the wireless sensor network platform. | |
| Gujjar et al. | A survey on wireless Ad-hoc implementations in android-based smartphones | |
| Lee et al. | A two-layer cluster head selection based on distance in wireless sensor networks | |
| Chang et al. | Optimized Algorithm for Clustering Routing for Wireless Sensor Networks | |
| Jang et al. | Energy efficiency improvement based on optimal buffer thresholds model for wireless sensor devices | |
| Kumbhar et al. | An energy efficient ring routing protocol for wireless sensor network | |
| Xu et al. | Authentication scheme for cluster-structured ad hoc network | |
| Ranga et al. | MFZLP: multihop far zone leach protocol for WSNs |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180327 Termination date: 20220111 |