CN103312535B - Community-based layering opportunistic network and method for building up thereof and communication means - Google Patents

Community-based layering opportunistic network and method for building up thereof and communication means Download PDF

Info

Publication number
CN103312535B
CN103312535B CN201310120823.3A CN201310120823A CN103312535B CN 103312535 B CN103312535 B CN 103312535B CN 201310120823 A CN201310120823 A CN 201310120823A CN 103312535 B CN103312535 B CN 103312535B
Authority
CN
China
Prior art keywords
node
community
data
communication
super
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
Application number
CN201310120823.3A
Other languages
Chinese (zh)
Other versions
CN103312535A (en
Inventor
张勇
宋梅
韩滢
程刚
鲍叙言
陈娟
宋朝阳
陈桦
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing University of Posts and Telecommunications
Original Assignee
Beijing University of Posts and Telecommunications
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing University of Posts and Telecommunications filed Critical Beijing University of Posts and Telecommunications
Priority to CN201310120823.3A priority Critical patent/CN103312535B/en
Publication of CN103312535A publication Critical patent/CN103312535A/en
Application granted granted Critical
Publication of CN103312535B publication Critical patent/CN103312535B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The present invention discloses a kind of community-based layering opportunistic network and method for building up thereof and communication means, for solving existing opportunistic network, has that node administration is loose, connectivity is poor, data and inquiry rely on the problems such as flooding to design.Described community-based laminating machine network packet can contain some communities;In each described community all include ordinary node and in order to identify community and management ordinary node communication super node;It is in communication with each other by the free node between community that moves between described community.Community-based layering opportunistic network of the present invention and method for building up thereof and communication means, have the multiple advantages such as network management is orderly, connectivity good, data sharing high, and storage pressure is little.

Description

基于社区的分层机会网络及其建立方法与通信方法Community-Based Hierarchical Opportunity Network and Its Establishment Method and Communication Method

技术领域technical field

本发明通信领域,尤其涉及基于社区的分层机会网络、基于社区的分层机会网络建立方法以及通信方法。The invention relates to the communication field, in particular to a community-based layered opportunity network, a community-based layered opportunity network establishment method and a communication method.

背景技术Background technique

机会网络是在DTN(Delay Tolerant Networks)时延容忍网络的基础上演化而来,是不需要源节点和目的节点之间存在完整路径,利用节点移动的相遇实现网络通信的自组织网络。Opportunistic networks are evolved on the basis of DTN (Delay Tolerant Networks) delay-tolerant networks. They are self-organizing networks that do not require a complete path between the source node and the destination node, and use the encounter of node movement to realize network communication.

机会网络的通信模式为“存储-携带-转发”。源节点把要转发出去的信息传输到与其相遇的节点上,不断转发携带,最终达到目的节点。The communication mode of opportunistic networks is "store-carry-forward". The source node transmits the information to be forwarded to the node where it meets, forwards and carries it continuously, and finally reaches the destination node.

机会网络适用于无法建立健全连通的网络环境,如星际网络通信、偏远地区网络传输、便携设备组网、车载通信网、野生动物追踪网等。Opportunistic networks are suitable for network environments where sound connectivity cannot be established, such as interstellar network communications, network transmission in remote areas, portable device networking, vehicle communication networks, wild animal tracking networks, etc.

但现有的机会网络,由于所有的节点在功能、级别上是对等的,且节点具有较大移动性,物理位置变动频繁的特点从而存在以下问题:However, the existing opportunistic network has the following problems because all nodes are equal in function and level, and the nodes have greater mobility and frequent physical location changes:

1:网络中的节点缺乏管理,网络连接性差;1: The nodes in the network lack management and the network connectivity is poor;

2:可能造成一个数据在全网反复泛滥传播的问题,浪费了节点的存储资源;2: It may cause a problem of repeated flooding of data in the whole network, wasting the storage resources of nodes;

3:数据查询的范围为全网,容易导致洪泛查找,且选取的数据转发路径不当,将导致节点转发的信息大、存储压力大的同时,增大时延性。3: The scope of data query is the whole network, which is easy to cause flood search, and the selected data forwarding path is improper, which will lead to large amount of information forwarded by nodes, high storage pressure, and increased delay.

4:一个节点的离开或失效,可能导致某些仅存在该节点上的数据从网络中消失,数据的共享性以及有效性差。4: The departure or failure of a node may cause some data that only exists on this node to disappear from the network, and the sharing and effectiveness of data are poor.

发明内容Contents of the invention

(一)发明目的(1) Purpose of the invention

本发明提供一种节点管理有序、连接性较好、增加数据的可靠性以及有效性的基于社区的分层机会网络及其建立方法与通信方法。The invention provides a community-based layered opportunity network with orderly node management, good connectivity, and increased data reliability and effectiveness, as well as its establishment method and communication method.

(二)技术方案(2) Technical solutions

为达上述目的,本发明基于社区的分层机会网络,所述基于社区的分层机会网络包含若干社区;每一所述社区内均包括普通节点以及用以标识社区且管理普通节点通信的超级节点;To achieve the above-mentioned purpose, the present invention is based on a community-based hierarchical opportunity network, which includes several communities; each of the communities includes ordinary nodes and a super node;

所述社区间通过运动在社区间的游离节点相互通信。The inter-communities communicate with each other by moving free nodes among the communities.

进一步地,所述社区建立在通信热点区。Further, the community is established in a communication hotspot.

为达上述目的,本发明基于社区的分层机会网络建立方法,所述基于社区的分层机会网络建立方法包括以下步骤:In order to achieve the above-mentioned purpose, the method for establishing a community-based hierarchical opportunity network of the present invention, the method for establishing a community-based hierarchical opportunity network includes the following steps:

步骤S1:超级节点实时探测其通信范围内的通信节点并读取通信节点所携带的属性信息;Step S1: The super node detects the communication nodes within its communication range in real time and reads the attribute information carried by the communication nodes;

步骤S2:超级节点按预设方法计算出与每一所述通信节点的相遇概率;Step S2: The super node calculates the encounter probability with each communication node according to a preset method;

步骤S3:超级节点比较其自身与该通信节点的相遇概率是否大于该通信节点与其他超级节点的相遇概率,Step S3: The super node compares whether its encounter probability with the communication node is greater than the encounter probability of the communication node with other super nodes,

大于,则进入步骤S3.1,不大于则进入步骤S3.2;If it is greater than, enter step S3.1; if it is not greater, enter step S3.2;

步骤S3.1:超级节点将该通信节点设置为由其管理的普通节点,用以组建由其标识的社区,且将其与该通信节点的相遇概率返回给该通信节点;Step S3.1: The super node sets the communication node as an ordinary node managed by it to form a community identified by it, and returns the probability of encountering the communication node to the communication node;

步骤S3.2:超级节点将其与该通信节点相遇概率返回给该通信节点,其中,该通信节点为所述超级节点所标识社区外的普通节点或游离节点。Step S3.2: The super node returns the probability of encountering the communication node to the communication node, wherein the communication node is an ordinary node or a free node outside the community identified by the super node.

优选地,所述预设方法通过如下公式计算超级节点与通信节点间相遇概率;Preferably, the preset method calculates the encounter probability between the super node and the communication node through the following formula;

(( SS ,, Mm nno )) 00 ff == 00 PP initinit ff == 11 (( 11 -- λλ )) TT contactcontact TT contactcontact ++ TT noncontactnoncontact ++ λλ (( 11 -- 11 -- PP initinit ee γγ (( ff -- 22 )) )) ff ≥&Greater Equal; 22

P(S,Mn)为超级节点S与通信节点Mn的相遇概率;P(S,M n ) is the encounter probability between super node S and communication node M n ;

f为超级节点S与通信节点Mn的相遇总次数。f is the total number of encounters between super node S and communication node Mn .

PInit为相遇概率的初始值;P Init is the initial value of the encounter probability;

λ为取值在0到1之间的常数;λ is a constant with a value between 0 and 1;

Tcontact为此前预设时间内超级节点S与通信节点Mn相遇的累计时长;Tnoncontact为此前预设时间内超级节点S与通信节点Mn未相遇的累计时长;T contact is the accumulative duration of encounter between super node S and communication node M n within the previous preset time; T noncontact is the accumulative duration of non-encounter between super node S and communication node M n within the previous preset time;

γ为调整因子。γ is the adjustment factor.

优选地,所述属性信息包括该通信节点与所有超级节点之间的相遇概率及其所属社区。Preferably, the attribute information includes encounter probabilities between the communication node and all super nodes and the communities they belong to.

为达上述目的,本发明基于社区的分层机会网络通信方法,所述基于社区的分层机会网络通信方法包括以下步骤:In order to achieve the above-mentioned purpose, the present invention is based on a community-based layered opportunity network communication method, and the community-based layered opportunity network communication method includes the following steps:

步骤A:超级节点对由其所标识社区内的普通节点所存储的数据建立数据索引表,对游离节点所存储的数据建立临时数据索引表,并复制游离节点所携带的其他社区的数据索引表来构建社区间数据索引表;Step A: The super node establishes a data index table for the data stored by the common nodes in the identified community, establishes a temporary data index table for the data stored by the free node, and copies the data index table of other communities carried by the free node To build inter-community data index tables;

步骤B:普通节点M将待查询数据的检索信息提交到超级节点;Step B: The ordinary node M submits the retrieval information of the data to be queried to the super node;

步骤C:超级节点在数据索引表中查询,Step C: The super node queries in the data index table,

若数据索引表有记录,超级节点将存储有该待查询数据的普通节点N的识别信息发送至普通节点M,普通节点M通过其所在社区内的普通节点间的相遇实现与普通节点N的通信;If there is a record in the data index table, the super node will send the identification information of the ordinary node N that stores the data to be queried to the ordinary node M, and the ordinary node M realizes the communication with the ordinary node N through the encounter between the ordinary nodes in its community ;

若数据索引表无记录,超级节点在临时数据索引表中查询是否有记录,If there is no record in the data index table, the super node will query whether there is a record in the temporary data index table,

有,则超级节点向普通节点M返回游离节点O的识别信息,普通节点M通过通信节点的相遇与游离节点O进行通信;If yes, the super node returns the identification information of the free node O to the ordinary node M, and the ordinary node M communicates with the free node O through the encounter of the communication nodes;

无,超级节点在社区间数据索引表中查询是否有记录,None, the super node queries whether there is a record in the inter-community data index table,

有,则通过游离节点P访问存储有该待查询数据的其他社区的普通节点,并由游离节点P返回数据给普通节点M;If yes, the free node P accesses the ordinary nodes of other communities that store the data to be queried, and the free node P returns the data to the ordinary node M;

无,则通信失败;If none, the communication fails;

其中,所述基于社区的分层机会网络包含若干社区;每一所述社区内的均包括普通节点以及用以标识社区且管理普通节点通信的超级节点。Wherein, the community-based hierarchical opportunity network includes several communities; each of the communities includes common nodes and super nodes used to identify the community and manage the communication of common nodes.

尤其是,especially,

所述步骤C中,超级节点还监控各数据被查询的热度,并根据预定方法判断是否在由其管理的普通节点或其自身建立被查询数据副本。In the step C, the super node also monitors the popularity of each data being queried, and judges according to a predetermined method whether to establish a copy of the queried data in a common node managed by it or itself.

尤其是,所述预定方法包括以下步骤:In particular, the predetermined method includes the following steps:

步骤C1.1:根据如下公式分别计算Pf以及αiStep C1.1: Calculate P f and α i respectively according to the following formulas;

PP ff == ΠΠ nno == 11 CC ++ 11 (( 11 -- PP (( SS ,, Mm nno )) ))

αα ii == δeδe -- θHDθ HD II

Pf为其所述对应数据的失效概率;P f is the failure probability of the corresponding data;

C为其所对应的社区内数据的副本数;C is the number of copies of data in the corresponding community;

P(S,Mn)为超级节点S与存储有待查询数据的通信节点Mn的相遇概率;P(S,M n ) is the encounter probability between the super node S and the communication node M n storing the data to be queried;

热度HDI为单位时间内其所对应的数据被查询的次数;Heat HD I is the number of times the corresponding data is queried per unit time;

动态因子αi表征其所对应的数据允许的最大失效概率;The dynamic factor α i characterizes the maximum failure probability allowed by the corresponding data;

δ为数据可靠性保证参数;θ为调整因子;δ is the data reliability assurance parameter; θ is the adjustment factor;

步骤C1.2,超级节点判断Pf与αi的大小,且当Pfi时,超级节点在由其管理的普通节点或其自身建立该被查询数据的副本。Step C1.2, the super node judges the size of P f and α i , and when P f > α i , the super node creates a copy of the queried data in the ordinary node managed by it or itself.

尤其是,所述预定方法为热度阈值判定方法,若被查询数据的热度大于阈值,则在由其管理的普通节点或其自身建立被查询数据副本。In particular, the predetermined method is a hotness threshold determination method, if the hotness of the queried data is greater than the threshold, a copy of the queried data will be established on the common node managed by it or itself.

尤其是,所述步骤A中还包括超级节点实时的监测与其通信各节点的连接状况,并根据各通信节点的运行状况即时的更新数据索引表、临时数据索引表以及社区间数据索引表的子步骤。In particular, the step A also includes that the super node monitors the connection status of each node communicating with it in real time, and updates the data index table, the temporary data index table and the sub-community data index table in real time according to the operating status of each communication node. step.

(三)本发明的有益效果(3) Beneficial effects of the present invention

本发明基于社区的分层机会网络及其建立方法与通信方法,通过建立社区以及由超级节点对普通节点进行管理,提高了连通性;数据的查询优先在社区内查询,抑制了洪泛查询的出现,防止了数据在全网范围内宏泛传播导致的数据存储压力大,占用存储资源等问题。The present invention is based on the community-based layered opportunistic network and its establishment method and communication method, through the establishment of communities and the management of ordinary nodes by super nodes, the connectivity is improved; the query of data is prioritized in the community, and the flood query is suppressed It prevents problems such as high pressure on data storage and occupation of storage resources caused by the macro-spreading of data in the entire network.

附图说明Description of drawings

图1为本发明实施例一所述的基于社区的分层机会网络的结构示意图;FIG. 1 is a schematic structural diagram of a community-based hierarchical opportunity network according to Embodiment 1 of the present invention;

图2为本发明实施例二所述的基于社区的分层机会网络建立方法的流程图;FIG. 2 is a flowchart of a method for establishing a community-based hierarchical opportunity network according to Embodiment 2 of the present invention;

图3为本发明实施例四所述的基于社区的分层机会网络通信方法的流程图。FIG. 3 is a flow chart of a community-based hierarchical opportunistic network communication method according to Embodiment 4 of the present invention.

具体实施方式detailed description

下面结合说明书附图以及实施例对本发明基于社区的分层机会网络及其建立方法与通信方法做进一步的说明。The community-based hierarchical opportunity network and its establishment method and communication method of the present invention will be further described below in conjunction with the accompanying drawings and embodiments.

实施例一:Embodiment one:

本实施例基于社区的分层机会网络,包含若干社区;每一所述社区内的均包括普通节点以及用以标识社区且管理普通节点通信的超级节点;This embodiment is based on a community-based hierarchical opportunity network, including several communities; each of the communities includes ordinary nodes and super nodes used to identify the community and manage the communication of ordinary nodes;

所述社区间通过运动在社区间的游离节点相互通信。The inter-communities communicate with each other by moving free nodes among the communities.

在本实施例中,机会网络的分层性体现在节点之间的不对等性,超级节点比普通节点以及游离节点的权限,功能都更加强大。In this embodiment, the layering of the opportunistic network is reflected in the asymmetry between nodes, and super nodes have more powerful authority and functions than ordinary nodes and free nodes.

如图1所示,图中所示的基于社区的分层机会网络中包括3个社区,分别为社区S1、社区S2以及社区S3,其中社区S1、S2以及S3中均包括一个超级节点以及由超级节点管理的三个普通节点。社区的标识由超级节点来实现,故通常社区的标识与其对应的超级节点的ID是一致的,故社区S1中的超级节点为S1,社区S2中的超级节点为S2,社区S3中的超级节点为S3。As shown in Figure 1, the community-based hierarchical opportunity network shown in the figure includes three communities, namely community S1, community S2, and community S3, where each of communities S1, S2, and S3 includes a super node and Three ordinary nodes managed by supernodes. The identification of the community is realized by the super node, so usually the identification of the community is consistent with the ID of the corresponding super node, so the super node in the community S1 is S1, the super node in the community S2 is S2, and the super node in the community S3 for S3.

社区间通过游离节点通信,如图1中,包括运动在社区S1与社区S3之间的游离节点M1,运动在社区S1与社区S2之间的游离节点M2、M3以及往返社区S2与社区S3之间的游离节点M4,Communities communicate through free nodes, as shown in Figure 1, including free node M1 moving between community S1 and community S3, free nodes M2 and M3 moving between community S1 and community S2, and between community S2 and community S3 The free node M4 between

所述超级节点的选择通常是社区内移动缓慢或不移动的具有稳定性高、可辐射能量高、无线覆盖范围广、计算能力与信息处理能量的通信节点,能够保证在其所覆盖的通信范围内与绝大多数节点进行信令交互、数据传递。超级节点具有全网唯一的表示S。The selection of the super node is usually a slow-moving or non-moving communication node in the community with high stability, high radiant energy, wide wireless coverage, computing power and information processing energy, which can ensure that the communication range covered by it It performs signaling interaction and data transmission with most nodes within the network. Super nodes have a unique representation S in the entire network.

普通节点包括人载与车载的移动设备、存储能力较低,是数据的生产者、传递者以及使用者且与超级节点之间的通信稳定,与普通节点之间通过如蓝牙、IEEE802.11X等实现短距离的无线通信,普通节点在本社区内移动的概率较大,在社区外漫游的概率小。故形成了社区内节点密度大、节点间相遇次数多,数据传输频繁,数据传输时延小,且稳定可靠。每一普通节点均具有全网唯一的表示ID。Ordinary nodes include human-carried and vehicle-mounted mobile devices with low storage capacity. They are producers, transmitters, and users of data and have stable communication with super nodes. They communicate with ordinary nodes through Bluetooth, IEEE802.11X, etc. To achieve short-distance wireless communication, the probability of ordinary nodes moving within the community is relatively high, and the probability of roaming outside the community is small. Therefore, the density of nodes in the community is large, the number of encounters between nodes is large, the data transmission is frequent, the data transmission delay is small, and it is stable and reliable. Each common node has a unique representation ID for the entire network.

作为本实施例的进一步的改进,所述社区建立在通信热点区。所述通信热点区为节点密度大、节点间相遇频繁,数据交互频繁的区域,通常如办公楼、商场、实验室等区域会形成通信热点,而将社区建立在通信热点区,有效的利用了社区特性,实现了数据的高效传递以及共享。As a further improvement of this embodiment, the community is established in a communication hotspot. The communication hotspots are areas with high node density, frequent encounters between nodes, and frequent data interactions. Usually, areas such as office buildings, shopping malls, laboratories and other areas will form communication hotspots. Building communities in communication hotspots effectively utilizes The community feature realizes the efficient transfer and sharing of data.

实施例二:Embodiment two:

如图2所示,本实施例基于社区的分层机会网络建立方法,所述基于社区的分层机会网络建立方法包括以下步骤:As shown in FIG. 2 , in this embodiment, a method for establishing a community-based hierarchical opportunity network, the method for establishing a community-based hierarchical opportunity network includes the following steps:

步骤S1:超级节点实时探测其通信范围内的通信节点并读取通信节点所携带的属性信息;通过实施例一可知,超级节点是计算能力、信息处理能力均较强的通信节点,超级节点在其覆盖的通信范围内探测搜索通信节点,并复制通信节点所携带的属性信息,至少包括其与任何一个超级节点间的相遇概率;Step S1: The supernode detects the communication nodes within its communication range in real time and reads the attribute information carried by the communication nodes; it can be seen from the first embodiment that the supernode is a communication node with strong computing power and information processing ability, and the supernode is in Detect and search communication nodes within the communication range covered by it, and copy the attribute information carried by the communication nodes, including at least the probability of encountering any super node;

步骤S2:超级节点按预设方法计算出与每一所述通信节点的相遇概率;Step S2: The super node calculates the encounter probability with each communication node according to a preset method;

步骤S3:超级节点比较其自身与该通信节点的相遇概率是否大于该通信节点与其他超级节点的相遇概率,Step S3: The super node compares whether its encounter probability with the communication node is greater than the encounter probability of the communication node with other super nodes,

大于,则进入步骤S3.1,不大于则进入步骤S3.2;If it is greater than, enter step S3.1; if it is not greater, enter step S3.2;

步骤S3.1:超级节点将该通信节点设置为由其管理的普通节点,用以组建由其标识的社区,且将其与该通信节点的相遇概率返回给该通信节点;由于超级节点通过计算其与该通信节点的相遇概率大于其他任意一个超级节点,即表示所述超级节点与该通信节点之间数据传递的可靠性大、数据共享性高,节点间的连接性高,且由此可知同一社区内的通信节点间的相遇频率高、数据共享性高、数据可靠大,在超级节点的管理下实现高效的数据交互,以避免查询的洪泛以及数据的洪泛。Step S3.1: The super node sets the communication node as an ordinary node managed by it to form a community identified by it, and returns the probability of encountering the communication node to the communication node; since the super node calculates Its encounter probability with this communication node is greater than any other super node, which means that the reliability of data transmission between the super node and this communication node is high, the data sharing is high, and the connectivity between nodes is high, and it can be seen from this Communication nodes in the same community have high encounter frequency, high data sharing, and high data reliability. Under the management of super nodes, efficient data interaction is realized to avoid query flooding and data flooding.

步骤S3.2:超级节点将其与该通信节点相遇概率返回给该通信节点,其中,该通信节点为所述超级节点所标识社区外的普通节点或游离节点。Step S3.2: The super node returns the probability of encountering the communication node to the communication node, wherein the communication node is an ordinary node or a free node outside the community identified by the super node.

作为本实施例的进一步的具化,所述属性信息包括该通信节点与所有超级节点之间的相遇概率及其所属社区。通信节点可以通过建立相遇概率表来记录其自身与其他通信节点之间的相遇概率,为超级节点建立社区提供数据参考或计算参数。As a further embodiment of this embodiment, the attribute information includes encounter probabilities between the communication node and all super nodes and the communities they belong to. A communication node can record the encounter probability between itself and other communication nodes by establishing an encounter probability table, which provides data reference or calculation parameters for super nodes to establish a community.

通常超级节点与其相遇的所有通信节点的相遇时间、断开时间、连线状况、相遇概率以及每一通信节点的存储空间等信息,并可通过数据概率表等记录形式进行记录。Usually, information such as the encounter time, disconnection time, connection status, encounter probability, and storage space of each communication node between the super node and all communication nodes that it meets can be recorded in the form of a data probability table and other records.

本实施例为实施例一所述的基于社区的分层机会网络,提供具体建立的方法,实现简单快捷,且很好的利用了人载或车载移动通信终端设备的社区性,建立了一个社区内通信节点间联系更加紧密、连接性更好、数据共享能力高的基于社区的分层机会网络,社区间通过游离节点进行通信,防止了数据的洪泛传播,提高了基于社区的分层机会网络分布式存储的效率。This embodiment is the layered opportunistic network based on the community described in Embodiment 1. It provides a specific establishment method, which is simple and quick to implement, and makes good use of the community nature of human-carried or vehicle-mounted mobile communication terminal equipment to establish a community A community-based hierarchical opportunity network with closer connection, better connectivity, and high data sharing capabilities between internal communication nodes. Communities communicate through free nodes, preventing data flooding and improving community-based stratification opportunities Efficiency of network distributed storage.

实施例三:Embodiment three:

本实施例在上一实施例的基础上,提供了一种优选的计算相遇概率的方法;所述预设方法通过如下公式计算超级节点与通信节点间相遇概率;On the basis of the previous embodiment, this embodiment provides a preferred method for calculating the encounter probability; the preset method calculates the encounter probability between the super node and the communication node through the following formula;

优选地,所述预设方法通过如下公式计算超级节点与通信节点间相遇概率;Preferably, the preset method calculates the encounter probability between the super node and the communication node through the following formula;

PP (( SS ,, Mm nno )) 00 ff == 00 PP initinit ff == 11 (( 11 -- λλ )) TT contactcontact TT contactcontact ++ TT noncontactnoncontact ++ λλ (( 11 -- 11 -- PP initinit ee γγ (( ff -- 22 )) )) ff ≥&Greater Equal; 22

P(S,Mn)为超级节点S与通信节点Mn的相遇概率;P(S,M n ) is the encounter probability between super node S and communication node M n ;

f为超级节点S与通信节点Mn的相遇总次数。f is the total number of encounters between super node S and communication node Mn .

PInit为相遇概率的初始值;P Init is the initial value of the encounter probability;

λ为取值在0到1之间的常数;λ is a constant with a value between 0 and 1;

Tcontact为此前预设时间内超级节点S与通信节点Mn相遇的累计时长;Tnoncontact为此前预设时间内超级节点S与通信节点Mn未相遇的累计时长;若预设时间为T,则T=Tcontact+Tnoncontact;T contact is the accumulative duration of meeting between super node S and communication node M n within the previous preset time; T noncontact is the accumulative duration of no encounter between super node S and communication node M n within the previous preset time; if the preset time is T, Then T=T contact +T noncontact ;

γ为调整因子。γ is the adjustment factor.

本实施例所述的预设方法根据本实施例所需建立的基于社区的分层机会网络的社区属性而提出的一种专用的具有计算简便,计算结果准确的优点。The preset method described in this embodiment is a special one proposed according to the community attributes of the community-based hierarchical opportunity network to be established in this embodiment, and has the advantages of simple calculation and accurate calculation results.

作为本实施例的进一步的改进,本实施例还进一步地提供了一种社区间连接概率的计算方法,具体如下:As a further improvement of this embodiment, this embodiment further provides a calculation method for inter-community connection probability, specifically as follows:

运动在社区Si与社区Sj之间的游离节点Mn移动到超级节点Sj所管理的社区Sj时,则游离节点将其所携带的超级节点Si的相遇概率发送给社区Sj,Sj通过此表可计算出Sj与Si的通过节点Mn的间接联系概率如下:When the free node M n moving between the community S i and the community S j moves to the community S j managed by the super node S j , the free node sends the encounter probability of the super node S i it carries to the community S j , S j can calculate the indirect connection probability between S j and S i through node M n through this table as follows:

PP nno (( SS ii ,, SS jj )) == PP (( SS ii ,, SS jj )) oldold ++ (( 11 -- PP (( SS ii ,, SS jj )) oldold )) ×× PP (( SS ii ,, Mm nno )) ×× PP (( Mm nno ,, SS jj )) ×× ββ ))

