2010 IEEE International Conference on Wireless Communications, Networking and Information Security最新文献_第5页

A connected dominating set-based weighted clustering algorithm for wireless sensor networks 基于连通支配集的无线传感器网络加权聚类算法

2010 IEEE International Conference on Wireless Communications, Networking and Information Security Pub Date : 2010-06-25 DOI: 10.1109/WCINS.2010.5544142

V. Anitha, M. Sebastian

{"title":"A connected dominating set-based weighted clustering algorithm for wireless sensor networks","authors":"V. Anitha, M. Sebastian","doi":"10.1109/WCINS.2010.5544142","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5544142","url":null,"abstract":"Grouping of sensor nodes into clusters is the most popular approach to support scalability in Wireless Sensor Networks (WSN). The performance of WSNs can be improved suitably by selecting the qualified nodes to form a stable backbone structure with guaranteed network coverage. In this paper, we propose a centralized and weighted algorithm for dynamic sensor networks which require reliable data gathering. The solution is based on a (k, r) - Connected Dominating Set, which is suitable for cluster-based hierarchical routing. This improves reliability, provides variable degree of clusterhead redundancy and reduces route searching space in WSN. To create a stable and efficient backbone structure, backbone sensor nodes are selected based on quality, which is a function of the residual battery power, node degree, transmission range and mobility of the sensor nodes. Performance of the algorithm is evaluated through simulation. It is observed that the proposed algorithm performs well in terms of number of elements in the backbone structure, load balancing and the number of re-affiliations","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125748321","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}

引用次数: 5

Performance analysis for multiuser dual-hop decode-and-forward cooperative system over Nakagami-m fading channels Nakagami-m衰落信道下多用户双跳译码转发合作系统性能分析

2010 IEEE International Conference on Wireless Communications, Networking and Information Security Pub Date : 2010-06-25 DOI: 10.1109/WCINS.2010.5541770

Weiguang Li, HuaMin Chen, Ming Chen

引用次数: 2

A provably secure authenticated key exchange protocol 一个可证明的安全认证密钥交换协议

2010 IEEE International Conference on Wireless Communications, Networking and Information Security Pub Date : 2010-06-25 DOI: 10.1109/WCINS.2010.5541786

Lijiang Zhang

引用次数: 5

An identity-based security infrastructure for Cloud environments 用于云环境的基于身份的安全基础设施

2010 IEEE International Conference on Wireless Communications, Networking and Information Security Pub Date : 2010-06-25 DOI: 10.1109/WCINS.2010.5541859

C. Schridde, Tim Dörnemann, Ernst Juhnke, Bernd Freisleben, Matthew Smith

引用次数: 41

An efficient dynamic adjusting MAC protocol for multichannel cognitive wireless networks 多通道认知无线网络中一种高效动态调整MAC协议

2010 IEEE International Conference on Wireless Communications, Networking and Information Security Pub Date : 2010-06-25 DOI: 10.1109/WCINS.2010.5544148

Chih-Shun Hsu, Yuh-Shyan Chen, Chih-En He

{"title":"An efficient dynamic adjusting MAC protocol for multichannel cognitive wireless networks","authors":"Chih-Shun Hsu, Yuh-Shyan Chen, Chih-En He","doi":"10.1109/WCINS.2010.5544148","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5544148","url":null,"abstract":"To enhance the usage of radio spectrum, a wireless network, named as the cognitive wireless network, which allows the unlicensed users to scan and use idle radio spectrum, has attracted a lot of attention recently. Because the radio spectrum has to return to the licensed user whenever the licensed user needs it, the radio spectrum of cognitive wireless networks is a precious resource. Hence, how to avoid collisions and enhance the throughput of the network are important issues for designing MAC protocols of cognitive wireless networks. In this paper, we propose an efficient dynamic adjusting MAC (EDA-MAC) protocol for cognitive wireless networks. EDA-MAC is improved from C-MAC, which assigns each joined host a dedicated beacon slot and thus it has a good potential to avoid contentions and collisions and achieve high throughput. The improvements we made are listed as follows: First, instead of a fixed number of signaling slots of C-MAC, EDA-MAC dynamically adjusts the number of signaling slots according to the number of estimated contenders and thus reduces the number of collisions and shortens the join process. Second, each joined host can inform others its transmission intention by its beacon frame. Since each joined host has a dedicated beacon slot, almost all the beacon frames can be sent without any collision. Third, each communication group contains a leader. The leader is responsible for coordinating the join process, data transmission, transmission rate selection, channel scan, and channel switch of each host in the communication group. With the coordination of the leader, unnecessary contentions and collisions can be avoided and thus enhances the throughput of the network. Simulation results justify the efficiency of the proposed EDA-MAC protocol.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"20 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130524605","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}

引用次数: 13

An average-entropy-value-based stopping criterion for BICM-ID 基于平均熵值的BICM-ID停止准则

2010 IEEE International Conference on Wireless Communications, Networking and Information Security Pub Date : 2010-06-25 DOI: 10.1109/WCINS.2010.5541897

Zhang Shuai, L. Jianping, Cai Chaoshi

{"title":"An average-entropy-value-based stopping criterion for BICM-ID","authors":"Zhang Shuai, L. Jianping, Cai Chaoshi","doi":"10.1109/WCINS.2010.5541897","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5541897","url":null,"abstract":"Stopping criterion is an efficient technique to reduce the unnecessary iterations of the iterative decoding process. Up to now, almost all the existing stopping criteria are designed for turbo-decoder, not for bit-interleaved coded modulation with iterative decoding (BICM-ID) receiver. Since the differences between the iterative schemes in turbo-decoder and BICM-ID receiver, these existing stopping criteria need greater computational complexity or extra storage when they are used in BICM-ID. This paper proposes an efficient stopping criterion, called AEV criterion, for BICM-ID receiver. This proposed criterion is based on average entropy value (AEV) of the decoding results. It takes a better trade-off between the average iteration numbers and the performance degradation than the existing criteria at high SNRs for BICM-ID. Furthermore, it needs no extra storage. Simulation results show that at high SNRs, with the increasing of SNR, the average iteration number curve of AEV criterion is getting closer and closer to the one of GENIE criterion which is the ideal but not a practical criterion. By using the proposed AEV criterion, the average iteration number is obviously reduced and the performance degradation is very small.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126671853","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}

引用次数: 1

A heuristic protocol combined location service in geographic ad hoc routing 结合地理自组织路由中位置服务的启发式协议

2010 IEEE International Conference on Wireless Communications, Networking and Information Security Pub Date : 2010-06-25 DOI: 10.1109/WCINS.2010.5543111

You-fu Jiang, G. Wang, Hai-yang Jin

引用次数: 3

Combating self-learning worms by using predators 利用捕食者来对抗自学蠕虫

2010 IEEE International Conference on Wireless Communications, Networking and Information Security Pub Date : 2010-06-25 DOI: 10.1109/WCINS.2010.5541851

Fangwei Wang, Yunkai Zhang, Honggang Guo, Changguang Wang

引用次数: 1

One-pass key establishment for anonymous wireless roaming 匿名无线漫游的一遍密钥建立

2010 IEEE International Conference on Wireless Communications, Networking and Information Security Pub Date : 2010-06-25 DOI: 10.1109/WCINS.2010.5541836

Y. Wang, D. Wong, Liusheng Huang

引用次数: 3

Multi-cell channel estimation and multi-cell joint detection in TD-SCDMA system TD-SCDMA系统中多小区信道估计与多小区联合检测

2010 IEEE International Conference on Wireless Communications, Networking and Information Security Pub Date : 2010-06-25 DOI: 10.1109/WCINS.2010.5541750

Xiang Zhang, Wenbo Wang, Shuping Chen, Chunyi Wang

引用次数: 8