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

4th ieee/ACS international conference on Computer systems and Applications (AICCSA-06)

作者： Omar, Wail M. Almad, Bassam A. Taleb-Bendiab, A. Liverpool John Moores Univ Sch Comp & Math Sci Byrom St Liverpool L3 3AF Merseyside England Sohar Univ Fac Sci Appl Sohar Oman

ISBN: (纸本)1424402115

Accepting recent proposals for building modern E-health enterprise systems using grid computing technology, this paper presents a scenario for remote patient healthcare monitoring based on an experimental grid overlay. The paper presents an architectural model of the implemented Remote E-Health Monitoring System prototype, together with its associated sensor and actuator framework. In addition, a set of description languages [1-3] have been proposed and developed to providing a semantic layer to enrich health monitoring data exchanged between the requester (hospital), target (patient) and the e-health intelligence framework. For instance, intelligence services can perform personalized and predictive monitoring of individual patients. A case-study of pregnancy monitoring is used to illustrate the design and usability of such a grid overlay. Finally, the paper concludes with general remarks and a statement of further work.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Energy efficient fractional coverage schemes for low cost wireless sensor networks

Energy efficient fractional coverage schemes for low cost wi...

引用

26th ieee international conference on distributed computing systems Workshops, ICDCS 2006

作者： Ye, Mao Chan, Edward Chen, Guihai Wu, Jie Department of Computer Science City University of Hong Kong Hong Kong National Laboratory of Novel Software Technology Nanjing University China Department of Computer Science and Engineering Florida Atlantic University United States

ISBN: (纸本)0769525415

An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes, while the remaining nodes stay active to provide continuous service. Depending on different types of applications, the network lifetime may be much more critical than covering the entire monitored area at every data reporting round. This paper presents a competition based distributed scheme called FCS to address the fractional coverage problem in wireless sensor networks with tiny, low-cost sensors. Through localized, energy-aware competition, the proposed scheme achieves the desired fractional coverage with a minimum number of active sensors. By taking account of both residual battery energy and recent reporting latency, an enhanced version of FCS which uses a novel competition metric to constrain the maximum reporting latency throughout the network is also proposed. These two schemes also contain the desirable property that it can be extended easily to handle the more general k-coverage problem. © 2006 ieee.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Scalable and robust aggregation techniques for extracting statistical information in sensor networks

Scalable and robust aggregation techniques for extracting st...

引用

26th ieee Internationa26th ieee international conference on distributed computing systems, ICDCS 2006

作者： Hongbo, Jiang Shudong, Jin Division of Computer Science EECS Case Western Reserve University Cleveland OH 44106 United States

ISBN: (纸本)0769525407

Wireless sensor networks have stringent constraints on system resources and data aggregation techniques are critically important. However, accurate data aggregation is difficult due to the variation of sensor readings and due to the frequent communication failures. To address these difficulties, we propose a scalable and robust data aggregation algorithm. The novelty of our work includes two aspects. First, our algorithm exploits the mixture model and the Expectation Maximization (EM) algorithm for parameter estimation. Hence, it captures the effects of aggregation over different scales while keeping the communication cost low. Second, our algorithm exploits loss-tolerant multi-path routing schemes. Hence, it obtains accurate statistical information even in the presence of high link and node failure rates. We demonstrate that our techniques reduce communication cost while retaining the precious statistical information otherwise neglected by other aggregation techniques. Our evaluation shows the proposed techniques are robust against link and node failures, and perform consistently well. © 2006 ieee.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Path planning of mobile landmarks for localization in wireless sensor networks

Path planning of mobile landmarks for localization in wirele...

引用

26th ieee international conference on distributed computing systems Workshops, ICDCS 2006

作者： Koutsonikolas, Dimitrios Das, Saumitra M. Hu, Y. Charlie School of Electrical and Computer Engineering Center for Wireless Systems and Applications Purdue University West Lafayette IN 47907 United States

ISBN: (纸本)0769525415

Many applications of wireless sensor networks require the sensor nodes to obtain their locations. The main idea in most localization methods has been that some nodes with known coordinates (e.g., GPS-equipped nodes) transmit beacons with their coordinates in order to help other nodes to localize themselves. A promising method that significantly reduces the deployment cost is to replace the set of statically deployed GPS-enhanced sensors with one mobile landmark equipped with a GPS unit. In this case, a fundamental research issue is the planning of the path that the mobile landmark should travel along in order to minimize the localization error. In this paper we first study the localization error of three different trajectories for the mobile landmark, namely SCAN, DOUBLE SCAN, and HILBERT. We further study the tradeoffs between the trajectory resolution and the localization accuracy in the presence of 2-hop localization, in which sensors that have already obtained an estimate of their positions help to localize other sensors. Our trajectories are practical and can be easily implemented in mobile robot platforms. © 2006 ieee.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

