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

Cost- and Collision-Minimizing Forwarding Schemes for Wireless Sensor Networks: design, analysis, and Experimental Validation

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2009年第3期8卷 322-337页

作者： Rossi, Michele Bui, Nicola Zorzi, Michele Consotzio Ferrara Ric CFR I-44100 Ferrara Italy Univ Padua Dept Informat Engn I-35131 Padua Italy

The paper presents an original integrated MAC and routing scheme for wireless sensor networks. Our design objective is to elect the next hop for data forwarding by jointly minimizing the amount of signaling to complete a contention and maximizing the probability of electing the best candidate node. Toward this aim, we represent the suitability of a node to be the relay by means of locally calculated and generic cost metrics. Based on these costs, we analytically model the access selection problem through dynamic programming techniques, which we use to find the optimal access policy. Hence, we propose a contention-based MAC and forwarding technique, called Cost- and Collision-Minimizing Routing (CCMR). This scheme is then thoroughly validated and characterized through analysis, simulation, and experimental results.

关键词： Routing protocols distributed applications algorithm/protocol design and analysis dynamic programming 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

来源：评论

学校读者我要写书评

暂无评论

A theory of network localization

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2006年第12期5卷 1663-1678页

作者： Aspnes, James Eren, Tolga Goldenberg, David K. Morse, A. Stephen Whiteley, Walter Yang, Yang Richard Anderson, Brian D. O. Belhumeur, Peter N. Yale Univ Dept Comp Sci New Haven CT 06520 USA Yale Univ Dept Elect Engn Lab Control Sci & Engn New Haven CT 06520 USA York Univ Dept Math & Stat N York ON M3J 1P3 Canada Natl ICT Australia Ltd Canberra ACT 2601 Australia Columbia Univ Dept Comp Sci New York NY 10029 USA

In this paper, we provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors. We construct grounded graphs to model network localization and apply graph rigidity theory to test the conditions for unique localizability and to construct uniquely localizable networks. We further study the computational complexity of network localization and investigate a subclass of grounded graphs where localization can be computed efficiently. We conclude with a discussion of localization in sensor networks where the sensors are placed randomly.

关键词： computer systems organization communication/networking and IT mobile computing algorithm/protocol design and analysis architectures theory of computation analysis of algorithms and problem complexity nonnumerical algorithms and problems geometrical problems and computation mathematics of computing discrete mathematics graph theory network problems computer applications mobile applications location-dependent and sensitive wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

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 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

来源：评论

学校读者我要写书评

暂无评论

Optimizing Communication Overhead while Reducing Path Length in Beaconless Georouting with Guaranteed Delivery for Wireless Sensor Networks

引用

IEEE TRANSACTIONS ON COMPUTERS 2013年第12期62卷 2440-2453页

作者： Ruehrup, Stefan Stojmenovic, Ivan Telecommun Res Ctr Vienna FTW A-1220 Vienna Austria Univ Ottawa Sch Informat Technol & Engn Ottawa ON K1T 3V4 Canada King Abdulaziz Univ Jeddah 21413 Saudi Arabia

Beaconless or contention-based geographic routing algorithms forward packets toward a geographical destination reactively without the knowledge of the neighborhood. Such algorithms allow greedy forwarding, where only the next hop neighbor responds after a timer-based contention using only three messages (RTS, CTS, and DATA) per forwarding step. However, existing contention-based schemes for recovery from greedy failures do not have this property. In this paper, we show that recovery is possible within this 3-message scheme: the Rotational Sweep (RS) algorithm directly identifies the next hop after timer-based contention and constructs a traversal path that ensures progress after a greedy failure. It uses a traversal scheme (called Sweep Circle) that forwards a message along the alpha-shape of the network and provides recovery paths shorter or equal to the prominent face routing with Gabriel graph planarization. An alternative traversal scheme (called Twisting Triangle) provides even shorter routes on average, as shown by simulations. They both also reduce per-node overall network contention delays. We prove that both traversal schemes guarantee delivery in unit disk graphs. Our traversal schemes avoid planarization and are easy to implement, based merely on the evaluation of a function of a neighbor node's relative position. They can also be used for boundary detection and improve path-length in conventional beacon-based routing.

关键词： Routing protocols algorithm/protocol design and analysis

来源：评论

学校读者我要写书评

暂无评论

Distributed algorithm for efficient construction and maintenance of connected k-hop dominating sets in mobile ad hoc networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2008年第4期7卷 444-457页

作者： Yang, Hong-Yen Lin, Chia-Hung Tsai, Ming-Jer Natl Tsing Hua Univ Dept Comp Sci Hsinchu 300 Taiwan

A k-hop dominating set is a subset of nodes such that each node that is not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can be used for disseminating topology update packets or route request packets, in which the flooding search space is reduced to the set, resulting in significant flooding overhead reduction in broadcast-related applications. In mobile ad hoc networks, a connected k-hop dominating set may become disconnected due to node mobility or switch-off, which necessitates the reformation of the k-hop dominating set. In this paper, we identify a sufficient condition that guarantees the connectivity of the virtual backbone. The condition can be verified in a distributed manner by the node only having the link information of its neighbors. (Unless specified otherwise, the term "neighbor" denotes a "1-hop neighbor." The link information of neighbors can be obtained by 2-hop neighbor information or 1-hop neighbor positions [ 4], [ 16].) With the help of this condition, we propose a distributed algorithm for efficiently constructing and maintaining connected k-hop dominating sets in mobile ad hoc networks. Simulations show that our connected k-hop dominating set is small and stable and needs little maintenance overhead in the Random-Walk Mobility and Gauss-Markov Mobility Models.

