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

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

来源：评论

学校读者我要写书评

暂无评论

引用

中国计算机科学前沿 2010年第4期4卷 500-515页

作者： Ye TIAN Bangchuan LIU Zhenhua HE Anhui Province Key Laboratory on High Performance Computing and Application School of Computer Science and TechnologyUniversity of Science and Technology of ChinaHefei 230027China

With the success of lnternet video-on-demand (VoD) streaming services, the bandwidth required and the financial cost incurred by the host of the video server becoming extremely large. Peer-to-peer (P2P) networks and proxies are two common ways for reducing the server workload. In this paper, we consider a peer-assisted Internet VoD system with proxies deployed at domain gateways. We formally present the video caching problem with the objectives of reducing the video server workload and avoiding inter-domain traffic, and we obtain its optimal solution. Inspired by theoretical analysis, we develop a practical protocol named PopCap for Internet VoD services. Compared with previous work, PopCap does not require additional infrastructure support, is inexpensive, and able to cope well with the characteristic workloads of Interact VoD services. From simulationbased experiments driven by real-world data sets from YouTube, we find that PopCap can effectively reduce the video server workload, therefore provides a superior performance regarding the video server's traffic reduction.

关键词： Internet video-on-demand (VoD) peer-to-peer (P2P) caching algorithm/protocol design and analysis

来源：评论

学校读者我要写书评

暂无评论

Improving Spectral and Temporal Efficiency of Collocated IEEE 802.15.4 LR-WPANs

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2009年第12期8卷 1596-1609页

作者： Kim, Tae Hyun Ha, Jae Yeol Choi, Sunghyun Univ Illinois Wireless Networking Grp Coordinated Sci Labs 459 Urbana IL 61801 USA MZEN Co Ltd Res & Dev Team Seoul 143140 South Korea Seoul Natl Univ Sch Elect Engn Multimedia & Wireless Networking Lab Seoul 151742 South Korea

The number of frequency channels specified for IEEE 802.15.4 low-rate wireless personal area networks (LR-WPANs) does not suffice to operate a variety of collocated WPAN applications that the standard is targeting. To overcome this limit, we introduce Virtual Channel, a novel concept to increase the number of available channels by efficiently managing given spectral and temporal resources. A virtual channel is created by scheduling a superframe and selecting a logical channel. This extends the notion of a channel from spectral domain to spectral and temporal domain. Specifically, we propose a superframe scheduler using throughput estimation (SUTE) of the IEEE 802.15.4 carrier sense multiple access with collision avoidance (CSMA/CA). In addition, nearest vacancy search (NEVS) is proposed, both of which are for temporal efficiency of the collocation. For both spectral and temporal efficiency, virtual channel selector (VCS) is proposed. The simulation results show that a remarkable improvement on the collocation efficiency of IEEE 802.15.4 can be achieved by our proposals. Moreover, this study also reveals the fundamental drawback of the current standard in terms of the collocation efficiency that the beacon interval and superframe duration are adjustable only by exponent parameters.

关键词： algorithm/protocol design and analysis wireless sensor networks standards mobile communication systems scheduling

来源：评论

学校读者我要写书评

暂无评论

Cluster Overlay Broadcast (COB): MANET routing with complexity polynomial in source-destination distance

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2006年第6期5卷 653-667页

作者： Ritchie, L Yang, HS Richa, AW Reisslein, M Arizona State Univ Dept Elect Engn Goldwater Ctr Tempe AZ 85287 USA Kyungnam Univ Div Elect & Elect Engn Masan 631701 South Korea Arizona State Univ Dept Comp Sci & Engn Tempe AZ 85287 USA

