Cooperative Caching in Dynamic Shared Spectrum Networks

Das, Dibakar; Abouzeid, Alhussein A.

doi:10.1109/twc.2016.2552159

Cited by 16 publications

(11 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Dibakar Das et al [23] have proposed two caching and scheduling policies using Lyapunov drift techniques between primary and secondary request generation rates which should be supported increases from the case without cooperation. Fixed Primary Caching Policy (FPCP (FPCP) algorithm increases the set of request generation rates that can be maintained.…”

Section: Literature Surveymentioning

confidence: 99%

Appropriate Channel Selection for Dynamic Resource Allocation with Priority Scheduling Approach in Multi-hop Cognitive Radio Networks

Santhamurthy¹,

Parasuramane²

2017

IJIES

View full text Add to dashboard Cite

Today's wireless communication systems required groundbreaking solution to meet scarcity of radio spectrum. Cognitive radio (CR) is an emerging technology which provides futuristic solution and improving the precious likely resources utilization. Cognitive radio network (CRN) is an intellectual wireless communication system as well as aware of its environment. In CRN, we have sensing problem by multiple nodes with changing computational power, spectrum allocation and range of sensing. The secondary user (SU) plays major role of primary channel sensing and appropriate unused channel selection for communication. In this paper we focused on optimum resource allocations and priority based scheduling for primary user (PU) and secondary user (SU) to exploit the performance of the entire network by reducing the interference at PU and also exploiting the throughput and decreasing the risk of overlying the coverage of CRNs. The effectiveness of dynamic resource allocation priority based scheduling (DRAPBS-CRN) algorithm is compared with dynamic resource allocation (DRA-CRN) algorithm and is found to be 26% more efficient using ns-2 simulation. This proposed DRAPBS-CRN algorithm also will avoid collisions and perform smart data transmission in CRN.

show abstract

Section: Literature Surveymentioning

confidence: 99%

Appropriate Channel Selection for Dynamic Resource Allocation with Priority Scheduling Approach in Multi-hop Cognitive Radio Networks

Santhamurthy¹,

Parasuramane²

2017

IJIES

View full text Add to dashboard Cite

show abstract

“…In this scheme, the SU must perform spectrum sensing at the beginning of each time slot and then transmits its data transmission in the rest of the slot only when the operating channel is detected to be idle. For simplicity, the spectrum sensing is supposed to be perfect without missed detections or false alarms as in [ 11 , 12 , 13 , 14 , 15 , 16 , 17 , 18 , 19 , 20 , 21 , 22 , 23 , 24 , 25 , 26 , 27 , 28 , 29 ]. Note that a channel can only be occupied by one user at any time.…”

Section: System Model Descriptionmentioning

confidence: 99%

“…In [ 15 ], the preemptive resume priority (PRP) M/G/1 queuing network model was proposed to characterize the connection-based spectrum handoff behaviors with multiple interruptions in multiple-channel CR networks, where the SU can significantly reduce the extended data delivery time by applying the traffic-adaptive target channel sequence selection method. In [ 16 , 17 , 18 , 19 , 20 , 21 , 22 , 23 ], multiple interruptions and the extended data delivery time were also studied in the PRP M/G/1 queuing network model. However, the authors only considered a single-channel CR network.…”

Section: Introductionmentioning

confidence: 99%

“…In order to reduce the complexity of the algorithm, it proposed the equiprobable target channel selection and the primary traffic-based target channel selection, which were not optimal selection schemes for the considered secondary connection. In general, in [ 11 , 12 , 13 , 14 , 15 , 16 , 17 , 18 , 19 , 20 , 21 , 22 , 23 , 24 , 25 , 26 , 27 , 28 , 29 ], all the CR networks were established based on the preemptive resume priority queuing system model. That is, when the secondary connection was interrupted due to the appearance of the primary connection, the interrupted secondary connection would reactively or proactively determine a best available channel to resume its unfinished data transmission.…”

Section: Introductionmentioning

confidence: 99%

“…In this paper, unlike [ 11 , 12 , 13 , 14 , 15 , 16 , 17 , 18 , 19 , 20 , 21 , 22 , 23 , 24 , 25 , 26 , 27 , 28 , 29 ], we propose an analytical framework based on the preemptive repeat identical (PRI) M/G/1 queuing network model to characterize spectrum handoff behaviors with general service time distribution of both primary and secondary connections, multiple interruptions and transmission time delay resulting from the appearance of primary connections. Under the preemptive repeat policy, when interruptions happen, the secondary connection will start from the beginning.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Spectrum Handoffs Based on Preemptive Repeat Priority Queue in Cognitive Radio Networks

Yang

Tan

Liang

et al. 2016

Sensors

View full text Add to dashboard Cite

Cognitive radio can significantly improve the spectrum efficiency, and spectrum handoff is considered as an important functionality to guarantee the quality of service (QoS) of primary users (PUs) and the continuity of data transmission of secondary users (SUs). In this paper, we propose an analytical framework based on a preemptive repeat identical (PRI) M/G/1 queuing network model to characterize spectrum handoff behaviors with general service time distribution of both primary and secondary connections, multiple interruptions and transmission delay resulting from the appearance of primary connections. Then, we derive the close-expression of the extended data delivery and the system sojourn time in both staying and changing scenarios. In addition, based on analysis of spectrum handoff behaviors resulting from multiple interruptions caused by the appearance of the primary connections, we investigate the traffic-adaptive policy, by which the considered SU will optimally adjust its handoff spectrum policy. Moreover, we investigate the admissible region and provide the reference for designing the admission control rule for the arriving secondary connection requests. Finally, simulation results verify that our proposed analytical framework is reasonable and can provide the reference for executing the optimal spectrum handoff strategy and designing the admission control rule for the SU in cognitive radio networks.

show abstract

A Mutual Authentication Framework for Wireless Medical Sensor Networks

2017

View full text Add to dashboard Cite

Wireless medical sensor networks (WMSN) comprise of distributed sensors, which can sense human physiological signs and monitor the health condition of the patient. It is observed that providing privacy to the patient's data is an important issue and can be challenging. The information passing is done via the public channel in WMSN. Thus, the patient, sensitive information can be obtained by eavesdropping or by unauthorized use of handheld devices which the health professionals use in monitoring the patient. Therefore, there is an essential need of restricting the unauthorized access to the patient's medical information. Hence, the efficient authentication scheme for the healthcare applications is needed to preserve the privacy of the patients' vital signs. To ensure secure and authorized communication in WMSN, we design a symmetric key based authentication protocol for WMSN environment. The proposed protocol uses only computationally efficient operations to achieve lightweight attribute. We analyze the security of the proposed protocol. We use a formal security proof algorithm to show the scheme security against known attacks. We also use the Automated Validation of Internet Security Protocols and Applications (AVISPA) simulator to show protocol secure against man-in-the-middle attack and replay attack. Additionally, we adopt an informal analysis to discuss the key attributes of the proposed scheme. From the formal proof of security, we can see that an attacker has a negligible probability of breaking the protocol security. AVISPA simulator also demonstrates the proposed scheme security against active attacks, namely, man-in-the-middle attack and replay attack. Additionally, through the comparison of computational efficiency and security attributes with several recent results, proposed scheme seems to be battered.

show abstract

Cooperative Caching in Dynamic Shared Spectrum Networks

Cited by 16 publications

References 17 publications

Appropriate Channel Selection for Dynamic Resource Allocation with Priority Scheduling Approach in Multi-hop Cognitive Radio Networks

Appropriate Channel Selection for Dynamic Resource Allocation with Priority Scheduling Approach in Multi-hop Cognitive Radio Networks

Spectrum Handoffs Based on Preemptive Repeat Priority Queue in Cognitive Radio Networks

A Mutual Authentication Framework for Wireless Medical Sensor Networks

Contact Info

Product

Resources

About