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