Minimum cost blocking problem in multi path wireless routing protocols

Aug 19, 2013Download as docx, pdf0 likes139 views

This document presents a class of Minimum Cost Blocking problems in Wireless Mesh Networks that use multi-path wireless routing protocols. It establishes that multi-path routing protocols are superior to conventional single-path protocols in resisting blocking, node isolation, and network partitioning attacks. It analyzes two scenarios - one with low network node mobility and one with high mobility - and proves the problems are NP-hard and #P-hard, respectively, for adversaries. It also provides approximation algorithms and simulations showing multi-path protocols are exponentially harder for adversaries to optimally attack.

Minimum Cost Blocking Problem in Multi-path Wireless
Routing Protocols
ABSTRACT:
We present a class of Minimum Cost Blocking (MCB) problems in Wireless Mesh
Networks (WMNs) with multi-path wireless routing protocols. We establish the
provable superiority of multi-path routing protocols over conventional protocols
against blocking, node-isolation and network-partitioning type attacks. In our
attack model, an adversary is considered successful if he is able to capture/isolate a
subset of nodes such that no more than a certain amount of traffic from source
nodes reaches the gateways. Two scenarios, viz. (a) low mobility for network
nodes, and (b) high degree of node mobility, are evaluated. Scenario (a) is proven
to be NP-hard and scenario (b) is proven to be #P-hard for the adversary to realize
the goal. Further, several approximation algorithms are presented which show that
even in the best case scenario it is at least exponentially hard for the adversary to
optimally succeed in such blocking-type attacks. These results are verified through
simulations which demonstrate the robustness of multi-path routing protocols
against such attacks. To the best of our knowledge, this is the first work that
theoretically evaluates the attack-resiliency and performance of multi-path
protocols with network node mobility.

EXISTING SYSTEM:
MULTI-PATH traffic scheduling and routing protocols in wired networks are
deemed superior over conventional single path protocols in terms of both enhanced
throughput and robustness. In wireless networks, even though the dynamic nature
of networks and resource constraints entail additional overhead in maintaining and
reconfiguring multiple routes, which could offset the benefits seen in wired
networks, research has proven that multi-path routing provides better Quality of
Service (QoS) guarantees.
DISADVANTAGES OF EXISTING SYSTEM:
Blocking, node-isolation and network-partitioning type attacks are easy to launch
and are effective in the wireless networks domain due to channel constraints and
dynamic network topologies
PROPOSED SYSTEM:
• The identification of the Minimum Cost Blocking (MCB) problem. Though we
consider MCB in the WMN setting, the problem is applicable to other wireless or
wired networks.
• Evaluating the hardness of the problem. MCB is NPhard for the low/no node
mobility scenario and #P-hard for networks with patterned node mobility. The

reduction for no-mobility is derived from the basic Set Cover problem and for
mobility scenario, from the 3SAT and #SAT problems.
• Development of approximation algorithms for the best case scenario and the
performance testing of these algorithms in different settings through random
graphs based experiments.
• Laying direction for future research to evaluate the performance of multi-path
protocols against sophisticated attacks in mobile wireless networks.
ADVANTAGES OF PROPOSED SYSTEM:
Our proposed system demonstrates the superiority of multi-path protocols over
traditional single-path protocols in terms of resiliency against blocking and node
isolation-type attacks, especially in the wireless networks domain. Multi-path
protocols for WMNs make it extremely hard for an adversary to efficiently launch
such attacks.
SYSTEM CONFIGURATION:-
HARDWARE CONFIGURATION:-
 Processor - Pentium –IV
 Speed - 1.1 Ghz
 RAM - 256 MB(min)
 Hard Disk - 20 GB

 Key Board - Standard Windows Keyboard
 Mouse - Two or Three Button Mouse
 Monitor - SVGA
SOFTWARE CONFIGURATION:-
 Operating System : Windows XP
 Programming Language : JAVA
 Java Version : JDK 1.6 & above.
REFERENCE:
Qi Duan, Mohit Virendra, Shambhu Upadhyaya, Senior Member, IEEE, Ameya
Sanzgiri, “Minimum Cost Blocking Problem in Multi-path Wireless Routing
Protocols”, IEEE TRANSACTIONS ON COMPUTERS, VOL. X, NO. X,
FEBRUARY 2013.