Secure group communication in wireless sensor networks

Secure group communication in wireless sensor networks

引用

1st international Symposium on Wireless Pervasive computing

作者： Ghosh, Subhas K. Patro, Ranjeet K. Raina, Manik Thejaswi, Chandrasekhara Ganapathy, Viswanath Honeywell Technol Solut Lab 151-1 DoraisanipalyaBannerghatta Rd Bangalore 560076 Karnataka India

ISBN: (纸本)0780394100

In this paper we address the issues of forming secure multicast group within wireless sensor networks. We describe a protocol that establishes a secure multicast group, and distributes a group key by mutually authenticating a group of devices over an open insecure wireless channel. We choose a conference keying mechanism and extend it with symmetric authentication protocols and a key hierarchy on which group key could be distributed efficiently. We address two problems in this work. Firstly, the formation of secure groups in sensor network with a low communication complexity, secondly, provides an efficient solution to maintain such multicast group.

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Roadmap query for sensor network assisted navigation in dynamic environments

引用

2nd ieee international conference on distributed computing in sensor systems

作者： Bhattacharya, Sangeeta Atay, Nuzhet Alankus, Gazihan Lu, Chenyang Bayazit, O. Burchan Roman, Gruia-Catalin Washington Univ Dept Comp Sci & Engn St Louis MO 63110 USA

ISBN: (纸本)3540352279

Mobile entity navigation in dynamic environments is an essential part of many mission critical applications like search and rescue and fire fighting. The dynamism of the environment necessitates the mobile entity to constantly maintain a high degree of awareness of the changing environment. This criteria makes it difficult to achieve good navigation performance by using just on-board sensors and existing navigation methods and motivates the use of wireless sensor networks (WSNs) to aid navigation. In this paper, we present a novel approach that integrates a roadmap based navigation algorithm with a novel WSN query protocol called Roadmap Query (RQ). RQ enables collection of frequent, up-todate information about the surrounding environment, thus allowing the mobile entity to make good navigation decisions. Simulation results under realistic fire scenarios show that in highly dynamic environments RQ outperforms existing approaches in both navigation performance and communication cost. We also present a mobile agent based implementation of RQ along with preliminary experimental results, on Mica2 motes. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

Gappa:: Gossip based multi-channel reprogramming for sensor networks

引用

2nd ieee international conference on distributed computing in sensor systems

作者： Wang, Limin Kulkarni, Sandeep S. Michigan State Univ Dept Comp Sci & Engn Sodtware Engn & Network Syst Lab E Lansing MI 48824 USA

ISBN: (纸本)3540352279

Reprogramming the sensor networks in place is an important and challenging problem. One way suggested for reprogramming is with the help of an UAV (Unmanned Ariel Vehicle). To reprogram a sensor network with the help of an UAV, one can either communicate the entire new program to one (or a few) sensor in the field, or let the UAV communicate parts of the code to a subset of sensor nodes on multiple channels at once. In the latter approach, the nodes need to communicate with each other to receive the remaining parts of the program. In this paper, we propose a protocol for such gossip between nodes. To better utilize the multi-channel resources and reduce contention, our protocol provides a multi-channel sender selection algorithm. This algorithm attempts to ensure that in any neighborhood, at any time, there is at most one sensor transmitting on a given frequency. Moreover, our sender selection algorithm is greedy in that it tries to select the sender that is expected to have the most impact for each channel. Our protocol also conserves energy by putting the nodes that are unlikely to contribute or receive data shortly to "sleep" state. Through simulation, we show that our protocol is faster and more energy efficient than the existing reprogramming approaches that assume that the new program is initially located only on a small set of nodes. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Computer networks

来源：评论

学校读者我要写书评

暂无评论

Consistency-based on-line localization in sensor networks

引用

2nd ieee international conference on distributed computing in sensor systems

作者： Feng, Jessica Girod, Lewis Potkonjak, Miodrag 4821 Boelter Hall Los Angeles CA 90034 USA