Routing algorithms with time and message complexities that are provably low and independent of the total number of nodes in the network are essential for the design and operation of very large scale wireless mobile ad hoc networks (MANETs). In this paper, we develop and analyze Cluster Overlay Broadcast (COB), a low-complexity routing algorithm for MANETs. COB runs on top of a one-hop cluster cover of the network, which can be created and maintained using, for instance, the Least Cluster Change (LCC) algorithm. We formally prove that the LCC algorithm maintains a cluster cover with a constant density of cluster leaders with minimal update cost. COB discovers routes by flooding (broadcasting) route requests through the network of cluster leaders with a doubling radius technique. Building on the constant density property of the network of cluster leaders, we formally prove that, if there exists a route from a source to a destination node with a minimum hop count of Delta, then COB discovers a route with at most O(Delta) hops from the source to the destination node in at most O(Delta) time and by sending at most O(Delta(2)) messages. We prove this result for arbitrary node distributions and mobility patterns and also show that COB adapts asymptotically optimally to the mobility of the nodes. In our simulation experiments, we examine the network layer performance of COB, compare it with Dynamic Source Routing, and investigate the impact of the MAC layer on COB routing.

关键词： one-hop clustering algorithm/protocol design and analysis message complexity routing protocol scalability time complexity wireless mobile ad hoc network

来源：评论

学校读者我要写书评

暂无评论

SELECT: Self-learning collision avoidance for wireless networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2008年第3期7卷 305-321页

作者： Chen, Chun-Cheng Seo, Eunsoo Kim, Hwangnam Luo, Haiyun Univ Illinois Dept Comp Sci Urbana IL 61801 USA Korea Univ Sch Elect Engn Seoul 136713 South Korea

The limited number of orthogonal channels and autonomous installations of hot spots and home wireless networks often leave neighboring 802.11 basic service sets (BSSs) operating on the same or overlapping channels, therefore interfering with each other. However, the 802.11 medium access control (MAC) does not work well in resolving inter-BSS interference due to the well-known hidden/exposed-receiver problem, which has been haunting the research community for more than a decade. In this paper, we propose SELECT, an effective and efficient self-learning collision avoidance strategy to address the hidden/exposed-receiver problem in 802.11 wireless networks. SELECT is based on the observation that carrier sense with received signal strength (RSS) measurements at the sender and the receiver can be strongly correlated. A SELECT-enabled sender exploits such correlation using an automated online learning algorithm and makes an informed judgment of the channel availability at the intended receiver. SELECT achieves collision avoidance at packet-level time granularity, involves zero communication overhead, and easily integrates with the 802.11 Distributed Coordination Function (DCF). Our evaluation in analysis, simulations, and prototype experiments show that SELECT addresses the hidden/exposed-receiver problem well. In typical hidden/exposed-receiver scenarios, SELECT improves the throughput by up to 140 percent and the channel access success ratio by up to 302 percent while almost completely eliminating contention-induced data packet drops.

关键词： wireless communication access schemes algorithm/protocol design and analysis

来源：评论

学校读者我要写书评

暂无评论

Tree-based object tracking without mobility statistics in wireless sensor networks

引用

WIRELESS NETWORKS 2010年第5期16卷 1263-1276页

作者： Yen, Li-Hsing Wu, Bang Ye Yang, Chia-Cheng Natl Univ Kaohsiung Dept Comp Sci & Informat Engn Kaohsiung 811 Taiwan Natl Chung Cheng Univ Dept Comp Sci & Informat Engn Taipei 621 Chiayi County Taiwan Chung Hua Univ Dept Comp Sci & Informat Engn Hsinchu 300 Taiwan

Object tracking in wireless sensor networks is to track mobile objects by scattered sensors. These sensors are typically organized into a tree to deliver report messages upon detecting object's move. Existing tree construction algorithms all require a mobility profile that characterizes the movement statistics of the target object. Mobility profiles are generally obtained based on historical running traces. The contribution of this work is twofold. We first show that the problem of finding an optimal message report tree that requires the least amount of report messages is NP-hard. We then propose analytic estimates of mobility profiles based on Markov-chain model. This profiling replaces an otherwise experimental process that generates and analyzes running traces. Simulation results show that the analytic profiling works well and can replace costly statistical profiling without noticeable performance degradation.

关键词： Network topology Sensor networks algorithm/protocol design and analysis Trees Stochastic processes

来源：评论

学校读者我要写书评

暂无评论

The design and evaluation of unified cellular and ad hoc networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2007年第9期6卷 1060-1074页

