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

Energy and spatial reuse efficient network-wide real-time data broadcasting in mobile ad hoc networks

IEEE TRANSACTIONS ON MOBILE COMPUTING 2006年第10期5卷 1297-1312页

作者： Tavli, Bulent Heinzelman, Wendi B. Univ Rochester Dept Elect & Comp Engn Rochester NY 14627 USA

In this paper, we present NB-TRACE, which is an energy-efficient network-wide voice broadcasting architecture for mobile ad hoc networks. In the NB-TRACE architecture, the network is organized into overlapping clusters through a distributed algorithm, where the clusterheads create a nonconnected dominating set. Channel access is regulated through a distributed TDMA scheme maintained by the clusterheads. The first group of packets of a broadcast session is broadcast through flooding, where each data rebroadcast is preceded by an acknowledgment to the upstream node. Nodes that do not get an acknowledgment for a predetermined time, except the clusterheads, cease to rebroadcast, which prunes the redundant retransmissions. The connected dominating set formed through this basic algorithm is broken in time due to node mobility. The network responds to the broken links through multiple mechanisms to ensure the maintenance of the connected dominating set. We compare NB-TRACE with four network layer broadcast routing algorithms ( Flooding, Gossiping, Counter-based broadcasting, and Distance-based broadcasting) and three medium access control protocols ( IEEE 802.11, SMAC, and MH-TRACE) through extensive ns-2 simulations. Our results show that NB-TRACE outperforms other network/MAC layer combinations in minimizing energy dissipation and optimizing spatial reuse, while producing competitive QoS performance.

关键词： low-power design energy-aware systems data communications distributed protocols network communications network topology wireless communication network protocols protocol architecture protocol verification routing protocols access schemes mobile computing algorithm/protocol design and analysis mobile communication systems

来源：评论

学校读者我要写书评

暂无评论

Collaborative and Distributed Search System with Mobile Devices

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2012年第10期11卷 1478-1493页

作者： Shen, Chih-Ya Yang, De-Nian Chen, Ming-Syan Natl Taiwan Univ Dept Elect Engn Taipei 10617 Taiwan Acad Sinica Inst Informat Sci Taipei 11529 Taiwan Acad Sinica Res Ctr Informat Technol Innovat CITI Taipei 11529 Taiwan

With the advances of communications, computing, and positioning technologies, mobile devices have been regarded as mobile computing platforms for various kinds of location-based and human-computation services. However, most existing applications regard each device as a sensor or focus on services with the computation on a single device. In contrast, this paper leverages a group of mobile devices as a collaborative and distributed search platform. Specifically, we propose a search system with mobile devices for rescue and patrol operations. The system utilizes mobile devices to find and assign the search route to each searcher in a collaborative and distributed manner. Given the roads to be searched in an area and the candidate start locations, our system minimizes the time required to search the whole area and guarantees that each road will be searched at least once. We first formulate the k-Person Search Problem for k mobile devices and prove that the problem is NP-Hard. To find the optimal solutions, we propose a centralized algorithm for a special case and an Integer Linear Programming formulation for general cases. We also devise an approximation algorithm. The algorithms can be used to dispatch the searchers before the operation starts. Moreover, to support online adaptation, we formulate the Path Refinement Problem for path exchange among searchers and propose a distributed algorithm to adaptively adjust the paths after the search starts. We also implement the proposed algorithms in mobile devices as a collaborative and distributed search system and demonstrate the efficiency of our algorithms with computation simulations and field trials.

关键词： Mobile applications distributed applications 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

来源：评论

学校读者我要写书评

暂无评论

ConverSS: A Hybrid MAC/Routing Solution for Small-Scale, Convergecast Wireless Networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2011年第9期10卷 1227-1236页

作者： Kam, Clement Schurgers, Curt Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92037 USA

In applications involving networks of sensor-equipped autonomous vehicles, it is crucial to have an energy-efficient communication protocol due to the limited on-board batteries. Unlike traditional sensor networks, vehicle sensor networks typically consist of only a small number of nodes. We exploit this fact in our protocol design by optimizing specifically for these mobile small-scale networks. Our proposed solution, ConverSS, is a hybrid MAC/routing protocol that is energy-efficient for vehicle sensor networks. We have evaluated the protocol through simulation in ns-2 and verified its operation in a testbed network deployment. The results show that ConverSS is robust to real-world link impairments and that it outperforms common layered solutions by as much as a factor of 10.

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

