检索结果-内蒙古大学图书馆

ACM/IEEE International Conference on Model Driven Engineering Languages and Systems (MODELS)

作者： Enet, Josselin Bousse, Erwan Tisi, Massimo Sunye, Gerson Nantes Univ CNRS Ecole Cent Nantes IMT AtlantiqueLS2NUMR 6004 Nantes France

ISBN: (纸本)9798350324983

Domain-Specific Languages (DSLs) help manage the growing complexity of systems by facilitating their description and execution or simulation via tailored languages. A large part of the development costs of a DSL comes from building the associated tools it requires, such as an editor or a debugger. To reduce these costs, the Language Server protocol (LSP) and Debug Adapter protocol (DAP) enable the creation of generic tooling interfaces which rely on standardized services exposed by languages. However, as these protocols have been designed for General Purpose Languages (GPLs), their applicability to DSLs has no yet been extensively studied. In this paper, we analyze both LSP and DAP, with an emphasis regarding their relevance for the development of tooling for DSLs. We provide both a high-level insight into these protocols, such as a dependency graph of their services, and a more fine-grained qualitative analysis of each service. We show that while some services defined by these two protocols can be provided by any DSL, others make strong assumptions on the concepts that should be part of the considered DSL. Conversely, domain-specific concepts available in some DSLs are not exploitable through these protocols, thus reducing the capabilities of generic tools.

关键词： Programming Languages and Software algorithm/protocol design and analysis Testing and Debugging Document and Text Editing

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Aggregate Queries for Optimal Location Selection

引用

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 2019年第2期16卷 329-343页

作者： Yilmaz, Emre Ferhatosmanoglu, Hakan Ayday, Erman Aksoy, Remzi Can Bilkent Univ Comp Engn Dept TR-06800 Ankara Turkey Univ Warwick Dept Comp Sci Coventry CV4 7AL W Midlands England Bilkent Univ TR-06800 Ankara Turkey Univ Michigan Ann Arbor MI 48109 USA

Today, vast amounts of location data are collected by various service providers. These location data owners have a good idea of where their users are most of the time. Other businesses also want to use this information for location analytics, such as finding the optimal location for a new branch. However, location data owners cannot share their data with other businesses, mainly due to privacy and legal concerns. In this paper, we propose privacy-preserving solutions in which location-based queries can be answered by data owners without sharing their data with other businesses and without accessing sensitive information such as the customer list of the businesses that send the query. We utilize a partially homomorphic cryptosystem as the building block of the proposed protocols. We prove the security of the protocols in semi-honest threat model. We also explain how to achieve differential privacy in the proposed protocols and discuss its impact on utility. We evaluate the performance of the protocols with real and synthetic datasets and show that the proposed solutions are highly practical. The proposed solutions will facilitate an effective sharing of sensitive data between entities and joint analytics in a wide range of applications without violating their customers' privacy.

关键词： Privacy data encryption security integrity and protection query processing algorithm/protocol design and analysis

来源：评论

学校读者我要写书评

暂无评论

Proximity-Aware Location Based Collaborative Sensing for Energy-Efficient Mobile Devices

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2019年第2期18卷 417-430页

作者： Kwak, Jeongho Kim, Jihwan Chong, Song Trinity Coll Dublin Dept Comp Sci & Stat Dublin 2 Ireland Samsung Elect Suwon 443803 Gyeongi South Korea Korea Adv Inst Sci & Technol Sch Elect Engn Daejeon 34141 South Korea

A fundamental question in the study of location-based mobile sensing is how much energy can be saved while still guaranteeing the reliable localization accuracy. In this paper, we analyze key features of human proximity and find a motivation which implies that the energy-efficient and accurate localization is possible by sharing the locations of nearby mobile devices. From the location-based collaborative sensing idea, we formulate an optimization problem which aims to minimize the total number of location measurements for a given fairness criterion. Then, we propose a practical and distributed location sharing (DLS) protocol and an optimal parameter control algorithm (OWD) which makes the DLS protocol attain an asymptotic optimal performance. Via extensive simulations under various environments including real mobility traces, we verify that the proposed DLS+OWD policy significantly reduces the average power consumption of mobile devices with a higher fairness compared to the existing algorithms.

