Pub Date : 2010-07-08DOI: 10.1109/WCNC.2010.5506433
Mohamed Noune, A. Nix
Single-Carrier Frequency Division Multiple Access (SC-FDMA) has been selected as the uplink transmission scheme in the 3GPP Long Term Evolution standard. SC-FDMA has reduced sensitivity to phase noise and a lower Peak-to-Average Power Ratio (PAPR) compared to Orthogonal Frequency Division Multiple Access. In this paper we propose joint Tomlinson-Harashima Precoding and transmit power allocation for SC-FDMA. We derive the optimum power allocation for SC-FDMA transmission for both Zero-Forcing (ZF) and Minimum Mean-Square Error (MMSE) LE receivers in order to maximize the achievable data rate subject to constant transmit power. Although this improves the system's performance and offers a 1-2 dB improvement over Frequency-Domain Decision Feedback Equalization (FD-DFE), when the proposed transmit power allocation scheme is combined with decision feedback equalization the system incurs a performance degradation due to error propagation. In this paper we propose a joint implementation of the derived power allocation scheme with THP. Here we show that the system's performance is further improved over both FD-LE and FD-DFE when transmit power allocation is applied.
{"title":"Joint Tomlinson-Harashima Precoding and Optimum Transmit Power Allocation for SC-FDMA","authors":"Mohamed Noune, A. Nix","doi":"10.1109/WCNC.2010.5506433","DOIUrl":"https://doi.org/10.1109/WCNC.2010.5506433","url":null,"abstract":"Single-Carrier Frequency Division Multiple Access (SC-FDMA) has been selected as the uplink transmission scheme in the 3GPP Long Term Evolution standard. SC-FDMA has reduced sensitivity to phase noise and a lower Peak-to-Average Power Ratio (PAPR) compared to Orthogonal Frequency Division Multiple Access. In this paper we propose joint Tomlinson-Harashima Precoding and transmit power allocation for SC-FDMA. We derive the optimum power allocation for SC-FDMA transmission for both Zero-Forcing (ZF) and Minimum Mean-Square Error (MMSE) LE receivers in order to maximize the achievable data rate subject to constant transmit power. Although this improves the system's performance and offers a 1-2 dB improvement over Frequency-Domain Decision Feedback Equalization (FD-DFE), when the proposed transmit power allocation scheme is combined with decision feedback equalization the system incurs a performance degradation due to error propagation. In this paper we propose a joint implementation of the derived power allocation scheme with THP. Here we show that the system's performance is further improved over both FD-LE and FD-DFE when transmit power allocation is applied.","PeriodicalId":102524,"journal":{"name":"2010 IEEE Wireless Communication and Networking Conference","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121315837","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 : 2010-07-08DOI: 10.1109/WCNC.2010.5506482
T. Dai, J. Agbinya
An increasing body of protocols has been proposed in recent years for detecting node replication attack in sensor networks. Most of them however expose the following limitations: high performance overheads, unreasonable assumptions, etc. To address these issues, we propose two new protocols in this paper: LANCE and SACRED. LANCE is designed to be light-weight in performance at the cost of slightly weaker security robustness while SACRED obtains much greater security by trading off small performance. Theoretical analysis and simulations have also been conducted to evaluate the protocols in terms of security features and performance overheads.
{"title":"Early and Lightweight Distributed Detection of Node Replication Attack in Sensor Networks","authors":"T. Dai, J. Agbinya","doi":"10.1109/WCNC.2010.5506482","DOIUrl":"https://doi.org/10.1109/WCNC.2010.5506482","url":null,"abstract":"An increasing body of protocols has been proposed in recent years for detecting node replication attack in sensor networks. Most of them however expose the following limitations: high performance overheads, unreasonable assumptions, etc. To address these issues, we propose two new protocols in this paper: LANCE and SACRED. LANCE is designed to be light-weight in performance at the cost of slightly weaker security robustness while SACRED obtains much greater security by trading off small performance. Theoretical analysis and simulations have also been conducted to evaluate the protocols in terms of security features and performance overheads.","PeriodicalId":102524,"journal":{"name":"2010 IEEE Wireless Communication and Networking Conference","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114419964","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 : 2010-04-18DOI: 10.1109/WCNC.2010.5506613
M. J. Taghiyar, S. Muhaidat, Jie Liang
In this paper, we analyze the impact of imperfect channel estimation on the performance of pilot symbol assisted modulation (PSAM) used in a relay communication system with distributed space time block code (STBC) and amplify-and-forward protocol. We derive correlation coefficients between the channel coefficients and their estimates when the relay-to-destination link is either non-fading or fading, in terms of Doppler frequency, number of pilot symbols and SNR. This enables us to choose the optimum number of pilot symbols to compensate for the estimation error when the fading and Doppler effects are severe. Our performance analysis demonstrates that the presence of fading in the relay-to-destination link manifests itself by introducing additional Doppler frequency terms. Furthermore, we derive a tight lower bound for the bit error rate (BER) of BPSK modulation with channel estimation errors in terms of cross correlation coeffcients and the number of pilot symbols. Simulation results are also presented to validate our analytical results.
{"title":"On the Performance of Pilot Symbol Assisted Modulation for Cooperative Systems with Imperfect Channel Estimation","authors":"M. J. Taghiyar, S. Muhaidat, Jie Liang","doi":"10.1109/WCNC.2010.5506613","DOIUrl":"https://doi.org/10.1109/WCNC.2010.5506613","url":null,"abstract":"In this paper, we analyze the impact of imperfect channel estimation on the performance of pilot symbol assisted modulation (PSAM) used in a relay communication system with distributed space time block code (STBC) and amplify-and-forward protocol. We derive correlation coefficients between the channel coefficients and their estimates when the relay-to-destination link is either non-fading or fading, in terms of Doppler frequency, number of pilot symbols and SNR. This enables us to choose the optimum number of pilot symbols to compensate for the estimation error when the fading and Doppler effects are severe. Our performance analysis demonstrates that the presence of fading in the relay-to-destination link manifests itself by introducing additional Doppler frequency terms. Furthermore, we derive a tight lower bound for the bit error rate (BER) of BPSK modulation with channel estimation errors in terms of cross correlation coeffcients and the number of pilot symbols. Simulation results are also presented to validate our analytical results.","PeriodicalId":102524,"journal":{"name":"2010 IEEE Wireless Communication and Networking Conference","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114656558","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 : 2010-04-18DOI: 10.1109/WCNC.2010.5506132
Yoshihiro Ikeda, Hiroki Nishiyama, N. Ansari, Y. Nemoto, N. Kato
While Transmission Control Protocol (TCP) is the most popular transport protocol used in terrestrial networks, its performance is not adequate in wireless networks with long delay, e.g., satellite networks. Though some improvements of TCP and new transport protocols have been proposed, we focus on Variable-structure congestion Control Protocol (VCP) designed for high Bandwidth Delay Product (BDP) networks. In VCP, Explicit Congestion Notification (ECN) is used to generate the feedback signal from routers to sources in order to notify the utilization ratio of a bottleneck link. By adjusting its congestion window according to the network traffic conditions, VCP is able to achieve high link utilization even in high BDP networks. However, VCP requires a long time to fill the link capacity due to its more conservative window control mechanism than the slow start phase in TCP. In addition, throughput is unnecessarily degraded in VCP due to packet losses in wireless environments. In this paper, to address these issues, we propose two extensions of VCP, namely Bandwidth-Independent Start-up Extension (BISE) and Wireless Loss Tolerant Extension (WLTE). BISE can quickly increase its congestion window in the start-up phase. WLTE can maintain high throughput in wireless environments. The performance of the proposed schemes is evaluated through computer simulations. The results demonstrate that the proposed schemes dramatically improve the performance of VCP in the initial phase and also in wireless environments.
{"title":"Extensions of VCP to Enhance the Performance in High BDP and Wireless Networks","authors":"Yoshihiro Ikeda, Hiroki Nishiyama, N. Ansari, Y. Nemoto, N. Kato","doi":"10.1109/WCNC.2010.5506132","DOIUrl":"https://doi.org/10.1109/WCNC.2010.5506132","url":null,"abstract":"While Transmission Control Protocol (TCP) is the most popular transport protocol used in terrestrial networks, its performance is not adequate in wireless networks with long delay, e.g., satellite networks. Though some improvements of TCP and new transport protocols have been proposed, we focus on Variable-structure congestion Control Protocol (VCP) designed for high Bandwidth Delay Product (BDP) networks. In VCP, Explicit Congestion Notification (ECN) is used to generate the feedback signal from routers to sources in order to notify the utilization ratio of a bottleneck link. By adjusting its congestion window according to the network traffic conditions, VCP is able to achieve high link utilization even in high BDP networks. However, VCP requires a long time to fill the link capacity due to its more conservative window control mechanism than the slow start phase in TCP. In addition, throughput is unnecessarily degraded in VCP due to packet losses in wireless environments. In this paper, to address these issues, we propose two extensions of VCP, namely Bandwidth-Independent Start-up Extension (BISE) and Wireless Loss Tolerant Extension (WLTE). BISE can quickly increase its congestion window in the start-up phase. WLTE can maintain high throughput in wireless environments. The performance of the proposed schemes is evaluated through computer simulations. The results demonstrate that the proposed schemes dramatically improve the performance of VCP in the initial phase and also in wireless environments.","PeriodicalId":102524,"journal":{"name":"2010 IEEE Wireless Communication and Networking Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121337451","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 : 2010-04-18DOI: 10.1109/WCNC.2010.5506270
S. Sayed, Yang Yang, Haiyou Guo, Honglin Hu
High energy consumption at mobile devices is a critical issue for end users to access and enjoy high data-rate multimedia applications and services in Wireless Local Area Networks (WLANs). This paper develops an analytical framework for analyzing and comparing the energy efficiency performance of IEEE 802.11n Medium Access Control (MAC) protocol and a Busy Tone Based Cooperative MAC Protocol(namely BTAC) in multi-rate WLANs. Our proposed analytical model considers the impact of dynamic radio channel conditions and multi-rate transmission scenarios. Analytical and simulation results show that BTAC can achieve up to 50% energy saving, comparing to the IEEE 802.11n MAC protocol, under different radio channel conditions, network sizes and traffic loads.
{"title":"Analysis of Energy Efficiency of a Busy Tone Based Cooperative MAC Protocol for Multi-Rate WLANs","authors":"S. Sayed, Yang Yang, Haiyou Guo, Honglin Hu","doi":"10.1109/WCNC.2010.5506270","DOIUrl":"https://doi.org/10.1109/WCNC.2010.5506270","url":null,"abstract":"High energy consumption at mobile devices is a critical issue for end users to access and enjoy high data-rate multimedia applications and services in Wireless Local Area Networks (WLANs). This paper develops an analytical framework for analyzing and comparing the energy efficiency performance of IEEE 802.11n Medium Access Control (MAC) protocol and a Busy Tone Based Cooperative MAC Protocol(namely BTAC) in multi-rate WLANs. Our proposed analytical model considers the impact of dynamic radio channel conditions and multi-rate transmission scenarios. Analytical and simulation results show that BTAC can achieve up to 50% energy saving, comparing to the IEEE 802.11n MAC protocol, under different radio channel conditions, network sizes and traffic loads.","PeriodicalId":102524,"journal":{"name":"2010 IEEE Wireless Communication and Networking Conference","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127261606","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 : 2010-04-18DOI: 10.1109/WCNC.2010.5506125
Liping Wang, Yusheng Ji, Fuqiang Liu
The deployment of relay stations in OFDMA cellular networks is a promising solution to provide ubiquitous high- data-rate coverage. However, it makes the resource allocation a more crucial and challenging task. In OFDMA relay-enhanced cellular networks, we formulate the optimal instantaneous resource allocation problem including path selection, power allocation and subchannel scheduling to achieve the proportional fairness in the long term. We first propose a low-complex resource allocation algorithm named 'VF w PF' under the constant uniform power allocation, and then use a void filling method to make full use of the wasted resources caused by the unbalanced data rates of the two hops in a relaying path. We further use a dual decomposition approach to solve the original optimization problem efficiently in its Lagrangian dual domain, and propose a modified iterative water-filling algorithm named 'PA w PF'. Simulation results show that our resource allocation algorithms improve the throughput for cell-edge users, and achieve a tradeoff between system throughput maximization and fairness among users. Moreover, compared with the constant power allocation, the optimal power allocation can not gain much in system throughput but can significantly improve the throughput for cell-edge users and also the fairness.
在OFDMA蜂窝网络中部署中继站是一种很有前途的解决方案，可以提供无处不在的高数据速率覆盖。然而，它使资源分配成为一项更加关键和具有挑战性的任务。在OFDMA中继增强蜂窝网络中，我们制定了包括路径选择、功率分配和子信道调度在内的最优瞬时资源分配问题，以实现长期的比例公平性。首先提出了一种恒均匀功率分配下的低复杂度资源分配算法“VF w PF”，然后利用空白填充法充分利用中继路径中两跳数据速率不平衡所造成的资源浪费。在此基础上，利用对偶分解方法在拉格朗日对偶域高效求解原优化问题，并提出了一种改进的迭代注水算法“PA w PF”。仿真结果表明，我们的资源分配算法提高了蜂窝边缘用户的吞吐量，实现了系统吞吐量最大化和用户间公平性之间的平衡。此外，与恒功率分配相比，最优功率分配不会增加系统吞吐量，但可以显著提高蜂窝边缘用户的吞吐量和公平性。
{"title":"Joint Optimization for Proportional Fairness in OFDMA Relay-Enhanced Cellular Networks","authors":"Liping Wang, Yusheng Ji, Fuqiang Liu","doi":"10.1109/WCNC.2010.5506125","DOIUrl":"https://doi.org/10.1109/WCNC.2010.5506125","url":null,"abstract":"The deployment of relay stations in OFDMA cellular networks is a promising solution to provide ubiquitous high- data-rate coverage. However, it makes the resource allocation a more crucial and challenging task. In OFDMA relay-enhanced cellular networks, we formulate the optimal instantaneous resource allocation problem including path selection, power allocation and subchannel scheduling to achieve the proportional fairness in the long term. We first propose a low-complex resource allocation algorithm named 'VF w PF' under the constant uniform power allocation, and then use a void filling method to make full use of the wasted resources caused by the unbalanced data rates of the two hops in a relaying path. We further use a dual decomposition approach to solve the original optimization problem efficiently in its Lagrangian dual domain, and propose a modified iterative water-filling algorithm named 'PA w PF'. Simulation results show that our resource allocation algorithms improve the throughput for cell-edge users, and achieve a tradeoff between system throughput maximization and fairness among users. Moreover, compared with the constant power allocation, the optimal power allocation can not gain much in system throughput but can significantly improve the throughput for cell-edge users and also the fairness.","PeriodicalId":102524,"journal":{"name":"2010 IEEE Wireless Communication and Networking Conference","volume":"40 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127443437","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 : 2010-04-18DOI: 10.1109/WCNC.2010.5506697
W. Kiess, Till Elsner, B. Scheuermann, M. Mauve
Access point sharing communities are an attractive solution for low-cost global mobile Internet access. However, existing communities all require a central authority in form of a certificate authority or an authentication server. In his paper, we show how such a community network can be created without a central entity. We introduce a mechanism called remote station approval; a host can use it to offer Internet access without requiring a central instance and without the risk of legal responsibility for the guests' traffic. We discuss how our system preserves the anonymity of its users and present a prototype implementation and some first performance figures.
{"title":"Global Grassroots WiFi Sharing","authors":"W. Kiess, Till Elsner, B. Scheuermann, M. Mauve","doi":"10.1109/WCNC.2010.5506697","DOIUrl":"https://doi.org/10.1109/WCNC.2010.5506697","url":null,"abstract":"Access point sharing communities are an attractive solution for low-cost global mobile Internet access. However, existing communities all require a central authority in form of a certificate authority or an authentication server. In his paper, we show how such a community network can be created without a central entity. We introduce a mechanism called remote station approval; a host can use it to offer Internet access without requiring a central instance and without the risk of legal responsibility for the guests' traffic. We discuss how our system preserves the anonymity of its users and present a prototype implementation and some first performance figures.","PeriodicalId":102524,"journal":{"name":"2010 IEEE Wireless Communication and Networking Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127531336","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 : 2010-04-18DOI: 10.1109/WCNC.2010.5506502
D. Niyato, Ping Wang, W. Saad, A. Hjørungnes
In vehicular-to-roadside (V2R) communications the bandwidth from roadside units (RSUs) can be shared among the vehicular users in order to improve the resource utilization and reduce the costs of bandwidth reservation. We formulate a coalitional game model to analyze the situation in which multiple vehicular users can cooperate for sharing the bandwidth from serving RSUs. First, we consider a emph{rational coalition formation} approach in which each vehicular user is self-interested, and, hence, decides to join the coalition which maximizes its individual utility. For this approach, we propose a dynamic model based on Markov chain which allows to obtain a stable coalitional structure. Further, for implementation of rational coalition formation, we propose a distributed algorithm based on well-defined merge and split mechanisms. Then, we consider the optimal coalition formation process in which the coalitions are formed so that the social welfare of all vehicular users is maximized. The performance evaluation shows that optimal coalition formation yields a higher utility than rational coalition formation due to the group-interest of all vehicular users. Also, both optimal and rational coalition formation achieve a significantly higher utility than the case without bandwidth sharing (non-cooperative case).
{"title":"Coalition Formation Games for Bandwidth Sharing in Vehicle-To-Roadside Communications","authors":"D. Niyato, Ping Wang, W. Saad, A. Hjørungnes","doi":"10.1109/WCNC.2010.5506502","DOIUrl":"https://doi.org/10.1109/WCNC.2010.5506502","url":null,"abstract":"In vehicular-to-roadside (V2R) communications the bandwidth from roadside units (RSUs) can be shared among the vehicular users in order to improve the resource utilization and reduce the costs of bandwidth reservation. We formulate a coalitional game model to analyze the situation in which multiple vehicular users can cooperate for sharing the bandwidth from serving RSUs. First, we consider a emph{rational coalition formation} approach in which each vehicular user is self-interested, and, hence, decides to join the coalition which maximizes its individual utility. For this approach, we propose a dynamic model based on Markov chain which allows to obtain a stable coalitional structure. Further, for implementation of rational coalition formation, we propose a distributed algorithm based on well-defined merge and split mechanisms. Then, we consider the optimal coalition formation process in which the coalitions are formed so that the social welfare of all vehicular users is maximized. The performance evaluation shows that optimal coalition formation yields a higher utility than rational coalition formation due to the group-interest of all vehicular users. Also, both optimal and rational coalition formation achieve a significantly higher utility than the case without bandwidth sharing (non-cooperative case).","PeriodicalId":102524,"journal":{"name":"2010 IEEE Wireless Communication and Networking Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125006628","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 : 2010-04-18DOI: 10.1109/WCNC.2010.5506634
Euisin Lee, Fucai Yu, Soochang Park, Juhyun Jung, Sang-Ha Kim, Sungkee Noh
In wireless sensor networks, a geographic routing requests source nodes (sensor nodes) to know location information of destination nodes (sinks) to send their data. To address this issue, many sink location service schemes have been proposed in the literature. They are designed to support only one communication mode such as unicast, anycast, manycast, or multicast communication modes. However, because an application can have one or more communication modes or a sensor network can operate several applications with each communication mode, it is necessary for a scheme to support all communication modes. Hence, we propose a general sink location service scheme for supporting all communication modes. The proposed scheme modifies the basic idea of the existing one proposed for unicast communication mode and extends it for supporting all communication modes. Simulation results show that the proposed scheme is superior to other sink location service schemes when supporting all communication modes.
{"title":"General Sink Location Service Based on Circle and Line Paths in Wireless Sensor Networks","authors":"Euisin Lee, Fucai Yu, Soochang Park, Juhyun Jung, Sang-Ha Kim, Sungkee Noh","doi":"10.1109/WCNC.2010.5506634","DOIUrl":"https://doi.org/10.1109/WCNC.2010.5506634","url":null,"abstract":"In wireless sensor networks, a geographic routing requests source nodes (sensor nodes) to know location information of destination nodes (sinks) to send their data. To address this issue, many sink location service schemes have been proposed in the literature. They are designed to support only one communication mode such as unicast, anycast, manycast, or multicast communication modes. However, because an application can have one or more communication modes or a sensor network can operate several applications with each communication mode, it is necessary for a scheme to support all communication modes. Hence, we propose a general sink location service scheme for supporting all communication modes. The proposed scheme modifies the basic idea of the existing one proposed for unicast communication mode and extends it for supporting all communication modes. Simulation results show that the proposed scheme is superior to other sink location service schemes when supporting all communication modes.","PeriodicalId":102524,"journal":{"name":"2010 IEEE Wireless Communication and Networking Conference","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126184924","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 : 2010-04-18DOI: 10.1109/WCNC.2010.5506259
Dac-Tu Ho, Jingyu Park, S. Shimamoto, J. Kitaori
This paper introduces a new kind of communication system that is proposed for oceanic air traffic control, especially works under the high air traffic conditions. The aircraft position reports are sent to the ground controllers by relaying them via other aircrafts. To do so, multi-hop ad-hoc networks that are based on these aircrafts is proposed to use. In addition, a proper multiple access scheme with optimal values is also proposed that allows the aircrafts to operate autonomously in a valid region. Furthermore, with accurate time obtained from equipped means, the Position aided-autonomous idle timeslot reuse scheme (PA-AITR) is proposed to reuse the idle timeslots caused by the sparse aircraft distributions. And another scheme, that is proposed to improve the connectivity under sparse aircraft distributions; which is aided by interference power in the feedback information (IB-NS). In all, the combined conditions and schemes show the applicability to utilize this system for future air traffic control communications.
{"title":"Performance Evaluation of Communication System Proposed for Oceanic Air Traffic Control","authors":"Dac-Tu Ho, Jingyu Park, S. Shimamoto, J. Kitaori","doi":"10.1109/WCNC.2010.5506259","DOIUrl":"https://doi.org/10.1109/WCNC.2010.5506259","url":null,"abstract":"This paper introduces a new kind of communication system that is proposed for oceanic air traffic control, especially works under the high air traffic conditions. The aircraft position reports are sent to the ground controllers by relaying them via other aircrafts. To do so, multi-hop ad-hoc networks that are based on these aircrafts is proposed to use. In addition, a proper multiple access scheme with optimal values is also proposed that allows the aircrafts to operate autonomously in a valid region. Furthermore, with accurate time obtained from equipped means, the Position aided-autonomous idle timeslot reuse scheme (PA-AITR) is proposed to reuse the idle timeslots caused by the sparse aircraft distributions. And another scheme, that is proposed to improve the connectivity under sparse aircraft distributions; which is aided by interference power in the feedback information (IB-NS). In all, the combined conditions and schemes show the applicability to utilize this system for future air traffic control communications.","PeriodicalId":102524,"journal":{"name":"2010 IEEE Wireless Communication and Networking Conference","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123321595","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
扫码关注我们
求助内容：
应助结果提醒方式：