2010 IEEE Global Telecommunications Conference GLOBECOM 2010最新文献_第5页

Lightweight Routing with QoS Support in Wireless Sensor and Actor Networks 无线传感器和行动者网络中支持QoS的轻量级路由

2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5684039

M. Akbaş, D. Turgut

引用次数: 13

Access Network Reselection Based on Momentary Resources in a Converged Wireless Environment 融合无线环境下基于瞬时资源的接入网重选

2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5684363

M. Corici, D. Vingarzan, T. Magedanz, C. Pampu, Qing Zhou

引用次数: 4

Realizable Forms of Ideal D/C and C/D Conversions for Complex Bandlimited Periodic Signals 复杂限带周期信号理想D/C和C/D转换的可实现形式

2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683773

M. Chang, Ren-Shian Chen

引用次数: 0

Topology-Assisted Techniques to Relay Selection for Homogeneously Distributed Wireless Sensor Networks 均匀分布无线传感器网络中继选择的拓扑辅助技术

2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683926

F. Etezadi, K. Zarifi, A. Ghrayeb, S. Affes

{"title":"Topology-Assisted Techniques to Relay Selection for Homogeneously Distributed Wireless Sensor Networks","authors":"F. Etezadi, K. Zarifi, A. Ghrayeb, S. Affes","doi":"10.1109/GLOCOM.2010.5683926","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683926","url":null,"abstract":"We consider a multi-relay amplify-and-forward cooperative communication scheme in wireless sensor networks with uniformly distributed nodes. Fixing the average total transmission power from the network and preserving fairness among the selected relays by constraining them to transmit with equal average powers, we aim to improve the signal reception quality at the far-field receiver by means of a proper choice of the relays. Assuming that the nodes' forward channels are not known, the following three relay selection schemes are proposed and their performances are analyzed. 1) Optimal relay selection scheme that maximizes the average SNR at the receiver by exploiting K nodes with the highest SNRs as relays; 2) geometry-based relay selection scheme that is energy-efficient and achieves a close-to-optimal average SNR performance at the receiver by using K closest nodes to the source as relays; and 3) random relay selection scheme that is energy-efficient and further guarantees a fair usage of all nodes by randomly selecting K relays from a specific area around the source. By minimizing an outage probability, a strategy to determine this area is also proposed. Finally, it is shown for all relay selection schemes that the SNR variance at the receiver converges to zero as K increases.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"31 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85478147","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

Distributed QoS-Aware MAC for Multimedia over Cognitive Radio Networks 基于认知无线网络的多媒体分布式qos感知MAC

2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683743

L. Cai, Yongkang Liu, Xuemin Shen, J. Mark, Dongmei Zhao

引用次数: 23

Attack-Resistant Collaboration in Wireless Video Streaming Social Networks 无线视频流社交网络中的抗攻击协作

2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5685222

Wan-Yi Sabrina Lin, H. V. Zhao, K. J. R. Liu

引用次数: 1

Performance Assessment of Caching and Forwarding Algorithms for Vehicular Delay Tolerant Networks 车载容忍延迟网络中缓存和转发算法的性能评估

2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683857

Bruno M. C. Silva, F. Farahmand, J. Rodrigues

{"title":"Performance Assessment of Caching and Forwarding Algorithms for Vehicular Delay Tolerant Networks","authors":"Bruno M. C. Silva, F. Farahmand, J. Rodrigues","doi":"10.1109/GLOCOM.2010.5683857","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683857","url":null,"abstract":"Vehicular delay tolerant networks (VDTNs) were proposed as a novel disruptive network concept based on the delay tolerant networking (DTN) paradigm. VDTN network architecture uses vehicles to relay messages, enabling network connectivity in challenged scenarios. Due to intermittent connectivity, network nodes carry messages in their buffers, relaying them only when a proper contact opportunity occurs. The storage capacity and message retrieving of intermediate nodes directly affects the network performance. Therefore, efficient and robust caching and forwarding mechanisms are needed. This paper proposes a content storage and retrieval solution for VDTN networks. It consists on storage and retrieval control labels, attached to every message of aggregated traffic (data bundles). These labels define cacheable contents, and apply cache-control and forwarding restrictions on data bundles. This solution is fully automated, providing a fast, safe, and reliable data transfer and storage management, while improves the applicability and performance of VDTN networks significantly. The proposed algorithms were evaluated and validated through a VDTN testbed.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"13 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76926534","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}

引用次数: 4

Cooperation Stimulation in Cognitive Networks Using Indirect Reciprocity Game Modelling 基于间接互惠博弈模型的认知网络合作刺激

2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683332

Yan Chen, K. Liu

{"title":"Cooperation Stimulation in Cognitive Networks Using Indirect Reciprocity Game Modelling","authors":"Yan Chen, K. Liu","doi":"10.1109/GLOCOM.2010.5683332","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683332","url":null,"abstract":"In cognitive networks, since nodes generally belong to different authorities and pursue different goals, they will not cooperate with others unless cooperation can improve their own performance. Thus, how to stimulate cooperation among nodes in cognitive networks is very important. However, most of existing game-theoretic cooperation stimulation approaches rely on the assumption that the interactions between any pair of players are long-lasting. When this assumption is not true, according to the well-known Prisoner's Dilemma and the backward induction principle, the unique Nash equilibrium (NE) is to always play non-cooperatively. In this paper, we propose a cooperation stimulation scheme for the scenario where the number of interactions between any pair of players are finite. The proposed algorithm is based on indirect reciprocity game modelling where the key concept is ``I help you not because you have helped me but because you have helped others''. We formulate the problem of finding the optimal action rule as a Markov Decision Process (MDP). Using the packet forwarding game as an example, we show that with an appropriate cost-to-gain ratio, the strategy of forwarding the number of packets that is equal to the reputation level of the receiver is an evolutionarily stable strategy (ESS). Finally, simulations are shown to verify the efficiency and effectiveness of the proposed algorithm.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"82 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77128446","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 Three-State Node Reliability Model for Sensor Networks 传感器网络的三状态节点可靠性模型

2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683750

M. Shazly, E. Elmallah, H. Aboelfotoh

{"title":"A Three-State Node Reliability Model for Sensor Networks","authors":"M. Shazly, E. Elmallah, H. Aboelfotoh","doi":"10.1109/GLOCOM.2010.5683750","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683750","url":null,"abstract":"In this paper we formulate and analyze a model for assessing the reliability of a wireless sensor network (WSN) based on classifying the operating states of each node at any instant into one of three possible states: a state where both the sensing and wireless modules are operating, a state where only the wireless module is operating, and a state where the wireless module is failed. Thus, in the second state a node can only relay traffic among its neighbours without generating its own data. We define the reliability of a WSN as the probability that the sink node can collect data from a number of nodes whose total weight exceeds a specified threshold limit, given that each node can be in any one of the three possible states with a given probability. Existing results in the literature show that a restricted 2-state version of the problem is #P-hard even when the network is a rectangular grid. Nevertheless, for a rectangular WxL grid on n nodes where the sink node lies in one of the corners, the restricted 2-state reliability problem can be solved in O(nL2^W) time. Thus, the algorithm runs in polynomial time for any fixed W. Our work here derives an exact algorithm for the generalized 3-state reliability model on a generalized class of grids, called diagonalized grids, while maintaining the same O(nL2^W) running time. We obtain numerical results that illustrate the use of the devised algorithm as a WSN topological design tool.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"1 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80862702","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}

引用次数: 15

Cyclostationary-Based Architectures for Spectrum Sensing in IEEE 802.22 WRAN 基于循环平稳的IEEE 802.22无线局域网频谱感知架构

2010 IEEE Global Telecommunications Conference GLOBECOM 2010 Pub Date : 2010-12-01 DOI: 10.1109/GLOCOM.2010.5683492

D. Bhargavi, A. Iyer, C. Murthy

引用次数: 13