Pub Date : 2012-06-10DOI: 10.1109/ICC.2012.6363642
Xu Li, N. Mitton, A. Nayak, I. Stojmenovic
We propose to apply the concept of Cost-to-Progress Ratio (CPR) in greedy routing for load reduction and balancing. The load of a node is the percentage of time it is occupied by forwarding traffic or inability to forward due to interference. The resultant routing protocol, named CPR-routing, is a localized parameterless approach, optimizing the ratio of nodal load and geographic progress. Through extensive simulation, we evaluate it in comparison with an existing parameter-based localized solution, α-routing. Our simulation results indicate that CPR-routing outperforms α-routing in per node load, success rate, and average hop count.
{"title":"Localized load-aware geographic routing in wireless ad hoc networks","authors":"Xu Li, N. Mitton, A. Nayak, I. Stojmenovic","doi":"10.1109/ICC.2012.6363642","DOIUrl":"https://doi.org/10.1109/ICC.2012.6363642","url":null,"abstract":"We propose to apply the concept of Cost-to-Progress Ratio (CPR) in greedy routing for load reduction and balancing. The load of a node is the percentage of time it is occupied by forwarding traffic or inability to forward due to interference. The resultant routing protocol, named CPR-routing, is a localized parameterless approach, optimizing the ratio of nodal load and geographic progress. Through extensive simulation, we evaluate it in comparison with an existing parameter-based localized solution, α-routing. Our simulation results indicate that CPR-routing outperforms α-routing in per node load, success rate, and average hop count.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126652129","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 : 2012-06-10DOI: 10.1109/ICC.2012.6363866
Hailong Li, Vaibhav R. Pandit, Yang Chi, D. Agrawal
In this paper, we explore two specific Wireless Sensor Network applications of environmental monitoring and motion capturing, where the traditional methods of energy-balanced data propagation are not ideally suited. These solutions are either too generic to exploit the specific characteristic of our application or are too complex to be implemented for simplistic requirements of our application. We propose and analyse a simple, energy efficient and energy balanced algorithm for the propagation of data in our specific application which can be used in other Wireless Sensor Networks with similar characteristics and requirements. We first model our problem using Integer Programming to find an optimal solution which is NP hard to solve. Subsequently, we also provide a heuristic solution that prolongs the lifetime of our network to near the optimal value.
{"title":"Lifetime optimization of Wireless Sensor Networks with packet propagation table","authors":"Hailong Li, Vaibhav R. Pandit, Yang Chi, D. Agrawal","doi":"10.1109/ICC.2012.6363866","DOIUrl":"https://doi.org/10.1109/ICC.2012.6363866","url":null,"abstract":"In this paper, we explore two specific Wireless Sensor Network applications of environmental monitoring and motion capturing, where the traditional methods of energy-balanced data propagation are not ideally suited. These solutions are either too generic to exploit the specific characteristic of our application or are too complex to be implemented for simplistic requirements of our application. We propose and analyse a simple, energy efficient and energy balanced algorithm for the propagation of data in our specific application which can be used in other Wireless Sensor Networks with similar characteristics and requirements. We first model our problem using Integer Programming to find an optimal solution which is NP hard to solve. Subsequently, we also provide a heuristic solution that prolongs the lifetime of our network to near the optimal value.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114946938","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 : 2012-06-10DOI: 10.1109/ICC.2012.6364549
H. Nicanfar, Paria Jokar, Victor C. M. Leung
Due to the extensive use of wireless technologies, security is one of the most important and challenging issues in smart grid networks. To secure data communications, strong authentication and key management mechanisms are needed. In this paper, we propose a mutual authentication scheme and key management protocol tailored for Home Area Network (HAN) with low overhead and enhanced robustness. Using identity-based cryptography technique, the proposed scheme broadcasts only a small packet to all HAN nodes to refresh their keys, thus significantly improving key management overhead cost by reducing network bandwidth. Analysis shows that the proposed scheme delivers required security against well-known HAN attacks, and can be easily adopted based on existing technologies.
{"title":"Efficient authentication and key management for the Home Area Network","authors":"H. Nicanfar, Paria Jokar, Victor C. M. Leung","doi":"10.1109/ICC.2012.6364549","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364549","url":null,"abstract":"Due to the extensive use of wireless technologies, security is one of the most important and challenging issues in smart grid networks. To secure data communications, strong authentication and key management mechanisms are needed. In this paper, we propose a mutual authentication scheme and key management protocol tailored for Home Area Network (HAN) with low overhead and enhanced robustness. Using identity-based cryptography technique, the proposed scheme broadcasts only a small packet to all HAN nodes to refresh their keys, thus significantly improving key management overhead cost by reducing network bandwidth. Analysis shows that the proposed scheme delivers required security against well-known HAN attacks, and can be easily adopted based on existing technologies.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115083057","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 : 2012-06-10DOI: 10.1109/ICC.2012.6364571
Hesham Elsawy, E. Hossain
Carrier-sense multiple access (CSMA) protocols coordinate the spectrum access to maximize the spatial frequency reuse and minimize the mutual interference in distributed wireless networks. Since the CSMA protocol correlates the positions of the simultaneously active transmitters, the analytically tractable Poisson point process (PPP) cannot be used to model the spatial distribution of the simultaneously active transmitters. Instead, the hard core point process (HCPP) is widely used to model the spatial distribution of the simultaneously active transmitters. However, the HCPP can be directly applied to CSMA random networks under deterministic channel gains only. In this paper, we integrate the fading and spatial distribution statistics in the analysis of the HCPP, and thus provide a unified framework to capture the intensity of simultaneously active transmitters in a random CSMA wireless network under general fading environments.
{"title":"Modeling random CSMA wireless networks in general fading environments","authors":"Hesham Elsawy, E. Hossain","doi":"10.1109/ICC.2012.6364571","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364571","url":null,"abstract":"Carrier-sense multiple access (CSMA) protocols coordinate the spectrum access to maximize the spatial frequency reuse and minimize the mutual interference in distributed wireless networks. Since the CSMA protocol correlates the positions of the simultaneously active transmitters, the analytically tractable Poisson point process (PPP) cannot be used to model the spatial distribution of the simultaneously active transmitters. Instead, the hard core point process (HCPP) is widely used to model the spatial distribution of the simultaneously active transmitters. However, the HCPP can be directly applied to CSMA random networks under deterministic channel gains only. In this paper, we integrate the fading and spatial distribution statistics in the analysis of the HCPP, and thus provide a unified framework to capture the intensity of simultaneously active transmitters in a random CSMA wireless network under general fading environments.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115590602","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 : 2012-06-10DOI: 10.1109/ICC.2012.6364434
Ning Zhang, N. Lu, R. Lu, J. Mark, Xuemin Shen
In this paper, a cooperative framework in cognitive radio networks, which addresses energy efficiency of the primary users (PUs) and trustworthiness of secondary users (SUs), is proposed. Specifically, the cooperation involves a PU selecting the most suitable SU as the cooperative relay and allocating the spectrum access intervals for relaying its message and rewarding the SU for its help in relaying the PU's message. Based on the PU's strategy, the selected SU determines its optimal transmission power. The above sequential decision procedure, with the PU as the leader and the SU as the follower, is formulated as a Stackelberg game. The outcomes of the proposed cooperative strategy, including partner selection, cooperation in an untrustworthy environment, and energy efficiency consideration, are analyzed. Numerical results demonstrate that, with the proposed relay selection scheme, the PU can achieve high energy saving through cooperation with the trustworthy SU.
{"title":"Energy-efficient and trust-aware cooperation in cognitive radio networks","authors":"Ning Zhang, N. Lu, R. Lu, J. Mark, Xuemin Shen","doi":"10.1109/ICC.2012.6364434","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364434","url":null,"abstract":"In this paper, a cooperative framework in cognitive radio networks, which addresses energy efficiency of the primary users (PUs) and trustworthiness of secondary users (SUs), is proposed. Specifically, the cooperation involves a PU selecting the most suitable SU as the cooperative relay and allocating the spectrum access intervals for relaying its message and rewarding the SU for its help in relaying the PU's message. Based on the PU's strategy, the selected SU determines its optimal transmission power. The above sequential decision procedure, with the PU as the leader and the SU as the follower, is formulated as a Stackelberg game. The outcomes of the proposed cooperative strategy, including partner selection, cooperation in an untrustworthy environment, and energy efficiency consideration, are analyzed. Numerical results demonstrate that, with the proposed relay selection scheme, the PU can achieve high energy saving through cooperation with the trustworthy SU.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116048752","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 : 2012-06-10DOI: 10.1109/ICC.2012.6364575
Nima Nikzad, Jinseok Yang, P. Zappi, T. Simunic, D. Krishnaswamy
While the connectivity, sensing, and computational capabilities of today's smartphones have increased, congestion in wireless channels and energy consumption remain major issues. We present a technique for model-driven adaptive environmental sensing, designed to reduce the amount of data that is communicated over the cellular network. In simulations of an exposure monitoring system, our technique reduced the number of messages sent by 85%, obtained power savings of 80% while generating a global model of pollution with error of maximum 0.5 ppm, a negligible amount for the application of interest.
{"title":"Model-driven adaptive wireless sensing for environmental healthcare feedback systems","authors":"Nima Nikzad, Jinseok Yang, P. Zappi, T. Simunic, D. Krishnaswamy","doi":"10.1109/ICC.2012.6364575","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364575","url":null,"abstract":"While the connectivity, sensing, and computational capabilities of today's smartphones have increased, congestion in wireless channels and energy consumption remain major issues. We present a technique for model-driven adaptive environmental sensing, designed to reduce the amount of data that is communicated over the cellular network. In simulations of an exposure monitoring system, our technique reduced the number of messages sent by 85%, obtained power savings of 80% while generating a global model of pollution with error of maximum 0.5 ppm, a negligible amount for the application of interest.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116382787","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 : 2012-06-10DOI: 10.1109/ICC.2012.6364491
Tianyu Wang, Lingyang Song, Zhu Han, Xiang Cheng, B. Jiao
We consider a cognitive radio network in which multiple pairs of secondary users (SUs) communicate by a one-way relay node over orthogonal channels with the existence of an eavesdropper close to the destination. The transmit power of the relay needs efficient distribution for maximizing the sum secrecy rate of the SU pairs, meanwhile satisfying the interference constraint at the single primary user (PU). Specifically, we introduce two multi-object auctions, i.e. the Vickrey auction and the sequential first-price auction, to perform this power allocation problem. We prove the existence and give the general form of the only equilibrium for each auction. We also propose two algorithms based on the equilibriums, respectively. From the simulation results, we see that the system secrecy rate curve of the Vickrey auction gradually coincides with that of the optimal allocation with increasing power units, while the sequential first-price auction reflects more fairness.
{"title":"Power allocation using Vickrey auction and sequential first-price auction games for physical layer security in cognitive relay networks","authors":"Tianyu Wang, Lingyang Song, Zhu Han, Xiang Cheng, B. Jiao","doi":"10.1109/ICC.2012.6364491","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364491","url":null,"abstract":"We consider a cognitive radio network in which multiple pairs of secondary users (SUs) communicate by a one-way relay node over orthogonal channels with the existence of an eavesdropper close to the destination. The transmit power of the relay needs efficient distribution for maximizing the sum secrecy rate of the SU pairs, meanwhile satisfying the interference constraint at the single primary user (PU). Specifically, we introduce two multi-object auctions, i.e. the Vickrey auction and the sequential first-price auction, to perform this power allocation problem. We prove the existence and give the general form of the only equilibrium for each auction. We also propose two algorithms based on the equilibriums, respectively. From the simulation results, we see that the system secrecy rate curve of the Vickrey auction gradually coincides with that of the optimal allocation with increasing power units, while the sequential first-price auction reflects more fairness.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122329220","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 : 2012-06-10DOI: 10.1109/ICC.2012.6363787
Ke Xiong, Pingyi Fan, K. Letaief, Su Yi, M. Lei
This paper investigates the resource allocation problem to minimize the downlink transmission delay under power constraints for two-way relay transmission using network coding over OFDM channels, where two sources with unbalanced traffic exchange their information via a relay node with network coding deployed. Since the explicit solution to this optimization problem is hard to obtain and with extremely high computation complexity even for numerical solution, we propose low-complexity suboptimal algorithms for the problem, where subcarrier assignment is carried out by assuming an equal power distribution at first and then optimal power allocation is executed to minimize the transmission delay. By simulations, the proposed resource allocation scheme is shown to achieve less than 1.01 times the optimal delay and outperform the strategies without network coding in overwhelming majority cases.
{"title":"Resource allocation for minimal downlink delay in two-way OFDM relaying with network coding","authors":"Ke Xiong, Pingyi Fan, K. Letaief, Su Yi, M. Lei","doi":"10.1109/ICC.2012.6363787","DOIUrl":"https://doi.org/10.1109/ICC.2012.6363787","url":null,"abstract":"This paper investigates the resource allocation problem to minimize the downlink transmission delay under power constraints for two-way relay transmission using network coding over OFDM channels, where two sources with unbalanced traffic exchange their information via a relay node with network coding deployed. Since the explicit solution to this optimization problem is hard to obtain and with extremely high computation complexity even for numerical solution, we propose low-complexity suboptimal algorithms for the problem, where subcarrier assignment is carried out by assuming an equal power distribution at first and then optimal power allocation is executed to minimize the transmission delay. By simulations, the proposed resource allocation scheme is shown to achieve less than 1.01 times the optimal delay and outperform the strategies without network coding in overwhelming majority cases.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122614090","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 : 2012-06-10DOI: 10.1109/ICC.2012.6363897
Xin Qu, C. Kang
The feasibility condition for interference alignment (IA) with no channel extension has not been known yet. In this paper, for the first time, we explore the feasibility of interference alignment and cancellation (IAC) which has been proposed for IA with no channel extension. We investigate IAC for the Gaussian interference multiple access channel (MAC) with K receivers and J users, each with M antennas. We establish and prove the general feasibility conditions of IAC. A graph theoretic approach is central to the results.
{"title":"On feasibility of interference alignment and cancellation for Gaussian interference multiple access channel","authors":"Xin Qu, C. Kang","doi":"10.1109/ICC.2012.6363897","DOIUrl":"https://doi.org/10.1109/ICC.2012.6363897","url":null,"abstract":"The feasibility condition for interference alignment (IA) with no channel extension has not been known yet. In this paper, for the first time, we explore the feasibility of interference alignment and cancellation (IAC) which has been proposed for IA with no channel extension. We investigate IAC for the Gaussian interference multiple access channel (MAC) with K receivers and J users, each with M antennas. We establish and prove the general feasibility conditions of IAC. A graph theoretic approach is central to the results.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122665520","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 : 2012-06-10DOI: 10.1109/ICC.2012.6364465
Md. Shohrab Hossain, Mohammed Atiquzzaman, W. Ivancic
Mobile networks can be formed in bus, train, aircrafts, satellites with a wide variety of on-board IP-enabled devices and Network Mobility (NEMO) protocols are required to support uninterrupted services to ongoing sessions. Earlier works have not demonstrated seamless handover for NEMO architecture. In this work, we proposed a handover scheme for NEMO that exploits the multi-homing feature of the Mobile Router and uses make-before-break strategy to ensure seamless handover for NEMO. Using experimental testbed, we have presented a thorough handoff performance evaluation of multihomed NEMO and compared it with basic NEMO. Results demonstrate that the proposed multihomed NEMO outperforms the basic NEMO while achieving seamless handover.
{"title":"Performance evaluation of multihomed NEMO","authors":"Md. Shohrab Hossain, Mohammed Atiquzzaman, W. Ivancic","doi":"10.1109/ICC.2012.6364465","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364465","url":null,"abstract":"Mobile networks can be formed in bus, train, aircrafts, satellites with a wide variety of on-board IP-enabled devices and Network Mobility (NEMO) protocols are required to support uninterrupted services to ongoing sessions. Earlier works have not demonstrated seamless handover for NEMO architecture. In this work, we proposed a handover scheme for NEMO that exploits the multi-homing feature of the Mobile Router and uses make-before-break strategy to ensure seamless handover for NEMO. Using experimental testbed, we have presented a thorough handoff performance evaluation of multihomed NEMO and compared it with basic NEMO. Results demonstrate that the proposed multihomed NEMO outperforms the basic NEMO while achieving seamless handover.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122819741","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
扫码关注我们
求助内容：
应助结果提醒方式：