This document discusses selective jamming attacks in wireless networks and methods to prevent them. It begins by introducing the open nature of wireless networks leaves them vulnerable to jamming attacks. It then discusses different types of jamming attacks and notes that selective jamming, which targets specific important packets, is more effective than continuous jamming. The document proposes using cryptographic techniques like commitment schemes and puzzles combined with physical layer parameters to prevent real-time packet classification and selective jamming. It reviews related work on jamming attacks and defenses. Finally, it outlines the problem statement, system model, and the contribution of using symmetric encryption and resisting brute force block encryption attacks to reduce jamming through packet hiding.

Packet hiding methods for preventing selectiveveenasraj

This document discusses selective jamming attacks in wireless networks. It describes how an adversary with internal knowledge of network protocols and secrets can classify packets in real-time based on the first few symbols and then selectively jam important packets. This allows the adversary to launch effective denial-of-service attacks with low effort. The document then proposes and analyzes three schemes to prevent real-time packet classification and mitigate these selective jamming attacks while minimizing overhead.

Jamming Anticipation and Convolution through Immaculate Hiding Process of Pac...IOSR Journals

This document discusses selective jamming attacks on wireless networks. It defines the problem of real-time packet classification by jamming nodes and developing mechanisms to prevent this. It presents the network and adversary models considered. Optimization problems are formulated to represent the best strategies for the attacker and network when they have imperfect knowledge of each other. Detection of jamming attacks is also addressed through monitoring packet delivery ratios across nodes.

Antijam ipsn09freddy_1989

This document discusses an anti-jamming protocol called WisperNet for embedded wireless networks. WisperNet aims to eliminate spatio-temporal patterns in communication while maintaining coordinated and collision-free operation. It does this through coordinated temporal randomization of slot schedules and sizes between each node and its neighbors, preventing jammers from predicting channel activity. WisperNet also employs adaptive routing to select paths with the highest packet delivery ratios to avoid random jammers co-located near nodes. The protocol tightly synchronizes legitimate nodes while ensuring no communication patterns are exposed to external observers like jammers.

Ijcatr04051010Editor IJCATR

Wireless mesh networks (WMNs) assure to expand high-speed wireless connectivity beyond what is possible with the current Wi-Fi based infrastructure. Due to their unique architectural features leave them particularly vulnerable to security threats. In this paper, various forms of sophisticated attacks launched from adversaries with internal access to the WMN are described. We also identify possible detection and mitigation mechanisms

ADVANCED TECHNIQUES FOR PREVENTING SELECTIVE JAMMING ATTACKS USING PACKET-HID...ijiert bestjournal

The wireless networks are more vulnerable to jammin g. This jamming can be used as a launch pad for mounting Denial-Of-Service attack on wireless networks. Typically,jamming has been address under an external threat model. Ho wever,adversaries with internal knowledge of protocol specification and network sec rets can launch low-effort jamming attacks that are difficult to detect and counter. I n this work we address the problem of jamming attacks as internal threat model,where the attacker is aware of all network secrets and details of implementation. These types of attac kers are difficult to identify. In this work we address the problem of selective jamming attacks . In these attacks the attacker is active for only short period of time,selectively targetin g the messages. The selective jamming attacks can be launched by performing real-time pac ket classification at the physical layer. To mitigate these attacks,we illustrate different sch emes that prevent real-time packet classification by combining cryptographic primitive s with physical-layer attributes.

JPN1403 Autonomous Mobile Mesh Networkschennaijp

International Journal of Engineering and Science Invention (IJESI) inventionjournals

This document summarizes a research paper that proposes a scheme to protect the location privacy of source nodes in wireless sensor networks against hotspot-locating attacks. The scheme creates an irregularly shaped "cloud" of fake traffic around the real source node to camouflage its location. Cryptographic techniques are used to change packet appearances at each hop. This prevents packet correlation and makes the source node indistinguishable. Simulations show the scheme provides stronger privacy than routing-based schemes while requiring less energy than global-adversary schemes. The proposed neighbor discovery distance algorithm aims to find the minimum traffic path to efficiently transmit data without loss.

wireless sensor networkA. Shamel

Random walk based approach to detect clone attacks in wireless sensor networksShakas Technologies

