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

1993 International Conference on Parallel Processing, ICPP 1993

作者： Su, Chien-Chun Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109-2122 United States

ISBN: (纸本)0849389836

We present three protocols defin ing the relationship between messages and the chan nel resources requested: request-then-hold, requestthen wait, and request-then-relinquish. Based on the three protocols, we develop an adaptive deadlockfree routing algorithm called the SP routing. The SP routing uses shortest paths and is fully-adaptive, so messages can be routed via any of the shortest paths from the source to the destination. Since it is a minimal or shortest routing, the SP routing guar antees the freedom of livelocks. The SP routing is not limited to a specific network topology. The main requirement for an applicable network topology is that there exists a deterministic, minimal, deadlock-free routing algorithm. Most ex isting network topologies are equipped with such an algorithm. In this paper, we present an adaptive deadlock-free routing agorithm for n-dimensional meshes by using the SP routing. The hardware re quired by the SP routing uses only one extra virtual channel as compared to the deterministic routing. © 1993 IEEE.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

Non-preemptive scheduling of messages on controller area network for real-time control applications

Non-preemptive scheduling of messages on controller area net...

引用

1995 real-time Technology and Applications Symposium, RTAS 1995

作者： Zuberi, Khawar M. Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI 48109-2122 United States

Scheduling messages on the controller area network (CAN) corresponds to assigning identifiers (IDs) to messages according to their priorities. If fixed priority scheduling such as deadline monotonic (DM) is used to calculate these priorities, then in general, it will result in low schedulability. Dynamic scheduling schemes such as earliest deadline (ED) can give greater schedulability, but they are not practical for CAN because if the ID is to reflect message deadlines then a long ID must be used. This increases the length of each message to the point that ED is no better than DM. Our solution to this problem is the mixed traffic scheduler (MTS), which is a cross between ED and DM, and provides high schedulability without needing long IDs. Through simulations, we compare the performance of MTS with that of DM and ED* (an imaginary scheduler which works like ED, except it needs only short IDs). We use a realistic workload in our simulations based on messages typically found in computer integrated manufacturing. Our simulations show that MTS performs much better than DM and at the same level as ED, except under high loads and tight deadlines, when ED* is superior. © 1995 IEEE.

关键词： real time control

来源：评论

学校读者我要写书评

暂无评论

On accurate measurement of link quality in multi-hop wireless mesh networks

On accurate measurement of link quality in multi-hop wireles...

引用

12th Annual International Conference on Mobile computing and Networking, MOBICOM 2006

作者： Kim, Kyu-Han Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI 48109-2121 United States

ISBN: (纸本)1595932860

This paper presents a highly efficient and accurate link-quality measurement framework, called EAR (Efficient and Accurate link-quality monitoR), for multi-hop wireless mesh networks, that has several salient features. First, it exploits three complementary measurement schemes: passive, cooperative, and active monitoring. EAR maximizes the measurement accuracy by (i) dynamically and adaptively adopting one of these schemes and (ii) opportunistically exploiting the unicast application traffic present in the network, while minimizing the measurement overhead. Second, EAR effectively identifies the existence of wireless link asymmetry by measuring the quality of each link in both directions of the link, thus improving the utilization of network capacity by up to 114%. Finally, its reliance on both the network layer and the IEEE 802.11-based device driver solutions makes EAR easily deployable in existing multi-hop wireless mesh networks without system recompilation or MAC firmware modification. EAR has been evaluated extensively via both n.s-2-based simulation and experimentation on our Linux-based implementation. Both simulation and experimentation results have shown EAR to provide highly accurate link-quality measurements with minimum overhead. Copyright 2006 ACM.

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Towards Energy-Efficiency: Integrating MATD3 Reinforcement Learning Method for Computational Offloading in RIS-Aided UAV-MEC Environments

引用

IEEE Internet of Things Journal 2025年

作者： Wu, Liangshun Zhang, Cong Zhang, Bin Du, Jianbo Qu, Junsuo Key Laboratory of Embedded System and Service Computing Tongji University Ministry of Education Shanghai201804 China Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai201210 China School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai200240 China Xi'an Key Laboratory of Advanced Control and Intelligent Process School of Automation Xi'an University of Posts & Telecommunications Xi'an710061 China Xinjiang University of Political Science and Law Tumushuke832003 China School of Remote Sensing and Information Engineering Wuhan University Wuhan430079 China Department of Computer City University of Hong Kong 999077 Hong Kong School of Communications and Information Engineering Xi'an University of Posts & Telecommunications Xi'an710061 China