关键词： Distributed networks location based collaborative sensing short-range communications distributed applications algorithm/protocol design and analysis mobile environments

来源：评论

学校读者我要写书评

暂无评论

Byzantine Resilient protocol for the IoT

引用

IEEE INTERNET OF THINGS JOURNAL 2019年第2期6卷 2506-2517页

作者： Frohlich, Antonio Augusto Scheffel, Roberto Milton Kozhaya, David Verissimo, Paulo Esteves Univ Fed Santa Catarina Software Hardware Integrat Lab BR-88040900 Florianopolis SC Brazil ABB Corp Res CH-5405 Baden Switzerland Univ Luxembourg Interdisciplinary Ctr Secur Reliabil & Trust L-4364 Esch Sur Alzette Luxembourg

Wireless sensor networks (WSNs), often adhering to a single gateway architecture, constitute the communication backbone for many modern cyber-physical systems (CPSs). Consequently, fault-tolerance in CPS becomes a challenging task, especially when accounting for failures (potentially malicious) that incapacitate the gateway or disrupt the nodes-gateway communication, not to mention the energy, timeliness, and security constraints demanded by CPS domains. This paper aims at ameliorating the fault-tolerance of WSN-based CPS to increase system and data availability. To this end, we propose a replicated gateway architecture augmented with energy-efficient real-time Byzantine-resilient data communication protocols. At the sensors level, we introduce fault-tolerant trustful space-time protocol, a geographic routing protocol capable of delivering messages in an energy-efficient and timely manner to multiple gateways, even in the presence of voids caused by faulty and malicious sensor nodes. At the gateway level, we propose a multigateway synchronization protocol, which we call ByzCast, that delivers timely correct data to CPS applications, despite the failure or maliciousness of a number of gateways. We show, through extensive simulations, that our protocols provide better system robustness yielding an increased system and data availability while meeting CPS energy, timeliness, and security demands.

关键词： algorithm/protocol design and analysis fault-tolerance routing protocols wireless sensor networks (WSNs)

来源：评论

学校读者我要写书评

暂无评论

Optimal Packet Aggregation Scheduling in Wireless Networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2018年第12期17卷 2835-2852页

作者： Akyurek, Alper Sinan Rosing, Tajana Simunic Univ Calif San Diego Dept Elect & Comp Engn San Diego CA 92093 USA

One of the most critical emerging problems for 5G and Internet of Things is the handling of machine-to-machine communication. Wireless sensor networks are deployed every day, resulting in a more distributed infrastructure, where the communication and processing are handled by energy, bandwidth, and processing constrained devices. Aggregation of multiple packets flowing over the same path increases spectral efficiency, energy efficiency, and resource utilization. We address the problem of determining the optimal waiting time to maximize the utility within the network. We provide a general framework, where the utility function is user-defined for each individual application stream and packet. This allows the user to optimize for energy, delay, or expiration rate in the resolution of individual streams. Our algorithm calculates the optimal time for any given condition on-the-fly and can adapt to changing conditions with low computational complexity. We provide an optimal multi-hop distributed and scalable under congestion versions of our algorithm. Our simulations in ns3 show that we outperform state-of-the-art policies by 1.55x in terms of information freshness. Our solution reduces average power consumption by more than 60 percent. Our congestion-aware solution shows constant performance with increasing congestion levels, whereas state-of-the-art solutions degrade by up to 70 percent under the same conditions.

关键词： Wireless communication network management algorithm/protocol design and analysis iterative methods Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient algorithms for data retrieval from indexed parallel broadcast channels

引用

SUSTAINABLE COMPUTING-INFORMATICS & SYSTEMS 2017年第Dec.期16卷 93-105页