This document proposes two new non-deterministic and fully distributed (NDFD) protocols called RAndom WaLk (RAWL) and Table-assisted RAndom WaLk (TRAWL) to detect clone attacks in wireless sensor networks. Previous solutions have drawbacks such as requiring central control or being vulnerable to compromising critical witness nodes. The proposed protocols select witnesses through random walks to distribute this process and prevent adversaries from easily identifying critical nodes. They fulfill security requirements with moderate overhead compared to existing NDFD approaches. Simulation results show the protocols outperform others in witness selection and that TRAWL has the lowest memory overhead. While communication overhead is higher, it is acceptable given security improvements over alternatives.

Cm32996999IJMER

This document summarizes a research paper on multicasting in wireless ad hoc networks. It discusses using an On-Demand Multicast Routing Protocol (ODMRP) and a fully localized scheme. ODMRP builds a forwarding mesh topology to avoid issues with multicasting trees in mobile networks. The localized scheme integrates layered multicast and routing-based congestion avoidance to control multicast rates and maintain fairness with unicast flows. It allows each node to monitor links and cut aggregate multicast rates when links become congested, while still delivering multiple quality layers to receivers. Analysis and simulations showed the localized scheme enables multicasting and provides fair bandwidth sharing between multicast and unicast flows.

Distributed throughput maximization in wireless networks using the stability ...Nexgen Technology

The document proposes a game-theoretical framework to design distributed algorithms that control transmission range in wireless networks to maximize throughput. It defines the stability region as the set of input rates under which queues are stable. The goal is to adapt the stability region to end-to-end flows by having flows control node transmission ranges. Based on this, a new algorithm called WiMAX-Mesh-NTC is developed for IEEE 802.16 networks that maximizes throughput while guaranteeing stability. Simulation results show it achieves throughput levels that are at least 90% of optimal in 72% of scenarios.

MLDW- A MultiLayered Detection mechanism for Wormhole attack in AODV based MANETijsptm

Wormhole attack is one of the serious routing attacks amongst all the network layer attacks launched on MANET. Wormhole attack is launched by creation of tunnels and it leads to total disruption of the routing paths on MANET. In this paper, MLDW- a multilayered Intrusion Detection Prevention System approach is proposed to detect and isolate wormhole attack on MANET. The routing protocol used is Adhoc On Demand Distance Vector (AODV). MLDW has a layered framework consisting of link latency estimator, intermediate neighbor node discovery mechanism, packet drop calculator, node energy degrade estimator followed by isolation technique. MLDW effectiveness is evaluated using ns2 network simulator.

autonomous mobile mesh networksswathi78

M phil-computer-science-network-security-projectsVijay Karan

International Journal of Engineering and Science Invention (IJESI)inventionjournals

This document summarizes a research paper that proposes a distributed localization scheme to detect jamming attacks in mobile ad hoc networks (MANETs). The scheme involves all nodes operating in promiscuous mode to monitor neighboring nodes for abnormal behavior, using metrics like packet delivery ratio and signal strength. If abnormal behavior is detected, an alert is broadcasted without relying on a centralized authority. This distributed approach is evaluated through simulations and found to more efficiently detect jamming attacks compared to a clustered network architecture with designated cluster heads.

I030102056063theijes

The document summarizes a research paper on avoiding jamming attacks over wireless networks through packet hiding. It discusses how selective jamming works, impacting network performance. It proposes three schemes combining cryptographic mechanisms like puzzle schemes, commitment schemes, and all-or-nothing transformations with physical layer parameters to mitigate selective jamming. The main goal is to transform a selective jammer into a random one and enable safe transmission even with a jammer present.

Iaetsd security and privacy enhancement using jammer inIaetsd Iaetsd

This document proposes a novel transmission scheme using a cooperative jammer (CJ) to improve security in downlink cellular networks. The scheme aims to securely transmit a private message from a base station to one of K mobile users, while keeping it private from the K-1 other users acting as potential internal eavesdroppers. A CJ is used to generate artificial interference and increase ambiguity at all users, including eavesdroppers, by beamforming. The optimal joint transmission scheme for the base station and CJ is derived to maximize the intended user's secrecy rate. Numerical results show improved performance over not using a CJ. The system model and assumptions and modeling of potential internal eavesdroppers, the CJ, and

Protocol manetKunal Prajapati

Ramacliangxiao0315

