Architecture of Hybrid Mobile Social Networks for Efficient Content Delivery

Akhtar, Rizwan; Leng, Supeng; Memon, Imran; Ali, Mushtaq; Zhang, Liren

doi:10.1007/s11277-014-1996-4

Cited by 60 publications

(27 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…4) Hence, in this section, we designed a novel routing criterion named SPC_SD, which considers all of the key factors. 4) Hence, in this section, we designed a novel routing criterion named SPC_SD, which considers all of the key factors.…”

Section: Proposed Routing Criterionmentioning

confidence: 99%

See 1 more Smart Citation

Design of optimum criterion for opportunistic multi-hop routing in cognitive radio networks

2018

View full text Add to dashboard Cite

The instability of operational channels on cognitive radio networks (CRNs), which is due to the stochastic behavior of primary users (PUs), has increased the complexity of the design of the optimal routing criterion (ORC) in CRNs. The exploitation of available opportunities in CRNs, such as the channel diversity, as well as alternative routes provided by the intermediate nodes belonging to routes (internal backup routes) in the route‐cost (or weight) determination, complicate the ORC design. In this paper, to cover the channel diversity, the CRN is modeled as a multigraph in which the weight of each edge is determined according to the behavior of PU senders and the protection of PU receivers. Then, an ORC for CRNs, which is referred to as the stability probability of communication between the source node and the destination node (SPC_SD), is proposed. SPC_SD, which is based on the obtained model, internal backup routes, and probability theory, calculates the precise probability of communication stability between the source and destination. The performance evaluation is conducted using simulations, and the results show that the end‐to‐end performance improved significantly.

show abstract

Section: Proposed Routing Criterionmentioning

confidence: 99%

“…The manner in which p c i;j is obtained is shown in (4). The manner in which p c i;j is obtained is shown in (4).…”

Section: Proposed Routing Criterionmentioning

confidence: 99%

Design of optimum criterion for opportunistic multi-hop routing in cognitive radio networks

2018

View full text Add to dashboard Cite

show abstract

“…Another aim of the security research in the field of mobile networks is the end device security. Well known security companies have introduced their security applications for mobile platforms, also academic community has done research in this area [17][18][19]. However, we are not aware of any effective network security solution for mobile devices, which will mitigate well known core network related attacks [20].…”

Section: Related Workmentioning

confidence: 99%

Enhanced Privacy and Authentication: An Efficient and Secure Anonymous Communication for Location Based Service Using Asymmetric Cryptography Scheme

Memon

Hussain

Akhtar

et al. 2015

Wireless Pers Commun

Self Cite

110

View full text Add to dashboard Cite

Past few years, the mobile technology and location based services have experienced a great increment in number of its users. The privacy issues related to these services are becoming main concerns because of the leakage of users' private information and contents. To prevent revelation of private information, many researchers have proposed several secure and authentication schemes which apply various technologies to provide integral security properties, such as symmetric encryption, digital signature, timestamp, etc. Unfortunately, some of these schemes still exhibit security and efficiency issues. In this research paper, we proposed an efficient and secure anonymous communication for location based service using asymmetric cryptography scheme over the wireless system was attempted missing some system detail. We also proposed the prevent user private information and secure communication by asymmetric cryptography scheme. We solved the wireless communication problem in A3 algorithm such as eavesdropping and this problem solved by asymmetric cryptography scheme because of its robustness against this type of attack by providing mutual authentication make the system more secure. Finally, performance and cost analysis show our scheme is more suitable for lowpower and resource limited wireless system and thus availability for real implementation. According to our security analysis and performance, we can prove that our proposed & Imran Memon asymmetric cryptography scheme is able to improve wireless communication system security and enhance efficiency in comparison to previous schemes.

show abstract

“…New query q, instead of searching all the clients in the pre-cloaked set R set . These steps continue until there are no clients to be cloaked together anymore and velocity and changing distances will be calculated (steps [4][5][6][7][8][9][10][11][12][13][14][15][16][17]. The cloaked region requirement of k local and δp is treated as the qualified cloaked region (steps [19][20][21].The subsequent snapshot i in the query lifetime, we respectively check the satisfaction of the δq by adding each client in R i−1 , R i−2 , .…”

Section: Algorithm Depictionmentioning

confidence: 99%

“…For example, in deploying the other types of architecture like semi-distributed systems and TTP free, achieving privacy and authentication simultaneous has always been an issue. In other words, there is always a tradeoff between privacy and access control in which ever architecture used [6]. In the past, a fair amount of research efforts have been dedicated to protecting location privacy of mobile travelers.…”

Section: Introductionmentioning

confidence: 99%

Authentication User’s Privacy: An Integrating Location Privacy Protection Algorithm for Secure Moving Objects in Location Based Services

Memon

2015

Wireless Pers Commun

Self Cite

View full text Add to dashboard Cite

Location based services (LBSs) are gaining importance due to the advancement in mobile networks and positioning technologies. The proliferation of location-based services in recent years has highlighted the need to consider location privacy. This has led to the development of methods enhancing location privacy, and to the investigation of reasons for sharing location information. While computational attacks on location privacy and their prevention have attracted a lot of research, attacks based on humans strategies and tactics have mostly been considered implicitly. Nevertheless, in querying LBSs, a user send its exact locations to their location service providers but in the process, location information of the users are misused either purposefully or otherwise by service providers creating privacy issues for users. It has therefore become important that mechanisms necessary to protect the privacy of users are adopted when querying location based services. It's on this premise that we introduced a novel query privacy algorithm called the authentication speed dynamic transportation mode cloaking algorithm for continuous query LBSs that considers users' similarity in speed, direction and travelling with the same transport mode for cloaking for anonymization. Experimental evaluation of the algorithm on a real world map shows that our model ensures total privacy for users, enhanced privacy guarantee, improves quality of service significantly and achieved an excellent performance measure also we compare our method with existing privacy protection methods such as V-DCA, DSDCA, AVD-DCA,D-TC and GCA.

show abstract

Architecture of Hybrid Mobile Social Networks for Efficient Content Delivery

Cited by 60 publications

References 13 publications

Design of optimum criterion for opportunistic multi-hop routing in cognitive radio networks

Design of optimum criterion for opportunistic multi-hop routing in cognitive radio networks

Enhanced Privacy and Authentication: An Efficient and Secure Anonymous Communication for Location Based Service Using Asymmetric Cryptography Scheme

Authentication User’s Privacy: An Integrating Location Privacy Protection Algorithm for Secure Moving Objects in Location Based Services

Contact Info

Product

Resources

About