作者： Hurson, Ali R. Sarvestani, Sahra Sedigh Wisely, Mike Missouri Univ Sci & Technol Rolla MO 65409 USA

The advances in mobile device and wireless communication techniques have enabled anywhere, anytime information access. Information being accessed, whether structured or unstructured, can be classified into three categories: private data, shared data, and public data. Private and shared data are usually accessed through on-demand-based services, where user request is pushed to the server(s) and response to the request is generated and passed to the user (i.e., two way communication). Public data, on the other hand, can be most effectively disseminated using broadcasting technique (i.e., one way communication). In broadcasting, server(s) generates the broadcast contents and disseminate it through the air channel. The mobile user in search of public data, tunes to the air channel and pulls the desired information. The characteristics of mobile device and limitations of wireless communication technology pose challenges on broadcasting strategy as well as data retrieval algorithms. To reduce the access time and power consumption, major research issues include indexing techniques and data organization on air channel, broadcasting over single and parallel channel(s), data distribution and replication strategy, conflict resolution, and data retrieval methods This article is intended to articulate these challenges, propose several solutions, and through comprehensive simulation demonstrate the validity of the proposed solutions. (C) 2017 Elsevier Inc. All rights reserved.

关键词： algorithm/protocol design and analysis Query processing Retrieval models Ubiquitous computing Energy management Broadcasting

来源：评论

学校读者我要写书评

暂无评论

Network Coding as a Performance Booster for Concurrent Multi-Path Transfer of Data in Multi-Hop Wireless Networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2017年第4期16卷 1047-1058页

作者： Arianpoo, Nasim Aydin, Ilknur Leung, Victor C. M. Univ British Columbia Dept Elect Engn Vancouver BC V6T 1Z4 Canada Farmingdale State Coll Comp Syst Dept Farmingdale NY 11735 USA

The emerging use of multi-homed wireless devices along with simultaneous multi-path data transfer offers tremendous potentials to improve the capacity of multi-hop wireless networks. The use of simultaneous data transfer over separate disjoint paths in multi-hop wireless networks to increase network capacity is a less explored subject, mainly because of the challenges it triggers for the reliable transport layer protocols. Reliable transport layer protocols generally use packet sequence number as a mean to ensure delivery. As such, the out-of-order packet arrival in reliable transport layer protocols triggers receiver buffer blocking that causes throughput degradation and prevents the reliable multi-path transport layer protocol to realize its vast potential. This paper focuses on integrating network coding with a reliable multi-path transport layer protocol to resolve the receiver buffer blocking problem. We propose an adaptive network coding mechanism to desensitize the receiver against packet reordering and consequently eliminate the receiver buffer blocking problem. Our state-of-the-art network coding scheme uses a combination of Q-learning and logistic regression for rare data events to control the number of redundant packets based on the network dynamics. We confirmed the veracity of our proposed scheme by a queuing theory based mathematical model. Moreover, the effectiveness of the proposed scheme is demonstrated through simulations and testbed experiments.

关键词： Machine learning wireless coding and information theory Markov processes algorithm/protocol design and analysis SCTP-CMT

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient algorithms for data retrieval from indexed parallel broadcast channels

引用

SUSTAINABLE COMPUTING-INFORMATICS & SYSTEMS 2016年 10卷 20-35页

作者： Hurson, Ali R. Sarvestani, Sahra Sedigh Wisely, Mike Missouri Univ Sci & Technol Dept Comp Sci Rolla MO 65409 USA Missouri Univ Sci & Technol Dept Elect & Comp Engn Rolla MO 65409 USA