This document proposes a game-theoretic model called random access game to model contention control in wireless networks. It defines a random access game with players being wireless nodes, strategies being channel access probabilities, and payoffs accounting for utility from access and cost from collisions. It shows Nash equilibria of such games can achieve system-wide objectives like fairness through specification of per-node utility functions. A novel medium access control method is proposed that estimates conditional collision probability and adjusts access probabilities accordingly to achieve Nash equilibria, enabling optimization of throughput, fairness, and service differentiation in a distributed manner.

JPD1428 Multicast Capacity in MANET with Infrastructure Supportchennaijp

NETWORK CODING AS A PERFORMANCE BOOSTER FORCONCURRENT MULTI-PATH TRANSFER OF ...Nexgen Technology

GET IEEE BIG DATA,JAVA ,DOTNET,ANDROID ,NS2,MATLAB,EMBEDED AT LOW COST WITH BEST QUALITY PLEASE CONTACT BELOW NUMBER FOR MORE INFORMATION PLEASE FIND THE BELOW DETAILS: Nexgen Technology No :66,4th cross,Venkata nagar, Near SBI ATM, Puducherry. Email Id: praveen@nexgenproject.com Mobile: 9791938249 Telephone: 0413-2211159 www.nexgenproject.com NEXGEN TECHNOLOGY provides bulk ieee projects to its regular clients and satisfies all their requirements on time, Also it provides 24/7 supports to all its clients in delivering the resources which is including source code delivery ,Documents delivery, Algorithms delivery etc...,NEXGEN TECHNOLOGY is also having around 100 clients throughout India and across the World.

Java capacity of hybrid wireless mesh networks with random a psEcway Technologies

The document discusses the capacity of a hybrid wireless mesh network architecture that utilizes connections to randomly placed access points (APs) of wireless local area networks (WLANs). It presents that theoretical analysis shows the asymptotic capacity of such a three-tier hybrid network is affected by the number of mesh router cells connected to APs, the ratio of access link bandwidth to backbone link bandwidth, and traffic balance among mesh routers with AP access. The network architecture and results suggest hybrid wireless mesh networks can significantly improve capacity by taking advantage of widely deployed WLANs.

An overview of contemporary security problems in wireless mesh networksiosrjce

Wireless mesh network (WMN) is a new wireless networking concept. Unlike traditional wireless networks, Wireless Mesh Networks do not rely on any fixed communications. As an alternative, hosts rely on each other to keep the network connected. Wireless Internet service providers are choosing WMNs to offer Internet connectivity, as it allows a fast, simple and inexpensive network use. One major challenge in design of these networks is their vulnerability to security attacks. In this paper, principal contemporary security issues for wireless mesh networks have been investigated. Identification of the threats a Wireless mesh network faces and the security goals to be realized are described. The new challenges and opportunities posed by this new networking environment are dealt with and explored approaches to secure its communication.

20IMPULSE_TECHNOLOGY

The document proposes a generalized two-hop relay algorithm called 2HR- that allows for more flexible control of packet delivery delays in mobile ad hoc networks. The 2HR- algorithm allows each packet to be delivered to up to k distinct relay nodes. The destination can accept fresh packets that are part of the group it is currently requesting. This covers existing two-hop relay protocols as special cases. The document develops a Markov chain model to analyze how the mean and variance of delay varies with parameters like contention and traffic. Both simulation and theoretical results show the framework can efficiently analyze delay and the 2HR- algorithm provides flexible control over the mean and variance of delay.

Local directional number pattern for face analysis face and expression recogn...JPINFOTECH JAYAPRAKASH

This paper proposes a new local feature descriptor called local directional number pattern (LDN) to encode structural information from textures for face recognition and expression analysis. LDN analyzes directional information in local neighborhoods using a compass mask to determine prominent positive and negative directions, allowing it to distinguish textures with similar patterns but different intensity transitions. It uses gradient information across the entire neighborhood, conveying more information compactly compared to other descriptors. Experiments show LDN performs consistently under variations in illumination, noise, expression, and time.

A proxy based approach to continuous location-based spatial queries in mobile...JPINFOTECH JAYAPRAKASH

The document proposes a proxy-based approach for continuous location-based spatial queries in mobile environments. The proxy builds estimated valid regions (EVRs) for mobile clients by exploiting spatial and temporal locality of spatial queries. For nearest neighbor queries, algorithms are developed to accelerate EVR growth. For window queries, EVRs are represented as estimated window vectors to achieve larger regions. The proxy uses separate index structures for different query types and algorithms allow results to be shared between query types. Experimental results show the proposed approach outperforms existing proxy-based approaches.

