Showing 97–108 of 207 results
Group Key Agreement with Local Connectivity Abstract? a group key agreement problem where a user is only aware of his neighbors while the connectivity graph is arbitrary. In our problem, there is no centralized initialization for users. A group key agreement with these features is very suitable for social networks. Under our setting, we construct…
Group Key Agreement with Local Connectivity Abstract? Group Key Agreement with the Local Connectivity. A group key agreement problem where a user is the only aware of his neighbors while the connectivity graph is arbitrary. In our problem, there is no centralized initialization for users. A group key agreement with these features is the very…
Guaranteed Packet Delivery Using Greedy Routing Abstract?Guaranteed Packet Delivery Using Greedy Routing, In this paper, we propose a method of constructing a virtual coordinate system (ABVCap) in wireless sensor networks where location information is not available. A routing protocol based on ABVCap virtual coordinates is also introduced. Our routing protocol guarantees packet delivery and does…
High Performance and High Scalable Packet Classification Algorithm for Network Security Systems Abstract?High Performance and High Scalable Packet Classification Algorithm for Network Security Systems. Packet classification is a core function in network and security systems;hence,hardware-based solutions, such as packet classification accelerator chips or T-CAM < Final Year Projects 2016 > Ternary Content Addressable Memory have…
HydroCast: Pressure Routing for Underwater Sensor Networks Abstract? HydroCast: Pressure Routing for Underwater Sensor Networks. A Sensor Equipped Aquatic < Final Year Projects 2016 > SEA swarm is a sensor cloud that drifts with water currents and enables 4D (space and time) monitoring of local underwater events such as contaminants, marine life, and intruders. The…
Improved Privacy Preserving P2P Multimedia Distribution based on recombined fingerprints Abstract?Improved Privacy Preserving P2P Multimedia Distribution based on recombined fingerprints. Anonymous fingerprint has been suggested as a < Final Year Projects > convenient solution for the legal distribution of multimedia contents with copyright protection whilst preserving the privacy of buyers, whose identities are only revealed…
Incentive Driven Information Sharing in Delay Tolerant Mobile Networks Abstract?Mobile wireless devices (e.g., smartphones, PDAs, and notebooks) play important roles in our daily life, e.g., users often use such devices for bank transactions, keep in touch with friends. Users can also store such information and share with one another via opportunistic peer to peer…
Jamming-Resilient Secure Neighbor Discovery in Mobile Ad Hoc Networks Abstract?Secure neighbor discovery is fundamental to mobile ad hoc networks MANETs < Final Year Projects 2016 > deployed in hostile environments and refers to the process in which two neighboring nodes exchange messages to discover and authenticate each other. It is vulnerable to the jamming attack…
Joint Static and Dynamic Traffic Scheduling in Data Center Networks Abstract? The advent and continued growth of large data centers has led to much interest in switch architectures that can economically meet the high capacities needed for interconnecting the thousands of servers in these data centers. Various multilayer architectures employing thousands of switches have been…
key management for multiple multicast groups in wireless networks Abstract? The emergence of diverse group-based services, multiple multicast groups are likely to coexist in a single network, and users may subscribe to multiple groups simultaneously. However,< Final Year Project > the existing group key management (GKM) schemes, aiming to secure communication within a single group,…
Least Cost Influence Maximization Across Multiple Social Networks Abstract? Online social networks(OSNs),the least cost influence (LCI) problem has become one of the central re-search topics. It aims at identifying a minimum number of seed users who can trigger a wide cascade of information propagation. Most of existing literature investigated the LCI problem only based on…
Least Cost Influence Maximization Across Multiple Social Networks Abstract? In online social networks(OSNs),the least cost influence (LCI) problem has become one of the central re-search topics. It aims at identifying a minimum number of seed users who can?t rigger a wide cascade of information propagation. Most of existing literature investigated the LCI problem only based…
End of content
End of content
Don't have an account yet? Sign up
No items in your cart. Go on, fill it up with something you love!
Start Shopping Now
Free 