Constraints on the energy, bandwidth, and connectivity of mobile devices and wireless communication medium complicate the timely and reliable access to public data. Energy is often the most stringent constraint, necessitating techniques that facilitate operation in energy-saving modes. Broadcasting, typically over parallel channels, has proven to be an effective method for dissemination of public data to mobile devices. However, the employment of parallel channels introduces challenges associated with channel switching and conflicts due to concurrent accesses to multiple data items that ultimately increase energy consumption and response time. The detrimental effects on energy consumption and response time can be alleviated by scheduling the retrieval of data items in an order that reduces the number of passes over the air channels and channel switching between the parallel channels. In this paper, several scheduling algorithms are proposed and analyzed that achieve the aforementioned objectives. To further improve energy consumption and response time, the scope of our scheduling algorithms has been enhanced by replication of popular data items. The proposed scheduling algorithms, both with and without replication, have been simulated, and simulation results are presented and analyzed. These results show that the proposed scheduling algorithms, compared to some heuristic based methods, have greater impact in reducing energy consumption and response time. This reduction is shown to be more-pronounced with replication of data items. (C) 2016 Elsevier Inc. All rights reserved.

关键词： algorithm/protocol design and analysis Query processing Retrieval models Ubiquitous computing Energy management Broadcasting

来源：评论

学校读者我要写书评

暂无评论

GRaTIS: Free Bits in the Network

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2015年第1期14卷 72-85页

作者： Saha, Dola Dutta, Aveek Grunwald, Dirk Sicker, Douglas Univ Colorado Boulder CO 80309 USA Univ Colorado Dept Elect Comp & Energy Engn Boulder CO 80309 USA Univ Colorado Dept Comp Sci Dept Elect & Comp Engn Boulder CO 80309 USA Univ Colorado Dept Comp Sci Boulder CO 80309 USA

Recent work has examined techniques to estimate the "best" modulation rate for data networks such as 802.11a/g. While accurate rate estimation yields better rate-selection decisions and increased throughput, those methods must still choose between a handful of modulation rates. Each modulation rate is effective in a range of actual signal-to-noise ratios (SNRs) but the limited number of practical rates means that transmitters are often forced to "step down" to a lower data rate despite having a higher SNR than the minimum required for that lower rate. In this paper we describe, evaluate and implement a practical multiuser communication scheme that exploits these discrete "steps" in modulation rates to transmit two packets in the time normally needed to transmit a single packet, increasing aggregate throughput precisely when it is most needed-when the network is busy and suffers from rate unfairness. Because the method transmits a group of packets simultaneously, we call this scheme Group Rate Transmission with Intertwined Symbols, or GRaTIS. In addition to up to 120% improvement in network throughput achieved by GRaTIS, the technique is backward compatible with 802.11 and doesn't require complex DSP algorithms as required by competing methods.

关键词： Wireless communication protocol architecture signal processing systems algorithm/protocol design and analysis reconfigurable hardware

来源：评论

学校读者我要写书评

暂无评论

Emerging Applications for Cyber Transportation Systems

引用

Journal of Computer Science & Technology 2014年第4期29卷 562-575页

作者： Aditya Wagh 侯云飞乔春明张龙飞李旭 Adel Sadek Kevin Hulme 吴昌旭徐宏力黄刘生 IEEE Department of Computer Science and Engineering State University of New York at Buffalo Buffalo NY 14260-2000 U.S.A. Department of Civil Structural and Environmental Engineering State University of New York at Buffalo Buffalo NY 14260-2000 U.S.A. The New York State Center for Engineering Design and Industrial Innovation Buffalo NY 14260 U.S.A. Department of Industrial and System Engineering State University of New York at Buffalo Buffalo NY 14260-2000 U.S.A. School of Computer Science and Technology Suzhou Institute for Advanced Study University of Science and Technology of China

Recent advances in connected vehicles and autonomous driving are going to change the face of ground trans- portation as we know it. This paper describes the design and evaluation of several emerging applications for such a cyber transportation system （CTS）. These applications have been designed using holistic approaches, which consider the unique roles played by the human drivers, the transportation system, and the communication network. They can improve driver safety and provide on-road infotainment. They can also improve transportation operations and efficiency, thereby benefiting travelers and attracting investment from both government agencies and private businesses to deploy infrastructures and bootstrap the evolutionary process of CTS.

关键词： emerging technology application algorithm/protocol design and analysis cyber transportation system

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：