Ip geolocation mapping for moderately connected internet regionsJPINFOTECH JAYAPRAKASH

This document proposes a new IP geolocation mapping scheme called GeoGet for moderately connected internet regions where the traditional assumption of strong correlation between network delay and geographic distance does not hold. GeoGet maps clients to the geolocation of the landmark with the shortest delay measurement. It uses widely distributed web servers as landmarks and JavaScript probes from clients to measure delays without installing software. An evaluation shows GeoGet improves geolocation accuracy over existing schemes by mapping 35.4% of clients to the correct city compared to 13.4% and 15.1% for other schemes.

Detection and localization of multiple spoofing attackers in wireless networksJPINFOTECH JAYAPRAKASH

This document proposes methods for detecting and localizing multiple spoofing attackers in wireless networks. It discusses using received signal strength (RSS) spatial correlation, which is a physical property associated with each node's location, to detect spoofing attacks. It formulates determining the number of attackers as a multiclass detection problem and develops cluster-based mechanisms. When training data is available, it explores using support vector machines to improve accuracy. An integrated detection and localization system is developed that can localize multiple attackers with over 90% accuracy in experiments. Existing cryptographic approaches have overhead while the proposed RSS-based spatial correlation method does not require wireless device modification.

Warningbird a near real time detection system for suspicious urls in twitter ...JPINFOTECH JAYAPRAKASH

The document describes WARNINGBIRD, a system for detecting suspicious URLs in Twitter streams. It analyzes correlations between URL redirect chains extracted from tweets, since attackers often reuse the same URLs. WARNINGBIRD discovers frequently shared URLs to find correlated chains and determine suspiciousness. It was trained on tweets and accurately classifies URLs with low false positives and negatives.

More Related Content

What's hot (17)

wireless sensor networkA. Shamel

Random walk based approach to detect clone attacks in wireless sensor networksShakas Technologies

Cm32996999IJMER

Distributed throughput maximization in wireless networks using the stability ...Nexgen Technology

MLDW- A MultiLayered Detection mechanism for Wormhole attack in AODV based MANETijsptm

autonomous mobile mesh networksswathi78

M phil-computer-science-network-security-projectsVijay Karan

International Journal of Engineering and Science Invention (IJESI)inventionjournals

I030102056063theijes

Iaetsd security and privacy enhancement using jammer inIaetsd Iaetsd

Protocol manetKunal Prajapati

Ramacliangxiao0315

JPD1428 Multicast Capacity in MANET with Infrastructure Supportchennaijp

NETWORK CODING AS A PERFORMANCE BOOSTER FORCONCURRENT MULTI-PATH TRANSFER OF ...Nexgen Technology

Java capacity of hybrid wireless mesh networks with random a psEcway Technologies

An overview of contemporary security problems in wireless mesh networksiosrjce

20IMPULSE_TECHNOLOGY

wireless sensor networkA. Shamel

Random walk based approach to detect clone attacks in wireless sensor networksShakas Technologies

Cm32996999IJMER

Distributed throughput maximization in wireless networks using the stability ...Nexgen Technology

MLDW- A MultiLayered Detection mechanism for Wormhole attack in AODV based MANETijsptm

autonomous mobile mesh networksswathi78

M phil-computer-science-network-security-projectsVijay Karan

International Journal of Engineering and Science Invention (IJESI)inventionjournals

I030102056063theijes

Iaetsd security and privacy enhancement using jammer inIaetsd Iaetsd

Protocol manetKunal Prajapati

Ramacliangxiao0315

JPD1428 Multicast Capacity in MANET with Infrastructure Supportchennaijp

NETWORK CODING AS A PERFORMANCE BOOSTER FORCONCURRENT MULTI-PATH TRANSFER OF ...Nexgen Technology

Java capacity of hybrid wireless mesh networks with random a psEcway Technologies

An overview of contemporary security problems in wireless mesh networksiosrjce

20IMPULSE_TECHNOLOGY

Viewers also liked (19)

Local directional number pattern for face analysis face and expression recogn...JPINFOTECH JAYAPRAKASH

A proxy based approach to continuous location-based spatial queries in mobile...JPINFOTECH JAYAPRAKASH

