Utilising multiple channels can increase the wireless ad hoc network capacity. Receiver Directed Transmission protocol (RDT) is designed to provide multichannel access using a single radio interface. RDT introduces a clever approach to support channel assignment and negotiation without relying on a control channel or time synchronisation. Protocols based on the RDT scheme normally use an extra radio interface, dual home channel or time synchronisation to overcome the expected issues in RDT, such as, hidden terminal and deafness problems. This paper demonstrates that using RDT with a single radio and single home channel it is still possible to increase the network capacity. Additionally, the paper investigates the effect of node density, mobility and number of available channels on RDT performance. NS-2 simulator is used to evaluate the proposed scheme. Simulation results confirm that using multichannel RDT scheme can effectively increase the throughput, the packet delivery ratio and reduce the delay compared to single channel protocol.
{"title":"Performance evaluation of Receiver Directed Transmission protocol with a single transceiver in MANETs","authors":"Nawaf S. Mirza, Mohamed A. Abdelshafy, P. King","doi":"10.1109/WD.2017.7918153","DOIUrl":"https://doi.org/10.1109/WD.2017.7918153","url":null,"abstract":"Utilising multiple channels can increase the wireless ad hoc network capacity. Receiver Directed Transmission protocol (RDT) is designed to provide multichannel access using a single radio interface. RDT introduces a clever approach to support channel assignment and negotiation without relying on a control channel or time synchronisation. Protocols based on the RDT scheme normally use an extra radio interface, dual home channel or time synchronisation to overcome the expected issues in RDT, such as, hidden terminal and deafness problems. This paper demonstrates that using RDT with a single radio and single home channel it is still possible to increase the network capacity. Additionally, the paper investigates the effect of node density, mobility and number of available channels on RDT performance. NS-2 simulator is used to evaluate the proposed scheme. Simulation results confirm that using multichannel RDT scheme can effectively increase the throughput, the packet delivery ratio and reduce the delay compared to single channel protocol.","PeriodicalId":179998,"journal":{"name":"2017 Wireless Days","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132284736","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we investigate channel sensing and power control problems in a cluster-based cognitive radio wireless sensor network (CRWSN). We first propose three channel sensing algorithms to solve the channel sensing problem including availability constraints. Then a joint channel sensing and power control scheme (JCSPCS) is proposed to solve the power control problem including quality of service (QoS) constraints. We prove that all our algorithms are probably approximately correct (PAC) algorithms that can correctly identify a bad channel with high probability. We show that our algorithms are suitable for QoS-constrained applications as they all terminate in a finite time with a finite error rate. The performance of our channel sensing algorithms and the joint channel sensing and power control scheme is shown in the simulation results.
{"title":"Joint channel sensing and power control scheme for cognitive radio wireless sensor networks","authors":"Ziqiang Feng, I. Wassell","doi":"10.1109/WD.2017.7918139","DOIUrl":"https://doi.org/10.1109/WD.2017.7918139","url":null,"abstract":"In this paper, we investigate channel sensing and power control problems in a cluster-based cognitive radio wireless sensor network (CRWSN). We first propose three channel sensing algorithms to solve the channel sensing problem including availability constraints. Then a joint channel sensing and power control scheme (JCSPCS) is proposed to solve the power control problem including quality of service (QoS) constraints. We prove that all our algorithms are probably approximately correct (PAC) algorithms that can correctly identify a bad channel with high probability. We show that our algorithms are suitable for QoS-constrained applications as they all terminate in a finite time with a finite error rate. The performance of our channel sensing algorithms and the joint channel sensing and power control scheme is shown in the simulation results.","PeriodicalId":179998,"journal":{"name":"2017 Wireless Days","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128996701","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Karimzadeh, Luca Valtulina, H. V. D. Berg, A. Pras, M. Liebsch, T. Taleb
The existing LTE network architecture dose not scale well to increasing demands due to its highly centralized and hierarchical composition. In this paper we discuss the major modifications required in the current LTE network to realize a decentralized LTE architecture. Next, we develop two IP address mobility support schemes for this architecture. The proposed solutions can handle traffic redirecting and seamless IP address continuity for the nodes moving among the distributed anchor points in a resource efficient manner. Our approaches are based on the SDN (Software Defined Networking) paradigm which is also one of the most important candidate technologies to realize 5G mobile networks. We extend the NS3-LENA simulation software to implement a decentralized LTE network as well as the proposed IP mobility support schemes. The evaluation results show that the proposed solutions efficiently fulfill the functionality and performance requirements (e.g., latency and packet loss) related to mobility management.
{"title":"Software Defined Networking to support IP address mobility in future LTE network","authors":"M. Karimzadeh, Luca Valtulina, H. V. D. Berg, A. Pras, M. Liebsch, T. Taleb","doi":"10.1109/WD.2017.7918114","DOIUrl":"https://doi.org/10.1109/WD.2017.7918114","url":null,"abstract":"The existing LTE network architecture dose not scale well to increasing demands due to its highly centralized and hierarchical composition. In this paper we discuss the major modifications required in the current LTE network to realize a decentralized LTE architecture. Next, we develop two IP address mobility support schemes for this architecture. The proposed solutions can handle traffic redirecting and seamless IP address continuity for the nodes moving among the distributed anchor points in a resource efficient manner. Our approaches are based on the SDN (Software Defined Networking) paradigm which is also one of the most important candidate technologies to realize 5G mobile networks. We extend the NS3-LENA simulation software to implement a decentralized LTE network as well as the proposed IP mobility support schemes. The evaluation results show that the proposed solutions efficiently fulfill the functionality and performance requirements (e.g., latency and packet loss) related to mobility management.","PeriodicalId":179998,"journal":{"name":"2017 Wireless Days","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123719614","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we propose a new setup for a cooperative multi-relay non-orthogonal multiple access scheme (CMR-NOMA) to enhance the downlink performance of non-orthogonal multiple access, while operating in severe fading. We compare the performance of the proposed scheme to an existing cooperative non-orthogonal multiple access scheme (CNOMA) in terms of the user-average bit error rate, the ergodic sum-rate and the fairness index level, with a conventional NOMA system serving as the baseline for comparison. We also propose the use of a modified successive interference cancellation (SIC) technique at the mobile equipment in coded systems to reduce the highly-complex processing inherent in the recovery of NOMA signals.
{"title":"Cooperative multi-relay non-orthogonal multiple access for downlink transmission in 5G communication systems","authors":"A. Gendia, M. Elsabrouty, A. Emran","doi":"10.1109/WD.2017.7918121","DOIUrl":"https://doi.org/10.1109/WD.2017.7918121","url":null,"abstract":"In this paper, we propose a new setup for a cooperative multi-relay non-orthogonal multiple access scheme (CMR-NOMA) to enhance the downlink performance of non-orthogonal multiple access, while operating in severe fading. We compare the performance of the proposed scheme to an existing cooperative non-orthogonal multiple access scheme (CNOMA) in terms of the user-average bit error rate, the ergodic sum-rate and the fairness index level, with a conventional NOMA system serving as the baseline for comparison. We also propose the use of a modified successive interference cancellation (SIC) technique at the mobile equipment in coded systems to reduce the highly-complex processing inherent in the recovery of NOMA signals.","PeriodicalId":179998,"journal":{"name":"2017 Wireless Days","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127058445","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The Content-Centric Networking (CCN) concept is a significant approach of several future Internet research activities. CCN in Wireless Sensor Networks present a promised technique that may ensure data routing based on content. In this paper, we focus on the lifetime of the Content Object exchanged in the network and we explain the idea of its integration in CCN for WSNs to better highlight the relevance of its exploitation. To this end, we implement DFCCN-WSNs ‘Data Freshness aware Content-Centric Networking in Wireless Sensor Networks’ a protocol that implements the data lifetime. Through extensive simulations, we demonstrate that DFCCN-WSNs outperforms traditional CCN in terms of end-to-end delay.
{"title":"Data Freshness Aware Content-Centric Networking in WSNs","authors":"Ghada Jaber, Rahim Kacimi, T. Gayraud","doi":"10.1109/WD.2017.7918152","DOIUrl":"https://doi.org/10.1109/WD.2017.7918152","url":null,"abstract":"The Content-Centric Networking (CCN) concept is a significant approach of several future Internet research activities. CCN in Wireless Sensor Networks present a promised technique that may ensure data routing based on content. In this paper, we focus on the lifetime of the Content Object exchanged in the network and we explain the idea of its integration in CCN for WSNs to better highlight the relevance of its exploitation. To this end, we implement DFCCN-WSNs ‘Data Freshness aware Content-Centric Networking in Wireless Sensor Networks’ a protocol that implements the data lifetime. Through extensive simulations, we demonstrate that DFCCN-WSNs outperforms traditional CCN in terms of end-to-end delay.","PeriodicalId":179998,"journal":{"name":"2017 Wireless Days","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131229044","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this short paper, we study the deafness problem raised in the directional multi Gigabit transmission of IEEE 802.11ad standard which causes the devices to experience unequal chance of accessing the medium. We define three groups of Quasi-Omni (QO) antennas and propose two simple approaches to mitigate the deafness problem. Our simulation results show that the fairness increases up to 99% compared with current definition of IEEE 802.11ad which is less than 40%.
{"title":"A solution on deafness problem of WiGig networks based on IEEE 802.11ad","authors":"Parisa Mashinchi-Ghabel, H. Ajorloo, M. Shalmani","doi":"10.1109/WD.2017.7918105","DOIUrl":"https://doi.org/10.1109/WD.2017.7918105","url":null,"abstract":"In this short paper, we study the deafness problem raised in the directional multi Gigabit transmission of IEEE 802.11ad standard which causes the devices to experience unequal chance of accessing the medium. We define three groups of Quasi-Omni (QO) antennas and propose two simple approaches to mitigate the deafness problem. Our simulation results show that the fairness increases up to 99% compared with current definition of IEEE 802.11ad which is less than 40%.","PeriodicalId":179998,"journal":{"name":"2017 Wireless Days","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126387466","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Due to the complex nature of mobile ad hoc networks, simulation is an important tool used to explore approaches and validate research. De facto simulation tools for networking research such as ns-3 are extremely powerful. However, the time to develop, execute, and analyze a meaningful simulation in these tools can be significant. In addition to the unavoidable learning curve associated with the tool itself, the developer must have significant coding skills and domain knowledge. Once development of the simulation is complete, the time required to execute the simulation can be significant. In this paper, we present a case study that focuses on the use of the Netlogo tool to explore the impact of certain parameters on a cooperative cache deployed within a vehicular network. The results of the Netlogo simulation are then compared to the results of a similar simulation developed in ns-3. Our work shows that meaningful results can be obtained using Netlogo with less investment of time at the expense of flexibility and realism when compared to ns-3. With this approach, if the results of the Netlogo based simulation look promising, a greater investment in a more powerful and accurate simulation using ns-3 can be made. Utilizing this process saves the developer time by focusing on those approaches that look promising.
{"title":"Rapid prototyping of cooperative caching in a VANET: A case study","authors":"Steve Glass, I. Mahgoub, M. Rathod","doi":"10.1109/WD.2017.7918144","DOIUrl":"https://doi.org/10.1109/WD.2017.7918144","url":null,"abstract":"Due to the complex nature of mobile ad hoc networks, simulation is an important tool used to explore approaches and validate research. De facto simulation tools for networking research such as ns-3 are extremely powerful. However, the time to develop, execute, and analyze a meaningful simulation in these tools can be significant. In addition to the unavoidable learning curve associated with the tool itself, the developer must have significant coding skills and domain knowledge. Once development of the simulation is complete, the time required to execute the simulation can be significant. In this paper, we present a case study that focuses on the use of the Netlogo tool to explore the impact of certain parameters on a cooperative cache deployed within a vehicular network. The results of the Netlogo simulation are then compared to the results of a similar simulation developed in ns-3. Our work shows that meaningful results can be obtained using Netlogo with less investment of time at the expense of flexibility and realism when compared to ns-3. With this approach, if the results of the Netlogo based simulation look promising, a greater investment in a more powerful and accurate simulation using ns-3 can be made. Utilizing this process saves the developer time by focusing on those approaches that look promising.","PeriodicalId":179998,"journal":{"name":"2017 Wireless Days","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126033925","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Distributed Transactional Memory (DTM) is a concurrency mechanism aimed at simplifying distributed programming by allowing operations to execute atomically, mirroring the well-known transaction model of relational databases. DTM can play a fundamental role in the coordination of participants in mobile distributed applications. Most DTM solutions follow a full replication scheme, in spite of recent studies showing that partial replication approaches can present gains in scalability by reducing the amount of data stored at each node. This paper investigates the role of replica location in DTMs. The goal is to understand the effect of latency on the DTM's system performance in face of judicious replica distribution, taking into consideration the locations where data is more frequently accessed.
{"title":"Simulation of partial replication in Distributed Transactional Memory","authors":"Diogo Lima, Hugo M. Miranda, François Taïani","doi":"10.1109/WD.2017.7918115","DOIUrl":"https://doi.org/10.1109/WD.2017.7918115","url":null,"abstract":"Distributed Transactional Memory (DTM) is a concurrency mechanism aimed at simplifying distributed programming by allowing operations to execute atomically, mirroring the well-known transaction model of relational databases. DTM can play a fundamental role in the coordination of participants in mobile distributed applications. Most DTM solutions follow a full replication scheme, in spite of recent studies showing that partial replication approaches can present gains in scalability by reducing the amount of data stored at each node. This paper investigates the role of replica location in DTMs. The goal is to understand the effect of latency on the DTM's system performance in face of judicious replica distribution, taking into consideration the locations where data is more frequently accessed.","PeriodicalId":179998,"journal":{"name":"2017 Wireless Days","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129153368","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Delay Tolerant Networks (DTNs) ranging from Inter-Planetary Networks (IPN) to Vehicular Ad Hoc Networks (VANETs) are receiving continuous attention in recent years. The existing protocols for DTNs have been primarily designed and analyzed under the assumption that data traffic is either Constant Bit Rate (CBR) or Poisson. It has been observed that such models are incapable of capturing the inter-arrival behavior of the present day traffic which may be bursty in nature. The traffic characteristics in todays communication networks are statistically self-similar in nature, i.e., burstiness and correlation exists over many time scales, also referred to as Long Range Dependency (LRD). In this paper we analyze the traffic characteristics in the nodes of a delay tolerant network. Self-similar traffic is generated by implementing a traffic model in the source module of DTN. It is based on the model of aggregated ON/OFF sources. A mathematical analysis is provided to elucidate the cause of self similar nature of traffic in DTN. Through simulations and statistical analysis of the traffic data, we study the degree of self-similarity of traffic in the nodes of a vehicular delay tolerant network.
{"title":"Self-similarity of data traffic in a Delay Tolerant Network","authors":"Somreeta Pramanik, R. Datta, Puspal Chatterjee","doi":"10.1109/WD.2017.7918112","DOIUrl":"https://doi.org/10.1109/WD.2017.7918112","url":null,"abstract":"Delay Tolerant Networks (DTNs) ranging from Inter-Planetary Networks (IPN) to Vehicular Ad Hoc Networks (VANETs) are receiving continuous attention in recent years. The existing protocols for DTNs have been primarily designed and analyzed under the assumption that data traffic is either Constant Bit Rate (CBR) or Poisson. It has been observed that such models are incapable of capturing the inter-arrival behavior of the present day traffic which may be bursty in nature. The traffic characteristics in todays communication networks are statistically self-similar in nature, i.e., burstiness and correlation exists over many time scales, also referred to as Long Range Dependency (LRD). In this paper we analyze the traffic characteristics in the nodes of a delay tolerant network. Self-similar traffic is generated by implementing a traffic model in the source module of DTN. It is based on the model of aggregated ON/OFF sources. A mathematical analysis is provided to elucidate the cause of self similar nature of traffic in DTN. Through simulations and statistical analysis of the traffic data, we study the degree of self-similarity of traffic in the nodes of a vehicular delay tolerant network.","PeriodicalId":179998,"journal":{"name":"2017 Wireless Days","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117157933","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Zheng Chu, H. Nguyen, T. Le, M. Karamanoğlu, D. To, E. Ever, F. Al-turjman, A. Yazıcı
In this paper, we consider a secure wireless powered device-to-device (D2D) communication in the presence of the multiple eavesdroppers, where a smart hybrid base station (BS) in cellular network not only charges for the D2D transmitter to guarantee power efficiency for the D2D network, but also serves as a cooperative jammer (CJ) to interfere with the eavesdroppers. Although the cellular networks share their own spectrum with the D2D underlay network, both of them may not belong to the same service provider. Thus, the D2D transmitter charges for the energy services released by the hybrid BS. We formulate two Stackelberg game formulations to exploit the hierarchical interaction between the BS and the D2D transmitter with/without energy trading. The associated Stackelberg equilibriums of the formulated games are derived in terms of closed-form solutions. Simulation results are provided to validate our proposed schemes.
{"title":"Game theory based secure wireless powered D2D communications with cooperative jamming","authors":"Zheng Chu, H. Nguyen, T. Le, M. Karamanoğlu, D. To, E. Ever, F. Al-turjman, A. Yazıcı","doi":"10.1109/WD.2017.7918122","DOIUrl":"https://doi.org/10.1109/WD.2017.7918122","url":null,"abstract":"In this paper, we consider a secure wireless powered device-to-device (D2D) communication in the presence of the multiple eavesdroppers, where a smart hybrid base station (BS) in cellular network not only charges for the D2D transmitter to guarantee power efficiency for the D2D network, but also serves as a cooperative jammer (CJ) to interfere with the eavesdroppers. Although the cellular networks share their own spectrum with the D2D underlay network, both of them may not belong to the same service provider. Thus, the D2D transmitter charges for the energy services released by the hybrid BS. We formulate two Stackelberg game formulations to exploit the hierarchical interaction between the BS and the D2D transmitter with/without energy trading. The associated Stackelberg equilibriums of the formulated games are derived in terms of closed-form solutions. Simulation results are provided to validate our proposed schemes.","PeriodicalId":179998,"journal":{"name":"2017 Wireless Days","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126651521","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：