Pub Date : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594904
G. Anastasi, M. Castronuovo, M. Conti, M. D. Francesco
In the last years wireless sensor networks (WSN) have emerged as an enabling technology for a wide range of applications. The main challenge in the deployment and actual utilization of WSNs is the scarce energy budget available at sensor nodes. In this paper we address this problem through an Adaptive Staggered Sleep Protocol (ASLEEP) which is suitable to environmental monitoring applications. By tuning dynamically the wakeup period of each sensor node to its current traffic pattern, ASLEEP reduces both energy consumption and message latency. In addition, it can adapt to changes in the operating conditions. We present an experimental evaluation of ASLEEP based on a prototype implementation in a real testbed. The experimental results show that the proposed solution provides better performance, in terms of reduced energy consumption and message latency, in comparison with other similar approaches.
{"title":"Experimental evaluation of an Adaptive Staggered Sleep Protocol for wireless sensor networks","authors":"G. Anastasi, M. Castronuovo, M. Conti, M. D. Francesco","doi":"10.1109/WOWMOM.2008.4594904","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594904","url":null,"abstract":"In the last years wireless sensor networks (WSN) have emerged as an enabling technology for a wide range of applications. The main challenge in the deployment and actual utilization of WSNs is the scarce energy budget available at sensor nodes. In this paper we address this problem through an Adaptive Staggered Sleep Protocol (ASLEEP) which is suitable to environmental monitoring applications. By tuning dynamically the wakeup period of each sensor node to its current traffic pattern, ASLEEP reduces both energy consumption and message latency. In addition, it can adapt to changes in the operating conditions. We present an experimental evaluation of ASLEEP based on a prototype implementation in a real testbed. The experimental results show that the proposed solution provides better performance, in terms of reduced energy consumption and message latency, in comparison with other similar approaches.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125077665","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594919
Kameswari Kotapati, Peng Liu, T. F. Porta
A major security vulnerability in the mobile telecommunication network is that wireline signaling messages are cleartext. The latest protocol for wireline signaling message security is mobile application part security (MAPSec), which protects MAP (a signaling message protocol) messages on the link between nodes. MAPSec is a limited solution because it still leaves MAP signaling messages unsecured in intermediate nodes, and also leaves other wireline signaling message protocols unsecured both on the link and in intermediate nodes. Hence, there is a need for a more comprehensive wireline security scheme to protect all types of wireline signaling messages end-to-end i.e., both on the link and in intermediate nodes. As a solution, we propose EndSec, an end-to-end wireline signaling message security protocol for all types of signaling messages. EndSec works by inserting cryptographic checks on data items in signaling messages, has capabilities to self-detect and repair corruption, and identifies the nodes causing corruption.
{"title":"EndSec: An end-to-end message security protocol for mobile telecommunication networks","authors":"Kameswari Kotapati, Peng Liu, T. F. Porta","doi":"10.1109/WOWMOM.2008.4594919","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594919","url":null,"abstract":"A major security vulnerability in the mobile telecommunication network is that wireline signaling messages are cleartext. The latest protocol for wireline signaling message security is mobile application part security (MAPSec), which protects MAP (a signaling message protocol) messages on the link between nodes. MAPSec is a limited solution because it still leaves MAP signaling messages unsecured in intermediate nodes, and also leaves other wireline signaling message protocols unsecured both on the link and in intermediate nodes. Hence, there is a need for a more comprehensive wireline security scheme to protect all types of wireline signaling messages end-to-end i.e., both on the link and in intermediate nodes. As a solution, we propose EndSec, an end-to-end wireline signaling message security protocol for all types of signaling messages. EndSec works by inserting cryptographic checks on data items in signaling messages, has capabilities to self-detect and repair corruption, and identifies the nodes causing corruption.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122338329","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594841
Zhibin Wu, D. Raychaudhuri
This paper presents an integrated routing and MAC scheduling protocol (IRMA) for multihop wireless mesh networks. The IRMA approach is motivated by the fact that the overall performance achieved by conventional layered approaches (802.11 MAC combined with independent ad hoc routing protocols) is significantly lower than the underlying network capacity. We propose to integrate the routing and MAC into a single protocol layer and use joint optimization techniques to establish end-to-end path and TDMA schedules for flows across the network. This approach achieves non-conflicting allocation of channel resources based on global or local traffic flow specifications and the network graph. The proposed method not only establishes interference-free MAC link schedules, but also helps to find optimal routes which can route around congested areas of the network. Two specific IRMA algorithms are proposed and evaluated in this paper. The first method solves min-hop routing, then optimizes link scheduling based on routing results and real-time flow demands. The second approach attempts to optimize routing and scheduling decisions simultaneously, using available MAC bandwidth information to route around congested areas. Both centralized and distributed algorithms based on these methods are proposed and evaluated with detailed simulations. Results show significant 2-3x improvements in network throughput when compared with baseline 802.11-based mesh networks using independent routing protocols.
{"title":"Integrated routing and MAC scheduling for single-channel wireless mesh networks","authors":"Zhibin Wu, D. Raychaudhuri","doi":"10.1109/WOWMOM.2008.4594841","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594841","url":null,"abstract":"This paper presents an integrated routing and MAC scheduling protocol (IRMA) for multihop wireless mesh networks. The IRMA approach is motivated by the fact that the overall performance achieved by conventional layered approaches (802.11 MAC combined with independent ad hoc routing protocols) is significantly lower than the underlying network capacity. We propose to integrate the routing and MAC into a single protocol layer and use joint optimization techniques to establish end-to-end path and TDMA schedules for flows across the network. This approach achieves non-conflicting allocation of channel resources based on global or local traffic flow specifications and the network graph. The proposed method not only establishes interference-free MAC link schedules, but also helps to find optimal routes which can route around congested areas of the network. Two specific IRMA algorithms are proposed and evaluated in this paper. The first method solves min-hop routing, then optimizes link scheduling based on routing results and real-time flow demands. The second approach attempts to optimize routing and scheduling decisions simultaneously, using available MAC bandwidth information to route around congested areas. Both centralized and distributed algorithms based on these methods are proposed and evaluated with detailed simulations. Results show significant 2-3x improvements in network throughput when compared with baseline 802.11-based mesh networks using independent routing protocols.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121427656","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594879
A. Fillinger, Lukas L. Diduch, Imad Hamchi, M. Hoarau, S. Degré, V. Stanford
Modern multimedia applications use an increasing number of sensors including cameras, microphones and microphone arrays. These applications must acquire and process data from sensors in real-time, which is usually beyond the capabilities of single machines. We present our distributed sensor data transport middleware, the NIST data flow system II, which offers network transparent services for data acquisition and processing across a local network of computers. An application is thus represented as a data flow graph, with streaming media flowing between the different computational components. This is highlighted by presenting a multimedia application tracking persons using a sensor fusion of audio and video streams.
{"title":"The NIST Data Flow System II: A standardized interface for distributed multimedia applications","authors":"A. Fillinger, Lukas L. Diduch, Imad Hamchi, M. Hoarau, S. Degré, V. Stanford","doi":"10.1109/WOWMOM.2008.4594879","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594879","url":null,"abstract":"Modern multimedia applications use an increasing number of sensors including cameras, microphones and microphone arrays. These applications must acquire and process data from sensors in real-time, which is usually beyond the capabilities of single machines. We present our distributed sensor data transport middleware, the NIST data flow system II, which offers network transparent services for data acquisition and processing across a local network of computers. An application is thus represented as a data flow graph, with streaming media flowing between the different computational components. This is highlighted by presenting a multimedia application tracking persons using a sensor fusion of audio and video streams.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131877666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594839
Thomas King, T. Haenselmann, W. Effelsberg
Fingerprinting is a popular technology for 802.11-based positioning systems: Radio characteristics from different access points are measured at various positions and stored in a database. The database is copied to all mobile devices, and in case that a position estimate is needed, the device compares its currently measured radio characteristics with all the database entries. In this paper, we present two on-demand fingerprint selection algorithms to avoid the cumbersome and time-consuming approach of manually copying all fingerprints. Our algorithms only request those fingerprints from the database that are currently required to compute a position. The two algorithms differ in the way they shape the region for which fingerprints are requested. On-demand selection also allows storage-restricted mobile devices to utilize the positioning system. We carefully evaluate our algorithms in a real-world experiment. The results show that our algorithms do not harm the position accuracy of the positioning system. In addition, we analyze the space requirements of our algorithms and show that the typical constraints of mobile devices are met.
{"title":"On-demand fingerprint selection for 802.11-based positioning systems","authors":"Thomas King, T. Haenselmann, W. Effelsberg","doi":"10.1109/WOWMOM.2008.4594839","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594839","url":null,"abstract":"Fingerprinting is a popular technology for 802.11-based positioning systems: Radio characteristics from different access points are measured at various positions and stored in a database. The database is copied to all mobile devices, and in case that a position estimate is needed, the device compares its currently measured radio characteristics with all the database entries. In this paper, we present two on-demand fingerprint selection algorithms to avoid the cumbersome and time-consuming approach of manually copying all fingerprints. Our algorithms only request those fingerprints from the database that are currently required to compute a position. The two algorithms differ in the way they shape the region for which fingerprints are requested. On-demand selection also allows storage-restricted mobile devices to utilize the positioning system. We carefully evaluate our algorithms in a real-world experiment. The results show that our algorithms do not harm the position accuracy of the positioning system. In addition, we analyze the space requirements of our algorithms and show that the typical constraints of mobile devices are met.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130715158","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594854
T. Nilsson, Jahanzeb Farooq
We present a novel MAC scheme for solving the QoS parameter adjustment problem in IEEE 802.11e EDCA. The default values of the QoS parameters in EDCA, contention window (CW), arbitration Interframe Space (IFS) etc only yield good performance for few scenarios. We first propose a simple adaptation scheme, called a-EDCA, where the access point adapts the CWs based on the network conditions. The main contribution of this work is the second approach, called i-EDCA, where we make modifications to the backoff phase of EDCA and introduce a random IFS scheme. Simulation results show that both approaches result in stable capacity ratios between priority classes and very high channel utilization, compared to EDCA, when the number of stations is increased. Moreover, i-EDCA yields close to optimal channel utilization for a large number of scenarios without any need of adapting the parameters. In i-EDCA, the capacity for each class is directly proportional to its CW. Results also show that i-EDCA has improved fairness and prevents low priority classes to be starved under higher loads, a problem found in EDCA.
{"title":"A Novel MAC scheme for solving the QoS parameter adjustment problem in IEEE 802.11e EDCA","authors":"T. Nilsson, Jahanzeb Farooq","doi":"10.1109/WOWMOM.2008.4594854","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594854","url":null,"abstract":"We present a novel MAC scheme for solving the QoS parameter adjustment problem in IEEE 802.11e EDCA. The default values of the QoS parameters in EDCA, contention window (CW), arbitration Interframe Space (IFS) etc only yield good performance for few scenarios. We first propose a simple adaptation scheme, called a-EDCA, where the access point adapts the CWs based on the network conditions. The main contribution of this work is the second approach, called i-EDCA, where we make modifications to the backoff phase of EDCA and introduce a random IFS scheme. Simulation results show that both approaches result in stable capacity ratios between priority classes and very high channel utilization, compared to EDCA, when the number of stations is increased. Moreover, i-EDCA yields close to optimal channel utilization for a large number of scenarios without any need of adapting the parameters. In i-EDCA, the capacity for each class is directly proportional to its CW. Results also show that i-EDCA has improved fairness and prevents low priority classes to be starved under higher loads, a problem found in EDCA.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114367833","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594851
S. Schnaufer, W. Effelsberg
In vehicular ad-hoc networks unicast packet forwarding can be separated into the one-dimensional highway case and the two-dimensional city case; in this paper, we deal with the latter. We survey existing position-based routing protocols and present GRANT, our own approach of greedy routing with an abstract neighbor table. We simulate each protocol in our city scenario of Karlsruhe, consisting of streets with a length of 66 km, 390 junctions, and radio obstacles derived from high-definition satellite images. We also simulate the protocols with a FACE-2- and a distance vector-based recovery strategy. As a result we propose GRANT as a routing protocol for unicast city scenarios.
{"title":"Position-based unicast routing for city scenarios","authors":"S. Schnaufer, W. Effelsberg","doi":"10.1109/WOWMOM.2008.4594851","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594851","url":null,"abstract":"In vehicular ad-hoc networks unicast packet forwarding can be separated into the one-dimensional highway case and the two-dimensional city case; in this paper, we deal with the latter. We survey existing position-based routing protocols and present GRANT, our own approach of greedy routing with an abstract neighbor table. We simulate each protocol in our city scenario of Karlsruhe, consisting of streets with a length of 66 km, 390 junctions, and radio obstacles derived from high-definition satellite images. We also simulate the protocols with a FACE-2- and a distance vector-based recovery strategy. As a result we propose GRANT as a routing protocol for unicast city scenarios.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122882343","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594827
P. Pääkkönen, P. Salmela, Ramón Agüero, J. Choque
Ambient Networks concentrates on the co-operation of heterogeneous networks over multiple domains and accesses. One of the main goals of the project is the integration of developed concepts for validation purposes. This paper presents a performance analysis on the integration of mobility triggering and Host Identity Protocol (HIP) based mobility on the Ambient Networks/FreeBSD platform. The scalability of triggering and handover latency has been focused on in terms of different mobility triggers and access technologies. The results enable identification of the largest delay components, which have been analyzed.
{"title":"Performance analysis of HIP-based mobility and triggering","authors":"P. Pääkkönen, P. Salmela, Ramón Agüero, J. Choque","doi":"10.1109/WOWMOM.2008.4594827","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594827","url":null,"abstract":"Ambient Networks concentrates on the co-operation of heterogeneous networks over multiple domains and accesses. One of the main goals of the project is the integration of developed concepts for validation purposes. This paper presents a performance analysis on the integration of mobility triggering and Host Identity Protocol (HIP) based mobility on the Ambient Networks/FreeBSD platform. The scalability of triggering and handover latency has been focused on in terms of different mobility triggers and access technologies. The results enable identification of the largest delay components, which have been analyzed.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128973743","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594888
D. Henkel, T. Brown
Communication in delay tolerant networks can be facilitated by the use of dedicated mobile ldquoferriesrdquo which physically transport data packets between network nodes. The goal is for the ferry to autonomously find routes which minimize the average packet delay in the network. We prove that paths which visit all nodes in a round-trip fashion, i.e., solutions to the traveling salesman problem, do not yield the lowest average packet delay. We propose two novel ferry path planning algorithms based on stochastic modeling and machine learning. We model the path planning task as a Markov decision process with the ferry acting as an independent agent. We apply reinforcement learning to enable the ferry to make optimal decisions. Simulation experiments show the resulting routes have lower average packet delay than solutions known to date.
{"title":"Towards autonomous data ferry route design through reinforcement learning","authors":"D. Henkel, T. Brown","doi":"10.1109/WOWMOM.2008.4594888","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594888","url":null,"abstract":"Communication in delay tolerant networks can be facilitated by the use of dedicated mobile ldquoferriesrdquo which physically transport data packets between network nodes. The goal is for the ferry to autonomously find routes which minimize the average packet delay in the network. We prove that paths which visit all nodes in a round-trip fashion, i.e., solutions to the traveling salesman problem, do not yield the lowest average packet delay. We propose two novel ferry path planning algorithms based on stochastic modeling and machine learning. We model the path planning task as a Markov decision process with the ferry acting as an independent agent. We apply reinforcement learning to enable the ferry to make optimal decisions. Simulation experiments show the resulting routes have lower average packet delay than solutions known to date.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131984006","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594859
M. Amoretti, Maria Chiara Laghi, Alberto Carubelli, F. Zanichelli, G. Conte
Mobile computing environments may be very critical for traditional QoS management techniques often relying on centralized resource coordinating services, due to the unavoidable high unstability of network and service layers. On the other hand, a peer-to-peer approach for continuous service provisioning to mobile users may maintain locally an updated list of service providers, and allow clients to switch sources depending on the experienced service quality. In this paper we present a QoS-aware reputation management system for service-oriented P2P networks which aims at improving the quality of service provider selection within purely decentralized mobile environments. The selection process is based on the evaluations provided by other service consumers in terms of a set of application specific QoS parameters.
{"title":"Reputation-based service selection in a peer-to-peer mobile environment","authors":"M. Amoretti, Maria Chiara Laghi, Alberto Carubelli, F. Zanichelli, G. Conte","doi":"10.1109/WOWMOM.2008.4594859","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594859","url":null,"abstract":"Mobile computing environments may be very critical for traditional QoS management techniques often relying on centralized resource coordinating services, due to the unavoidable high unstability of network and service layers. On the other hand, a peer-to-peer approach for continuous service provisioning to mobile users may maintain locally an updated list of service providers, and allow clients to switch sources depending on the experienced service quality. In this paper we present a QoS-aware reputation management system for service-oriented P2P networks which aims at improving the quality of service provider selection within purely decentralized mobile environments. The selection process is based on the evaluations provided by other service consumers in terms of a set of application specific QoS parameters.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128439636","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：