本文選題：自組織社會(huì)網(wǎng)絡(luò) + 中間件��； 參考：《大連理工大學(xué)》2014年博士論文

【摘要】：自組織社會(huì)網(wǎng)絡(luò)為移動(dòng)用戶間提供了基礎(chǔ)設(shè)施無關(guān)的機(jī)會(huì)性溝通環(huán)境。充分利用由現(xiàn)代傳感設(shè)備采集的用戶社會(huì)性特征有助于提升和改善移動(dòng)自組織網(wǎng)絡(luò)的性能。其中,以社會(huì)感知機(jī)制為基礎(chǔ)設(shè)計(jì)的中間件對(duì)簡(jiǎn)潔高效地開發(fā)創(chuàng)新性的應(yīng)用與服務(wù)具有重要的作用。然而,由于受到多種因素的限制,如缺乏集中管理、設(shè)備異構(gòu)性、無線通信的不可靠性、移動(dòng)性、資源約束、需要支持多種流量類型等,一些新的挑戰(zhàn)也應(yīng)運(yùn)而生。其中一個(gè)主要挑戰(zhàn)是由應(yīng)用程序和底層協(xié)議之間的差異而造成的性能下降和實(shí)施效率低下的問題。此外,數(shù)據(jù)管理也為人類和無線網(wǎng)絡(luò)系統(tǒng)提出了嚴(yán)峻的挑戰(zhàn),由于目前僅僅忽略或者只在一定程度上考慮了用戶社會(huì)和移動(dòng)信息。自組織社會(huì)網(wǎng)絡(luò)可以廣泛地應(yīng)用在會(huì)議場(chǎng)所和一些緊急情況下,其實(shí)際場(chǎng)景能清晰地說明在合適的無線網(wǎng)絡(luò)操作中將重要的服務(wù)或模塊(如數(shù)據(jù)管理)和中間件設(shè)計(jì)相結(jié)合的重要性。 在目前的工作中,自組織網(wǎng)絡(luò)框架已經(jīng)被提出,但從未在數(shù)據(jù)管理中考慮社會(huì)感知問題。為解決這一不足之處,本文專注于為自組織社會(huì)網(wǎng)絡(luò)中間件開發(fā)一個(gè)正式的框架,在其上可以設(shè)計(jì)和提出數(shù)據(jù)管理協(xié)議。本文充分利用社會(huì)網(wǎng)絡(luò)和移動(dòng)自組織網(wǎng)絡(luò)去整合社會(huì)感知和用戶移動(dòng)性。這促使本文探討了數(shù)據(jù)管理中間件的各方面問題,包括數(shù)據(jù)可用性、負(fù)載分配和社群中用戶合作問題。自組織社會(huì)網(wǎng)絡(luò)不同于社會(huì)網(wǎng)絡(luò)在于其網(wǎng)絡(luò)結(jié)構(gòu)是經(jīng)常性斷連的。傳統(tǒng)上,理想方法被廣泛的用于解決數(shù)據(jù)可用性,甚至是負(fù)載分配和用戶合作問題。然而,無線鏈路的質(zhì)量受多種因素影響,例如移動(dòng)性、開銷和用戶自私行為。為應(yīng)對(duì)上述挑戰(zhàn),數(shù)據(jù)拷貝方法和社群劃分概念在本文的研究過程中得到了廣泛地應(yīng)用。據(jù)我們所知,這是第一次在自組織社會(huì)網(wǎng)絡(luò)中同時(shí)研究數(shù)據(jù)可用性、負(fù)載分配和自私問題。 自組織社會(huì)網(wǎng)絡(luò)服務(wù)的可訪問性和可用性可由拷貝方法來保證,該方法有助于避免因組群的不確定性移動(dòng)引起的社群劃分以及數(shù)據(jù)丟失,同時(shí)也利于減少數(shù)據(jù)從源端到目的端經(jīng)歷的跳數(shù)。但是由于資源限制,不可能在每個(gè)節(jié)點(diǎn)上拷貝所有的數(shù)據(jù)項(xiàng)。問題由此產(chǎn)生,在何處、如何分配數(shù)據(jù)副本以獲得高數(shù)據(jù)可訪問性和可用性。本文首先在該方向上以最大化數(shù)據(jù)可用性為目標(biāo)設(shè)計(jì)拷貝協(xié)議ComPAS,一個(gè)基于社群劃分感知的拷貝分配方法。ComPAS運(yùn)用一致有效的方式為每位用戶存儲(chǔ)數(shù)據(jù)副本,它基于系統(tǒng)的拷貝預(yù)算及其所需可用性來選擇副本數(shù)量。該方法的目標(biāo)包括利用社會(huì)關(guān)系為社群中的數(shù)據(jù)設(shè)置拷貝,通過盡可能降低拷貝讀取消耗、重定位消耗和通信量,提高有效性和一致性。該方法同時(shí)將平衡社群存儲(chǔ)空間負(fù)載作為另一個(gè)目標(biāo)。與其他方案相比,ComPAS在讀取消耗上提供了更引入關(guān)注的模式,并且能高效處理網(wǎng)絡(luò)中的副本重定位問題。 自組織社會(huì)網(wǎng)絡(luò)系統(tǒng)同時(shí)面臨著性能退化和穩(wěn)定性差的挑戰(zhàn),這是由工作時(shí)的負(fù)載不均衡分布和鏈路失效造成的。分布式系統(tǒng)的正常功能是由其各個(gè)計(jì)算模塊協(xié)同工作而實(shí)現(xiàn)的。一個(gè)有效的負(fù)載均衡策略能保證系統(tǒng)資源的優(yōu)化利用,并且各個(gè)代理中不會(huì)出現(xiàn)空載或過載的情況。在現(xiàn)如今的許多分布式環(huán)境中,包括自組織社會(huì)網(wǎng)絡(luò),用戶由有限的存儲(chǔ)空間、帶寬等資源相連接從而造成時(shí)延,這使得用戶需要依靠遍及整個(gè)網(wǎng)絡(luò)的資源通信和負(fù)載交換。為了充分利用這類網(wǎng)絡(luò)系統(tǒng),數(shù)據(jù)可用性和資源分發(fā)是關(guān)鍵問題,其中負(fù)載均衡、分區(qū)和容錯(cuò)都是需要解決的問題。因此,本文提出了基于社群的、具有負(fù)載均衡與公平機(jī)制的事件分發(fā)方法Co-Lab,強(qiáng)化了數(shù)據(jù)管理性能。該方法采用興趣相似性和過濾拷貝方法在社群內(nèi)進(jìn)行代理分簇。Co-Lab的目標(biāo)是在社群代理間獲得更加均勻的負(fù)載分布,在保持盡可能高的可靠性下避免過載代理的出現(xiàn)。性能評(píng)價(jià)部分表明Co-Lab具有明顯的優(yōu)勢(shì),可以達(dá)到相對(duì)更好的負(fù)載均衡,降低總體負(fù)載,以及對(duì)于失效情況的魯棒性。 現(xiàn)有的數(shù)據(jù)管理協(xié)議的另一不足之處在于進(jìn)行轉(zhuǎn)發(fā)數(shù)據(jù)等操作時(shí)通常會(huì)假設(shè)用戶是合作的。如果節(jié)點(diǎn)拒絕合作,端到端的連接就無法形成。這樣的非自愿(自私)的行為會(huì)嚴(yán)重降低網(wǎng)絡(luò)的性能。所以,探測(cè)自私用戶、減輕其對(duì)合作用戶的影響是必不可少的。盡管在探測(cè)自私用戶方面已有研究,但是圍繞該問題仍存在一些問題,尤其是面對(duì)自組織網(wǎng)絡(luò)中的數(shù)據(jù)分發(fā)和轉(zhuǎn)發(fā)服務(wù)時(shí)。所以,本文意欲設(shè)計(jì)一種算法,讓每位用戶能自主地識(shí)別和排除自私用戶。這類特性可以從細(xì)菌等的生物過程中觀察得出,并且啟發(fā)我們將這一新的合作框架的概念用于拷貝分配協(xié)議上。因此,本文提出了一種以ComPAS為數(shù)據(jù)拷貝模型的生物啟發(fā)式的算法,稱作BoDMaS,以探測(cè)和減輕自私節(jié)點(diǎn)的影響。BoDMaS采用社會(huì)和生物機(jī)制,對(duì)用戶進(jìn)行評(píng)估和分類,并拒絕自私用戶的參與。為評(píng)價(jià)該策略的有效性,本文采用了不同的指標(biāo)。結(jié)果表明,在自組織社會(huì)網(wǎng)絡(luò)環(huán)境下,BoDMaS能準(zhǔn)確探測(cè)在拷貝操作中的自私性。
[Abstract]:The self-organized social network provides an infrastructure independent opportunistic communication environment for mobile users. Making full use of the social characteristics of users collected by modern sensing devices helps to improve and improve the performance of mobile ad hoc networks. Among them, middleware based on social perception mechanism is innovative and efficient in developing and innovating. However, some new challenges, such as lack of centralized management, isomeric equipment, unreliability of wireless communications, mobility, resource constraints, need to support a variety of traffic types, and a number of new challenges. One of the major challenges is the application and the underlying protocol. In addition, data management also poses a severe challenge to the human and wireless network systems. Since only a certain degree of neglect or only a certain degree of consideration of the user's social and mobile information, the self organized social network can be widely used in conference sites and some of them. In an emergency, its actual scene clearly illustrates the importance of combining important services or modules (such as data management) and middleware design in a suitable wireless network operation.
In the present work, the self-organizing network framework has been proposed, but the social perception problem has never been considered in the data management. In order to solve this problem, this paper focuses on the development of a formal framework for self-organizing social network middleware, and can design and propose data management protocols on it. This paper makes full use of social networks and Mobile ad hoc networks integrate social perception and user mobility. This has prompted this paper to discuss all aspects of data management middleware, including data availability, load distribution and user cooperation in the community. The self organized social network is different from the social network because its network structure is often disconnected. Traditionally, the ideal method It is widely used to solve data availability, even load distribution and user cooperation. However, the quality of wireless links is affected by many factors, such as mobility, overhead and user selfish behavior. In response to the above challenges, the data copy method and community division concept have been widely used in the research process of this article. For the first time, it is the first time to study data availability, load distribution and selfishness in a self organizing social network.
The accessibility and availability of self-organized social network services can be guaranteed by copy methods, which can help avoid community division and data loss caused by group uncertainty movement, and also reduce the number of jumps from source to destination. However, it is impossible to copy each node by resource constraints. All data items. The problem arises, where, how to assign a copy of data to obtain high data accessibility and availability. First, in this direction, a copy protocol ComPAS is designed to maximize data availability, and a community partition aware copy allocation method.ComPAS uses a consistent and effective way for each A user stores a copy of the data, which is based on the copy budget of the system and its availability to select the number of copies. The aim of this method is to use social relations to copy the data in the community, to reduce the copy reading consumption as much as possible, to relocate the consumption and traffic, to raise the efficiency and consistency. The group storage space load is another goal. Compared with other solutions, ComPAS provides more interesting patterns for reading consumption and can efficiently handle replica relocation problems in the network.
The self organized social network system is confronted with the challenge of performance degradation and poor stability, which is caused by the unbalanced load distribution and link failure at work. The normal function of the distributed system is implemented by the cooperative work of various computing modules. An effective load balancing strategy can ensure the optimal utilization of the system resources. In many distributed environments, including self organized social networks, users are connected by limited storage space, bandwidth and other resources to cause delay, which makes users rely on resource communication and load exchange throughout the network. In order to make full use of this Network system, data availability and resource distribution are the key problems, in which load balancing, partition and fault tolerance are all problems to be solved. Therefore, this paper proposes an event distribution method, Co-Lab, based on community, with load balancing and fairness mechanism, which strengthens the performance of data management. This method uses interest similarity and filter copying. The objective of the proxy clustering.Co-Lab in the community is to obtain a more uniform load distribution between the community agents and avoid the appearance of the overloading agent under the highest possible reliability. The performance evaluation part shows that Co-Lab has obvious advantages to achieve a relatively better negative load balance, the overall load reduction, and the failure of the failure. The robustness of the case.
Another disadvantage of existing data management protocols is that a user is usually assumed to be cooperative when the data is forwarded. If the node refuses to cooperate, the end to end connection can not be formed. Such an involuntary (selfish) behavior will seriously reduce the performance of the network. Therefore, it will detect selfish users and reduce their shadow to the cooperative users. Noise is essential. Although there has been a study on the detection of selfish users, there are still some problems around this problem, especially in the face of data distribution and forwarding services in a self organized network. So, this article intends to design an algorithm that allows each user to recognize and exclude selfish users independently. This kind of feature can be from bacteria. The concept of this new cooperative framework is used to apply the concept of this new cooperative framework to the copy allocation protocol. Therefore, this paper proposes a bioheuristic algorithm based on ComPAS as a data copy model, called BoDMaS, to detect and mitigate the influence of selfish nodes on the social and biological mechanisms, and to the users. In order to evaluate the effectiveness of the strategy, different indicators are used to evaluate the effectiveness of the strategy. The results show that BoDMaS can accurately detect the selfishness in the copy operation under the self-organized social network environment.

【學(xué)位授予單位】：大連理工大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2014
【分類號(hào)】：TN929.5
，

本文編號(hào)：1795369