Pub Date : 2012-04-01DOI: 10.1109/WCNC.2012.6214503
N. Noels, M. Moeneclaey
This paper presents a new iterative multiuser (MU) detection algorithm for asynchronous spectrally-efficient continuous-phase modulation in additive white Gaussian noise. The proposed detector is derived from the sum-product (SP) algorithm and the factor graph (FG) framework, and performs approximate maximum a posteriori bit detection. A convenient FG of the actual MU detection problem is considered, rather than only FGs of the individual single-user detection problems combined with ad-hoc inter-user interference cancellation. A suitable set of SP messages is approximated by a Gaussian distribution; this considerably reduces the computational complexity and memory size requirements as compared to a straightforward application of the SP rules. The resulting algorithm succeeds in achieving a good error performance.
{"title":"Spectrally efficient CPM: Suboptimal FG-based multiuser detection","authors":"N. Noels, M. Moeneclaey","doi":"10.1109/WCNC.2012.6214503","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214503","url":null,"abstract":"This paper presents a new iterative multiuser (MU) detection algorithm for asynchronous spectrally-efficient continuous-phase modulation in additive white Gaussian noise. The proposed detector is derived from the sum-product (SP) algorithm and the factor graph (FG) framework, and performs approximate maximum a posteriori bit detection. A convenient FG of the actual MU detection problem is considered, rather than only FGs of the individual single-user detection problems combined with ad-hoc inter-user interference cancellation. A suitable set of SP messages is approximated by a Gaussian distribution; this considerably reduces the computational complexity and memory size requirements as compared to a straightforward application of the SP rules. The resulting algorithm succeeds in achieving a good error performance.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124213274","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-04-01DOI: 10.1109/WCNC.2012.6214223
E. Cruz, C. A. V. Campos, R. Pasquini, L. Faina, Rodolfo Oliveira
This paper presents the URBAN_XOR1 protocol, an XOR-based flat routing mechanism developed for vehicular ad hoc networks (VANETs) formed in urban scenarios. The paper firstly describes the URBAN_XOR routing principle, which requires reduced knowledge about the set of nodes present in the VANET in order to provide traffic forwarding. Basically, the URBAN XOR protocol introduces the concept of local visibility, prioritizing the insertion of closer neighbors (in number of hops) in the routing tables, and simplifying the management of the frequent network mobility found in VANETs. Then, the performance of the proposed URBAN_XOR protocol is compared through simulation with other topology-based and position-based protocols, characterizing its performance in terms of path availability ratio, end-to-end delay, path length and path duration. The results reveal that URBAN_XOR contributes for the overall network stability, reducing the end-to-end delay due to its ability of generating shorter paths. At the same time, URBAN_XOR exhibits path availability similar to other topology-based protocols, but exhibiting better path duration times.
{"title":"Performance analysis of XOR-based routing in urban vehicular ad hoc networks","authors":"E. Cruz, C. A. V. Campos, R. Pasquini, L. Faina, Rodolfo Oliveira","doi":"10.1109/WCNC.2012.6214223","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214223","url":null,"abstract":"This paper presents the URBAN_XOR1 protocol, an XOR-based flat routing mechanism developed for vehicular ad hoc networks (VANETs) formed in urban scenarios. The paper firstly describes the URBAN_XOR routing principle, which requires reduced knowledge about the set of nodes present in the VANET in order to provide traffic forwarding. Basically, the URBAN XOR protocol introduces the concept of local visibility, prioritizing the insertion of closer neighbors (in number of hops) in the routing tables, and simplifying the management of the frequent network mobility found in VANETs. Then, the performance of the proposed URBAN_XOR protocol is compared through simulation with other topology-based and position-based protocols, characterizing its performance in terms of path availability ratio, end-to-end delay, path length and path duration. The results reveal that URBAN_XOR contributes for the overall network stability, reducing the end-to-end delay due to its ability of generating shorter paths. At the same time, URBAN_XOR exhibits path availability similar to other topology-based protocols, but exhibiting better path duration times.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124374782","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-04-01DOI: 10.1109/WCNC.2012.6214430
Xitao Gong, G. Ascheid
This paper studies the achievable performance of a single-antenna spectrum-sharing system. Due to limited cooperation between secondary users (SUs) and primary users (PUs), perfect channel state information (CSI) related to the PUs is hard to obtain for the SUs. Therefore, we assume the secondary transmitter and receiver have only statistical CSI from the secondary transmitter to the primary receiver. First, we investigate the optimal power adaptation method under both a peak transmit power constraint and an average interference constraint. The optimal power allocation strategy is categorized into three regions based on the channel variations. Furthermore, we propose an efficient method in order to determine the optimal thresholds to divide three regions. Second, we derive closed-form expressions of the ergodic capacity of the secondary link over Rayleigh fading channels. The analytical results reveal some interesting insights into the achievable performance of the spectrum-sharing system, which are discussed and verified by simulation results.
本文研究了单天线频谱共享系统的可实现性能。由于secondary user (secondary user)和primary user (primary user)之间的合作有限，导致su很难获得与pu相关的完美信道状态信息(CSI)。因此，我们假设二级发射机和接收机只有从二级发射机到主接收机的统计CSI。首先，研究了峰值发射功率约束和平均干扰约束下的最优功率自适应方法。根据信道的变化将最优功率分配策略分为三个区域。此外，我们还提出了一种有效的方法来确定划分三个区域的最佳阈值。其次，我们推导了瑞利衰落信道上次级链路遍历容量的封闭表达式。分析结果揭示了频谱共享系统可实现性能的一些有趣见解，并通过仿真结果进行了讨论和验证。
{"title":"Ergodic capacity for cognitive radio with partial channel state information of the primary user","authors":"Xitao Gong, G. Ascheid","doi":"10.1109/WCNC.2012.6214430","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214430","url":null,"abstract":"This paper studies the achievable performance of a single-antenna spectrum-sharing system. Due to limited cooperation between secondary users (SUs) and primary users (PUs), perfect channel state information (CSI) related to the PUs is hard to obtain for the SUs. Therefore, we assume the secondary transmitter and receiver have only statistical CSI from the secondary transmitter to the primary receiver. First, we investigate the optimal power adaptation method under both a peak transmit power constraint and an average interference constraint. The optimal power allocation strategy is categorized into three regions based on the channel variations. Furthermore, we propose an efficient method in order to determine the optimal thresholds to divide three regions. Second, we derive closed-form expressions of the ergodic capacity of the secondary link over Rayleigh fading channels. The analytical results reveal some interesting insights into the achievable performance of the spectrum-sharing system, which are discussed and verified by simulation results.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115103724","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-04-01DOI: 10.1109/WCNC.2012.6214225
Caixing Shao, S. Leng, Yan Zhang, Huirong Fu
Vehicular Ad Hoc Networks (VANETs) and their diverse applications experience growing interest in both academic and industry. Different types of traffic packets delivered through vehicle-to-vehicle and vehicle-to-infrastructure communications are intended to improve passenger safety and comfort. In this paper, we propose a multiple priority supported Medium Access Control (MAC) protocol for VANETs based on the time slotted p-persistent channel access mechanism. The protocol differentiates the services packets into multi-priority on the Control Channel (CCH). Theoretical analysis based on Markov model is presented to optimize the transmission probabilities of the packets with different priorities, as well as the adjustable intervals of the CCH and the Services Channels (SCHs). Both analytical results and simulation experiments show that the proposed MAC protocol is able to ensure the prioritized transmission of the safety packets and also achieve optimal system performance with respect to saturated throughput.
{"title":"A multi-priority supported p-persistent MAC protocol for Vehicular Ad Hoc Networks","authors":"Caixing Shao, S. Leng, Yan Zhang, Huirong Fu","doi":"10.1109/WCNC.2012.6214225","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214225","url":null,"abstract":"Vehicular Ad Hoc Networks (VANETs) and their diverse applications experience growing interest in both academic and industry. Different types of traffic packets delivered through vehicle-to-vehicle and vehicle-to-infrastructure communications are intended to improve passenger safety and comfort. In this paper, we propose a multiple priority supported Medium Access Control (MAC) protocol for VANETs based on the time slotted p-persistent channel access mechanism. The protocol differentiates the services packets into multi-priority on the Control Channel (CCH). Theoretical analysis based on Markov model is presented to optimize the transmission probabilities of the packets with different priorities, as well as the adjustable intervals of the CCH and the Services Channels (SCHs). Both analytical results and simulation experiments show that the proposed MAC protocol is able to ensure the prioritized transmission of the safety packets and also achieve optimal system performance with respect to saturated throughput.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"215 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116824928","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-04-01DOI: 10.1109/WCNC.2012.6214099
Yen-Hsu Chen, W. Chung, Guo-Kai Ni, Hongke Zhang, S. Kuo
The ad hoc network is composed of multiple sensor nodes to serve various applications, such as data collection or environmental monitoring. In many applications, the sensor nodes near the boundary of the deployment region provide biased or low-quality information because they have limited number of neighboring nodes and only partial information is available. Hence, the boundary recognition is an important issue in the ad hoc networks. By the statistical approach in high node density networks, Fekete's pioneer work identified the boundary node by number of neighboring nodes and using a specific threshold. By exploiting the number of nodes in the two-hop region, our proposed algorithm has significant improvement of boundary recognition contrasted with Fekete's algorithm in the low-density network. Given the information topology and the cost function, the analyses provide a framework to obtain the optimal threshold for boundary recognition. Besides, the simulation results reveal the proposed algorithm has greater than 90% detection rate and lower than 10% false alarm rate.
{"title":"Optimal self boundary recognition with two-hop information for ad hoc networks","authors":"Yen-Hsu Chen, W. Chung, Guo-Kai Ni, Hongke Zhang, S. Kuo","doi":"10.1109/WCNC.2012.6214099","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214099","url":null,"abstract":"The ad hoc network is composed of multiple sensor nodes to serve various applications, such as data collection or environmental monitoring. In many applications, the sensor nodes near the boundary of the deployment region provide biased or low-quality information because they have limited number of neighboring nodes and only partial information is available. Hence, the boundary recognition is an important issue in the ad hoc networks. By the statistical approach in high node density networks, Fekete's pioneer work identified the boundary node by number of neighboring nodes and using a specific threshold. By exploiting the number of nodes in the two-hop region, our proposed algorithm has significant improvement of boundary recognition contrasted with Fekete's algorithm in the low-density network. Given the information topology and the cost function, the analyses provide a framework to obtain the optimal threshold for boundary recognition. Besides, the simulation results reveal the proposed algorithm has greater than 90% detection rate and lower than 10% false alarm rate.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115994329","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-04-01DOI: 10.1109/WCNC.2012.6213954
Zhenghui Li, F. Luan, Yan Zhang, Limin Xiao, Lianfeng Huang, Shidong Zhou, Xibin Xu, Jing Wang
In this paper we present some channel measurement results of distributed multiple-input multiple-output (D-MIMO) systems inside a MD-82 aircraft. Channel capacity and spatial correlation are analyzed from the measured channel matrix. Capacity results of 7 different systems (six D-MIMO systems and a SISO system) are discussed. It is found that D-MIMO systems yield significant capacity gains as compared to SISO system. Spatial correlations among transmitter (Tx) antennas distributed above the cabin aisle are statistically analyzed from the measured data. Result shows that, when receiver (Rx) antenna array is placed in the front or back of the cabin, some Tx antenna pairs are highly correlative (correlation coefficients are higher than 0.8). The effect of Tx antenna selection on capacity characteristic of in-cabin D-MIMO system is also studied. It is found that Tx antenna selection can further improve channel capacity and the optimum selected Tx antennas are usually the ones near to the Rx array.
{"title":"Capacity and spatial correlation measurements for wideband distributed MIMO channel in aircraft cabin environment","authors":"Zhenghui Li, F. Luan, Yan Zhang, Limin Xiao, Lianfeng Huang, Shidong Zhou, Xibin Xu, Jing Wang","doi":"10.1109/WCNC.2012.6213954","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6213954","url":null,"abstract":"In this paper we present some channel measurement results of distributed multiple-input multiple-output (D-MIMO) systems inside a MD-82 aircraft. Channel capacity and spatial correlation are analyzed from the measured channel matrix. Capacity results of 7 different systems (six D-MIMO systems and a SISO system) are discussed. It is found that D-MIMO systems yield significant capacity gains as compared to SISO system. Spatial correlations among transmitter (Tx) antennas distributed above the cabin aisle are statistically analyzed from the measured data. Result shows that, when receiver (Rx) antenna array is placed in the front or back of the cabin, some Tx antenna pairs are highly correlative (correlation coefficients are higher than 0.8). The effect of Tx antenna selection on capacity characteristic of in-cabin D-MIMO system is also studied. It is found that Tx antenna selection can further improve channel capacity and the optimum selected Tx antennas are usually the ones near to the Rx array.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123411473","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-04-01DOI: 10.1109/WCNC.2012.6214136
K. Lin, S. Chou, Cheng-Fu Chou
As mobile devices, such as smart phones and tablet PCs, become more and more ubiquitous, it is increasingly popular for users to watch online video streaming on their mobile devices. Because of the nature of wireless broadcast, a wireless router (e.g., an access point or cellular tower) can retrieve video streams from the video server and then efficiently multicast them via wireless medium to multiple clients who are interested in those videos. However, clients could locate in different positions and therefore experience various wireless channel conditions. In addition, clients might be interested in different video content so that different video clips could have various popularity. The heterogeneity in wireless conditions and user interests makes bandwidth allocation in a wireless router for video multicast a challenging problem. In this paper, we propose a marginal-utility-based video multicast scheme that takes variant channel qualities and heterogeneous user interests into account. Our evaluation shows that, compared to interest-oblivious multicast, the proposed interest-aware approach can improve the average visual quality by up to 9 dB.
{"title":"Video multicast with heterogeneous user interests in multi-rate wireless networks","authors":"K. Lin, S. Chou, Cheng-Fu Chou","doi":"10.1109/WCNC.2012.6214136","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214136","url":null,"abstract":"As mobile devices, such as smart phones and tablet PCs, become more and more ubiquitous, it is increasingly popular for users to watch online video streaming on their mobile devices. Because of the nature of wireless broadcast, a wireless router (e.g., an access point or cellular tower) can retrieve video streams from the video server and then efficiently multicast them via wireless medium to multiple clients who are interested in those videos. However, clients could locate in different positions and therefore experience various wireless channel conditions. In addition, clients might be interested in different video content so that different video clips could have various popularity. The heterogeneity in wireless conditions and user interests makes bandwidth allocation in a wireless router for video multicast a challenging problem. In this paper, we propose a marginal-utility-based video multicast scheme that takes variant channel qualities and heterogeneous user interests into account. Our evaluation shows that, compared to interest-oblivious multicast, the proposed interest-aware approach can improve the average visual quality by up to 9 dB.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122082380","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-04-01DOI: 10.1109/WCNC.2012.6214040
Jiyong Pang, Jun Wang, Dongyao Wang, G. Shen, Qi Jiang, Jianguo Liu
Heterogeneous networks (HetNets) are expected to be one of the major performance enhancement enablers of LTE-Advanced. Due to significantly challenging interference scenarios, enhanced inter-cell interference coordination (eICIC) based on almost blank subframes (ABS) is the key technology enabler that makes HetNets a reality. The key factor determining the gain of ABS-based eICIC is the configured number of ABS which depends closely on the number of UEs requesting protection from ABS. In this paper, we study the optimal amount of ABS for synchronous ABS configuration by formulating this optimization as a network-wide utility maximization problem. We firstly propose a distributed method to determine victim UEs protected by ABS for any given amount of ABS via dynamic programming, and then find the optimal amount of ABS by evaluating the overall system utility. A remarkable feature of the proposed solution is that only limited information exchange via backhaul is required and the optimal amount of ABS could be individually derived at each eNB. Extensive simulations demonstrate that our solution can not only improve the overall system throughput significantly but also provide better network-wide fairness.
{"title":"Optimized time-domain resource partitioning for enhanced inter-cell interference coordination in heterogeneous networks","authors":"Jiyong Pang, Jun Wang, Dongyao Wang, G. Shen, Qi Jiang, Jianguo Liu","doi":"10.1109/WCNC.2012.6214040","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214040","url":null,"abstract":"Heterogeneous networks (HetNets) are expected to be one of the major performance enhancement enablers of LTE-Advanced. Due to significantly challenging interference scenarios, enhanced inter-cell interference coordination (eICIC) based on almost blank subframes (ABS) is the key technology enabler that makes HetNets a reality. The key factor determining the gain of ABS-based eICIC is the configured number of ABS which depends closely on the number of UEs requesting protection from ABS. In this paper, we study the optimal amount of ABS for synchronous ABS configuration by formulating this optimization as a network-wide utility maximization problem. We firstly propose a distributed method to determine victim UEs protected by ABS for any given amount of ABS via dynamic programming, and then find the optimal amount of ABS by evaluating the overall system utility. A remarkable feature of the proposed solution is that only limited information exchange via backhaul is required and the optimal amount of ABS could be individually derived at each eNB. Extensive simulations demonstrate that our solution can not only improve the overall system throughput significantly but also provide better network-wide fairness.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122092857","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-04-01DOI: 10.1109/WCNC.2012.6214096
Z. Movahedi, M. N. Lima, G. Pujolle
An important characteristic in trust management frameworks is how nodes obtain information about the trustworthiness of other nodes. Some trust management models are based on local information, while others use both information of neighbors and remote nodes. Despite the wide of information used, the existing trust monitoring approaches are mainly based either on passive monitoring mechanisms or on active monitoring mechanisms. While passive monitoring suffers from limitations ranging from strict antenna requirements to high battery use, active dissemination alternatives generate extra overhead to the resource constrained mobile ad hoc networks (MANETs). In this paper, we propose a new knowledge monitoring scheme for trust management on MANETs based on autonomic principles. The proposed scheme minimizes the overhead using transiting packets on the network to update nodes knowledge about other nodes trustworthiness. Simulation results show that the proposed mechanism improves significantly the performance of underlying network, providing a sufficient correct knowledge about nodes trustworthiness required by trust management frameworks.
{"title":"An autonomic knowledge monitoring scheme for trust management on mobile ad hoc networks","authors":"Z. Movahedi, M. N. Lima, G. Pujolle","doi":"10.1109/WCNC.2012.6214096","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214096","url":null,"abstract":"An important characteristic in trust management frameworks is how nodes obtain information about the trustworthiness of other nodes. Some trust management models are based on local information, while others use both information of neighbors and remote nodes. Despite the wide of information used, the existing trust monitoring approaches are mainly based either on passive monitoring mechanisms or on active monitoring mechanisms. While passive monitoring suffers from limitations ranging from strict antenna requirements to high battery use, active dissemination alternatives generate extra overhead to the resource constrained mobile ad hoc networks (MANETs). In this paper, we propose a new knowledge monitoring scheme for trust management on MANETs based on autonomic principles. The proposed scheme minimizes the overhead using transiting packets on the network to update nodes knowledge about other nodes trustworthiness. Simulation results show that the proposed mechanism improves significantly the performance of underlying network, providing a sufficient correct knowledge about nodes trustworthiness required by trust management frameworks.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125995809","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-04-01DOI: 10.1109/WCNC.2012.6214148
Yuning Song, Liang Liu, Huadong Ma
Exposure problem, which corresponds to the quality of coverage, is a fundamental problem in wireless sensor networks. In this paper, we exploit a cellular computing model in the physarum for solving the minimal exposure problem. We first use the road-network among all points of interesting (PoIs) in the monitoring filed to formulate the minimal exposure problem, and then convert it into the Steiner tree problem by discretizing the monitoring field to a large-scale weighted grid. Inspired by the path-finding capability of physarum, we develop a new heuristic algorithm, named as the physarum optimization, to solve the Steiner tree problem with low complexity and high parallelism. Extensive simulations demonstrate that our proposed models and algorithm are effective for finding the road-network with minimal exposure.
{"title":"A physarum-inspired algorithm for minimal exposure problem in wireless sensor networks","authors":"Yuning Song, Liang Liu, Huadong Ma","doi":"10.1109/WCNC.2012.6214148","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214148","url":null,"abstract":"Exposure problem, which corresponds to the quality of coverage, is a fundamental problem in wireless sensor networks. In this paper, we exploit a cellular computing model in the physarum for solving the minimal exposure problem. We first use the road-network among all points of interesting (PoIs) in the monitoring filed to formulate the minimal exposure problem, and then convert it into the Steiner tree problem by discretizing the monitoring field to a large-scale weighted grid. Inspired by the path-finding capability of physarum, we develop a new heuristic algorithm, named as the physarum optimization, to solve the Steiner tree problem with low complexity and high parallelism. Extensive simulations demonstrate that our proposed models and algorithm are effective for finding the road-network with minimal exposure.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129391427","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
扫码关注我们
求助内容：
应助结果提醒方式：