【摘要】：針對如何有效利用多個資源提供者為請求資源的車輛提供服務(wù)的問題,引入車輛服務(wù)能力的概念,面向城市車輛自組織網(wǎng)絡(luò)(VANET)環(huán)境,提出了一種車聯(lián)網(wǎng)協(xié)同服務(wù)發(fā)現(xiàn)中間件體系結(jié)構(gòu).該中間件可以根據(jù)車輛的內(nèi)部資源和自身的物理屬性,綜合衡量其提供服務(wù)的能力.同時,設(shè)計了協(xié)同服務(wù)發(fā)現(xiàn)算法,將服務(wù)任務(wù)根據(jù)提供服務(wù)車輛的服務(wù)能力進行合理分配.計算可提供服務(wù)車輛的服務(wù)能力和協(xié)同服務(wù)車輛閾值,確定服務(wù)提供者列表.按照列表內(nèi)各車輛的服務(wù)能力,將請求的服務(wù)任務(wù)進行分配,并將服務(wù)請求車輛與服務(wù)提供者進行服務(wù)綁定.仿真結(jié)果表明,與相同城市環(huán)境下的VITP算法相比,所提算法可降低服務(wù)綁定時間,并提高服務(wù)綁定成功率.
[Abstract]:In order to solve the problem of how to effectively utilize multiple resource providers to provide services for vehicles requesting resources, the concept of vehicle service capability is introduced to face the (VANET) environment of urban vehicle ad hoc networks. This paper presents a middleware architecture for collaborative service discovery in vehicle networking. The middleware can comprehensively measure the ability of the vehicle to provide services according to its internal resources and its own physical properties. At the same time, a collaborative service discovery algorithm is designed to distribute the service tasks according to the service capacity of service vehicles. The service capacity and collaborative service vehicle threshold are calculated to determine the list of service providers. According to the service capacity of each vehicle in the list, the requested service task is assigned and the service request vehicle is bound to the service provider. The simulation results show that compared with the VITP algorithm in the same urban environment, the proposed algorithm can reduce the service binding time and improve the success rate of service binding.
【作者單位】： 湖南大學信息科學與工程學院;
【基金】：國家自然科學基金資助項目(61672220)
【分類號】：U463.67;U495

【相似文獻】

相關(guān)期刊論文 前2條

1 包起帆;;“兩港一航”集裝箱電子標簽系統(tǒng)的應(yīng)用示范研究(續(xù)前)[J];集裝箱化;2006年04期

2 ;[J];;年期

相關(guān)碩士學位論文 前2條

1 李楊盼;基于多Agent的車聯(lián)網(wǎng)預警監(jiān)測中間件研究[D];河北工業(yè)大學;2015年

2 李守京;Telematics系統(tǒng)的軟件構(gòu)架與應(yīng)用[D];上海交通大學;2015年

，

本文編號：2338918