通过统计所有在两社区之间(即超级节点Sj与Si间)移动的游离节点数,则可计算出Sj与Si的平均间接联系概率为:By counting the number of free nodes moving between the two communities (that is, between the super nodes S j and S i ), the average indirect connection probability between S j and S i can be calculated as:

PP IndirectIndirect (( SS ii ,, SS jj )) == ΣΣ nno == 11 NN (( SS ii ,, SS jj )) PP nno (( SS ii ,, SS jj )) NN (( SS ii ,, SS jj ))

其中N(Si,Sj)是往返与S1,S2之间节点的总数。Among them, N(S i , S j ) is the total number of nodes between S1 and S2.

通过上述方法,可以很好的计算出社区间的连接和联系,进一步的加强了超级节点对基于社区的分层机会网络的管理。Through the above method, the connection and connection between communities can be well calculated, which further strengthens the super node's management of the community-based hierarchical opportunity network.

实施例四:Embodiment four:

如图3所示,本实施例基于社区的分层机会网络通信方法,包括以下步骤:As shown in FIG. 3, the community-based layered opportunistic network communication method of this embodiment includes the following steps:

步骤A:超级节点对由其所标识社区内的普通节点所存储的数据建立数据索引表,对游离节点所存储的数据建立临时数据索引表,并复制游离节点所携带的其他社区的数据索引表构建社区间数据索引表;在具体的实施过程中,普通节点、游离节点以及超级节点将其存储的数据按照预设的统一的命名规则或编号规则进行命名,从而方便数据后续的检索Step A: The super node establishes a data index table for the data stored by the common nodes in the identified community, establishes a temporary data index table for the data stored by the free node, and copies the data index table of other communities carried by the free node Build an inter-community data index table; in the specific implementation process, ordinary nodes, free nodes and super nodes name the data stored in them according to the preset unified naming rules or numbering rules, so as to facilitate the subsequent retrieval of data