Ip geolocation mapping for moderately connected internet regionsJPINFOTECH JAYAPRAKASH

Detection and localization of multiple spoofing attackers in wireless networksJPINFOTECH JAYAPRAKASH

Warningbird a near real time detection system for suspicious urls in twitter ...JPINFOTECH JAYAPRAKASH

Content sharing over smartphone based delay-tolerant networksJPINFOTECH JAYAPRAKASH

The document proposes a content sharing scheme called discover-predict-deliver (DPD) for smartphone-based delay tolerant networks (DTNs). DPD employs a hidden Markov model and Viterbi algorithm to predict users' future locations based on mobility learning of locations indoors and outdoors. Evaluation using real human movement traces shows DPD can correctly discover and deliver 87% of contents within 2 hours when only 30% of nodes have the content. The proposed scheme was implemented on smartphones, with approximately 2% CPU overhead and reducing battery life by up to 15%.

Enabling dynamic data and indirect mutual trust for cloud computing storage s...JPINFOTECH JAYAPRAKASH

This document proposes a cloud storage scheme that allows data owners to outsource sensitive data to cloud service providers while maintaining control over the data and establishing trust between the two parties. The proposed scheme enables dynamic operations on outsourced data like modification, insertion, deletion and appending. It also ensures authorized users always receive the latest version of data and identifies misbehaving parties to address trust issues. The scheme supports access control management and its advantages include dynamic block-level operations, newness of data, indirect mutual trust and access control enforcement.

Security threats to mobile multimedia applications camera based attacks on mo...JPINFOTECH JAYAPRAKASH

The Places of Our Lives: Visiting Patterns and Automatic Labeling from Longitudinal Smartphone Data ABSTRACT: The location tracking functionality of modern mobile devices provides unprecedented opportunity to the understanding of individual mobility in daily life. Instead of studying raw geographic coordinates, we are interested in understanding human mobility patterns based on sequences of place visits which encode, at a coarse resolution, most daily activities. This paper presents a study on place characterization in people’s everyday life based on data recorded continuously by smartphones. First, we study human mobility from sequences of place visits, including visiting patterns on different place categories. Second, we address the problem of automatic place labeling from smartphone data without using any geo-location information. Our study on a large-scale data collected from 114 smartphone users over 18 months confirm many intuitions, and also reveals findings regarding both regularly and novelty trends in visiting patterns. Considering the problem of place labeling with 10 place categories, we show that frequently visited places can be recognized reliably (over 80 percent) while it is much more challenging to recognize infrequent places.

A log based approach to make digital forensics easier on cloud computingJPINFOTECH JAYAPRAKASH

The document proposes a log-based approach to make digital forensics easier on cloud computing. Existing cloud computing models like IaaS, PaaS, and SaaS are not friendly to digital forensics because users do not control the hardware. The proposed approach uses log models to quickly gather forensic information from the cloud. This reduces the complexity of forensic investigations on the cloud compared to traditional approaches. The logs can help with non-repudiation of user behaviors on the cloud.

Enforcing secure and privacy preserving information brokering in distributed ...JPINFOTECH JAYAPRAKASH

This document proposes a system called Privacy Preserving Information Brokering (PPIB) to enforce secure and privacy-preserving information brokering in distributed information sharing. Existing information brokering systems only adopt server-side access control and do not protect privacy of data location and consumers. PPIB uses brokers and coordinators, with coordinators enforcing access control and routing queries using query brokering automata. It proposes automaton segmentation and query segment encryption to securely distribute routing responsibilities among coordinators while preventing privacy inferences. This is the first work to formally define privacy attacks like attribute-correlation and propose countermeasures without overhead.

On the node clone detection in wireless sensor networksJPINFOTECH JAYAPRAKASH

The document proposes two novel node clone detection protocols for wireless sensor networks. The first protocol is based on a distributed hash table (DHT) that constructs a decentralized caching and checking system to effectively detect cloned nodes. It provides high security and efficient storage consumption. The second protocol, called randomly directed exploration, provides highly efficient communication performance for dense networks through probabilistic directed forwarding and border determination. It achieves adequate detection probability while consuming minimal memory. Both protocols address weaknesses in existing approaches and improve security, storage, communication, and detection performance for wireless sensor networks.

Review of behavior malware analysis for androidJPINFOTECH JAYAPRAKASH