With the proliferation of IoT devices, there is an escalating demand for enhanced computing and communication capabilities. Mobile Edge computing (MEC) addresses this need by relocating computing resources to the network edge, thereby delivering swifter and more efficient services. This paper introduces a computation offloading and energy consumption optimization framework that leverages Reconfigurable Intelligent Surfaces (RIS), Unmanned Aerial Vehicles (UAVs), and MEC. The scheme aims to maximize energy efficiency through the optimization of task allocation, RIS phase shifts, and UAV trajectories. By employing the Multi-Agent Twin Delayed Deep Deterministic Policy Gradient (MATD3) reinforcement learning algorithm, the paper further refines UAV trajectories and RIS configurations. The simulation results indicate that the proposed method surpasses the traditional Concave-Convex Procedure (CCCP) algorithm in both UAV trajectory control and RIS configuration, demonstrating quicker convergence and enhanced stability. The method proves to be adaptable to diverse environments and tasks, showcasing notable benefits in RIS-assisted interference suppression, particularly with large RIS, thereby enhancing UAV data reception rates. Additionally, MATD3 exhibits faster and smoother convergence for extended task durations and smaller RIS scenarios. Simulation results reveal that UAVs tend to move closer to RIS, with energy efficiency falling as IoT tasks increase, affirming the proposed algorithm's high energy efficiency and effectiveness. © 2025 IEEE.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

Comparison of connection admission-control schemes in the presence of hand-offs in cellular networks 98

Comparison of connection admission-control schemes in the pr...

引用

4th Annual ACM/IEEE International Conference on Mobile computing and Networking, MobiCom 1998

作者： Choi, Sunghyun Shin, Kang G. Real-Time Computing Laboratory Department Of Electrical Engineering And Computer Science The University Of Michigan Ann ArborMI48109-2122 United States

ISBN: (纸本)9781581130355

In this paper, we compare four distributed connection admission control schemes in cellular networks where the first two schemes are to keep the hand-off dropping probability below a target value, the third scheme is to guarantee no hand-off drops through a per-connection bandwidth reservation, and the fourth scheme uses another type of per-connection bandwidth reservation. The first scheme predicts the bandwidth required to handle hand-offs by estimating possible hand-offs from adjacent cells, then performs the admission control for each newly-requested connection. On the other hand, the second scheme predicts the total required bandwidth in the current cell by estimating both incoming and outgoing hand-offs at each cell. The third scheme requires the set of cells which the mobile with a newly-requested connection will traverse, and reserves bandwidth for each connection in each of those cells. The fourth scheme reserves bandwidth for each connection in the predicted next cell of a mobile. We adopt the history-based mobility estimation for the first two schemes. Using extensive simulations, the four schemes are compared quantitatively in terms of (1) important performance measures such as the hand-off dropping probability, connection-blocking probability, and bandwidth utilization, (2) dependency on the de-sign parameters, (3) dependency on the mobility estimation accuracy, and (4) complexity. The simulation results indicate that the first scheme is the most desirable in the sense that it achieves reasonably good performance while requiring much less memory and computation than the other three schemes. © Copyright ACM 1998.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Dependable, efficient, scalable architecture for management of large-scale batteries 10

Dependable, efficient, scalable architecture for management ...

引用

1st ACM/IEEE International Conference on Cyber-Physical Systems, ICCPS 2010

作者： Kim, Hahnsang Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI 48109-2121 United States

ISBN: (纸本)9781450300667

Conventional battery management systems (BMSs) for electric vehicles (EVs) are designed in an ad hoc way, causing the supply of EVs to fall behind the market demand. A well-designed and combined hardware-software architecture is essential for the management of a large-scale battery pack that consists of thousands of battery cells as in Tesla Motors and GM Chevy Volt. We propose a Dependable, Efficient, Scalable Architecture (DESA) that effectively monitors a large number of battery cells, efficiently controls and reconfigures, if needed, their connection arrangement. DESA is monarchy-based and supports hierarchical, autonomous management of battery cells, where a global BMS orchestrates a group of local BMSs. A local controller on each local BMS autonomously manages an array of battery cells, and the global controller reconfigures the connectivity of such battery-cell arrays in coordination with the local controllers. Configuration of a battery system is controlled by three types of switch - called P-, S-, and B-switches - and an algorithm that changes the setting of these switches. Our evaluation results show that DESA effectively tolerates battery-cell failures by order of magnitude - while achieving service cost savings 7.4 times - more than a conventional BMS. This superior performance not only extends the battery life signifcantly, but also provides the flexibility in supporting diverse electric power demands from a growing number of on-board applications. © 2010 ACM.

关键词： Software architecture

来源：评论

学校读者我要写书评

暂无评论

ARCMA: Attack-resilient collaborative message authentication in Wireless Sensor Networks 08

ARCMA: Attack-resilient collaborative message authentication...

引用

4th International Conference on Security and Privacy in Communication Networks, SecureComm'08

作者： Cho, Min-Gyu Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI 48109-2121 United States

ISBN: (纸本)9781605582412