步骤B:普通节点M将待查询数据的检索信息提交到超级节点;所述索引信息为关键词或数据存储编号等索引信息Step B: The ordinary node M submits the search information of the data to be queried to the super node; the index information is index information such as keywords or data storage numbers

步骤C:超级节点在数据索引表中查询,Step C: The super node queries in the data index table,

若数据索引表有记录,超级节点将存储有该待查询数据的普通节点N的识别信息发送至普通节点M,普通节点M通过其所在社区内的普通节点间的相遇实现与普通节点N的通信;优先查询本社区内的数据索引表,即优先与本社区内的通信节点间共享数据,由于社区内节点相遇频繁,故具有传输快,共享效率等优点,且相对传统方法中在全网查询,可以更快的提供更为优质的数据转发、携带路径,避免不必要的中间通信节点的数据转发,从而减缓各通信节点的存储压力,提高存储效率;其中所述普通节点N可以是一个或多个位于本社区内的通信节点;If there is a record in the data index table, the super node will send the identification information of the ordinary node N that stores the data to be queried to the ordinary node M, and the ordinary node M realizes the communication with the ordinary node N through the encounter between the ordinary nodes in its community ;Priority to query the data index table in the community, that is, to share data with the communication nodes in the community in priority. Since the nodes in the community meet frequently, it has the advantages of fast transmission and sharing efficiency, and compared with the traditional method in the whole network query , can provide more high-quality data forwarding and carrying paths faster, avoid unnecessary data forwarding of intermediate communication nodes, thereby reducing the storage pressure of each communication node and improving storage efficiency; wherein the common node N can be one or Multiple communication nodes located in the community;