来源：评论

学校读者我要写书评

暂无评论

Mobile Scheduling for Spatiotemporal Detection in Wireless Sensor Networks

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2010年第12期21卷 1851-1866页

作者： Xing, Guoliang Wang, Jianping Yuan, Zhaohui Tan, Rui Sun, Limin Huang, Qingfeng Jia, Xiaohua So, Hing Cheung Michigan State Univ Dept Comp Sci & Engn E Lansing MI 48824 USA City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China Chinese Acad Sci Inst Software Beijing 100080 Peoples R China C8 MediSensors Inc Los Gotos CA 95032 USA City Univ Hong Kong Dept Elect Engn Kowloon Hong Kong Peoples R China

Wireless sensor networks (WSNs) deployed for mission-critical applications face the fundamental challenge of meeting stringent spatiotemporal performance requirements using nodes with limited sensing capacity. Although advance network planning and dense node deployment may initially achieve the required performance, they often fail to adapt to the unpredictability and variability of physical reality. This paper explores efficient use of mobile sensors to address limitations of static WSNs for target detection. We propose a data-fusion-based detection model that enables static and mobile sensors to effectively collaborate in target detection. An optimal sensor movement scheduling algorithm is developed to minimize the total moving distance of sensors while achieving a set of spatiotemporal performance requirements including high detection probability, low system false alarm rate, and bounded detection delay. The effectiveness of our approach is validated by extensive simulations based on real data traces collected by 23 sensor nodes.

关键词： Data fusion algorithm/protocol design and analysis wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

An Efficient Directed Localization Recursion protocol for Wireless Sensor Networks

引用

IEEE TRANSACTIONS ON COMPUTERS 2009年第5期58卷 677-691页

作者： Braga Fernandes de Oliveira, Horacio Antonio Boukerche, Azzedine Nakamura, Eduardo Freire Ferreira Loureiro, Antonio Alfredo Univ Ottawa Sch Informat Technol & Engn PARADISE Res Lab Ottawa ON K1N 6N5 Canada Univ Fed Minas Gerais Dept Comp Sci BR-30123970 Belo Horizonte MG Brazil Univ Fed Amazonas Dept Comp Sci BR-69077000 Manaus Amazonas Brazil FUCAPI Ctr Anal Res & Technol Innovat Fdn BR-69075351 Manaus Amazonas Brazil

The establishment of a localization system is an important task in wireless sensor networks. Due to the geographical correlation between sensed data, location information is commonly used to name the gathered data and address nodes and regions in data dissemination protocols. In general, to estimate its location, a node needs the position information of at least three reference points (neighbors that know their positions). In this work, we propose a different scheme in which only two reference points are required in order to estimate a position. To choose between the two possible solutions of an estimate, we use the known direction of the recursion. This approach leads to a recursive localization system that works with low-density networks (increasing by 40 percent the number of nodes with estimates in some cases), reduces the position error by almost 30 percent, requires 37 percent less processor resources to estimate a position, uses fewer beacon nodes, and also indicates the node position error based on its distance to the recursion origin. No GPS-enabled node is required, since the recursion origin can be used as a relative coordinate system. The algorithm's evaluation is performed by comparing it with a similar localization system;also, experiments are made to evaluate the impact of both systems in geographic algorithms.

关键词： Network architecture and design algorithm/protocol design and analysis wireless sensor networks localization GPS free

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

Explicit Congestion Control algorithms for Time Varying Capacity Media

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2011年第1期10卷 81-93页

作者： Abrantes, Filipe Araujo, Joao Taveira Ricardo, Manuel Fraunhofer Portugal Res Ctr AICOS P-4169007 Oporto Portugal UCL Dept Elect & Elect Engn London WC1E 7JE England Univ Porto INESC Porto Fac Engn P-4200465 Oporto Portugal

