Pub Date : 2009-01-11DOI: 10.1109/CCNC.2009.4784980
Takeshi Umezawa, K. Nakauchi, Ved P. Kafle, M. Inoue, T. Matsunaka, T. Warabino, Y. Kishi
In spite of recent advances of personal communication devices and access network technology, users are still facing the issues such as high device maintenance costs, complication of inter-device cooperation, illegal access to devices, and leakage of personal information. Consequently, it is difficult for users to securely construct a network with local as well as remote personal devices. We propose a User-driven Service Creation Platform (USCP), which enables users to construct a secure private network in a simple and intuitive way, making the most of the authentication mechanism in cellular networks. USCP separates signaling and data paths in a flat structure of a virtual network topology. In this paper, we describe the basic design of USCP.
尽管近年来个人通信设备和接入网技术不断进步，但用户仍然面临着设备维护成本高、设备间合作复杂、非法访问设备、个人信息泄露等问题。因此，用户很难安全地使用本地和远程个人设备构建网络。我们提出了一个用户驱动的服务创建平台(User-driven Service Creation Platform, USCP)，使用户能够以简单直观的方式构建安全的专用网，充分利用蜂窝网络中的认证机制。USCP在虚拟网络拓扑的平面结构中分离信令和数据路径。本文描述了USCP的基本设计。
{"title":"Basic Design of a User-Driven Service Creation Platform Assisted by Cellular Systems","authors":"Takeshi Umezawa, K. Nakauchi, Ved P. Kafle, M. Inoue, T. Matsunaka, T. Warabino, Y. Kishi","doi":"10.1109/CCNC.2009.4784980","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784980","url":null,"abstract":"In spite of recent advances of personal communication devices and access network technology, users are still facing the issues such as high device maintenance costs, complication of inter-device cooperation, illegal access to devices, and leakage of personal information. Consequently, it is difficult for users to securely construct a network with local as well as remote personal devices. We propose a User-driven Service Creation Platform (USCP), which enables users to construct a secure private network in a simple and intuitive way, making the most of the authentication mechanism in cellular networks. USCP separates signaling and data paths in a flat structure of a virtual network topology. In this paper, we describe the basic design of USCP.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"205 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131773360","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 : 2009-01-11DOI: 10.1109/CCNC.2009.4784864
S. Gurumurthy, A. Ganz
We propose a middleware called BuddyShare to automatically form an overlay group of nearby friends' mobile phones to collaboratively download data by sharing mobile internet. This system is hypothetical in nature and only work on certain assumptions such as: 1) frequent availability of friends' phone nearby, 2) Sufficient social trust among physically close users to share internet and 3) sufficient social networking information available in phones. In order to validate these hypotheses, we collected human centric dataset of cellular phone users of university environment to study the user behavior. In this paper, we present certain social and proximity behaviors of these users that validate these hypotheses and show the practical feasibility of a BuddyShare system. We also study the usefulness of BuddyShare by virtually leveraging it on this user network, which concludes around three times scaling in download rate on average.
{"title":"Analyzing Human Centric Data for Sharing Mobile Internet with Social Buddies","authors":"S. Gurumurthy, A. Ganz","doi":"10.1109/CCNC.2009.4784864","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784864","url":null,"abstract":"We propose a middleware called BuddyShare to automatically form an overlay group of nearby friends' mobile phones to collaboratively download data by sharing mobile internet. This system is hypothetical in nature and only work on certain assumptions such as: 1) frequent availability of friends' phone nearby, 2) Sufficient social trust among physically close users to share internet and 3) sufficient social networking information available in phones. In order to validate these hypotheses, we collected human centric dataset of cellular phone users of university environment to study the user behavior. In this paper, we present certain social and proximity behaviors of these users that validate these hypotheses and show the practical feasibility of a BuddyShare system. We also study the usefulness of BuddyShare by virtually leveraging it on this user network, which concludes around three times scaling in download rate on average.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132339556","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 : 2009-01-11DOI: 10.1109/CCNC.2009.4784965
S. Ferretti, M. Roccetti, Roberta Zioni
Detecting cheaters in peer-to-peer Multiplayer On-line Games (MOGs) may be more effective than avoiding the cheats. This is particularly true for fast paced, real-time MOGs, since the classic approaches to prevent time cheats usually complicate the communication protocols among peers. This results in a loss of responsiveness among players during the game session. We present a cheating detection scheme, named AC/DC (Algorithm for Cheating Detection by Cheating), that faces a specific time cheat, i.e., the look-ahead cheat. The idea is that of exploiting a counterattack approach to determine if the suspected node waits for messages coming from other peers before generating its cheated events. During the counterattack, the controlling node delays the transmission of newly generated events to the suspected node. This allows to determine if the suspected node waits for these events before generating its own ones. In this paper, a novel version of the AC/DC approach is presented which exploits a control scheme that measures the statistical correlation between the additional delay employed by the controlling peer and the network latencies from the controlled peer. Simulation results confirm the viability of the approach.
在点对点多人在线游戏(mog)中发现作弊者可能比避免作弊者更有效。对于快节奏的实时mog来说尤其如此，因为防止时间作弊的经典方法通常会使对等体之间的通信协议复杂化。这将导致玩家在游戏过程中失去响应性。我们提出了一种作弊检测方案，命名为AC/DC (Algorithm for cheating detection by cheating)，该方案面对特定的时间作弊，即向前看作弊。其思想是利用一种反击方法来确定可疑节点在生成其被欺骗的事件之前是否等待来自其他对等节点的消息。在反击过程中，控制节点将新生成的事件延迟发送到可疑节点。这允许确定可疑节点在生成自己的事件之前是否等待这些事件。本文提出了一种新的AC/DC方法，该方法利用一种控制方案来测量控制对等体使用的额外延迟与被控制对等体的网络延迟之间的统计相关性。仿真结果验证了该方法的可行性。
{"title":"A Statistical Approach to Cheating Countermeasure in P2P MOGs","authors":"S. Ferretti, M. Roccetti, Roberta Zioni","doi":"10.1109/CCNC.2009.4784965","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784965","url":null,"abstract":"Detecting cheaters in peer-to-peer Multiplayer On-line Games (MOGs) may be more effective than avoiding the cheats. This is particularly true for fast paced, real-time MOGs, since the classic approaches to prevent time cheats usually complicate the communication protocols among peers. This results in a loss of responsiveness among players during the game session. We present a cheating detection scheme, named AC/DC (Algorithm for Cheating Detection by Cheating), that faces a specific time cheat, i.e., the look-ahead cheat. The idea is that of exploiting a counterattack approach to determine if the suspected node waits for messages coming from other peers before generating its cheated events. During the counterattack, the controlling node delays the transmission of newly generated events to the suspected node. This allows to determine if the suspected node waits for these events before generating its own ones. In this paper, a novel version of the AC/DC approach is presented which exploits a control scheme that measures the statistical correlation between the additional delay employed by the controlling peer and the network latencies from the controlled peer. Simulation results confirm the viability of the approach.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131636616","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 : 2009-01-11DOI: 10.1109/CCNC.2009.4784859
Zuhui Ma, D. Qiu
Optimistic unchoking plays an important role in BitTorrent Peer-to-Peer (P2P) file sharing networks. Peers use optimistic unchoking to find upload bandwidth information about their neighbors. However, free-riders can also take advantage of optimistic unchoking and download from the network without uploading anything. In this paper, we propose a novel optimistic unchoking algorithm for BitTorrent. The main purposes of our algorithm are to prevent free-riding and to improve the efficiency of optimistic unchoking. We then propose a stochastic model to analyze the performance of our algorithm. We also verify the results by simulations. Both theoretical and simulation results show that our algorithm can effectively prevent free-riding and significantly improve the download rate of normal peers at the same time.
{"title":"A Novel Optimistic Unchoking Algorithm for BitTorrent","authors":"Zuhui Ma, D. Qiu","doi":"10.1109/CCNC.2009.4784859","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784859","url":null,"abstract":"Optimistic unchoking plays an important role in BitTorrent Peer-to-Peer (P2P) file sharing networks. Peers use optimistic unchoking to find upload bandwidth information about their neighbors. However, free-riders can also take advantage of optimistic unchoking and download from the network without uploading anything. In this paper, we propose a novel optimistic unchoking algorithm for BitTorrent. The main purposes of our algorithm are to prevent free-riding and to improve the efficiency of optimistic unchoking. We then propose a stochastic model to analyze the performance of our algorithm. We also verify the results by simulations. Both theoretical and simulation results show that our algorithm can effectively prevent free-riding and significantly improve the download rate of normal peers at the same time.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"341 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134323811","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 : 2009-01-11DOI: 10.1109/CCNC.2009.4784982
C. Jacob, Lei Zhang, A. Kress, S. Steglich, Tian Hui
Evolving device capabilities and network technologies make the seamless combination of personal area and wide area networks capable and desirable to exploit advantages of each of the environments. By this, the vision of adaptive and context-aware service provision becomes possible and offers new opportunities for pervasive computing. In this paper, we describe an approach that addresses the convergence of personal area and wide area networks on the service level. We extend a middleware for mobile ad hoc networks to enable the remote access to personal multimedia content at home via a proper infrastructure and gateway. In a second step, we use this concept to enable the context-aware download of multimedia content to the mobile phone based on rules and a semantic blackboard approach.
{"title":"A Mobile Middleware Approach for the Convergence of Wide Area and Personal Area Networks","authors":"C. Jacob, Lei Zhang, A. Kress, S. Steglich, Tian Hui","doi":"10.1109/CCNC.2009.4784982","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784982","url":null,"abstract":"Evolving device capabilities and network technologies make the seamless combination of personal area and wide area networks capable and desirable to exploit advantages of each of the environments. By this, the vision of adaptive and context-aware service provision becomes possible and offers new opportunities for pervasive computing. \u0000 \u0000In this paper, we describe an approach that addresses the convergence of personal area and wide area networks on the service level. We extend a middleware for mobile ad hoc networks to enable the remote access to personal multimedia content at home via a proper infrastructure and gateway. In a second step, we use this concept to enable the context-aware download of multimedia content to the mobile phone based on rules and a semantic blackboard approach.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129093944","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 : 2009-01-11DOI: 10.1109/CCNC.2009.4784993
Sung-Hyung Lee, Jae-Hyun Kim
This paper proposes a new authentication protocol for the LR-WPAN. In order to guarantee the reliability and safety of a protocol, this protocol uses the hierarchical authentication. In addition, in order to reduce the impact of the denial of service attack, the proposed protocol performs the authentication between a parent router and a joiner device prior to the authentication between a trust center and the joiner device. Moreover, this protocol reduces the authentication delay by decreasing the number of message exchanges during authentication. We evaluate the safety of the proposed protocol by the security analysis and compare the number of message exchanges of the ZigBee authentication protocol and the proposed protocol when denial of service attack occurs. We also analyze the delay for authentication of the joiner device through the implementation of both protocols. Those results show that the proposed protocol effectively protects networks from the denial of service attack and reduces the time for authenticating the joiner device up to maximum 30% as the number of hops increases.
{"title":"Design of Authentication Protocol for LR-WPAN using Pre-Authentication Mechanism","authors":"Sung-Hyung Lee, Jae-Hyun Kim","doi":"10.1109/CCNC.2009.4784993","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784993","url":null,"abstract":"This paper proposes a new authentication protocol for the LR-WPAN. In order to guarantee the reliability and safety of a protocol, this protocol uses the hierarchical authentication. In addition, in order to reduce the impact of the denial of service attack, the proposed protocol performs the authentication between a parent router and a joiner device prior to the authentication between a trust center and the joiner device. Moreover, this protocol reduces the authentication delay by decreasing the number of message exchanges during authentication. We evaluate the safety of the proposed protocol by the security analysis and compare the number of message exchanges of the ZigBee authentication protocol and the proposed protocol when denial of service attack occurs. We also analyze the delay for authentication of the joiner device through the implementation of both protocols. Those results show that the proposed protocol effectively protects networks from the denial of service attack and reduces the time for authenticating the joiner device up to maximum 30% as the number of hops increases.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129100818","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 : 2009-01-11DOI: 10.1109/CCNC.2009.4784841
Tseng-Wen Feng, B. Williams, Pao-Chu Wang, Shyh-Kang Jeng
In this paper, we conduct the window design for single-input single-output (SISO) and multiple-input multiple-output (MIMO) OFDM systems. The key value of this paper is to optimize the receiver SINR when carrier frequency offset (CFO) and phase noise both affecting an OFDM system. To our best knowledge, this is the first research to design window coefficients through leveraging the CFO and phase noise statistics for SISO and MIMO OFDM systems over frequency-selective channels. CFO and phase noise will destroy the orthogonality of OFDM system and lead to inter-carrier interference (ICI). Simulation results show that our proposed method can improve the system performance.
{"title":"Window Design for SISO and MIMO OFDM Systems","authors":"Tseng-Wen Feng, B. Williams, Pao-Chu Wang, Shyh-Kang Jeng","doi":"10.1109/CCNC.2009.4784841","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784841","url":null,"abstract":"In this paper, we conduct the window design for single-input single-output (SISO) and multiple-input multiple-output (MIMO) OFDM systems. The key value of this paper is to optimize the receiver SINR when carrier frequency offset (CFO) and phase noise both affecting an OFDM system. To our best knowledge, this is the first research to design window coefficients through leveraging the CFO and phase noise statistics for SISO and MIMO OFDM systems over frequency-selective channels. CFO and phase noise will destroy the orthogonality of OFDM system and lead to inter-carrier interference (ICI). Simulation results show that our proposed method can improve the system performance.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131706266","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 : 2009-01-11DOI: 10.1109/CCNC.2009.4784734
S. Craver, Yu Chen, Hao Chen, Jun Yu, I. M. Atakli
Robust cryptography provides confidentiality and integrity for information transferred between peers. However, the decrypted plaintext in the memory of a receivers' computer is vulnerable--both to surveillance at the endpoints, and users who choose to forward confidential information. In this paper, we proposed a novel scheme called BLINK, which uses a reconfigurable hardware based decoder which operates on the link between a computer and its display. It moves the decryption outside the computer, preventing plaintext stealing, forwarding, screen capture and printing. Currently we are implementing the BLINK scheme on top of Altera FPGA board with Digital Visual Interface (DVI) ports, the correctness, effectiveness, and the performance will be evaluated through experiment.
{"title":"BLINK: Securing Information to the Last Connection","authors":"S. Craver, Yu Chen, Hao Chen, Jun Yu, I. M. Atakli","doi":"10.1109/CCNC.2009.4784734","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784734","url":null,"abstract":"Robust cryptography provides confidentiality and integrity for information transferred between peers. However, the decrypted plaintext in the memory of a receivers' computer is vulnerable--both to surveillance at the endpoints, and users who choose to forward confidential information. In this paper, we proposed a novel scheme called BLINK, which uses a reconfigurable hardware based decoder which operates on the link between a computer and its display. It moves the decryption outside the computer, preventing plaintext stealing, forwarding, screen capture and printing. Currently we are implementing the BLINK scheme on top of Altera FPGA board with Digital Visual Interface (DVI) ports, the correctness, effectiveness, and the performance will be evaluated through experiment.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132176511","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 : 2009-01-11DOI: 10.1109/CCNC.2009.4784710
Pengye Xia, Xing Jin, S. Chan
Multiple description coding (MDC) has been widely used in media streaming to address the bandwidth heterogeneity issue. That is, the video source encodes data into multiple descriptions. At the receiver end, the streaming quality is proportional to the number of descriptions received. In this paper, we investigate how to assign bandwidth for descriptions in order to make full use of available network bandwidth. We formulate the problem as an optimization problem. We then decompose the problem and address it by an iterative algorithm. We evaluate the algorithm through simulations. Our results show that arbitrary description rates may severely degrade system performance and an optimal solution can make efficient use of network bandwidth.
{"title":"Optimal Bandwidth Assignment for Multiple Description Coding in Media Streaming","authors":"Pengye Xia, Xing Jin, S. Chan","doi":"10.1109/CCNC.2009.4784710","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784710","url":null,"abstract":"Multiple description coding (MDC) has been widely used in media streaming to address the bandwidth heterogeneity issue. That is, the video source encodes data into multiple descriptions. At the receiver end, the streaming quality is proportional to the number of descriptions received. In this paper, we investigate how to assign bandwidth for descriptions in order to make full use of available network bandwidth. We formulate the problem as an optimization problem. We then decompose the problem and address it by an iterative algorithm. We evaluate the algorithm through simulations. Our results show that arbitrary description rates may severely degrade system performance and an optimal solution can make efficient use of network bandwidth.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133057188","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 : 2009-01-11DOI: 10.1109/CCNC.2009.4784944
Lin Yang, Jinhua Guo, Ying Wu
Vehicle safety communication applications require safety messages to be received by all the targeted vehicles within their lifetime. We propose a piggybacked cooperative repetition approach for reliably broadcasting safety messages in VANETs. Repetitions by neighbors that receive the original transmission can effectively cover the areas that are missed in the original transmissions. Moreover, the repetitions are piggybacked by the newly generated messages so that no extra messages are injected into the network. Our experiments show a significant performance improvement, achieving over 90% reception rate of safety messages at distances up to 200 meters to the sender.
{"title":"Piggyback Cooperative Repetition for Reliable Broadcasting of Safety Messages in VANETs","authors":"Lin Yang, Jinhua Guo, Ying Wu","doi":"10.1109/CCNC.2009.4784944","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784944","url":null,"abstract":"Vehicle safety communication applications require safety messages to be received by all the targeted vehicles within their lifetime. We propose a piggybacked cooperative repetition approach for reliably broadcasting safety messages in VANETs. Repetitions by neighbors that receive the original transmission can effectively cover the areas that are missed in the original transmissions. Moreover, the repetitions are piggybacked by the newly generated messages so that no extra messages are injected into the network. Our experiments show a significant performance improvement, achieving over 90% reception rate of safety messages at distances up to 200 meters to the sender.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133207560","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
扫码关注我们
求助内容：
应助结果提醒方式：