若数据索引表无记录,超级节点在临时数据索引表中查询是否有记录,If there is no record in the data index table, the super node will query whether there is a record in the temporary data index table,

有,则超级节点向普通节点M返回游离节点O的识别信息,普通节点M通过通信节点的相遇与游离节点O进行通信;无,超级节点在社区间数据索引表中查询是否有记录,If there is, the super node returns the identification information of the free node O to the ordinary node M, and the ordinary node M communicates with the free node O through the encounter of the communication nodes; if there is no, the super node queries whether there is a record in the inter-community data index table,

有,则通过游离节点P访问存储有该待查询数据的其他社区的普通节点,并由游离节点P返回数据给普通节点M;If yes, the free node P accesses the ordinary nodes of other communities that store the data to be queried, and the free node P returns the data to the ordinary node M;

无,则通信失败。If none, the communication fails.

若同一社区内没有通信节点可提供所需数据,再通过游离节点进行通信,为数据查询在保证最优查询的基础上,保证了与其他社区以及社区外的节点进行通信的方法,保证了基于社区的分层机会网络中存在该数据,就可以查询到,从而保证了较高的查询效率。If there is no communication node in the same community that can provide the required data, and then communicate through the free node, on the basis of ensuring the optimal query for data query, it ensures the method of communicating with other communities and nodes outside the community, and ensures the communication based on The data can be queried if it exists in the hierarchical opportunity network of the community, thus ensuring high query efficiency.

