IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications最新文献_第2页

An Energy-Efficient Architecture for DTN Throwboxes DTN抛掷盒的节能架构

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications Pub Date : 2007-05-01 DOI: 10.1109/INFCOM.2007.96

N. Banerjee, M. Corner, B. Levine

{"title":"An Energy-Efficient Architecture for DTN Throwboxes","authors":"N. Banerjee, M. Corner, B. Levine","doi":"10.1109/INFCOM.2007.96","DOIUrl":"https://doi.org/10.1109/INFCOM.2007.96","url":null,"abstract":"Disruption Tolerant Networks rely on intermittent contacts between mobile nodes to deliver packets using store-carry-and-forward paradigm. The key to improving performance in DTNs is to engineer a greater number of transfer opportunities. We earlier proposed the use of throwbox nodes, which are stationary, battery powered nodes with storage and processing, to enhance the capacity of DTNs. However, the use of throwboxes without efficient power management is minimally effective. If the nodes are too liberal with their energy consumption, they will fail prematurely. However if they are too conservative, they may miss important transfer opportunities, hence increasing lifetime without improving performance. In this paper, we present a hardware and software architecture for energy efficient throwboxes in DTNs. We propose a hardware platform that uses a multi-tiered, multi-radio, scalable, solar powered platform. The throwbox employs an approximate heuristic for solving the NP-Hard problem of meeting an average power constraint while maximizing the number of bytes forwarded by it. We built and deployed prototype throwboxes in UMassDieselNet -a bus DTN testbed. Through extensive trace-driven simulations and prototype deployment we show that a single throwbox with a 270 cm2 solar panel can run perpetually while improving packet delivery by 37% and reducing message delivery latency by at least 10% in the network.","PeriodicalId":426451,"journal":{"name":"IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134526750","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}

引用次数: 216

Information Aggregation and Optimized Actuation in Sensor Networks: Enabling Smart Electrical Grids 传感器网络中的信息聚合和优化驱动:实现智能电网

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications Pub Date : 2007-05-01 DOI: 10.1109/INFCOM.2007.286

D. Pendarakis, Nisheeth Shrivastava, Zhen Liu, R. Ambrosio

{"title":"Information Aggregation and Optimized Actuation in Sensor Networks: Enabling Smart Electrical Grids","authors":"D. Pendarakis, Nisheeth Shrivastava, Zhen Liu, R. Ambrosio","doi":"10.1109/INFCOM.2007.286","DOIUrl":"https://doi.org/10.1109/INFCOM.2007.286","url":null,"abstract":"A large number of potential applications of sensor and actuator networks (SANETs) have emerged recently, for example in the areas of energy production and distribution and health care and telemedicine. SANETs integrate the tasks of sensing and actuation, the process of controlling the operation of a physical system by setting values for parameters of interest. Of particular importance in SANETs is the ability to set actuator parameters, typically depending on values observed by the sensors, so as to achieve a system-wide objective. However, SANETs with large number of nodes or covering wide geographical areas present scalability challenges that necessitate the use of summarization techniques resulting in sub-optimal actuation values. There is therefore a clear trade-off between the level of summarization and the quality of the computed actuation parameters. This paper focuses on two interdependent problems. The first is the issue of efficient aggregation and summarization of the measurements. The second is the distributed computation of optimal actuation parameters to achieve a system-wide objective. We first consider the problem under the assumption of semi-static sensed values and then extend our model to cover the general case where sensor state changes, triggering update events. We develop algorithms for efficient summarization of these events and demonstrate that they minimally impact optimal actuation. Our work is motivated by the domain of energy distribution networks and, in particular, intelligent electrical grids.","PeriodicalId":426451,"journal":{"name":"IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134560992","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}

引用次数: 16

A Framework for Tiered Service in MPLS Networks MPLS网络分层业务框架

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications Pub Date : 2007-05-01 DOI: 10.1109/INFCOM.2007.185

G. Rouskas, Nikhil Baradwaj

引用次数: 10

Optimal Spectrum Sharing for Multi-Hop Software Defined Radio Networks 多跳软件无线电网络的最优频谱共享

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications Pub Date : 2007-05-01 DOI: 10.1109/INFCOM.2007.9

Yiwei Thomas Hou, Yi Shi, H. Sherali

{"title":"Optimal Spectrum Sharing for Multi-Hop Software Defined Radio Networks","authors":"Yiwei Thomas Hou, Yi Shi, H. Sherali","doi":"10.1109/INFCOM.2007.9","DOIUrl":"https://doi.org/10.1109/INFCOM.2007.9","url":null,"abstract":"Software defined radio (SDR) capitalizes advances in signal processing and radio technology and is capable of reconfiguring RF and switching to desired frequency bands. It is a frequency-agile data communication device that is vastly more powerful than recently proposed multi-channel multi-radio (MC-MR) technology. In this paper, we investigate the important problem of multi-hop networking with SDR nodes. For such network, each node has a pool of frequency bands (not necessarily of equal size) that can be used for communication. The uneven size of bands in the radio spectrum prompts the need of further division into sub-bands for optimal spectrum sharing. We characterize behaviors and constraints for such multi-hop SDR network from multiple layers, including modeling of spectrum sharing and sub-band division, scheduling and interference constraints, and flow routing. We give a formal mathematical formulation with the objective of minimizing the required network-wide radio spectrum resource for a set of user sessions. Since such problem formulation falls into mixed integer non-linear programming (MINLP), which is NP-hard in general, we develop a lower bound for the objective by relaxing the integer variables and linearization. Subsequently, we develop a near-optimal algorithm to this MINLP problem. This algorithm is based on a novel sequential fixing procedure, where the integer variables are determined iteratively via a sequence of linear programming. Simulation results show that solutions obtained by this algorithm are very close to lower bounds obtained via relaxation, thus suggesting that the solution produced by the algorithm is near-optimal.","PeriodicalId":426451,"journal":{"name":"IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131054815","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}

引用次数: 186

Post-Failure Routing Performance with Multiple Routing Configurations 多路由配置下的故障后路由性能

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications Pub Date : 2007-05-01 DOI: 10.1109/INFCOM.2007.20

A. Kvalbein, T. Cicic, S. Gjessing

引用次数: 65

Min-Cost Multicast of Selfish Information Flows 自私信息流的最小代价组播

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications Pub Date : 2007-05-01 DOI: 10.1109/INFCOM.2007.35

Zongpeng Li

{"title":"Min-Cost Multicast of Selfish Information Flows","authors":"Zongpeng Li","doi":"10.1109/INFCOM.2007.35","DOIUrl":"https://doi.org/10.1109/INFCOM.2007.35","url":null,"abstract":"We study multicast in a non-cooperative environment where information flows selfishly route themselves through the cheapest paths available. The main challenge is to enforce such selfish multicast flows to stabilize at a socially optimal operating point incurring minimum total edge cost, through appropriate cost allocation and other economic measures, with replicable and encodable properties of information flows considered. We show that known cost allocation schemes are not sufficient. We provide a shadow-price based cost allocation for networks without capacity limits, and show it enforces minimum-cost multicast. This improves previous result where a 2-approximate multicast flow is enforced. For capacitied networks, computing cost allocation by ignoring edge capacities will not yield correct results. We show that an edge tax scheme can be combined with a cost allocation to strictly enforce optimal multicast flows in this more realistic case. If taxes are not desirable, they can be returned to flows while maintaining weak enforcement of the optimal flow. We relate the taxes to VCG payment schemes and discuss an efficient primal-dual algorithm that simultaneously computes the taxes, the cost allocation, and the optimal multicast flow.","PeriodicalId":426451,"journal":{"name":"IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133046536","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}

引用次数: 31

A Fast and Compact Method for Unveiling Significant Patterns in High Speed Networks 一种快速紧凑的高速网络中重要模式揭示方法

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications Pub Date : 2007-05-01 DOI: 10.1109/INFCOM.2007.220

T. Bu, Jin Cao, Aiyou Chen, P. Lee

{"title":"A Fast and Compact Method for Unveiling Significant Patterns in High Speed Networks","authors":"T. Bu, Jin Cao, Aiyou Chen, P. Lee","doi":"10.1109/INFCOM.2007.220","DOIUrl":"https://doi.org/10.1109/INFCOM.2007.220","url":null,"abstract":"Identification of significant patterns in network traffic, such as IPs or flows that contribute large volume (heavy hitters) or introduce large changes (heavy changers), has many applications in accounting and network anomaly detection. As network speed and the number of flows grow rapidly, tracking per-IP or per-flow statistics becomes infeasible due to both the computational overhead and memory requirements. In this paper, we propose a novel sequential hashing scheme that requires only O(H log N) both in memory and computational overhead that are close to being optimal, where N is the the number of all possible keys (e.g., flows, IPs) and H is the maximum number of heavy keys. Moreover, the generalized sequential hashing scheme makes it possible to trade off among memory, update cost, and detection cost in a large range that can be utilized by different computer architectures for optimizing the overall performance. In addition, we also propose statistically efficient algorithms for estimating the values of heavy hitters and heavy changers. Using both theoretical analysis and experimental studies of Internet traces, we demonstrate that our approach can achieve the same accuracy as the existing methods do but using much less memory and computational overhead.","PeriodicalId":426451,"journal":{"name":"IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133324705","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

Routing with a Markovian Metric to Promote Local Mixing 用马尔可夫度量路由促进局部混合

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications Pub Date : 2007-05-01 DOI: 10.1109/INFCOM.2007.285

Yunnan Wu, Saumitra M. Das, Ranveer Chandra

{"title":"Routing with a Markovian Metric to Promote Local Mixing","authors":"Yunnan Wu, Saumitra M. Das, Ranveer Chandra","doi":"10.1109/INFCOM.2007.285","DOIUrl":"https://doi.org/10.1109/INFCOM.2007.285","url":null,"abstract":"Routing protocols have traditionally been based on finding shortest paths under certain cost metrics. A conventional routing metric models the cost of a path as the sum of the costs on the constituting links. This paper introduces the concept of a Markovian metric, which models the cost of a path as the cost of the first hop plus the cost of the second hop conditioned on the first hop, and so on. The notion of the Markovian metric is fairly general. It is potentially applicable to scenarios where the cost of sending a packet (or a stream of packets) over a link may depend on the previous hop of the packet (or the stream). Such scenario arises, for instance, in a wireless mesh network equipped with local mixing, a recent link layer advance. This scenario is examined as a case study for the Markovian metric. The local mixing engine sits between the routing and MAC layers. It maintains information about the packets each neighbor has, and identifies opportunities to mix the outgoing packets via network coding to reduce the transmissions in the air. We use a Markovian metric to model the reduction of channel resource consumption due to local mixing. This leads to routing decisions that can better take advantage of local mixing. We have implemented a system that incorporates local mixing and source routing using a Markovian metric in Qualnet. The experimental results demonstrate significant throughput gain and resource saving.","PeriodicalId":426451,"journal":{"name":"IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132091680","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}

引用次数: 46

Software TDMA for VoIP Applications Over IEEE802.11 Wireless LAN 软件TDMA VoIP应用在IEEE802.11无线局域网

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications Pub Date : 2007-05-01 DOI: 10.1109/INFCOM.2007.282

F. Guo, T. Chiueh

引用次数: 26

Link Scheduling for Minimum Delay in Spatial Re-Use TDMA 空间复用TDMA中最小时延的链路调度

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications Pub Date : 2007-05-01 DOI: 10.1109/INFCOM.2007.12

P. Djukic, S. Valaee

{"title":"Link Scheduling for Minimum Delay in Spatial Re-Use TDMA","authors":"P. Djukic, S. Valaee","doi":"10.1109/INFCOM.2007.12","DOIUrl":"https://doi.org/10.1109/INFCOM.2007.12","url":null,"abstract":"Time division multiple access (TDMA) based medium access control (MAC) protocols provide QoS with guaranteed access to wireless channel. However, in multihop wireless networks, these protocols may introduce delay when packets are forwarded from an inbound link to an outbound link on a node. Delay occurs if the outbound link is scheduled to transmit before the inbound link. The total round trip delay can be quite large since it accumulates at every hop in the path. This paper presents a method that finds schedules with minimum round trip scheduling delay. We show that the scheduling delay can be interpreted as a cost collected over a cycle on the conflict graph. We use this observation to formulate a min-max program for the delay across a set of multiple paths. The min-max delay program is NP-complete since the transmission order of links is a vector of binary integer variables. We design heuristics to select appropriate transmission orders. Once the transmission orders are known, a modified Bellman-Ford algorithm is used to find the schedules. The simulation results confirm that the proposed algorithm can find effective min-max delay schedules.","PeriodicalId":426451,"journal":{"name":"IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128861920","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}

引用次数: 143