Explicit congestion control (XCC) is emerging as one potential solution for overcoming limitations inherent to the current TCP algorithm, characterized by unstable throughput, high queuing delay, RTT-limited fairness, and a static dynamic range that does not scale well to high bandwidth delay product networks. In XCC, routers provide multibit feedback to sources, which, in turn, adapt throughput more accurately to the path bandwidth with potentially faster convergence times. Such systems, however, require precise knowledge of link capacity for efficient operation. In the presence of variable-capacity media, e.g., 802.11, such information is not entirely obvious or may be difficult to extract. We explore three possible algorithms for XCC which retain efficiency under such conditions by inferring available bandwidth from queue dynamics and test them through simulations with two relevant XCC protocols: XCP and RCP. Additionally, preliminary results from an experimental implementation based on XCP are presented. Finally, we compare our proposals with TCP and show how such algorithms outperform it in terms of efficiency, stability, queuing delay, and flow-rate fairness.

关键词： Network communications wireless communication algorithm/protocol design and analysis

来源：评论

学校读者我要写书评

暂无评论

Adaptive Position Update for Geographic Routing in Mobile Ad Hoc Networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2013年第3期12卷 489-501页

作者： Chen, Quanjun Kanhere, Salil S. Hassan, Mahbub Univ Sydney ACFR Sydney NSW 2006 Australia Univ New S Wales Sch Comp Sci & Engn Sydney NSW 2052 Australia

In geographic routing, nodes need to maintain up-to-date positions of their immediate neighbors for making effective forwarding decisions. Periodic broadcasting of beacon packets that contain the geographic location coordinates of the nodes is a popular method used by most geographic routing protocols to maintain neighbor positions. We contend and demonstrate that periodic beaconing regardless of the node mobility and traffic patterns in the network is not attractive from both update cost and routing performance points of view. We propose the Adaptive Position Update (APU) strategy for geographic routing, which dynamically adjusts the frequency of position updates based on the mobility dynamics of the nodes and the forwarding patterns in the network. APU is based on two simple principles: 1) nodes whose movements are harder to predict update their positions more frequently (and vice versa), and (ii) nodes closer to forwarding paths update their positions more frequently (and vice versa). Our theoretical analysis, which is validated by NS2 simulations of a well-known geographic routing protocol, Greedy Perimeter Stateless Routing protocol (GPSR), shows that APU can significantly reduce the update cost and improve the routing performance in terms of packet delivery ratio and average end-to-end delay in comparison with periodic beaconing and other recently proposed updating schemes. The benefits of APU are further confirmed by undertaking evaluations in realistic network scenarios, which account for localization error, realistic radio propagation, and sparse network.

关键词： Wireless communication algorithm/protocol design and analysis routing protocols

来源：评论

学校读者我要写书评

暂无评论

Multiple access protocol for power-controlled wireless Access Nets

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2004年第4期3卷 307-316页

作者： Behzad, A Rubin, Z Univ Calif Los Angeles Dept Elect Engn Los Angeles CA 90095 USA

We consider ad hoc wireless networks that are configured as Mobile Backbone Networks. A hierarchical network architecture is synthesized, consisting of Access Nets (ANets) and Backbone Nets (BNets). Each ANet is managed by a (dynamically elected) Backbone Node (BN) that is equipped with higher capability (transmission and processing) modules. The BNs are chosen from currently active mobile backbone-capable nodes or are represented by (ground and/or airborne) unmanned vehicles (UVs) that are guided into selected positions. In this paper, we develop and investigate a new joint power controlled medium access control (MAC) algorithm for wireless access nets (ANets). Under our new protocol, the net backbone node instructs the ANet nodes to make power control adjustments while simultaneously allocating to them slots for the requested transmissions of their packets. This algorithm, in contrast to other employed conventional graph-based scheduling algorithms, satisfies the requirement that a minimum signal-to-interference and noise ratio (SINR) is met at all intended receivers. We show our algorithm to lead to a significant increase in the net throughput level by attaining high spatial reuse.

关键词： wireless communication graph algorithms network communications mobile communiction systems algorithm/protocol design and analysis access schemes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：