在以往的基于社区的分层机会网络中,两个通信节点相遇时,首先读取彼此的与其他通信节点相遇概率,如第一节点发现第二节点与其需要进行通信的目的节点相遇的机会大,则将其需要转发的信息传输到第二节点;是建立在一个源节点与一个目的节点之间的节点转发携带传输模式,而在本实施例所述的基于社区的分层机会网络中,通过超级节点可以获取存储有该数据的节点,则在节点相遇的数据传递时,是一个节点到多个节点间的数据传递,传递路径更多,从而数据交互的稳定性,可靠性更高,时延减小。In the previous community-based hierarchical opportunistic network, when two communication nodes meet, they first read each other’s encounter probability with other communication nodes. , then transmit the information that needs to be forwarded to the second node; it is a node forwarding carrying transmission mode established between a source node and a destination node, and in the community-based hierarchical opportunistic network described in this embodiment, The node that stores the data can be obtained through the super node. When the data transfer between the nodes is passed, it is the data transfer from one node to multiple nodes. There are more transfer paths, so the stability and reliability of data interaction are higher. Latency is reduced.

实施例五:Embodiment five:

本实施例在上一实施例的基础上,所述步骤C中,超级节点还监控各数据被查询的热度,并根据预定方法判断是否在由其管理的普通节点或其自身建立被查询数据副本。In this embodiment, on the basis of the previous embodiment, in the step C, the super node also monitors the popularity of each data being queried, and judges whether to establish a copy of the queried data in the common node managed by it or itself according to a predetermined method .