关键词： algorithm/protocol design and analysis mobile ad hoc network network topology localized communication routing protocols

来源：评论

学校读者我要写书评

暂无评论

Exploiting Spatial, Frequency, and Multiuser Diversity in 3GPP LTE Cellular Networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2012年第11期11卷 1652-1665页

作者： Lee, Suk-Bok Pefkianakis, Ioannis Choudhury, Sayantan Xu, Shugong Lu, Songwu Hanyang Univ Dept Comp Sci & Engn Seoul South Korea Univ Calif Los Angeles Dept Comp Sci Los Angeles CA 90034 USA Nokia Res Ctr Berkeley CA 94704 USA Huawei Technol Shanghai 201206 Peoples R China Univ Calif Los Angeles Dept Comp Sci Los Angeles CA 90024 USA

This paper addresses the problem of frequency domain packet scheduling (FDPS) incorporating spatial division multiplexing (SDM) multiple input multiple output (MIMO) techniques on the 3GPP Long-Term Evolution (LTE) downlink. We impose the LTE MIMO constraint of selecting only one MIMO mode (spatial multiplexing or transmit diversity) per user per transmission time interval (TTI). First, we address the optimal MIMO mode selection (multiplexing or diversity) per user in each TTI in order to maximize the proportional fair (PF) criterion adapted to the additional frequency and spatial domains. We prove that both single-user (SU-) and multi-user (MU-) MIMO FDPS problems under the LTE requirement are NP-hard. We therefore develop two types of approximation algorithms (ones with full channel feedback and the others with partial channel feedback), all of which guarantee provable performance bounds for both SU- and MU-MIMO cases. Based on 3GPP LTE system model simulations, our approximation algorithms that take into account both spatial and frequency diversity gains outperform the exact algorithms that do not exploit the potential spatial diversity gain. Moreover, the approximation algorithms with partial channel feedback achieve comparable performance (with only 1-6 percent performance degradation) to the ones with full channel feedback, while significantly reducing the channel feedback overhead by nearly 50 percent.

关键词： Wireless communication algorithm/protocol design and analysis packet scheduling cellular networks

来源：评论

学校读者我要写书评

暂无评论

Improving Reliability for Application-Layer Multicast Overlays

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2010年第8期21卷 1103-1116页

作者： Tian, Ye Shen, Hong Ng, Kam-Wing Univ Sci & Technol China Sch Comp Sci & Technol Hefei 230026 Anhui Peoples R China Univ Adelaide Sch Comp Sci Adelaide SA 5005 Australia Chinese Univ Hong Kong Dept Comp Sci & Engn Shatin Hong Kong Peoples R China

Reliability of tree-like multicast overlays caused by nodes' abrupt failures is considered as one of the major problems for the Internet application-layer media streaming service [1]. In this paper, we address this problem by designing a distributed and light-weighted protocol named the instantaneous reliability oriented protocol (IRP). Unlike most of existing empirical solutions, we first define the overlay reliability problem formally, and propose a protocol containing a node joining algorithm (IRP-Join), a node preemption algorithm (IRP-Preempt), and a node switching algorithm (IRP-Switch) for reactively constructing and repairing the overlay, as well as proactively maintaining the overlay. With the formal problem presentation, we set up a paradigm for solving the overlay reliability problem by theoretically proving the effectiveness of our algorithms. Moreover, by comparing IRP with existing solutions via simulation-based experiments and real-world deployment, we show that IRP achieves a better reliability, while incurs fewer structural adjustments on the multicast overlay, thus, providing a superior overall performance.

关键词： Reliability multicast algorithm/protocol design and analysis

来源：评论

学校读者我要写书评

暂无评论

Benefit-based data caching in ad hoc networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2008年第3期7卷 289-304页

作者： Tang, Bin Gupta, Himanshu Das, Samir R. Wichita State Univ Dept Comp Sci Wichita KS 67260 USA SUNY Stony Brook Dept Comp Sci Stony Brook NY 11794 USA

Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing efficient distributed caching algorithms is nontrivial when network nodes have limited memory. In this article, we consider the cache placement problem of minimizing total data access cost in ad hoc networks with multiple data items and nodes with limited memory capacity. The above optimization problem is known to be NP-hard. Defining benefit as the reduction in total access cost, we present a polynomial-time centralized approximation algorithm that provably delivers a solution whose benefit is at least 1/4 (1/2 for uniform-size data items) of the optimal benefit. The approximation algorithm is amenable to localized distributed implementation, which is shown via simulations to perform close to the approximation algorithm. Our distributed algorithm naturally extends to networks with mobile nodes. We simulate our distributed algorithm using a network simulator (ns2) and demonstrate that it significantly outperforms another existing caching technique (by Yin and Cao [ 33]) in all important performance metrics. The performance differential is particularly large in more challenging scenarios such as higher access frequency and smaller memory.

关键词： caching placement policy ad hoc networks algorithm/protocol design and analysis simulations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：