Pub Date : 2014-04-06DOI: 10.1109/WCNC.2014.6952408
P. Mach, Zdenek Becvar
This paper focuses on mitigation of cross-tier and co-tier interference for dense deployment of the femtocells (FAPs). We propose a centralized dynamic radio resource allocation scheme exploiting graph theory approach. The FAPs either utilize an overlapping allocation mode (OAM) or a non-overlapping allocation mode (NAM). The allocation mode is dynamically selected by a control unit (CU) depending on the changing interference pattern among individual FAPs. The FAPs are assumed to be mutually interfered if interference is higher than a specified threshold. In order to create interference matrix among the FAPs, we use Bron-Kerbosch algorithm. In case the FAPs are assessed to be interfered, the CU also allocates resources in the NAM mode in dynamic nature in dependence on current traffic load of the FAPs. The results indicate that the proposal offers significantly higher throughput for the macro users than other competitive schemes. Simultaneously, femto users perform satisfactorily as well.
{"title":"Centralized dynamic resource allocation scheme for femtocells exploiting graph theory approach","authors":"P. Mach, Zdenek Becvar","doi":"10.1109/WCNC.2014.6952408","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952408","url":null,"abstract":"This paper focuses on mitigation of cross-tier and co-tier interference for dense deployment of the femtocells (FAPs). We propose a centralized dynamic radio resource allocation scheme exploiting graph theory approach. The FAPs either utilize an overlapping allocation mode (OAM) or a non-overlapping allocation mode (NAM). The allocation mode is dynamically selected by a control unit (CU) depending on the changing interference pattern among individual FAPs. The FAPs are assumed to be mutually interfered if interference is higher than a specified threshold. In order to create interference matrix among the FAPs, we use Bron-Kerbosch algorithm. In case the FAPs are assessed to be interfered, the CU also allocates resources in the NAM mode in dynamic nature in dependence on current traffic load of the FAPs. The results indicate that the proposal offers significantly higher throughput for the macro users than other competitive schemes. Simultaneously, femto users perform satisfactorily as well.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128749283","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}
Pub Date : 2014-04-06DOI: 10.1109/WCNC.2014.6952167
Alok Sethi, V. Tapio, M. Juntti
The self-interference (SI) channel in full duplex transceivers is investigated. The SI channel is measured using ultra wide-band antennas. Narrow-band measurement technique is used for the channel measurements so that spatial resolution of 4.3 cm is achieved. Measurements are done in a variety of locations including an anechoic chamber with different antenna orientation. Antennas are mounted on an old laptop frame. Coherence bandwidth of the SI channel is found to be varying between 1 MHz and 4 MHz, effectively making it a frequency selective channel. It is also observed that a major amount of power is transferred because of direct coupling between the antennas via the frame on which antennas are mounted.
{"title":"Self-interference channel for full duplex transceivers","authors":"Alok Sethi, V. Tapio, M. Juntti","doi":"10.1109/WCNC.2014.6952167","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952167","url":null,"abstract":"The self-interference (SI) channel in full duplex transceivers is investigated. The SI channel is measured using ultra wide-band antennas. Narrow-band measurement technique is used for the channel measurements so that spatial resolution of 4.3 cm is achieved. Measurements are done in a variety of locations including an anechoic chamber with different antenna orientation. Antennas are mounted on an old laptop frame. Coherence bandwidth of the SI channel is found to be varying between 1 MHz and 4 MHz, effectively making it a frequency selective channel. It is also observed that a major amount of power is transferred because of direct coupling between the antennas via the frame on which antennas are mounted.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128553944","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}
Pub Date : 2014-04-06DOI: 10.1109/WCNC.2014.6952480
Hao Zhou, Yusheng Ji, Jie Li, Bao-hua Zhao
Device-to-device (D2D) communication underlaying a cellular infrastructure has been proposed as a means of facilitating rich local services and offloading the base station traffic. However, D2D communication presents a challenge in radio resource management due to the potential interference it may cause to the cellular network. In this paper, the joint optimization problem of D2D mode selection, modulation and coding schemes (MCSs) assignment, radio resources and power allocation is formulated to minimize the overall power consumption under minimum required rate guarantee. The problem is decoupled into two sub-problems which are solved by Lagrangian relaxation and tabu search methods, respectively. Simulation results show its performance superiority over other schemes, especially in the scenarios with high required rate and limited resources.
{"title":"Joint mode selection, MCS assignment, resource allocation and power control for D2D communication underlaying cellular networks","authors":"Hao Zhou, Yusheng Ji, Jie Li, Bao-hua Zhao","doi":"10.1109/WCNC.2014.6952480","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952480","url":null,"abstract":"Device-to-device (D2D) communication underlaying a cellular infrastructure has been proposed as a means of facilitating rich local services and offloading the base station traffic. However, D2D communication presents a challenge in radio resource management due to the potential interference it may cause to the cellular network. In this paper, the joint optimization problem of D2D mode selection, modulation and coding schemes (MCSs) assignment, radio resources and power allocation is formulated to minimize the overall power consumption under minimum required rate guarantee. The problem is decoupled into two sub-problems which are solved by Lagrangian relaxation and tabu search methods, respectively. Simulation results show its performance superiority over other schemes, especially in the scenarios with high required rate and limited resources.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128580093","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}
Pub Date : 2014-04-06DOI: 10.1109/WCNC.2014.6952855
Xuefeng Xiao, Yong Li, Xiaoyan Kui
Targeting for providing communication services in the Intermittently Connected Vehicular Networks (ICVN) where there are no end-to-end communication and routing paths between vehicles, many relaying algorithms and routing protocol have been proposed under the assumption that vehicular nodes in the network are homogeneously distributed in the network with the same contact rate and delivery cost. However, experimental data has found the heterogeneous mobility behaviors with vehicles, and various applications of vehicular networks show that the vehicular nodes belong to different types on the aspects communication ability, mobility behaviors, etc. By utilizing these heterogeneous features to enhance the network performance, we investigate the issue of optinal relay selection schemes for ICVN consisting of heterogeneous vehicular nodes. We investigate both the case of in contact relaying and off contact relaying. In each relaying scenario, we select relay vehicles to optimize in reducing the message transmission cost at the same time satisfying the needed transmission ratio considering both the heterogeneous contact rates and transmission cost. Realistic trace driven simulations demonstrate the effective of the designed relaying schemes in various settings and realistic environment.
{"title":"Relay schemes for intermittently connected vehicular networks with heterogeneous nodes","authors":"Xuefeng Xiao, Yong Li, Xiaoyan Kui","doi":"10.1109/WCNC.2014.6952855","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952855","url":null,"abstract":"Targeting for providing communication services in the Intermittently Connected Vehicular Networks (ICVN) where there are no end-to-end communication and routing paths between vehicles, many relaying algorithms and routing protocol have been proposed under the assumption that vehicular nodes in the network are homogeneously distributed in the network with the same contact rate and delivery cost. However, experimental data has found the heterogeneous mobility behaviors with vehicles, and various applications of vehicular networks show that the vehicular nodes belong to different types on the aspects communication ability, mobility behaviors, etc. By utilizing these heterogeneous features to enhance the network performance, we investigate the issue of optinal relay selection schemes for ICVN consisting of heterogeneous vehicular nodes. We investigate both the case of in contact relaying and off contact relaying. In each relaying scenario, we select relay vehicles to optimize in reducing the message transmission cost at the same time satisfying the needed transmission ratio considering both the heterogeneous contact rates and transmission cost. Realistic trace driven simulations demonstrate the effective of the designed relaying schemes in various settings and realistic environment.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128685836","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}
Pub Date : 2014-04-06DOI: 10.1109/WCNC.2014.6952395
W. Miao, G. Min, Yuming Jiang, X. Jin, Haozhe Wang
Carrier Aggregation (CA) has emerged as a promising technique for Long-Term Evolution Advanced (LTE-A) wireless communications to satisfy the ever-increasing bandwidth requirements. However, this technical envisagement puts forward new challenges on radio resource allocation such as serious unbalanced loads among different Component Carriers (CCs). To alleviate this problem, a novel QoS-aware resource allocation scheme, termed as Cross-CC User Migration (CUM) scheme, is proposed in this paper to support real-time services, taking into consideration the system throughput, user fairness and QoS constraints. The experiment results show that the proposed scheme outperforms the well-known Two-Level scheduling scheme in terms of packet loss probability, average queue length and throughput per user.
{"title":"QoS-aware resource allocation for LTE-A systems with carrier aggregation","authors":"W. Miao, G. Min, Yuming Jiang, X. Jin, Haozhe Wang","doi":"10.1109/WCNC.2014.6952395","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952395","url":null,"abstract":"Carrier Aggregation (CA) has emerged as a promising technique for Long-Term Evolution Advanced (LTE-A) wireless communications to satisfy the ever-increasing bandwidth requirements. However, this technical envisagement puts forward new challenges on radio resource allocation such as serious unbalanced loads among different Component Carriers (CCs). To alleviate this problem, a novel QoS-aware resource allocation scheme, termed as Cross-CC User Migration (CUM) scheme, is proposed in this paper to support real-time services, taking into consideration the system throughput, user fairness and QoS constraints. The experiment results show that the proposed scheme outperforms the well-known Two-Level scheduling scheme in terms of packet loss probability, average queue length and throughput per user.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129154110","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}
Pub Date : 2014-04-06DOI: 10.1109/WCNC.2014.6952958
Yang Xia, C. Yeo
Existing literatures show that deploying fixed relay infrastructure with stable interconnections can help to improve network connectivity. However, fixed relay infrastructure is inflexible and could be costly to deploy over large area. In this paper, we study the effectiveness of mobile relays in improving network connectivity in both Random Waypoint and Manhattan mobility models. Through extensive simulation, it is observed that mobile relays help to effectively improve the network connectivity, prolong the mean contact duration and reduce the number of network partitions. The mobile relay approach is also compared with the alternative approach of increasing node density. Through the simulation results, it is observed that mobile relay approach is far more effective than the alternative approach. Furthermore, we observe that the expected contact duration remains brief even with the mobile relays and discuss the implication of this observation in the design of routing protocols and clustering algorithms.
{"title":"Using mobile relays as connectivity catalyst for highly mobile networks","authors":"Yang Xia, C. Yeo","doi":"10.1109/WCNC.2014.6952958","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952958","url":null,"abstract":"Existing literatures show that deploying fixed relay infrastructure with stable interconnections can help to improve network connectivity. However, fixed relay infrastructure is inflexible and could be costly to deploy over large area. In this paper, we study the effectiveness of mobile relays in improving network connectivity in both Random Waypoint and Manhattan mobility models. Through extensive simulation, it is observed that mobile relays help to effectively improve the network connectivity, prolong the mean contact duration and reduce the number of network partitions. The mobile relay approach is also compared with the alternative approach of increasing node density. Through the simulation results, it is observed that mobile relay approach is far more effective than the alternative approach. Furthermore, we observe that the expected contact duration remains brief even with the mobile relays and discuss the implication of this observation in the design of routing protocols and clustering algorithms.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124624651","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}
Pub Date : 2014-04-06DOI: 10.1109/WCNC.2014.6952444
Aizaz U. Chaudhry, R. Hafez, J. Chinneck
In a classical multi-radio multi-channel Wireless Mesh Network (WMN) architecture, mesh nodes use omni-directional antennas. Due to the circular radiation pattern of such antennas, when a mesh node communicates with its neighbor on a certain frequency channel, other mesh nodes within its range must remain silent. Directional antennas have been proposed as a way to improve spatial reuse. Since these antennas are non-steerable, they are not suitable for a dynamic WMN. In this paper, we address the problem of co-channel interference in a dynamic WMN environment by using beamforming based on utilizing the multiple omni-directional antennas of a multi-radio mesh node in the form of a linear antenna array. Our novel Linear Array Beamforming-based Channel Assignment method reduces the number of frequency channels required (NCR) for interference-free communication among the mesh nodes. It significantly outperforms the classical omni-directional antenna pattern-based channel assignment approach in terms of NCR for all node-degrees.
{"title":"Significantly reducing the number of frequency channels required for wireless mesh networks using beamforming","authors":"Aizaz U. Chaudhry, R. Hafez, J. Chinneck","doi":"10.1109/WCNC.2014.6952444","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952444","url":null,"abstract":"In a classical multi-radio multi-channel Wireless Mesh Network (WMN) architecture, mesh nodes use omni-directional antennas. Due to the circular radiation pattern of such antennas, when a mesh node communicates with its neighbor on a certain frequency channel, other mesh nodes within its range must remain silent. Directional antennas have been proposed as a way to improve spatial reuse. Since these antennas are non-steerable, they are not suitable for a dynamic WMN. In this paper, we address the problem of co-channel interference in a dynamic WMN environment by using beamforming based on utilizing the multiple omni-directional antennas of a multi-radio mesh node in the form of a linear antenna array. Our novel Linear Array Beamforming-based Channel Assignment method reduces the number of frequency channels required (NCR) for interference-free communication among the mesh nodes. It significantly outperforms the classical omni-directional antenna pattern-based channel assignment approach in terms of NCR for all node-degrees.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129696482","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}
Pub Date : 2014-04-06DOI: 10.1109/WCNC.2014.6952247
Rindranirina Ramamonjison, V. Bhargava
In this work, we investigate the robust energy-efficient transmission for the cognitive uplink wireless system. Precisely, we propose an optimization framework for maximizing the sum energy efficiency while taking into account the uncertainty of the channel between the primary and secondary users. Here, we assume that the base station has multiple antennas and employs a zero-forcing receive filter to eliminate the inter-user interference. We handle the intractability of the probabilistic interference constraints by approximating them with convex and linear surrogate constraints. Despite the non-convexity of the utility function, we propose a parametric convex programming approach to derive an optimal algorithm based on Newton method. Through numerical simulations, we show the convergence and effectiveness of the proposed method and analyze the effect of channel uncertainty on the energy efficiency of the cognitive uplink system.
{"title":"Sum energy-efficiency maximization for cognitive uplink networks with imperfect CSI","authors":"Rindranirina Ramamonjison, V. Bhargava","doi":"10.1109/WCNC.2014.6952247","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952247","url":null,"abstract":"In this work, we investigate the robust energy-efficient transmission for the cognitive uplink wireless system. Precisely, we propose an optimization framework for maximizing the sum energy efficiency while taking into account the uncertainty of the channel between the primary and secondary users. Here, we assume that the base station has multiple antennas and employs a zero-forcing receive filter to eliminate the inter-user interference. We handle the intractability of the probabilistic interference constraints by approximating them with convex and linear surrogate constraints. Despite the non-convexity of the utility function, we propose a parametric convex programming approach to derive an optimal algorithm based on Newton method. Through numerical simulations, we show the convergence and effectiveness of the proposed method and analyze the effect of channel uncertainty on the energy efficiency of the cognitive uplink system.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130341312","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}
Pub Date : 2014-04-06DOI: 10.1109/WCNC.2014.6952446
Masoumeh Moradian, Farid Ashtiani
In this paper, we propose distributed static and dynamic optimal policies in a random access environment, comprised of energy harvesting (EH) nodes, in order to maximize the sum throughput. In static approach, each EH node exploits an optimal constant power to transmit its packets. However in dynamic one, the EH nodes adjust their transmission powers based on their network information, leading to exploit variable transmission powers. In static algorithm, the maximization is done through modeling energy buffer of EH nodes by a two-dimensional discrete time Markov chain which includes the effect of on-line charging and limited energy buffer. However, in dynamic approach, the variable power is allotted to EH nodes through modeling the problem as a Markov decision process. We observe that dynamic approach outperforms the static one by suitable management of collisions and available energy. Simulation results confirm our analytical approach.
{"title":"Sum throughput maximization in a slotted Aloha network with energy harvesting nodes","authors":"Masoumeh Moradian, Farid Ashtiani","doi":"10.1109/WCNC.2014.6952446","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952446","url":null,"abstract":"In this paper, we propose distributed static and dynamic optimal policies in a random access environment, comprised of energy harvesting (EH) nodes, in order to maximize the sum throughput. In static approach, each EH node exploits an optimal constant power to transmit its packets. However in dynamic one, the EH nodes adjust their transmission powers based on their network information, leading to exploit variable transmission powers. In static algorithm, the maximization is done through modeling energy buffer of EH nodes by a two-dimensional discrete time Markov chain which includes the effect of on-line charging and limited energy buffer. However, in dynamic approach, the variable power is allotted to EH nodes through modeling the problem as a Markov decision process. We observe that dynamic approach outperforms the static one by suitable management of collisions and available energy. Simulation results confirm our analytical approach.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126795655","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}
Pub Date : 2014-04-06DOI: 10.1109/WCNC.2014.6952555
Jie Hu, Lie-liang Yang, L. Hanzo
Since mobile communications exhibit strong social characteristics, based on the potential common interests of mobile users, mobile social networks (MSNs) are capable of mitigating the tele-traffic bottleneck. By multicasting the content of common interest from a content owner to content seekers within the owner's transmission range, a distributed MSNs architecture is proposed, which is capable of mitigating the tele-traffic imposed on network operators. In this contribution, the social relationship between a pair of MSN users is defined according to their geographic characteristics. By jointly considering the geographic social relationships and the wireless propagation environment, we derive the closed-form equations for evaluating both the throughput and delay of the social unicast/multicast transmissions. Simulation results are provided, both for supporting our theoretical analysis, as well as for investigating the impact of social relationships on the achievable network performance. Based on the results presented, we conclude that a more socially-minded content owner is particularly efficient in multicasting the content of common interest to content seekers.
{"title":"Throughput and delay analysis of wireless multicast in distributed mobile social networks based on geographic social relationships","authors":"Jie Hu, Lie-liang Yang, L. Hanzo","doi":"10.1109/WCNC.2014.6952555","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952555","url":null,"abstract":"Since mobile communications exhibit strong social characteristics, based on the potential common interests of mobile users, mobile social networks (MSNs) are capable of mitigating the tele-traffic bottleneck. By multicasting the content of common interest from a content owner to content seekers within the owner's transmission range, a distributed MSNs architecture is proposed, which is capable of mitigating the tele-traffic imposed on network operators. In this contribution, the social relationship between a pair of MSN users is defined according to their geographic characteristics. By jointly considering the geographic social relationships and the wireless propagation environment, we derive the closed-form equations for evaluating both the throughput and delay of the social unicast/multicast transmissions. Simulation results are provided, both for supporting our theoretical analysis, as well as for investigating the impact of social relationships on the achievable network performance. Based on the results presented, we conclude that a more socially-minded content owner is particularly efficient in multicasting the content of common interest to content seekers.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123838161","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
扫码关注我们
求助内容：
应助结果提醒方式：