作者： Luo, Haiyun Meng, Xiaqiao Ramjee, Ram Sinha, Prasun Li, Li (Erran) Univ Illinois Dept Comp Sci Urbana IL 61801 USA NEC Labs Amer Auton Survivable Distributed Syst Grp Princeton NJ 08540 USA Bell Labs Murray Hill NJ 07974 USA Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA

In third-generation (3G) wireless data networks, providing service to low data-rate users is required for maintaining fairness, but at the cost of reducing the cell's aggregate throughput. In this paper, we propose the Unified Cellular and Ad Hoc Network (UCAN) architecture for enhancing cell throughput while maintaining fairness. In UCAN, a mobile client has both 3G interface and IEEE 802.11-based peer-to-peer links. The 3G base station forwards packets for destination clients with poor channel quality to proxy clients with better channel quality. The proxy clients then use an ad hoc network composed of other mobile clients and IEEE 802.11 wireless links to forward the packets to the appropriate destinations, thereby improving cell throughput. We refine the 3G base station scheduling algorithm so that the throughput gains are distributed in proportion to users' average channel rates, thereby maintaining fairness. With the UCAN architecture in place, we propose novel greedy and on-demand protocols for proxy discovery and ad hoc routing that explicitly leverage the existence of the 3G infrastructure to reduce complexity and improve reliability. We further propose secure crediting mechanisms to motivate users that are not actively receiving to participate in relaying packets for others. Through both analysis and extensive simulations with HDR and IEEE 802.11b, we show that the UCAN architecture can increase individual user's throughput by more than 100 percent and the aggregate throughput of the HDR downlink by up to 50 percent.

关键词： wireless algorithm/protocol design and analysis mobile communication systems

来源：评论

学校读者我要写书评

暂无评论

A Distributed Constraint Satisfaction Problem Approach to Virtual Device Composition

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2012年第11期23卷 1997-2009页

作者： Karmouch, Eric Nayak, Amiya Univ Ottawa Sch Elect Engn & Comp Sci Ottawa ON K1N 6N5 Canada

The dynamic composition of networked appliances, or virtual devices, enables users to generate complex, strong, and specific systems. Current MANET-based composition schemes use service discovery mechanisms that depend on periodic service advertising by controlled broadcast, resulting in the unnecessary depletion of node resources. The assumption that, once generated, a virtual device is to remain static is false;the device should gracefully degrade and upgrade along with the conditions in the user's environment, particularly the network's current performance requirements. Presently, schemes for infrastructure-less virtual device composition and management do not consider this adaptation. We present a distributed constraint satisfaction problem (distCSP) for virtual device composition in MANETs that addresses these issues together with simulations that show its effectiveness and efficiency.

关键词： Pervasive computing multimedia applications algorithm/protocol design and analysis mobile environments constraint satisfaction

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient neighbor discovery protocol for mobile wireless sensor networks

引用

AD HOC NETWORKS 2009年第1期7卷 24-41页

作者： Kohvakka, Mikko Suhonen, Jukka Kuorilehto, Mauri Kaseva, Ville Haennikaeinen, Marko Haemaelaeinen, Timo D. Tampere Univ Technol Inst Digital & Comp Syst FI-33720 Tampere Finland

Low energy consumption is a critical design requirement for most wireless sensor network (WSN) applications. Due to minimal transmission power levels, time-varying environmental factors and mobility of nodes, network neighborhood changes frequently. In these conditions, the most critical issue for energy is to minimize the transactions and time consumed for neighbor discovery operations. In this paper, we present an energy-efficient neighbor discovery protocol targeted at synchronized low duty-cycle medium access control (MAC) schemes such as IEEE 802.15.4 and S-MAC. The protocol effectively reduces the need for costly network scans by proactively distributing node schedule information ill MAC protocol beacons and by using this information for establishing new communication links. Energy consumption is further reduced by optimizing the beacon transmission rate. The protocol is validated by performance analysis and experimental measurements with physical WSN prototypes. Experimental results show that the protocol can reduce node energy consumption up to 80% at 1-3 m/s node mobility. (C) 2007 Elsevier B.V. All rights reserved.

关键词： algorithm/protocol design and analysis Low power design Mobile computing Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：