This document summarizes a review of behavior-based malware analysis for Android. It discusses existing stochastic epidemic models for malware detection that are complex. The proposed system abstracts program behaviors and compares them to reference malware behaviors to detect suspicious activities. It analyzes apps, represents them as trace languages abstracted according to behavior patterns, and detects malware by comparing to a malware database. The system gets installed apps, running tasks, extracts permission information, and detects malware to help users identify potentially malicious apps.

Accuracy-Constrained Privacy-Preserving Access Control Mechanism for Relation...JPINFOTECH JAYAPRAKASH

Accuracy-Constrained Privacy-Preserving Access Control Mechanism for Relational Data To get this project in ONLINE or through TRAINING Sessions, Contact:JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83. Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry -9. Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690 , Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org Blog: www.jpinfotech.blogspot.com

Incentive compatible privacy preserving data analysisJPINFOTECH JAYAPRAKASH

This document discusses incentive compatible privacy-preserving data analysis. It proposes techniques that would motivate participating parties in data analysis tasks to provide truthful private inputs. Key theorems are developed to analyze what types of distributed data analysis functionalities could be implemented in a way that parties are incentivized to provide their true private data, such as certain data analysis tasks being in the best interest of parties to tell the truth. The number of dishonest parties is assumed to be at most one less than the total number of parties engaged in the analysis.

Bahg back bone-assisted hop greedy routing for vanet’s city environmentsJPINFOTECH JAYAPRAKASH

The document proposes a Back-Bone-Assisted Hop Greedy (BAHG) routing protocol for vehicular ad hoc networks (VANETs) in city environments. Existing geographic routing protocols for VANETs have issues with frequent disconnections in sparse areas and higher hop counts. BAHG introduces "back-bone nodes" that track node movement and provide connectivity information to efficiently route packets with lower hop counts and delays. It evaluates zones in a city and chooses boundary intersections as back-bone nodes to disseminate requests and replies. Simulation results show benefits in packet delivery and end-to-end delay compared to existing methods.

Understanding the external links of video sharing sites measurement and analysisJPINFOTECH JAYAPRAKASH

This paper analyzes the external links from video sharing sites like YouTube and Youku to quantify their impact on video popularity and distribution. The study finds that for videos uploaded over 8 months to Youku, around 15% of views came from external links. Certain genres like comedy attracted over 800 external links on average. External links also correlated with internal popularity - popular videos tended to have more external links. However, external links had a greater impact on the regionally focused Youku compared to the worldwide YouTube. This paper is the first to comprehensively measure and analyze the role of external links from video sites.

Multicast capacity in manet with infrastructure supportJPINFOTECH JAYAPRAKASH

This document summarizes a research paper on multicast capacity in mobile ad hoc networks with infrastructure support. The paper models a network with m static base stations and n mobile users placing multicast transmissions. It finds that multicast capacity falls into several regimes, each with reachable upper and lower bounds. The paper proposes jointly considering mobility, infrastructure, and multicast transmission to circumvent bottlenecks and improve capacity by utilizing both infrastructure routing and ad hoc routing.

Attribute based access to scalable media in cloud-assisted content sharing ne...JPINFOTECH JAYAPRAKASH

This paper proposes a novel Multi-message Ciphertext Policy Attribute-Based Encryption (MCP-ABE) technique to design an access control scheme for sharing scalable media based on user attributes. MCP-ABE allows encrypting multiple messages within a single ciphertext such that only users with attributes satisfying the access policy can decrypt it. This scheme offloads computation to cloud servers to support resource-limited mobile devices while maintaining data privacy. Existing solutions have issues like high complexity, inflexible policies, or only delivering one encrypted message per ciphertext. The proposed scheme addresses these through MCP-ABE's flexible attribute-based access and ability to encrypt multiple media units together efficiently.

Combining cryptographic primitives to prevent jamming attacks in wireless net...JPINFOTECH JAYAPRAKASH

The document discusses combining cryptographic techniques to prevent selective jamming attacks in wireless networks. It proposes three schemes: 1) a strong hiding commitment scheme that uses symmetric encryption, 2) a cryptographic puzzle hiding scheme that generates puzzles to recover encryption keys, and 3) an all-or-nothing transformation hiding scheme that partitions packets and transmits pseudo-messages to prevent classification. The schemes aim to transform selective jamming into random jamming and prevent real-time packet classification.