IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.最新文献_第9页

Network-aware positioning in sensor networks 传感器网络中的网络感知定位

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542809

Ahmed A. Ahmed, Hongchi Shi, Yi Shang

引用次数: 3

Wireless aware SCTP for ad hoc networks 无线感知SCTP自组织网络

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542779

Guanhua Ye, Chunyue Liu, T. Saadawi, Myung J. Lee

引用次数: 3

Improving connectivity and power efficiency in wireless ad hoc networks through agent nodes 通过代理节点改进无线自组织网络的连接性和功率效率

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542867

Yavuz Tokgoz, A. Acampora

{"title":"Improving connectivity and power efficiency in wireless ad hoc networks through agent nodes","authors":"Yavuz Tokgoz, A. Acampora","doi":"10.1109/MAHSS.2005.1542867","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542867","url":null,"abstract":"In this paper, we present a framework that improves the reliability and reduce the power consumption of a wireless ad hoc network through the deployment of supplementary nodes called agents. Agents are stationary nodes that have less stringent power constraints than the battery-operated mobile nodes. Placed in a mesh-like formation, agents enhance the connectivity of an ad hoc network by reducing the probability of having a partitioned system. We also show that the power consumption of user nodes is significantly decreased with a clever choice of the routing strategy, one that picks the routes that go through the agent nodes as often as possible, hence preventing the mobiles from relaying packets. In addition, the impact of a power control mode is analyzed. Even though such a mode already promises power efficiency, we demonstrate that the amount of power savings is further increased when the power control is used within the agent scheme. Finally, we present the traffic simulation results to assess the maximum throughput of no-agent and agent-supported networks under various routing strategies like bandwidth-conserving, power-conserving, etc. Some degradation in maximum throughput can be observed as a result of forcing routes to go through agent nodes","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130108459","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Reliable and semi-reliable communication with authentication in mobile ad hoc networks 移动自组织网络中带认证的可靠和半可靠通信

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542871

F. Dressler

引用次数: 12

Mobile network management and robust spatial retreats via network dynamics 移动网络管理和强大的空间撤退通过网络动态

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542805

Ke Ma, Yanyong Zhang, W. Trappe

{"title":"Mobile network management and robust spatial retreats via network dynamics","authors":"Ke Ma, Yanyong Zhang, W. Trappe","doi":"10.1109/MAHSS.2005.1542805","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542805","url":null,"abstract":"The mobility provided by mobile ad hoc and sensor networks will facilitate new mobility-oriented services. Recent work has demonstrated that, for many issues, mobility is advantageous to network operations. This paper proposes that the need for mobility may be captured by formulating the movement of nodes as a classical dynamical system. Motivated by classical mechanics, we propose the notion of network dynamics, where the position and movement of mobile devices evolve according to forces arising from system potential functions that capture the operational goals of the network. We argue that, in the context of moving communicating nodes, the equations of motion should be formulated as a steepest descent minimization of the system potential energy. Further, since global information is not practical in sensor networks, we introduce distributed algorithms that yield more practical implementations of network dynamics. The resulting algorithms are generic, and may be applied to produce balanced network configurations for different initial network deployments. As a second application of network dynamics, we examine the problem of adapting a mobile sensor network to the threat of a jammer. We show that the combination of spatial escape strategies with network dynamics prevents network partitioning that might arise from a mobile jammer","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124315573","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 48

Defending against search-based physical attacks in sensor networks 传感器网络中基于搜索的物理攻击防御

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542839

Wenjun Gu, Xun Wang, S. Chellappan, D. Xuan, T. Lai

引用次数: 14

Definition and evaluation of a trellis structure for self-organized networks 自组织网络网格结构的定义与评价

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542771

J. Ridoux, A. Fladenmuller, Y. Viniotis

引用次数: 1

Analytical bounds on broadcast with hitch-hiking in wireless ad-hoc networks 无线自组织网络中搭便车广播的解析界

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542813

G. Călinescu

{"title":"Analytical bounds on broadcast with hitch-hiking in wireless ad-hoc networks","authors":"G. Călinescu","doi":"10.1109/MAHSS.2005.1542813","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542813","url":null,"abstract":"Recently, there have been papers indicating that the maximal ratio combiner device can result in energy savings in wireless ad hoc networks by using hitch-hiking. We study the min-energy broadcast with hitch-hiking problem, an idealized version of broadcast using hitch-hiking, a problem studied experimentally in the INFOCOM 2004 paper of Agarwal et al. min-energy broadcast with hitch-hiking captures the maximum savings one can achieve in broadcasting using maximal ratio combiners. We show that the optimum of the classical min-energy broadcast problem is at most O(log2 n) times the optimum of min-energy broadcast with hitch-hiking, where n is the number of nodes in the networks. We show that this bound is tight up to a constant. In the special case when the nodes are on a line and the power requirement for node u to reach node v is d(u,v)K where d(u,v) the Euclidean distance between u and v and K is the signal attenuation exponent, which is assumed to be in between 2 and 5, we show that the optimum of the min-energy broadcast problem is at most a constant times optimum of min-energy broadcast with hitch-hiking. We also show that min-energy broadcast with hitch-hiking is NP-Hard, and present approximation algorithms. A formal definition of min-energy broadcast with hitch-hiking is given below. The input consists of a complete directed graph G = (V, E) with power requirement function c: E rarr R +, and a source s isin V. The output consists of a permutation T = < v1, v2,...., vn > of V with v1 = s and power assignment p(v) of every vertex v. For every 1 les i < j les n, define q(viv j) = p(vi)/c(vivj). An output is feasible if for every j > 1 we have Sigman i=1 p(vi)","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132067152","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A decentralized fault diagnosis system for wireless sensor networks 一种无线传感器网络分散故障诊断系统

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542799

Anmol Sheth, Carl Hartung, Richard Han

引用次数: 58

Route maintenance using mobility prediction for mobile ad hoc networks 基于移动性预测的移动自组网路由维护

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542780

B. Sathyaraj, R. Doss

引用次数: 22