myacademicproject logo

Networking & Network Security

  • myacademicproject categorys

    An Overlay Architecture for Throughput Optimal Multipath Routing

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 14 Months ago

    Legacy networks are often designed to operate with simple single-path routing, like shortest-path, which is known to be throughput suboptimal. On the other hand, previously proposed throughput optimal policies (i.e., backpressure) require every device in the network to make dynamic routing decisions.

    Know More
  • myacademicproject categorys

    FaceChange Attaining Neighbor Node Anonymity in Mobile Opportunistic Social Networks With Fine-Grained Control

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 9 Months ago

    In mobile opportunistic social networks (MOSNs), mobile devices carried by people communicate with each other directly when they meet for proximity-based MOSN services (e.g., file sharing) without the support of infrastructures. In current methods, when nodes meet, they simply communicate with their real IDs, which leads to privacy and security concerns. Anonymizing real IDs among neighbor nodes solves such concerns. However, this prevents nodes from collecting real ID-based encountering information, which is needed to support MOSN services.

    Know More
  • myacademicproject categorys

    Network Capability in Localizing Node Failures via End-to-End Path Measurements

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 10 Months ago

    We investigate the capability of localizing node failures in communication networks from binary states (normal/failed) of end-to-end paths. Given a set of nodes of interest, uniquely localizing failures within this set requires that different observable path states associate with different node failure events. However, this condition is difficult to test on large networks due to the need to enumerate all possible node failures. Our first contribution is a set of sufficient/necessary conditions for identifying a bounded number of failures within an arbitrary node set that can be tested in polynomial time.

    Know More
  • myacademicproject categorys

    Routing in Accumulative Multi-Hop Networks

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 13 Months ago

    This paper investigates the problem of finding optimal paths in single-source single-destination accumulative multihop networks. We consider a single source that communicates to a single destination assisted by several relays through multiple hops. At each hop, only one node transmits, while all the other nodes receive the transmitted signal, and store it after processing/decoding and mixing it with the signals received in previous hops.

    Know More
  • myacademicproject categorys

    Uncertain Data Clustering in Distributed Peer-to-Peer Networks

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 13 Months ago

    Uncertain data clustering has been recognized as an essential task in the research of data mining. Many centralized clustering algorithms are extended by defining new distance or similarity measurements to tackle this issue. With the fast development of network applications, these centralized methods show their limitations in conducting data clustering in a large dynamic distributed peer-to-peer network due to the privacy and security concerns or the technical constraints brought by distributive environments

    Know More
  • myacademicproject categorys

    Socially-Driven Learning-Based Prefetching in Mobile Online Social Networks

    • B.Tech / M.Tech / M.Sc / Ph.D

    •  GANGADHAR.T

    • 12 Months ago

    Mobile online social networks (OSNs) are emerging as the popular mainstream platform for information and content sharing among people. In order to provide the quality of experience support for mobile OSN services, in this paper, we propose a socially-driven learning-based framework, namely Spice, for the media content prefetching to reduce the access delay and enhance mobile user’s satisfaction. Through a largescale data-driven analysis over real-life mobile Twitter traces from over 17 000 users during a period of five months, we reveal that the social friendship has a great impact on user’s media content click behavior. To capture this effect, we conduct the social friendship clustering over the set of user’s friends, and then develop a cluster-based Latent Bias Model for sociallydriven learning-based prefetching prediction. We then propose a usage-adaptive prefetching scheduling scheme by taking into account that different users may possess heterogeneous patterns in t

    Know More
  • myacademicproject categorys

    A Coalition Formation Game for Distributed Node Clustering in Mobile Ad Hoc Networks

    • B.Tech / M.Tech / M.Sc / Ph.D

    •  GANGADHAR.T

    • 13 Months ago

    In the context of wireless mobile ad hoc networks, node clustering is a well known solution for handling the scalability issue. While existing work focused on unstructured (i.e., flat) networks, this paper investigates a clustering algorithm to handle stable size-restricted clusters for structured (i.e., groupbased) networks.

    Know More
  • myacademicproject categorys

    Location Privacy Preservation in Database-driven Wireless Cognitive Networks through Encrypted Probabilistic Data Structures

    • B.Tech / M.Tech / M.Sc / Ph.D

    •  GANGADHAR.T

    • 13 Months ago

    In this paper, we propose new location privacy preserving schemes for database-driven cognitive radio networks (CRN s) that protect secondary users’ (SU s) location privacy while allowing them to learn spectrum availability in their vicinity.

    Know More
  • myacademicproject categorys

    High Throughput Opportunistic Cooperative Device-to-Device Communications With Caching

    • B.Tech / M.Tech / M.Sc / Ph.D

    •  GANGADHAR.T

    • 12 Months ago

    To achieve the potential in providing high throughput for cellular networks by device-to-device (D2D) communications, the interference among D2D links should be carefully managed. In this paper, we propose an opportunistic cooperation strategy for D2D transmission by exploiting the caching capability at the users to control the interference among D2D links. We consider overlay inband D2D, divide the D2D users into clusters, and assign different frequency bands to cooperative and non-cooperative D2D links. To provide high opportunity for cooperative transmission, we introduce a caching policy. To maximize the network throughput, we jointly optimize the cluster size and bandwidth allocation, where the closed-form expression of the bandwidth allocation factor is obtained. Simulation results demonstrate that the proposed strategy can provide 400% ? 500% throughput gain over traditional D2D communications when the content popularity distribution is skewed, and can provide 60

    Know More
  • myacademicproject categorys

    Separable Reversible Data Hiding in Encrypted Image

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    This work proposes a novel scheme for separable reversible data hiding in encrypted images. In the first phase, a content owner encrypts the original uncompressed image using an encryption key. Then, a data-hider may compress the least significant bits of the encrypted image using a data-hiding key to create a sparse space to accommodate some additional data. With an encrypted image containing additional data, if a receiver has the data-hiding key, he can extract the additional data though he does not know the image content. If the receiver has the encryption key, he can decrypt the received data to obtain an image similar to the original one, but cannot extract the additional data. If the receiver has both the data-hiding key and the encryption key, he can extract the additional data and recover the original content without any error by exploiting the spatial correlation in natural image when the amount of additional data is not too large.

    Know More
  • myacademicproject categorys

    FireCol: A Collaborative Protection Network for the Detection of Flooding DDoS Attacks

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Distributed denial-of-service (DDoS) attacks remain a major security problem, the mitigation of which is very hard especially when it comes to highly distributed botnet-based attacks. The early discovery of these attacks, although challenging, is necessary to protect end-users as well as the expensive network infrastructure resources. Here, we address the problem of DDoS attacks and present the theoretical foundation, architecture, and algorithms of FireCol. The core of FireCol is composed of intrusion prevention systems (IPSs) located at the Internet service providers (ISPs) level. The IPSs form virtual protection rings

    Know More
  • myacademicproject categorys

    AMPLE: An Adaptive Traffic Engineering System Based on Virtual Routing Topologies

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Handling traffic dynamics in order to avoid network congestion and subsequent service disruptions is one of the key tasks performed by contemporary network management systems. Given the simple but rigid routing and forwarding functionalities in IP base environments, efficient resource management and control solutions against dynamic traffic conditions is still yet to be obtained. In this article, we introduce AMPLE — an efficient traffic engineering and management system that performs adaptive traffic control by using multiple virtualized routing topologies. The proposed system consists of two complementary components: offline link weight optimization that takes as input the physical network topology and tries to produce maximum routing path diversity across multiple virtual routing

    Know More
  • myacademicproject categorys

    Fast Transmission to Remote Cooperative Groups A New Key Management Paradigm

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    The problem of efficiently and securely broadcasting to a remote cooperative group occurs in many newly emerging networks. A major challenge in devising such systems is to overcome the obstacles of the potentially limited communication from the group to the sender, the unavailability of a fully trusted key generation center, and the dynamics of the sender. The existing key management paradigms cannot deal with these challenges effectively. In this paper, we circumvent these obstacles and close this gap by proposing a novel key management paradigm. The

    Know More
  • myacademicproject categorys

    Detection and Localization of Multiple Spoofing Attackers in Wireless Networks

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Wireless spoofing attacks are easy to launch and can significantly impact the performance of networks. Although the identity of a node can be verified through cryptographic authentication, conventional security approaches are not always desirable because of their overhead requirements. In this paper, we propose to use spatial information, a physical property associated with each node, hard to falsify, and not reliant on cryptography, as the basis for 1) detecting spoofing attacks; 2) determining the number of attackers when multiple adversaries masquerading as the same node identity; and 3) localizing multiple adversaries. We propose to

    Know More
  • myacademicproject categorys

    Localization of Wireless Sensor Networks in the Wild: Pursuit of Ranging Quality

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Localization is a fundamental issue of wireless sensor networks that has been extensively studied in the literature. Our real-world experience from GreenOrbs, a sensor network system deployed in a forest, shows that localization in the wild remains very challenging due to various interfering factors. In this paper, we propose CDL, a Combined and Differentiated Localization approach for

    Know More
  • myacademicproject categorys

    Privacy-Preserving Optimal Meeting Location Determination on Mobile Devices

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Equipped with state-of-the-art smart phones and mobile devices, today’s highly interconnected urban population is increasingly dependent on these gadgets to organize and plan their daily lives. These applications often rely on current(or preferred) locations of individual users or a group of users to provide the desired service, which jeopardizes their privacy; users do not necessarily want to reveal their current (or preferred)locations to the service provider or to other, possibly un-

    Know More
  • myacademicproject categorys

    Secure Data Retrieval for Decentralized Disruption-Tolerant Military Networks

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Mobile nodes in military environments such as a battlefield or a hostile region are likely to suffer from intermittent network connectivity and frequent partitions. Disruption-tolerant network (DTN) technologies are becoming successful solutions that allow wireless devices carried by soldiers to communicate with each other and access the confidential information or command reliably by exploiting external storage nodes. Some of the most challenging issues in this scenario are the enforcement of authorization policies and the policies update for secure data retrieval. Ciphertext-policy attribute-based encryption (CP-ABE) is a promising cryptographic solution to the access control issues. However, the problem of applying CP-ABE in decentralized

    Know More
  • myacademicproject categorys

    Automatic Test Packet Generation

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Networks are getting larger and more complex, yet administrators rely on rudimentary tools such as and to debug problems. We propose an automated and systematic approach for testing and debugging networks called “Automatic Test Packet Generation” (ATPG). ATPG reads router configurations and generates a device-independent model. The model is used to generate a minimum set of test packets to (minimally) exercise every link in the network or (maximally) exercise every rule in the network. Test packets are sent periodically, and detected failures

    Know More
  • myacademicproject categorys

    Secure and Distributed Data Discovery and Dissemination in Wireless Sensor Networks

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    In Wireless Sensor Network, the security of data and confidentiality of data is an important aspect. Hence the data cannot be interrupted by the intruder. For updating configuration parameters and distributing management commands, data discovery and dissemination protocol for wireless sensor network is responsible. But, it has drawback is that, some protocols were not designed with security. For this reason, The DiDrip protocol i.e. first secure and distributed data discovery and dissemination protocol is proposed. The main function

    Know More
  • myacademicproject categorys

    Network Traffic Classification Using Correlation Information

    • B.TECH / M.TECH / M.SC / PH.D

    •   GANGADHAR.T

    • 12 Months ago

    Traffic classification has wide applications in network management, from security monitoring to quality of service measurements. Recent research tends to apply machine learning techniques to flow statistical feature based classification methods. The nearest neighbor (NN)-based method has exhibited superior classification performance. It also has several important advantages, such as no requirements of training procedure, no risk of over fitting of parameters, and naturally being able to handle a huge number of classes.

    Know More
  • myacademicproject categorys

    A Data Fusion Technique for Wireless Ranging Performance Improvement

    • B.TECH / M.TECH / M.SC / PH.D

    •   GANGADHAR.T

    • 12 Months ago

    The increasing diffusion of mobile and portable devices provided with wireless connectivity makes the problem of distance measurement based on radio-frequency technologies increasingly important for the development of next-generation nomadic applications. In this paper, the performance limitations of two classic wireless ranging techniques based on received signal strength (RSS) and two-way time-of-flight (ToF) measurements, respectively, are analyzed and compared in detail. On the basis of this study, a data fusion algorithm is proposed to combine both techniques in order to improve ranging accuracy.

    Know More