2013 Proceedings IEEE INFOCOM最新文献_第10页

SpamTracer: How stealthy are spammers? SpamTracer:垃圾邮件发送者有多隐秘?

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOMW.2013.6562916

Pierre-Antoine Vervier, Olivier Thonnard

引用次数: 10

Video source identification in lossy wireless networks 有损无线网络中的视频源识别

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6566766

Shaxun Chen, A. Pande, K. Zeng, P. Mohapatra

引用次数: 15

Stochastic analysis of energy savings with sleep mode in OFDMA wireless networks OFDMA无线网络中睡眠模式节能的随机分析

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6566900

D. Tsilimantos, J. Gorce, E. Altman

引用次数: 41

A performance analysis of CSMA based broadcast protocol in VANETs 基于CSMA的VANETs广播协议性能分析

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6567090

Nguyen Tien Viet, F. Baccelli, Kai Zhu, Sundar Subramanian, Xinzhou Wu

{"title":"A performance analysis of CSMA based broadcast protocol in VANETs","authors":"Nguyen Tien Viet, F. Baccelli, Kai Zhu, Sundar Subramanian, Xinzhou Wu","doi":"10.1109/INFCOM.2013.6567090","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6567090","url":null,"abstract":"The broadcast of periodic messages is a key functionality in vehicular ad hoc networks. In the emerging vehicular networks, IEEE 802.11p is the standard of choice to support the PHY and MAC layer functionalities. The broadcast process in IEEE 802.11p is based on the CSMA mechanism where a device transmitting a packet senses the channel for ongoing transmissions and performs a random back-off before accessing the channel. Without RTS/CTS mechanisms, carrier sensing is expected to provide a protection region around the transmitter where no other transmitters are allowed. The point process characterizing the concurrent transmitters is expected to enforce a minimum separation between concurrent transmitters. However, at increasing densities, the CSMA behavior breaks down to an ALOHA-like transmission pattern where concurrent transmitters are distributed as a Poisson point process, indicating the lack of protection around transmitters. In this paper, we model the CSMA mechanism as a slotted system and analytically characterize the critical node/packet arrival density where the CSMA mechanism approaches an ALOHAlike behavior. Further, we use tools from stochastic geometry to establish closed-form expressions for the performance metrics of the broadcast mechanism in the ALOHA regime. Finally, using ns2 (an unslotted asynchronous simulator), we compare the theoretical results with simulations.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125879986","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}

引用次数: 89

A simple approximate analysis of floating content for context-aware applications 对上下文感知应用程序的浮动内容的简单近似分析

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1145/2491288.2491321

Shahzad Ali, G. Rizzo, Balaji Rengarajan, M. Marsan

{"title":"A simple approximate analysis of floating content for context-aware applications","authors":"Shahzad Ali, G. Rizzo, Balaji Rengarajan, M. Marsan","doi":"10.1145/2491288.2491321","DOIUrl":"https://doi.org/10.1145/2491288.2491321","url":null,"abstract":"Context-awareness is a peculiar characteristic of an ever expanding set of applications that make use of a combination of restricted spatio-temporal locality and mobile communications, to deliver a variety of services to the end user. It is expected that by 2014 more than 1.5 billion people would be using applications based on local search (search restricted on the basis of spatio-temporal locality), and that mobile location based services will drive revenues of more than $15 billion worldwide. A common feature of such context-aware applications is the fact that their communication requirements significantly differ from ordinary applications. For most of them, the scope of generated content itself is local. This locally relevant content may be of little concern to the rest of the world, therefore moving this content from the user device to store it in a well-accessible centralized location and/or making this information available beyond its scope represents a clear waste of resources (connectivity, storage). Due to these specific requirements, opportunistic communication can play a special role when coupled with context-awareness. The benefit of opportunistic communications is that it naturally incorporates context as spatial proximity is closely associated with connectivity.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129871943","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}

引用次数: 18

Video sharing propagation in social networks: Measurement, modeling, and analysis 社交网络中的视频分享传播：测量、建模和分析

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6566732

Xu Cheng, Haitao Li, Jiangchuan Liu

引用次数: 26

WheelLoc: Enabling continuous location service on mobile phone for outdoor scenarios WheelLoc:实现户外场景下手机连续定位服务

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6567082

He Wang, Zhiyang Wang, G. Shen, Fan Li, Song Han, Feng Zhao

{"title":"WheelLoc: Enabling continuous location service on mobile phone for outdoor scenarios","authors":"He Wang, Zhiyang Wang, G. Shen, Fan Li, Song Han, Feng Zhao","doi":"10.1109/INFCOM.2013.6567082","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6567082","url":null,"abstract":"The proliferation of location-based services and applications calls for provisioning of location service as a first class system component that can return accurate location fix in short response time and is energy efficient. In this paper, we present the design, implementation and evaluation of WheelLoc - a continuous system location service for outdoor scenarios. Unlike previous localization efforts that try to directly obtain a point location fix, WheelLoc adopts an indirect approach: it seeks to capture a user mobility trace first and to obtain any point location by time- and speed-aware interpolation or extrapolation. WheelLoc avoids energy-expensive sensors completely and relies solely on commonly available cheap sensors such as accelerometer and magnetometer. With a set of novel techniques and the leverage of publicly available road maps and cell tower information, WheelLoc is able to meet those requirements of a first class component. Experimental results confirmed the effectiveness of WheelLoc. It can return a location estimate within 40ms with an accuracy about 40 meters, consumes only 240mW energy, and effectively strikes a better energy-accuracy tradeoff than GPS duty-cycling.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129454685","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}

引用次数: 37

Capacity gain through power enhancement in multi-radio multi-channel wireless networks 在多无线电多信道无线网络中通过功率增强获得容量

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6566984

D. Shila, Y. Cheng

{"title":"Capacity gain through power enhancement in multi-radio multi-channel wireless networks","authors":"D. Shila, Y. Cheng","doi":"10.1109/INFCOM.2013.6566984","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6566984","url":null,"abstract":"The main focus of this paper is to show theoretically that power is a crucial factor in multi-radio multi-channel (MR-MC) wireless networks and hence by judiciously leveraging the power, one can realize a considerable gain on the capacity for MR-MC wireless networks. Such a capacity gain through power enhancement is revealed by our new insights of a co-channel enlarging effect. In particular, when the number of available channels (c) in a network is larger than that necessary for enabling the maximum set of simultaneous transmissions (c̃), allocating transmissions to those additional c-c̃ channels could enlarge the distance between the co-channel transmissions; the larger co-channel distance then allows a higher transmission power for higher link capacity. The finding of this paper specifically indicate that by exploiting the co-channel enlarging effect with power, one can realize the following gain on the capacity for MR-MC wireless networks: (i) In the channel-constraint region (c̃ <; c <; nφ/2), if each node augments its power from the minimum Pmin to Pmin c/c̃α/2, then a gain of Θ(log(c/c̃)α/2) is achieved; (ii) In the power-constraint region (c ≥ nφ/2), if each node sends at the maximum power level, Pmax = Pmin.nK or Pmin.2nφ/2, depending on the power availability at a node, then a gain of Θ(log n) or Θ(n) is achieved, respectively.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129681678","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}

引用次数: 2

A localized backbone renovating algorithm for wireless ad hoc and sensor networks 无线自组网和传感器网络的局部主干网更新算法

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6567021

Kai Xing, Shuo Zhang, Lei Shi, Haojin Zhu, Yuepeng Wang

{"title":"A localized backbone renovating algorithm for wireless ad hoc and sensor networks","authors":"Kai Xing, Shuo Zhang, Lei Shi, Haojin Zhu, Yuepeng Wang","doi":"10.1109/INFCOM.2013.6567021","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6567021","url":null,"abstract":"In this paper we propose and analyze a localized backbone renovating algorithm (LBR) to renovate a broken backbone in the network. This research is motivated by the problem of virtual backbone maintenance in wireless ad hoc and sensor networks, where the coverage area of nodes are disks with identical radii. According to our theoretical analysis, the proposed algorithm has the ability to renovate the backbone in a purely localized manner with a guaranteed connectivity of the network, while keeping the backbone size within a constant factor from that of the minimum CDS. Both the communication overhead and computation overhead of the LBR algorithm are O(k), where k is the number of nodes broken or added. We also conduct extensive simulation study on connectivity, backbone size, and the communication/computation overhead. The simulation results show that the proposed algorithm can always keep the renovated backbone being connected at low communication/computation overhead with a relatively small backbone, compared with other existing schemes. Furthermore, the LBR algorithm has the ability to deal with arbitrary number of node failures and additions in the network.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122309542","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}

引用次数: 3

ARTSense: Anonymous reputation and trust in participatory sensing ARTSense:参与式感知中的匿名声誉和信任

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6567058

Xinlei Wang, W. Cheng, P. Mohapatra, T. Abdelzaher

{"title":"ARTSense: Anonymous reputation and trust in participatory sensing","authors":"Xinlei Wang, W. Cheng, P. Mohapatra, T. Abdelzaher","doi":"10.1109/INFCOM.2013.6567058","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6567058","url":null,"abstract":"With the proliferation of sensor-embedded mobile computing devices, participatory sensing is becoming popular to collect information from and outsource tasks to participating users. These applications deal with a lot of personal information, e.g., users' identities and locations at a specific time. Therefore, we need to pay a deeper attention to privacy and anonymity. However, from a data consumer's point of view, we want to know the source of the sensing data, i.e., the identity of the sender, in order to evaluate how much the data can be trusted. “Anonymity” and “trust” are two conflicting objectives in participatory sensing networks, and there are no existing research efforts which investigated the possibility of achieving both of them at the same time. In this paper, we propose ARTSense, a framework to solve the problem of “trust without identity” in participatory sensing networks. Our solution consists of a privacy-preserving provenance model, a data trust assessment scheme and an anonymous reputation management protocol. We have shown that ARTSense achieves the anonymity and security requirements. Validations are done to show that we can capture the trust of information and reputation of participants accurately.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122312911","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}

引用次数: 172