在本实施例中,通过数据副本的建立,防止了仅一个源节点保存了数据导致当该节点失效或消失导致的整个基于社区的分层机会网络失去了该数据的问题发生,从而提高了基于社区的分层机会网络数据的可靠性和安全性。In this embodiment, through the establishment of a data copy, it is prevented that only one source node saves the data, which causes the entire community-based hierarchical opportunity network to lose the data when the node fails or disappears, thereby improving the The community's layered opportunity network data reliability and security.

作为本实施例的进一步的改进,本实施例还提供至少两种所述的预设方法;As a further improvement of this embodiment, this embodiment also provides at least two of the aforementioned preset methods;

第一:所述预定方法包括以下步骤:First: the predetermined method includes the following steps:

步骤C1.1:根据如下公式分别计算Pf以及αiStep C1.1: Calculate P f and α i respectively according to the following formulas;

PP ff == ΠΠ nno == 11 CC ++ 11 (( 11 -- PP (( SS ,, Mm nno )) ))

αα ii == δeδ e -- θHDθ HD II

Pf为其所述对应数据的失效概率;P f is the failure probability of the corresponding data;

C为其所对应的社区内数据的副本数;C is the number of copies of data in the corresponding community;

P(S,Mn)为本次超级节点S与通信及节点Mn的相遇概率;P(S,M n ) is the encounter probability between super node S and communication and node M n this time;

热度HDI为单位时间内其所对应的数据被查询的次数;Heat HD I is the number of times the corresponding data is queried per unit time;

动态因子αi表征其所对应的数据允许的最大失效概率;The dynamic factor α i characterizes the maximum failure probability allowed by the corresponding data;

δ为数据可靠性保证参数;θ为调整因子;δ is the data reliability assurance parameter; θ is the adjustment factor;

步骤C1.2,超级节点判断Pf与αi的大小,且当Pfi,则超级节点在由其管理的普通节点或其自身建立该被查询数据的副本,最终可以通过判断Pf≤αi是否成立,决定是否停止建立副本。Step C1.2, the super node judges the size of P f and α i , and when P f > α i , then the super node creates a copy of the queried data in the ordinary node managed by it or itself, and finally can judge P Whether f ≤ α i holds true, decides whether to stop creating copies.

本预设方法优先用于同一社区内的普通节点之间通信时数据副本,且通常将数据副本建立在剩余存储空间足够的普通节点上,这样既保证了数据的可靠性,同时保证各通信节点的负载均衡。This default method is preferentially used for data copies during communication between ordinary nodes in the same community, and usually the data copies are established on ordinary nodes with sufficient remaining storage space, which not only ensures the reliability of the data, but also ensures that each communication node load balancing.