ISBN: (纸本)3540352279

We have developed a new on-line error modeling and optimization-based localization approach for sensor networks in the presence of distance measurement noise. The approach is solely based on the concept of consistency, and is developed specifically for the case of on-line localization, which refers to the situation when references are not available a priori. The localization problem is formulated as the task of maximizing the consistency between measurements and calculated distances. In addition, we also present a localized localization algorithm where a specified communication cost or the location accuracy is guaranteed while optimizing the other. We evaluated the approach in (i) both GPS-based and GPS-less scenarios;(ii) 1-D, 2-D and 3-D spaces, on sets of acoustic ranging-based distance measurements recorded by deployed sensor networks. The experimental evaluation indicates that localization of only a few centimeters is consistently achieved when the average and median distance measurement errors are more than a meter, even when the nodes have only a few distance measurements. The relative performance in terms of location accuracy compares favorably with respect to several state-of-the-art localization approaches. Finally, several insightful observations about the required conditions for accurate location discovery are deduced by analyzing the experimental results. © Springer-Verlag Berlin Heidelberg 2006.

关键词： consistency location discovery statistical modeling

来源：评论

学校读者我要写书评

暂无评论

Evaluating the use of motes and TinyOS for a mobile sensor platform

Evaluating the use of motes and TinyOS for a mobile sensor p...

引用

IASTED international conference on Parallel and distributed computing and Networks

作者： Thomsen, J Husemann, D Univ Aarhus Dept Comp Sci Aabogade 34 DK-8200 Aarhus N Denmark IBM Res Zurich Res Lab CH-8803 Ruschlikon Switzerland

ISBN: (纸本)088986568X

Monitoring containers during transport in a secure, tamper resistant. and reliable manner, is the subject of the IBM Secure Trade Lane project (STL). We have evaluated a platform based on motes (i.e. very small computers) and TinyOS as the base for communication in STL. We implemented an ieee 802.15.4 full functional device (FFD) MAC layer with beacon support, and we discovered that running this MAC layer was too much for the motes. We saw starvation and we experienced a far too slow data transfer between layers in TinyOS. We tried to overcome the starvation problems by introducing means to limit the high number of timer interrupts required by the MAC layer. Our approach is called Adaptive Timer Resolution, but it did not solve our problems in this case. We concluded that motes and TinyOS are insufficient for the 802.15.4 FFD MAC layer and that this platform is having problems running applications with a high frequency of interrupts, and still execute useful code in between. Our contributins are the evaluation of the mote platform by pushing it beyond its limits and our timer resolution control mechanism Adaptive Tinier Resolution.

关键词： sensor networks communications operating systems TinyOS motes ieee 802.15.4

来源：评论

学校读者我要写书评

暂无评论

A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks

引用

Ad Hoc Networks 2006年第5期4卷 621-635页

作者： Chatzigiannakis, Ioannis Dimitriou, Tassos Nikoletseas, Sotiris Spirakis, Paul Patras University P.O. Box 1122 261 10 Patras Greece Athens Greece

We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The distributed co-operation of such nodes may lead to the accomplishment of large sensing tasks, having useful applications in practice. We present a new protocol for data propagation towards a control center ("sink") that avoids flooding by probabilistically favoring certain ("close to optimal") data transmissions. Motivated by certain applications (see [I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, Wireless sensor networks: a survey, Journal of Computer Networks 38 (2002) 393-422], [C. Intanagonwiwat, R. Govindan, D. Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, in: 6th ACM/ieee Annual international conference on Mobile computing (MOBICOM 2000), 2000, pp. 56-67]) and also as a starting point for a rigorous analysis, we study here lattice-shaped sensor networks. We however show that this lattice shape emerges even in randomly deployed sensor networks of sufficient sensor density. Our work is inspired and builds upon the directed diffusion paradigm of [C. Intanagonwiwat, R. Govindan, D. Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, in: 6th ACM/ieee Annual international conference on Mobile computing (MOBICOM 2000), 2000, pp. 56-67]. This protocol is very simple to implement in sensor devices, uses only local information and operates under total absence of co-ordination between sensors. We consider a network model of randomly deployed sensors of sufficient density. As shown by a geometry analysis, the protocol is correct, since it always propagates data to the sink, under ideal network conditions (no failures). Using stochastic processes, we show that the protocol is very energy efficient. Also, when part of the network is inoperative, the protocol manages to propagate data very close to the

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：