LBS include services to identify a location of a person or object, such as discovering the nearest banking cash machine (a.k.a. ATM) or the whereabouts of a friend or employee. LBS include parcel tracking and vehicle tracking services. LBS can include mobile commerce when taking the form of coupons or advertising directed at customers based […]
SERVICE SIMILARITY EXPLOITING IN LBS QUERIES FOR PRIVACY
Location-based services (LBS) are a general class of computer program-level services that use location data to control features. As such LBS is an information service and has a number of uses in social networking today as an entertainment service, which is accessible with mobile devices through the mobile network and which uses information on the […]
SYBIL-RESISTED TRUSTWORTHY SERVICE EVALUATION IN SERVICE-ORIENTED MOBILE SOCIAL NETWORKS
Trustworthy service evaluation (TSE) systems enable service providers or any third trusted authority to receive user feedback, known as service reviews or simply reviews, such as compliments and complaints about their services or products. In this paper, we propose a Trustworthy Service Evaluation (TSE) system to enable users to share service reviews in service-oriented mobile […]
GENERAL BEHAVIORAL CHARACTERIZATION OF PROXIMITY MALWARE DETECTION IN DELAY TOLERANT NETWORK
Proximity malware based on the DTN model brings unique security challenges that are not present in the infrastructure model. In the infrastructure model, the cellular carrier centrally monitors networks for abnormalities; moreover, the resource scarcity of individual nodes limits the rate of malware propagation. Proximity malware exploits the opportunistic contacts and distributed nature of DTNs […]
BEHAVIORAL MALWARE DETECTION SCHEME TOWARDS GENERAL BEHAVIORAL CHARACTERIZATION IN DELAY TOLERANT NETWORK
Malware, short for malicious software, is any software used to disrupt computer operation, gather sensitive information, or gain access to private computer systems. It can appear in the form of executable code, scripts, active content, and other software. ‘Malware’ is a general term used to refer to a variety of forms of hostile or intrusive […]
TAG POLLUTION ATTACK DETECTION USING TAG ENCODING SCHEME TO LINEAR NETWORK CODING
Linear network coding is a technique which can be used to improve a network’s throughput, efficiency and scalability, as well as resilience to attacks and eavesdropping. Linear network coding is a technique which can be used to improve a network’s throughput, efficiency and scalability, as well as resilience to attacks and eavesdropping. Network coding allows […]
ITRUST: AN EFFICIENT TRUST ESTABLISHMENT FOR PROBABILISTIC MISBEHAVIOR DETECTION IN DELAY TOLERANT NETWORK
In DTNs, a node could misbehave by dropping packets intentionally even when it has the capability to forward the data (e.g., sufficient buffers and meeting opportunities). Routing misbehavior can be caused by selfish (or rational) nodes that try to maximize their own benefits by enjoying the services provided by DTN while refusing to forward the […]
Efficient ITRUST for Probabilistic Misbehavior Detection in Delay-Tolerant Networks
Delay-tolerant networking (DTN) is an approach to computer network architecture that seeks to address the technical issues in heterogeneous networks that may lack continuous network connectivity. Examples of such networks are those operating in mobile or extreme terrestrial environments, or planned networks in space. Due to the unique network characteristics, designing a misbehavior detection scheme […]
KEPTE Key Pre-distribution Based Tag Encoding Scheme
This paper presents mathematical relations in linear network coding and proposes a key pre-distribution-based tag encoding (KEPTE) scheme to detect polluted data packets. This paper also quantitatively gave the security analysis of KEPTE and compared its performance and overhead with other schemes. The main advantages of KEPTE can be summarized as: 1) It is computationally […]
A Study on Online Service Migration from a Competitive Analysis Perspective
This paper introduces the service migration problem and formalize, it in the competitive analysis framework. For a single-server setting, we present a randomized online algorithm MIX and a deterministic online algorithm CEN that achieve a competitive ratio of in the worst case, i.e., without any knowledge of the future demand, where is the substrate size. […]
- « Previous Page
- 1
- …
- 3
- 4
- 5
- 6
- 7
- 8
- Next Page »