第二:所述预定方法为热度阈值判定方法,若被查询数据的热度大于阈值,则在由其管理的普通节点或其自身建立被查询数据副本。副本建立的份数可以根据各副本的平均热度的阈值判断来决定。Second: the predetermined method is a hotness threshold determination method, if the hotness of the queried data is greater than the threshold, a copy of the queried data will be established on the common node managed by it or itself. The number of copies created can be determined according to the threshold value of the average popularity of each copy.

阈值判定方法同样的也可以用于是否需要建立被查询数据副本的判定,但通常用于社区间,即社区外的节点对本社区内的一个数据查询次数达到一定上限,则在本社区内建立副本,且该副本通常建立在超级节点上,社区外的节点,通过游离节点与超级节点的相遇即可实现数据的交互,进一步简化了传递路径,提高了获取数据的有效性。The threshold judgment method can also be used to judge whether it is necessary to establish a copy of the queried data, but it is usually used between communities, that is, if the number of times a node outside the community queries a data in the community reaches a certain upper limit, a copy will be established in the community , and the copy is usually established on the super node, and the nodes outside the community can realize the data interaction through the encounter between the free node and the super node, which further simplifies the transmission path and improves the effectiveness of data acquisition.

上述两种方法均可用于被查询数据的副本的建立,超级节点在具体的运行时,可以只选择其中一种方法,也可同时应用两种方法,如社区内则用第一种失效概率与动态因子比较的方法,社区间则用第二种热度阈值判断的方法。The above two methods can be used to establish a copy of the queried data. Supernodes can choose only one of the methods during specific operation, or apply both methods at the same time. For example, in the community, the first failure probability and The method of dynamic factor comparison, the second method of heat threshold judgment is used among communities.

实施例六:Embodiment six:

本实施例在上述关于基于社区的分层机会网络通信方法中的任一实施例的基础上,所述步骤A中还包括超级节点实时的监测与其通信各节点的连接状况,并根据各通信节点的运行状况即时的更新数据索引表、临时数据索引表以及社区间数据索引表的子步骤。In this embodiment, on the basis of any one of the above-mentioned communication methods for community-based hierarchical opportunistic networks, the step A also includes the super node monitoring the connection status of each node communicating with it in real time, and according to each communication node The sub-steps of updating the data index table, temporary data index table, and inter-community data index table in real time.

普通节点在社区内实时运动,游离节点可能进入社区内成为普通节点,也可能进入某一社区与本社区的超级节点之间不能再通信,而普通节点也可能运动出本社区成为本社区与其他社区联系的游离节点,故需要及时的更新数据索引表、临时数据索引表、以及社区见数据索引表,保证查询到的引用是准确无误,不会因为普通节点成为游离节点,游离节点活动范围过大不在能与本社区内的节点进行通信时,造成通信不可靠等现象。所述更新包括,添加索引、删除索引,改写索引等动作。Ordinary nodes move in real time in the community. Free nodes may enter the community and become ordinary nodes, or they may enter a community and can no longer communicate with the super nodes of this community. Ordinary nodes may also move out of the community and become The free nodes connected by the community need to update the data index table, temporary data index table, and community see data index table in a timely manner to ensure that the references found are accurate and will not become free nodes because of ordinary nodes. Most of the time it is not possible to communicate with the nodes in the community, resulting in unreliable communication. The update includes actions such as adding an index, deleting an index, and rewriting an index.

以上实施方式仅用于说明本发明,而并非对本发明的限制,有关技术领域的普通技术人员,在不脱离本发明的精神和范围的情况下,还可以做出各种变化和变型,因此所有等同的技术方案也属于本发明的范畴,本发明的专利保护范围应由权利要求限定。The above embodiments are only used to illustrate the present invention, but not to limit the present invention. Those of ordinary skill in the relevant technical field can make various changes and modifications without departing from the spirit and scope of the present invention. Therefore, all Equivalent technical solutions also belong to the category of the present invention, and the scope of patent protection of the present invention should be defined by the claims.

Claims (4)

1. a community-based laminating machine meeting network creating method, it is characterised in that described community-based laminating machine can net Network method for building up comprises the following steps:
Step S1: communication node in its communication range of super node real-time detection also reads the attribute letter entrained by communication node Breath;
Step S2: super node is calculated and the collision probability of each described communication node by presetting method;
Step S3: it is super with other more than this communication node with the collision probability of this communication node that super node compares himself The collision probability of level node,
It is more than, then enters step S3.1, be not more than and then enter step S3.2;
Step S3.1: this communication node is set to the ordinary node managed by it by super node, is identified by it in order to set up Community, and its collision probability with this communication node is returned to this communication node;
Step S3.2: itself and this communication node collision probability are returned to this communication node, wherein, this communication node by super node Ordinary node outside by the identified community of described super node or free node;Wherein, described presetting method passes through equation below Calculate collision probability between super node and communication node;
P ( S , M n ) = 0 f = 0 P i n i t f = 1 ( 1 - λ ) T c o n t a c t T c o n t a c t + T n o n c o n t a c t + λ ( 1 - 1 - P i n i t e γ ( f - 2 ) ) f ≥ 2
P(S,Mn) it is super node S and communication node MnCollision probability;
F is super node S and communication node MnThe total degree that meets;
PInitInitial value for collision probability;
λ is value constant between 0 to 1;
TcontactFor super node S in Preset Time before this and communication node MnThe accumulative duration met;TnoncontactFor the most pre- If super node S and communication node M in the timenUnmet accumulative duration;
γ is Dynamic gene;
Wherein, described attribute information includes the collision probability between this communication node and all super nodes and affiliated community thereof.
2. a community-based laminating machine meeting network communication method, it is characterised in that described community-based laminating machine can net Network communication means comprises the following steps:
Step A: the data stored by the ordinary node in its identified community are set up data directory, to trip by super node The data stored from node set up ephemeral data concordance list, and replicate the data directory of free other communities entrained by node Table builds data directory between community;
Step B: the retrieval information of data to be checked is submitted to super node by ordinary node M;
Step C: super node is inquired about in data directory,
If data directory has record, storage is had the identification information of the ordinary node N of these data to be checked to send by super node The communication with ordinary node N is realized by meeting between the ordinary node in its place community to ordinary node M, ordinary node M;
If data directory no record, super node inquires about whether have record in ephemeral data concordance list,
Have, then super node returns the identification information of free node O, the ordinary node M phase by communication node to ordinary node M Meet and communicate with free node O;
Nothing, super node inquires about whether have record between community in data directory,
Have, then access, by free node P, the ordinary node that storage has other communities of these data to be checked, and by free node P returns data to ordinary node M;
Nothing, then communication failure;
Wherein, described community-based laminating machine network packet can contain some communities;All including in each described community is commonly saved Put and in order to identify community and the super node of management ordinary node communication.
Community-based laminating machine the most according to claim 2 meeting network communication method, it is characterised in that
In described step C, super node also monitors the temperature that each data are queried, and judges whether by it according to preordering method The ordinary node of management or himself foundation are queried data trnascription;Described preordering method comprises the following steps:
Step C1.1: calculate P according to equation below respectivelyfAnd αi
P f = Π n = 1 C + 1 ( 1 - P ( S , M n ) )
α i = δe - θHD I
PfFailure probability for its corresponding data;
C is the number of copies of data in the community that it is corresponding;
P(S,Mn) it is super node S and storage has the communication node M of data to be checkednCollision probability;
Temperature HDIThe number of times being queried for its corresponding data in the unit time;
Dynamic factor αiCharacterize the maximum failure probability that its corresponding data allow;
δ is that data reliability ensures parameter;θ is Dynamic gene;
Step C1.2, super node judges PfWith αiSize, and work as PfiTime, super node is at the ordinary node managed by it Or himself set up this copy being queried data.
4. according to the community-based laminating machine meeting network communication method described in Claims 2 or 3, it is characterised in that described step Rapid A also including, the real-time monitoring of super node communicates with the connection state of each node, and according to the operation of each communication node What situation was instant updates the sub-step of data directory between data directory, ephemeral data concordance list and community.
CN201310120823.3A 2013-04-09 2013-04-09 Community-based layering opportunistic network and method for building up thereof and communication means Expired - Fee Related CN103312535B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310120823.3A CN103312535B (en) 2013-04-09 2013-04-09 Community-based layering opportunistic network and method for building up thereof and communication means

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310120823.3A CN103312535B (en) 2013-04-09 2013-04-09 Community-based layering opportunistic network and method for building up thereof and communication means