Data Centric Storage (DCS) is a well-known data storage and query processing mechanism for Wireless Sensor Networks (WSNs), storing sensed data or their metadata at pre-specified locations. Queries issued by mobile users are sent to, and processed at, such storage nodes. However, securing DCS is very difficult because WSNs usually operate in an unattended environment and hence are subject to node-capture attacks. Even after capturing a single node, an attacker may be able to subvert the entire system by using the keying material extracted from the captured node. To remedy/alleviate the above problem, we propose Attack-Resilient Collaborative Message Authentication (ARCMA), in which sensor nodes collaboratively authenticate messages to be sent to, or received from, remote nodes. In ARCMA, each node belongs to one of k groups, and constructs an Authentication Tree (AT) which is formed with k nodes, each from a distinct group. Each node collaborates with the other nodes in its AT to authenticate messages. We propose two heuristics, called MIN and OPT, to construct ATs. Our analysis shows that the security of ARCMA does not degrade until the attacker capture k or more nodes. We also evaluate the overhead of constructing ATs and the cost of authenticating messages using ATs. Copyright 2008 ACM.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Improving wait-free algorithms for interprocess communication in embedded real-time systems

Improving wait-free algorithms for interprocess communicatio...

引用

2002 USENIX Annual Technical Conference

作者： Huang, Hai Pillai, Padmanabhan Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109-2122 United States

ISBN: (纸本)1880446006

Concurrency management is a basic requirement for interprocess communication in any multitasking system. This usually takes the form of lock-based or other blocking algorithms. In real-time and/or time-sensitive systems, the less-predictable timing behavior of lock-based mechanisms and the additional task-execution dependency make synchronization undesirable. Recent research has provided non-blocking and wait-free algorithms for interprocess communication, particularly in the domain of single-writer, multiple-reader semantics, but these algorithms typically incur high costs in terms of computation or space complexity, or both. In this paper, we propose a general transformation mechanism that takes advantage of temporal characteristics of the system to reduce both time and space overheads of current single-writer, multiple-reader algorithms. We show a 17–66% execution time reduction along with a 14–70% memory space reduction when three wait-free algorithms are improved by applying our transformation. We present three new algorithms for wait-free, single-writer, multiple-reader communication along with detailed performance evaluation of nine algorithms under various experimental conditions. © 2002 USENIX Association. All rights reserved.

关键词： Locks (fasteners)

来源：评论

学校读者我要写书评

暂无评论

OPEN FAULTS IN BICMOS GATES

引用

IEEE TRANSACTIONS ON computer-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1995年第5期14卷 567-575页

作者： MA, SC MCCLUSKEY, EJ Center for Reliable Computing Computer Systems Laboratory Department of Electrical Engineering and Computer Science University of Stanford Stanford CA USA

Opens in BICMOS structures are analyzed here. It is shown that some opens cannot be detected by stuck-fault or other functional tests, since some transistors in BiCMOS gates do not affect the logical function of the gate. A switch-level model for CMOS circuits is extended to include bipolar devices. With this switch-level model, opens that cannot be detected by stuck-faults or other functional tests are easily identified. It is also shown that, in BICMOS circuits, an open defect in one transistor can accelerate the wearout of another nondefective transistor.

关键词： BiCMOS integrated circuits Circuit faults Circuit testing Semiconductor device modeling Logic testing Delay MOSFETs Switching circuits Acceleration CMOS technology

来源：评论

学校读者我要写书评

暂无评论

Fusing Bluetooth with Pedestrian Dead Reckoning: A Floor Plan-Assisted Positioning Approach

arXiv

引用

arXiv 2025年

作者： Pan, Wenxuan Yang, Yang Chen, Mingzhe Wei, Dong Guo, Caili Mao, Shiwen Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China Department of Electrical and Computer Engineering the Institute for Data Science and Computing University of Miami Coral GablesFL33146 United States Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China Beijing Laboratory of Advanced Information Networks School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China Wireless Engineering Research and Education Center Auburn University AuburnAL36849 United States

Floor plans can provide valuable prior information that helps enhance the accuracy of indoor positioning systems. However, existing research typically faces challenges in efficiently leveraging floor plan information and applying it to complex indoor layouts. To fully exploit information from floor plans for positioning, we propose a floor plan-assisted fusion positioning algorithm (FP-BP) using Bluetooth low energy (BLE) and pedestrian dead reckoning (PDR). In the considered system, a user holding a smartphone walks through a positioning area with BLE beacons installed on the ceiling, and can locate himself in real time. In particular, FP-BP consists of two phases. In the offline phase, FP-BP programmatically extracts map features from a stylized floor plan based on their binary masks, and constructs a mapping function to identify the corresponding map feature of any given position on the map. In the online phase, FP-BP continuously computes BLE positions and PDR results from BLE signals and smartphone sensors, where a novel grid-based maximum likelihood estimation (GML) algorithm is introduced to enhance BLE positioning. Then, a particle filter is used to fuse them and obtain an initial estimate. Finally, FP-BP performs post-position correction to obtain the final position based on its specific map feature. Experimental results show that FP-BP can achieve a real-time mean positioning accuracy of 1.19 m, representing an improvement of over 28% compared to existing floor plan-fused baseline algorithms. Copyright © 2025, The Authors. All rights reserved.

关键词： Photomapping

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：