http://finalyearprojects.net

Checking delivery availability...

background-sm
Search
3
10 10 Updates found with d2d underlaid cellular networks sir meta distribution

Updates found with 'd2d underlaid cellular networks sir meta distribution'

Page 1 1

Updates found with ''

MUNICATION PROJECT TITLES Modeling and Analysis of SCMA Enhanced D2D and Cellular Hybrid NetworkAbstract—Sparse code multiple access (SCMA) has been recently proposed for the future wireless networks, which allows nonorthogonal spectrum resource sharing and enables system overloading. In this paper, we apply SCMA into device-todevice (D2D) communication and cellular hybrid network, targeted at using the overload feature of SCMA to support massive device connectivity and expand network capacity. Particularly, we develop a stochastic geometry-based framework to model and analyze SCMA, considering underlaid and overlaid modes. Based on the results, we analytically compare SCMA with orthogonalfrequency-division multiple access (OFDMA) using area spectralefficiency (ASE) and quantify closed-form ASE gain of SCMA over OFDMA. Notably, it is shown that system ASE can be significantly improved using SCMA and the ASE gain scales linearly with the SCMA codeword dimension. Besides, we endow D2D users with an activated probability to balance cross-tier interference in the underlaid mode and derive the optimal activated probability. Meanwhile, we study resource allocation in the overlaid mode and obtain the optimal codebook allocation rule. It is interestingly found that the optimal SCMA codebook allocation rule is independent of cellular network parameterswhen cellular users are densely deployed. The results are helpfulin the implementation of SCMA in the hybrid system.CONTACT:GANESAN.P+91  9865862045+91  8903410319
IEEE 2017 - 2018 COMMUNICATION PROJECT TITLES Modeling and Analysis of SCMA Enhanced D2D and Cellular Hybrid NetworkAbstract—Sparse code multiple access (SCMA) has been recently proposed for the future wireless networks, which allows nonorthogonal spectrum resource sharing and enables system overloading. In this paper, we apply SCMA into device-todevice (D2D) communication and cellular hybrid network, targeted at using the overload feature of SCMA to support massive device connectivity and expand network capacity. Particularly, we develop a stochastic geometry-based framework to model and analyze SCMA, considering underlaid and overlaid modes. Based on the results, we analytically compare SCMA with orthogonalfrequency-division multiple access (OFDMA) using area spectralefficiency (ASE) and quantify closed-form ASE gain of SCMA over OFDMA. Notably, it is shown that system ASE can be significantly improved using SCMA and the ASE gain scales linearly with the SCMA codeword dimension. Besides, we endow D2D users with an activated probability to balance cross-tier interference in the underlaid mode and derive the optimal activated probability. Meanwhile, we study resource allocation in the overlaid mode and obtain the optimal codebook allocation rule. It is interestingly found that the optimal SCMA codebook allocation rule is independent of cellular network parameterswhen cellular users are densely deployed. The results are helpfulin the implementation of SCMA in the hybrid system.CONTACT:GANESAN.P+91 9865862045+91 8903410319
Send Enquiry
Read More
MUNICATION PROJECT TITLES Energy Harvesting-Based D2D-Assisted Machine-Type CommunicationsAbstract—Supporting massive numbers of machine-type communication (MTC) devices poses several challenges for future 5G networks including network control, scheduling, and powering these devices. A potential solution is to offload MTC traffic onto device-to-device (D2D) communication links to better manage radio resources and reduce MTC devices’ energy consumption. However, this approach requires D2D users to use their own limited energy to relay MTC traffic, which may be undesirable. This motivates us to exploit recent advancements in RF energy harvesting for powering D2D relay transmissions. In this paper, we consider a D2D communication as an underlay to the cellularnetwork, where D2D users access a fraction of the spectrum occupied by cellular users. This underlay model presents a fundamental tradeoff: to protect cellular users, the spectrum available to D2D users needs to be reduced, which limits the number of D2D transmissions, but increases the amount of time that D2D users can spend harvesting energy to support MTC traffic. We study this tradeoff by characterizing the spectral efficiency of MTC, D2D and cellular users using stochasticgeometry. The optimal spectrum partition factor is characterized to achieve fairness and balance in the network, while increasing the average MTC spectral efficiency.CONTACT:GANESAN.P+91  9865862045+91  8903410319
IEEE 2017 - 2018 COMMUNICATION PROJECT TITLES Energy Harvesting-Based D2D-Assisted Machine-Type CommunicationsAbstract—Supporting massive numbers of machine-type communication (MTC) devices poses several challenges for future 5G networks including network control, scheduling, and powering these devices. A potential solution is to offload MTC traffic onto device-to-device (D2D) communication links to better manage radio resources and reduce MTC devices’ energy consumption. However, this approach requires D2D users to use their own limited energy to relay MTC traffic, which may be undesirable. This motivates us to exploit recent advancements in RF energy harvesting for powering D2D relay transmissions. In this paper, we consider a D2D communication as an underlay to the cellularnetwork, where D2D users access a fraction of the spectrum occupied by cellular users. This underlay model presents a fundamental tradeoff: to protect cellular users, the spectrum available to D2D users needs to be reduced, which limits the number of D2D transmissions, but increases the amount of time that D2D users can spend harvesting energy to support MTC traffic. We study this tradeoff by characterizing the spectral efficiency of MTC, D2D and cellular users using stochasticgeometry. The optimal spectrum partition factor is characterized to achieve fairness and balance in the network, while increasing the average MTC spectral efficiency.CONTACT:GANESAN.P+91 9865862045+91 8903410319
Send Enquiry
Read More
OJECTS  ABSTRACTOPTIMIZED LTE CELL PLANNING WITH VARYING SPATIAL AND TEMPORAL USER DENSITIES ABSTRACT:                         Base station deployment in cellular networks is one of the fundamental problems in network design. This paper proposes a novel method for the cell planning problem for the fourth generation (4G) cellular networks using meta-heuristic algorithms. In this approach, we aim to satisfy both cell coverage and capacity constraints simultaneously by formulating an optimization problem that captures practical planning aspects. The starting point of the planning process is defined through a dimensioning exercise that captures both coverage and capacity constraints. Afterwards, we implement a meta-heuristic algorithm based on swarm intelligence (e.g., particle swarm optimization or the recently-proposed grey wolf optimizer) to find suboptimal base station locations that satisfy both problem constraints in the area of interest which can be divided into several subareas with different spatial user densities. Subsequently, an iterative approach is executed to eliminate eventual redundant base stations. We also perform Monte Carlo simulations to study the performance of the proposed scheme and compute the average number of users in outage. Next, the problems of green planning with regards to temporal traffic variation and planning with location constraints due to tight limits on electromagnetic radiations are addressed, using the proposed method. Finally, in our simulation results, we apply our proposed approach for different scenarios with different subareas and user distributions and show that the desired network quality of service targets are always reached even for large-scale problems.
IEEE 2016 MAT LAB PROJECTS ABSTRACTOPTIMIZED LTE CELL PLANNING WITH VARYING SPATIAL AND TEMPORAL USER DENSITIES ABSTRACT: Base station deployment in cellular networks is one of the fundamental problems in network design. This paper proposes a novel method for the cell planning problem for the fourth generation (4G) cellular networks using meta-heuristic algorithms. In this approach, we aim to satisfy both cell coverage and capacity constraints simultaneously by formulating an optimization problem that captures practical planning aspects. The starting point of the planning process is defined through a dimensioning exercise that captures both coverage and capacity constraints. Afterwards, we implement a meta-heuristic algorithm based on swarm intelligence (e.g., particle swarm optimization or the recently-proposed grey wolf optimizer) to find suboptimal base station locations that satisfy both problem constraints in the area of interest which can be divided into several subareas with different spatial user densities. Subsequently, an iterative approach is executed to eliminate eventual redundant base stations. We also perform Monte Carlo simulations to study the performance of the proposed scheme and compute the average number of users in outage. Next, the problems of green planning with regards to temporal traffic variation and planning with location constraints due to tight limits on electromagnetic radiations are addressed, using the proposed method. Finally, in our simulation results, we apply our proposed approach for different scenarios with different subareas and user distributions and show that the desired network quality of service targets are always reached even for large-scale problems.
Send Enquiry
Read More
E COMPUTING PROJECT TITLES Propagation- and Mobility-Aware D2D Social Content ReplicationAbstract—Mobile online social network services have seen rapid expansion; thus, the corresponding huge amounts of user-generated social media contents propagating between users via social connections have significantly challenged the traditional content delivery paradigm.First, replicating all the contents generated by users to edge serversthat well “fit” the receivers becomes difficult due to limited bandwidthand storage capacities. Motivated by device-to-device (D2D) communication, which allows users with smart devices to transfer content directly, we propose replicating bandwidth-intensive social contents in a deviceto-device manner. Based on large-scale measurement studies on social content propagation and user mobility patterns in edge-network regions, we observe the following: (1) Device-to-device replication can significantly help users download social contents from neighboring peers. (2) Both social propagation and mobility patterns affect how contents should be replicated. (3) The replication strategies depend on regional characteristics (e.g., how users move across regions). Using these measurement insights, we propose a propagation- and mobility-aware content replication strategy for edge-network regions, in which social contents are assigned to users in edge-network regions according to a joint consideration of social graphs, content propagation and user mobility. We formulate the replication scheduling as an optimization problem and design a distributed algorithm using only historical, local and partial information to solve it. Trace-driven experiments further verify the superiority of our proposal: compared with conventional puremovement- based and popularity-based approaches, our design can significantly improve (2􀀀4-fold improvement) the amount of social content successfully delivered via device-to-device replication. CONTACT:GANESAN.P+91  9865862045+91  8903410319
IEEE 2017 - 18 MOBILE COMPUTING PROJECT TITLES Propagation- and Mobility-Aware D2D Social Content ReplicationAbstract—Mobile online social network services have seen rapid expansion; thus, the corresponding huge amounts of user-generated social media contents propagating between users via social connections have significantly challenged the traditional content delivery paradigm.First, replicating all the contents generated by users to edge serversthat well “fit” the receivers becomes difficult due to limited bandwidthand storage capacities. Motivated by device-to-device (D2D) communication, which allows users with smart devices to transfer content directly, we propose replicating bandwidth-intensive social contents in a deviceto-device manner. Based on large-scale measurement studies on social content propagation and user mobility patterns in edge-network regions, we observe the following: (1) Device-to-device replication can significantly help users download social contents from neighboring peers. (2) Both social propagation and mobility patterns affect how contents should be replicated. (3) The replication strategies depend on regional characteristics (e.g., how users move across regions). Using these measurement insights, we propose a propagation- and mobility-aware content replication strategy for edge-network regions, in which social contents are assigned to users in edge-network regions according to a joint consideration of social graphs, content propagation and user mobility. We formulate the replication scheduling as an optimization problem and design a distributed algorithm using only historical, local and partial information to solve it. Trace-driven experiments further verify the superiority of our proposal: compared with conventional puremovement- based and popularity-based approaches, our design can significantly improve (2􀀀4-fold improvement) the amount of social content successfully delivered via device-to-device replication. CONTACT:GANESAN.P+91 9865862045+91 8903410319
Send Enquiry
Read More
OJECTS  ABSTRACT:DESIGN AND ANALYSIS OF AN EFFICIENT FRIEND-TO-FRIEND CONTENT DISSEMINATION SYSTEM ABSTRACT:             Opportunistic communication, off-loading and decentralized distribution have been proposed as a means of cost efficient disseminating content when users are geographically clustered into communities. Despite its promise, none of the proposed systems have not been widely adopted due to unbounded high content delivery latency, security and privacy concerns. This paper, presents a novel hybrid content storage and distribution system addressing the trust and privacy concerns of users, lowering the cost of content distribution and storage, and shows how they can be combined uniquely to develop mobile social networking services. The system exploit the fact that users will trust their friends, and by replicating content on friends’ devices that are likely to consume that content it will be possible to disseminate it to other friends when connected to low cost networks. The paper provides a formal definition of this content replication problem, and show that it is NP hard. Then, it presents a community based greedy heuristic algorithm with novel dynamic centrality metrics that replicates the content on a minimum number of friends’ devices, to maximize availability. Then using real world and synthetic datasets, the effectiveness of the proposed scheme is demonstrated. The practicality of the proposed system is demonstrated through an implementation on Android smart phones.EXISTING SYSTEM:                   Despite offering additional advantages for mobile users, such as providing connectivity when there is no direct access to a network, opportunistic communication solutions have not seen wide spread adoption, primarily for two reasons. Firstly, due to the inherent reluctance by users to interact with strangers or third parties, despite security and privacy concerns are being partially addressed by the use of encryption. Secondly, due to the unbounded latencies of data transport.PROPOSED SYSTEM:               In contrast, offloading offer a generic solution for reducing congestion in a given network. Offloading between cellular and WLANs have been adopted by a number of operators. However, they still suffer from the lack of universal availability of WLANs provided by the same cellular network operator and the time taken for authentication. Importantly, neither of these solutions directly addresses loss of control of data and privacy.ADVANTAGE:•	Presents a hybrid content dissemination system for mobile social networks, which takes advantage of trusted social networking friends.•	Provides a formal definition of content replication, which maximizes content availability and minimizes replication and shows this to be NP-hard.•	Presents a community based greedy algorithm for efficient content replication by taking advantage of routine behavioral patterns of mobile users.•	Proposes dynamic centrality metrics to identify the most influential users within communities to minimize the content replication and delivery delay.•	Shows that it is possible to provide delivery success rates of 80% with less than 10% replication, through extensive data driven simulations using both real world and synthetic datasets.•	Demonstrates the practicality of the proposed hybrid content dissemination through the implementation of the system on Android smart phones.•	Reduces the traffic to the server because the helper alone going to contact the server.SYSTEM SPECIFICATION:HARDWARE REQUIREMENTS:•	Microsoft® Windows® 7/8/10 (32- or 64-bit)•	2 GB RAM minimum, 8 GB RAM recommended•	2 GB of available disk space minimum, 4 GB recommended (500 MB for IDE + 1.5 GB for Android SDK and emulator system image)•	1280 x 800 minimum screen resolutions•	Java Development Kit (JDK) 8•	For accelerated emulator: 64-bit operating system and Intel® processor with support for Intel® VT-x, Intel® EM64T (Intel® 64), and Execute Disable (XD) Bit functionalitySOFTWARE REQUIREMENTS:	Operating system 	:   Windows 7 Ultimate.	Coding Language		:   Java.	Front-End			:   Android Studio.	Data Base			:   Cloud database Manger.	Server			:   Wamp Server.CONCLUSION:                    In contrast, offloading offer a generic solution for reducing congestion in a given network. Offloading between cellular and WLANs have been adopted by a number of operators. However, they still suffer from the lack of universal availability of WLANs provided by the same cellular network operator and the time taken for authentication. Importantly, neither of these solutions directly addresses loss of control of data and privacy. We proposed a novel distributed content storage and dissemination architecture that uses intelligent content replication to addresses the issues of lack of trust and timeliness of delivery, and loss of privacy that has hindered the adoption and deployment of friend-to-friend content delivery. First, we showed that the content replication problem in opportunistic content dissemination architectures is NP-hard. Then, we developed a community based greedy algorithm for efficient content replication, taking advantage of routine behavioral patterns of social networking friends.
IEEE 2016 ANDROID PROJECTS ABSTRACT:DESIGN AND ANALYSIS OF AN EFFICIENT FRIEND-TO-FRIEND CONTENT DISSEMINATION SYSTEM ABSTRACT: Opportunistic communication, off-loading and decentralized distribution have been proposed as a means of cost efficient disseminating content when users are geographically clustered into communities. Despite its promise, none of the proposed systems have not been widely adopted due to unbounded high content delivery latency, security and privacy concerns. This paper, presents a novel hybrid content storage and distribution system addressing the trust and privacy concerns of users, lowering the cost of content distribution and storage, and shows how they can be combined uniquely to develop mobile social networking services. The system exploit the fact that users will trust their friends, and by replicating content on friends’ devices that are likely to consume that content it will be possible to disseminate it to other friends when connected to low cost networks. The paper provides a formal definition of this content replication problem, and show that it is NP hard. Then, it presents a community based greedy heuristic algorithm with novel dynamic centrality metrics that replicates the content on a minimum number of friends’ devices, to maximize availability. Then using real world and synthetic datasets, the effectiveness of the proposed scheme is demonstrated. The practicality of the proposed system is demonstrated through an implementation on Android smart phones.EXISTING SYSTEM: Despite offering additional advantages for mobile users, such as providing connectivity when there is no direct access to a network, opportunistic communication solutions have not seen wide spread adoption, primarily for two reasons. Firstly, due to the inherent reluctance by users to interact with strangers or third parties, despite security and privacy concerns are being partially addressed by the use of encryption. Secondly, due to the unbounded latencies of data transport.PROPOSED SYSTEM: In contrast, offloading offer a generic solution for reducing congestion in a given network. Offloading between cellular and WLANs have been adopted by a number of operators. However, they still suffer from the lack of universal availability of WLANs provided by the same cellular network operator and the time taken for authentication. Importantly, neither of these solutions directly addresses loss of control of data and privacy.ADVANTAGE:• Presents a hybrid content dissemination system for mobile social networks, which takes advantage of trusted social networking friends.• Provides a formal definition of content replication, which maximizes content availability and minimizes replication and shows this to be NP-hard.• Presents a community based greedy algorithm for efficient content replication by taking advantage of routine behavioral patterns of mobile users.• Proposes dynamic centrality metrics to identify the most influential users within communities to minimize the content replication and delivery delay.• Shows that it is possible to provide delivery success rates of 80% with less than 10% replication, through extensive data driven simulations using both real world and synthetic datasets.• Demonstrates the practicality of the proposed hybrid content dissemination through the implementation of the system on Android smart phones.• Reduces the traffic to the server because the helper alone going to contact the server.SYSTEM SPECIFICATION:HARDWARE REQUIREMENTS:• Microsoft® Windows® 7/8/10 (32- or 64-bit)• 2 GB RAM minimum, 8 GB RAM recommended• 2 GB of available disk space minimum, 4 GB recommended (500 MB for IDE + 1.5 GB for Android SDK and emulator system image)• 1280 x 800 minimum screen resolutions• Java Development Kit (JDK) 8• For accelerated emulator: 64-bit operating system and Intel® processor with support for Intel® VT-x, Intel® EM64T (Intel® 64), and Execute Disable (XD) Bit functionalitySOFTWARE REQUIREMENTS: Operating system : Windows 7 Ultimate. Coding Language : Java. Front-End : Android Studio. Data Base : Cloud database Manger. Server : Wamp Server.CONCLUSION: In contrast, offloading offer a generic solution for reducing congestion in a given network. Offloading between cellular and WLANs have been adopted by a number of operators. However, they still suffer from the lack of universal availability of WLANs provided by the same cellular network operator and the time taken for authentication. Importantly, neither of these solutions directly addresses loss of control of data and privacy. We proposed a novel distributed content storage and dissemination architecture that uses intelligent content replication to addresses the issues of lack of trust and timeliness of delivery, and loss of privacy that has hindered the adoption and deployment of friend-to-friend content delivery. First, we showed that the content replication problem in opportunistic content dissemination architectures is NP-hard. Then, we developed a community based greedy algorithm for efficient content replication, taking advantage of routine behavioral patterns of social networking friends.
Send Enquiry
Read More
OJECTS  ABSTRACT:DESIGN AND ANALYSIS OF AN EFFICIENTFRIEND-TO-FRIEND CONTENT DISSEMINATION SYSTEM ABSTRACT:                  Opportunistic communication, off-loading and decentralized distribution have been proposed as a means of cost efficient disseminating content when users are geographically clustered into communities. Despite its promise, none of the proposed systems have not been widely adopted due to unbounded high content delivery latency, security and privacy concerns. This paper, presents a novel hybrid content storage and distribution system addressing the trust and privacy concerns of users, lowering the cost of content distribution and storage, and shows how they can be combined uniquely to develop mobile social networking services. The system exploit the fact that users will trust their friends, and by replicating content on friends’ devices that are likely to consume that content it will be possible to disseminate it to other friends when connected to low cost networks. The paper provides a formal definition of this content replication problem, and show that it is NP hard. Then, it presents a community based greedy heuristic algorithm with novel dynamic centrality metrics that replicates the content on a minimum number of friends’ devices, to maximize availability. Then using real world and synthetic datasets, the effectiveness of the proposed scheme is demonstrated. The practicality of the proposed system is demonstrated through an implementation on Android smart phones.EXISTING SYSTEM:                Despite offering additional advantages for mobile users, such as providing connectivity when there is no direct access to a network, opportunistic communication solutions have not seen wide spread adoption, primarily for two reasons. Firstly, due to the inherent reluctance by users to interact with strangers or third parties, despite security and privacy concerns are being partially addressed by the use of encryption. Secondly, due to the unbounded latencies of data transport.PROPOSED SYSTEM:                    In contrast, offloading offer a generic solution for reducing congestion in a given network. Offloading between cellular and WLANs have been adopted by a number of operators. However, they still suffer from the lack of universal availability of WLANs provided by the same cellular network operator and the time taken for authentication. Importantly, neither of these solutions directly addresses loss of control of data and privacy.ADVANTAGE:•	Presents a hybrid content dissemination system for mobile social networks, which takes advantage of trusted social networking friends.•	Provides a formal definition of content replication, which maximizes content availability and minimizes replication and shows this to be NP-hard.•	Presents a community based greedy algorithm for efficient content replication by taking advantage of routine behavioral patterns of mobile users.•	Proposes dynamic centrality metrics to identify the most influential users within communities to minimize the content replication and delivery delay.•	Shows that it is possible to provide delivery success rates of 80% with less than 10% replication, through extensive data driven simulations using both real world and synthetic datasets.•	Demonstrates the practicality of the proposed hybrid content dissemination through the implementation of the system on Android smart phones.•	Reduces the traffic to the server because the helper alone going to contact the server.DISADVANTAGE:•	Due to the inherent reluctance by users to interact with strangers or third parties.•	Security and privacy concerns are being partially addressed by the use of encryption.•	Due to the unbounded latencies of data transportSYSTEM SPECIFICATION:HARDWARE REQUIREMENTS:•	Microsoft® Windows® 7/8/10 (32- or 64-bit)•	2 GB RAM minimum, 8 GB RAM recommended•	2 GB of available disk space minimum, 4 GB recommended (500 MB for IDE + 1.5 GB for Android SDK and emulator system image)•	1280 x 800 minimum screen resolutions•	Java Development Kit (JDK) 8•	For accelerated emulator: 64-bit operating system and Intel® processor with support for Intel® VT-x, Intel® EM64T (Intel® 64), and Execute Disable (XD) Bit functionalitySOFTWARE REQUIREMENTS:	Operating system 	:   Windows 7 Ultimate.	Coding Language		:   Java.	Front-End			:   Android Studio.	Data Base			:   Cloud database Manger.	Server			:   Wamp Server.CONCLUSION:In contrast, offloading offer a generic solution for reducing congestion in a given network. Offloading between cellular and WLANs have been adopted by a number of operators. However, they still suffer from the lack of universal availability of WLANs provided by the same cellular network operator and the time taken for authentication. Importantly, neither of these solutions directly addresses loss of control of data and privacy. We proposed a novel distributed content storage and dissemination architecture that uses intelligent content replication to addresses the issues of lack of trust and timeliness of delivery, and loss of privacy that has hindered the adoption and deployment of friend-to-friend content delivery. First, we showed that the content replication problem in opportunistic content dissemination architectures is NP-hard. Then, we developed a community based greedy algorithm for efficient content replication, taking advantage of routine behavioral patterns of social networking friends.
IEEE 2016 ANDROID PROJECTS ABSTRACT:DESIGN AND ANALYSIS OF AN EFFICIENT FRIEND-TO-FRIEND CONTENT DISSEMINATION SYSTEM ABSTRACT: Opportunistic communication, off-loading and decentralized distribution have been proposed as a means of cost efficient disseminating content when users are geographically clustered into communities. Despite its promise, none of the proposed systems have not been widely adopted due to unbounded high content delivery latency, security and privacy concerns. This paper, presents a novel hybrid content storage and distribution system addressing the trust and privacy concerns of users, lowering the cost of content distribution and storage, and shows how they can be combined uniquely to develop mobile social networking services. The system exploit the fact that users will trust their friends, and by replicating content on friends’ devices that are likely to consume that content it will be possible to disseminate it to other friends when connected to low cost networks. The paper provides a formal definition of this content replication problem, and show that it is NP hard. Then, it presents a community based greedy heuristic algorithm with novel dynamic centrality metrics that replicates the content on a minimum number of friends’ devices, to maximize availability. Then using real world and synthetic datasets, the effectiveness of the proposed scheme is demonstrated. The practicality of the proposed system is demonstrated through an implementation on Android smart phones.EXISTING SYSTEM: Despite offering additional advantages for mobile users, such as providing connectivity when there is no direct access to a network, opportunistic communication solutions have not seen wide spread adoption, primarily for two reasons. Firstly, due to the inherent reluctance by users to interact with strangers or third parties, despite security and privacy concerns are being partially addressed by the use of encryption. Secondly, due to the unbounded latencies of data transport.PROPOSED SYSTEM: In contrast, offloading offer a generic solution for reducing congestion in a given network. Offloading between cellular and WLANs have been adopted by a number of operators. However, they still suffer from the lack of universal availability of WLANs provided by the same cellular network operator and the time taken for authentication. Importantly, neither of these solutions directly addresses loss of control of data and privacy.ADVANTAGE:• Presents a hybrid content dissemination system for mobile social networks, which takes advantage of trusted social networking friends.• Provides a formal definition of content replication, which maximizes content availability and minimizes replication and shows this to be NP-hard.• Presents a community based greedy algorithm for efficient content replication by taking advantage of routine behavioral patterns of mobile users.• Proposes dynamic centrality metrics to identify the most influential users within communities to minimize the content replication and delivery delay.• Shows that it is possible to provide delivery success rates of 80% with less than 10% replication, through extensive data driven simulations using both real world and synthetic datasets.• Demonstrates the practicality of the proposed hybrid content dissemination through the implementation of the system on Android smart phones.• Reduces the traffic to the server because the helper alone going to contact the server.DISADVANTAGE:• Due to the inherent reluctance by users to interact with strangers or third parties.• Security and privacy concerns are being partially addressed by the use of encryption.• Due to the unbounded latencies of data transportSYSTEM SPECIFICATION:HARDWARE REQUIREMENTS:• Microsoft® Windows® 7/8/10 (32- or 64-bit)• 2 GB RAM minimum, 8 GB RAM recommended• 2 GB of available disk space minimum, 4 GB recommended (500 MB for IDE + 1.5 GB for Android SDK and emulator system image)• 1280 x 800 minimum screen resolutions• Java Development Kit (JDK) 8• For accelerated emulator: 64-bit operating system and Intel® processor with support for Intel® VT-x, Intel® EM64T (Intel® 64), and Execute Disable (XD) Bit functionalitySOFTWARE REQUIREMENTS: Operating system : Windows 7 Ultimate. Coding Language : Java. Front-End : Android Studio. Data Base : Cloud database Manger. Server : Wamp Server.CONCLUSION:In contrast, offloading offer a generic solution for reducing congestion in a given network. Offloading between cellular and WLANs have been adopted by a number of operators. However, they still suffer from the lack of universal availability of WLANs provided by the same cellular network operator and the time taken for authentication. Importantly, neither of these solutions directly addresses loss of control of data and privacy. We proposed a novel distributed content storage and dissemination architecture that uses intelligent content replication to addresses the issues of lack of trust and timeliness of delivery, and loss of privacy that has hindered the adoption and deployment of friend-to-friend content delivery. First, we showed that the content replication problem in opportunistic content dissemination architectures is NP-hard. Then, we developed a community based greedy algorithm for efficient content replication, taking advantage of routine behavioral patterns of social networking friends.
Send Enquiry
Read More
Page 1 1