Publications (2)

Publication Number Publication Date
CN103312535A CN103312535A (en) 2013-09-18
CN103312535B true CN103312535B (en) 2016-12-28

Family

ID=49137339

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310120823.3A Expired - Fee Related CN103312535B (en) 2013-04-09 2013-04-09 Community-based layering opportunistic network and method for building up thereof and communication means

Country Status (1)

Country Link
CN (1) CN103312535B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104661275B (en) * 2014-12-11 2018-01-30 北京邮电大学 A Data Transmission Method in Opportunistic Networks

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101594697A (en) * 2009-05-08 2009-12-02 北京航空航天大学 A Data Transmission Method Based on Community Opportunity Network
CN102970725A (en) * 2012-11-30 2013-03-13 北京理工大学 Mobile opportunity network routing method based on multi-layer community grouping

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090037307A1 (en) * 2007-08-01 2009-02-05 Wachovia Corporation Online origination machine

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101594697A (en) * 2009-05-08 2009-12-02 北京航空航天大学 A Data Transmission Method Based on Community Opportunity Network
CN102970725A (en) * 2012-11-30 2013-03-13 北京理工大学 Mobile opportunity network routing method based on multi-layer community grouping

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
THE RESEARCH ON DISTRIBUTED STORAGE MECHANISM USED IN CLUSTERED OPPORTUNISTIC NETWORK;JINGLONG LV;《proceedings of IEEE CCIS2012》;20120803;第255页右栏第20行至第257页右栏第21行 *
基于社区检测的机会网络路由机制研究;靳继伟;《中国优秀硕士论文全文数据库信息科技辑》;20121130;正文第4.1节至4.7节 *

Also Published As

Publication number Publication date
CN103312535A (en) 2013-09-18

Similar Documents

Publication Publication Date Title
Jo et al. Device-to-device-based heterogeneous radio access network architecture for mobile cloud computing
CN101686262B (en) Multi-node collaboration based storage method for sensor network
Seada et al. Rendezvous regions: A scalable architecture for service location and data-centric storage in large-scale wireless networks
Tang et al. An energy efficient hierarchical clustering index tree for facilitating time-correlated region queries in the Internet of Things
CN101355473B (en) Mobile ad hoc network resource release and search method and mobile ad hoc network node equipment
CN104753797A (en) Content center network dynamic routing method based on selective caching
CN104661275B (en) A Data Transmission Method in Opportunistic Networks
CN104486741B (en) The mixed serve that a kind of trust state perceives finds method
Pingale et al. Multi-objective sunflower based grey wolf optimization algorithm for multipath routing in IoT network
CN110337092A (en) A kind of low-power consumption relay selection method based on social trust model
CN107343304A (en) The cooperation caching method of content center network
Li et al. MobiSN: Semantics-based mobile ad hoc social network framework
CN105872054A (en) Mobile social network resource discovering method based on interest hotspots
CN102625292B (en) Social intermittent connection network dynamic address allocation and network performance optimization method
Chai et al. An efficient cooperative hybrid routing protocol for hybrid wireless mesh networks
CN106658632A (en) Wireless self-organizing network-based electric automobile charging method
CN103312535B (en) Community-based layering opportunistic network and method for building up thereof and communication means
He et al. Greedy construction of load‐balanced virtual backbones in wireless sensor networks
CN110139285B (en) A kind of power wireless special website site selection method
CN103501524A (en) Sparse self-organized monitoring network
Huang et al. Data-centric routing in sensor networks using biased walk
CN112020097B (en) A collaborative sensing node selection method based on energy efficiency priority in mobile scenarios
Benkaouha et al. Towards an efficient failure detection in MANETs
CN104270323B (en) A kind of network-content acquisition method of content oriented
CN103731510A (en) Data interaction method for application layer of wireless sensor network based on IPv6 (internal protocol version 6)

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
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20161228

Termination date: 20170409