{"title":"Error aware distributed space-time decoding for regenerative relay networks","authors":"Chao Zhang","doi":"10.1109/INFCOMW.2011.5928838","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928838","url":null,"abstract":"In this paper, we examine distributed space-time decoding structure for regenerative wireless relay networks. Given the demodulation error at the regenerative relays, we provide a general framework of error aware distributed space-time decoding at the destination, where the receiver is assumed to know the demodulation error probability at relays. Considering the high computational complexity of optimal Maximum Likelihood (ML) decoder, we also propose two low-complexity decoding structures, Max-Log decoder and Max-Log-Sphere decoder. Simulations show that error aware distributed space-time decoding can improve system performance greatly without high system overload, and Max-Log decoder and Max-Log-Sphere decoder can efficiently reduce decoding complexity with neglectable performance degradation.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128760621","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}
{"title":"Control and prediction in hierarchical wireless networks","authors":"S. Milner, C. Davis, J. Llorca","doi":"10.1109/INFCOMW.2011.5928845","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928845","url":null,"abstract":"Directional wireless networks (DWNs) using free space optical (FSO) and RF transmissions provide wireless backbone support for mobile communications in dynamic environments. The heterogeneous and dynamic nature of such networks challenges their robustness and requires self-organization mechanisms to assure end-to-end broadband connectivity. We have developed a framework to provide prediction and control strategies for assured network operation. We draw an analogy between a set of interconnected communication nodes and a molecule in which the bonds between atoms are representative of the links in the equivalent network. The dynamics of the network, and its optimization, can be analyzed by the methods of molecular dynamics. Links are modeled as bonds described by potential energy functions, such as the Morse potential, and a global description of the stability of the network can be obtained by a normal mode analysis (NMA). Effective “forces” act on nodes, which include the effects of power control, link length, and channel characteristics. A molecular re-arrangement or fragmentation occurs because this reduces the potential energy. In the same way a network can undergo topological reconfiguration, and an adaptive control strategy can be used to release, retain or reconfigure communication links for network performance optimization. Simulation results show the effectiveness of our self-organized control mechanism, where the physical topology reorganizes to maximize the number of source to destination communicating pairs. NMA of a network suffering degradation shows a correlation between anomalous eigenvalue behavior of the Hessian matrix describing the network and the improvement of network performance that can be achieved by topology change.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126868084","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}
{"title":"Analysis and experiments for dual-rate beacon scheduling in ZigBee/IEEE 802.15.4","authors":"Shantao Chen, Luís Almeida, Zhi Wang","doi":"10.1109/INFCOMW.2011.5928913","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928913","url":null,"abstract":"Cyber-Physical Networked Systems (CPNS) are systems that integrate a multitude of nodes that perform computations for the sake of interacting with, or controlling, a physical process. The network plays an important role in CPNS supporting the interactions among the distributed nodes that enable the collaborative work towards the application goals. Some systems, e.g., target tracking systems, require reconciling properties that are strongly influenced by the network in opposing directions. For example, it is important to maintain low energy consumption to prolong lifetime but it is also important to be reactive to event propagation for quick target detection. In the ZigBee/IEEE802.15.4 standards, the beacon-enabled mode can achieve low energy consumption by adopting low duty cycles but this causes reaction latency to events to degrade. In this paper, we carry out several experiments that validate the potential of the recently proposed dual-rate beacon scheduling method for ZigBee/IEEE802.15.4 sensor networks to accomplish a trade-off between low energy consumption and rapid events propagation. The experiments include both simulation with OPNET as well as a real test-bed built on CC2430-based nodes. The results show the impact of relevant configuration parameters and the superiority of the dual-rate beacon scheduling in providing low energy consumption and low latency in CPNS.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116886013","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}
{"title":"A Reservation-based Smart Parking System","authors":"Hongwei Wang, W. He","doi":"10.1109/INFCOMW.2011.5928901","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928901","url":null,"abstract":"Finding a parking space in most metropolitan areas, especially during the rush hours, is difficult for drivers. The difficulty arises from not knowing where the available spaces may be at that time; even if known, many vehicles may pursue very limited parking spaces to cause serious traffic congestion. In this paper, we design and implement a prototype of Reservation-based Smart Parking System (RSPS) that allows drivers to effectively find and reserve the vacant parking spaces. By periodically learning the parking status from the sensor networks deployed in parking lots, the reservation service is affected by the change of physical parking status. The drivers are allowed to access this cyber-physical system with their personal communication devices. Furthermore, we study state-of-the-art parking policies in smart parking systems and compare their performance. The experiment results show that the proposed reservation-based parking policy has the potential to simplify the operations of parking systems, as well as alleviate traffic congestion caused by parking searching.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114439733","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}
{"title":"Evaluating the energy benefit of dynamic optical bypass for content delivery","authors":"K. Guan, D. Kilper, G. Atkinson","doi":"10.1109/INFCOMW.2011.5928830","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928830","url":null,"abstract":"We evaluate the energy efficiency of dynamic optical bypass for decentralized content delivery networks (CDNs). We build energy models based on the energy consumption of current network equipment and devices and analyze the energy tradeoff among key networking resources. Our results show that, due to the under-utilization associated with signaling and reconfiguration overhead, a CDN with dynamic optical bypass achieves the largest savings in delivering very large files (100 Gb (gigabit) and above) with high download rate (a few hundred downloads per hour). We also derive a threshold for a file size, which is approximately the bandwidth-overhead product scaled by the ratio between the power density of WDM equipment and routers: CλT°pwdmd/pr1d. We show that, only for the delivery of content of sizes larger than this size threshold, a CDN with dynamic optical bypass is more energy efficient than CDN without bypass.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114767044","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}
{"title":"A cooperative social and vehicular network and its dynamic bandwidth allocation algorithms","authors":"Ridong Fei, Kun Yang, Xueqi Cheng","doi":"10.1109/INFCOMW.2011.5928891","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928891","url":null,"abstract":"This paper investigates into a special type of network that encourages cooperation between its upper layer social network and lower layer wireless communication network with particular focus on commuters on the road. Regarded as a branch of mobile social networks, the so-called vehicular social network (VSNs) proposed in this paper needs to consider both social aspects (such as social ties through common interests) and physical network operational mechanisms to design a system that is effective to its users and efficient to network resources. This calls for in-depth investigations into the correlation between social behaviours and network algorithms. This paper aims to making some preliminary exploration into this exciting field by investigating into how social centrality, an important concept in social network analysis, makes impact on dynamic bandwidth allocation (DBA) in a specific scenario of vehicular social networks. In particular the paper introduces centrality into the utility function's formula, based on which DBA is carried out in IEEE 802.16j-enable vehicular networks.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114837666","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}
Guangzhi Li, Dahai Xu, Dongmei Wang, A. Chiu, R. Doverspike
{"title":"Circuit planning tool over heterogeneous networks","authors":"Guangzhi Li, Dahai Xu, Dongmei Wang, A. Chiu, R. Doverspike","doi":"10.1109/INFCOMW.2011.5928797","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928797","url":null,"abstract":"currently, there is no existing solution or tool to efficiently route a high-speed circuit over heterogeneous DWDM networks under multi-vendor environment, although each vendor may provide a planning tool to route a circuit within its own sub-network domain. This is mainly due to the lack of common technology for optical reachability calculation across vendor sub-networks. Each sub-network has its own proprietary parameters or formulas to calculate whether an optical path is reachable or not. To route a circuit across heterogeneous networks, we rely on the common function provided by each vendor tool to determine all reachable paths within each sub-network, i.e, the reachability matrix for each sub-network. Here reachability matrix is defined as a list of all reachable paths within the sub-network. Then we build a weighted cost graph based on the reachability matrices and apply the shortest path algorithm to find a cost efficient route. Finally we address the DWDM (Dense Wavelength Division Multiplex) sub-network selection, regenerator placement, and wavelength assignment on the selected route. The systematical methodology has been implemented in a circuit planning tool for high-speed circuits (up to 100Gbps) and used in a real heterogeneous DWDM network since 2009.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114866898","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}
M. Naruse, F. Peper, K. Leibnitz, K. Akahane, N. Yamamoto, W. Nomura, T. Kawazoe, T. Yatsui, M. Murata, M. Ohtsu
{"title":"Autonomous excitation transfer in quantum dot mixtures via network of optical near-field interactions at the nanoscale","authors":"M. Naruse, F. Peper, K. Leibnitz, K. Akahane, N. Yamamoto, W. Nomura, T. Kawazoe, T. Yatsui, M. Murata, M. Ohtsu","doi":"10.1109/INFCOMW.2011.5928863","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928863","url":null,"abstract":"We examine autonomous optical excitation transfer in mixtures of different-sized quantum dots networked via optical near-fields at the nanometer scale. We theoretically and experimentally demonstrate optical excitation transfer via the network of optical near-field interactions among quantum dots. The topology-dependent efficiency of excitation transfer is also investigated. The results of our analysis of autonomous and energy-efficient light-matter interactions at the nanoscale, called nanophotonics, will provide useful insights into the design of robust and energy-efficient information and communications systems and networks.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124318870","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}
Animesh Srivastava, Bivas Mitra, F. Peruani, Niloy Ganguly
{"title":"Attacks on correlated peer-to-peer networks: An analytical study","authors":"Animesh Srivastava, Bivas Mitra, F. Peruani, Niloy Ganguly","doi":"10.1109/INFCOMW.2011.5928787","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928787","url":null,"abstract":"Analysis of attacks on real-world p2p networks and their impact on the topology of the network is difficult as the interconnections among the peers are not random; rather they evolve based on the needs of the connected peers and this brings in degree-degree correlation in the network. We develop an analytical framework to analyze the change in topology of a correlated network and propose a generalized model based on percolation theory to measure the resilience of a correlated network against any arbitrary attack. We present the results and analysis mainly on correlated superpeer networks and correlated bimodal networks. Some of the intricate questions on the stability of real-world superpeer network that we answer analytically are: (a) dependence of percolation threshold of a superpeer network on its peer degree, superpeer degree at different levels of degree-degree correlation (b) minimum peer degree required to make a superpeer topology more resilient. All our theoretical results are validated through simulations and the results are in very good agreement.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115523979","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}
{"title":"A timer-based session setup procedure in cellular-WLAN integrated systems","authors":"Gwangwoo Park, Younghyun Kim, Sangheon Pack","doi":"10.1109/INFCOMW.2011.5928846","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928846","url":null,"abstract":"The multiple registration scheme can reduce signaling overhead at the expense of increased session setup latency in cellular-WLAN integrated systems. In this paper, we propose a timer-based session setup procedure, which can reduce the session setup latency by looking for a user based on the estimation of the WLAN residence time. We investigate the optimization of the timer under realistic WLAN residence time model. Numerical results demonstrate that the timer-based session setup procedure can reduce the session setup latency by means of adaptive timer setting.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123142810","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}