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

Bio-inspired group mobility model for mobile ad hoc networks based on bird-flocking behavior

SOFT COMPUTING 2012年第3期16卷 437-450页

作者： Misra, Sudip Agarwal, Prateek Indian Inst Technol Sch Informat Technol Kharagpur 721302 W Bengal India

In this paper, we propose a novel group mobility model for mobile ad hoc networks (MANETs), named as Bird-Flocking Behavior Inspired Group Mobility Model (BFBIGM), which takes inspiration from the mobility of a flock of birds, flying in a formation. Most existing modeling techniques are deficient in successfully addressing many aspects in terms of the application of realistic forces on the movement of mobile nodes (MNs), the interaction of MNs within a group, and collision avoidance within a group and with environmental obstacles. The results obtained through experiments show that in terms of connectivity metrics, such as link duration, BFBIGM performs around 50% better in comparison to the popular existing mobility models like Random Waypoint (RWP) Model (Johnson et al. in ad hoc networking, addison-Wesley, Menlo Park, pp. 139-172,2001) and the Reference Point Group Mobility (RPGM) Model (Hong et al. in: Proceedings of the 2nd ACM international workshop on modeling, analysis and simulation of wireless and mobile systems, Seattle, WA, pp. 53-60,1999).

关键词： mobile ad hoc networks Mobility model Bird flocking Collision avoidance UAV

来源：评论

学校读者我要写书评

暂无评论

Connectivity in wireless ad-hoc networks with a log-normal radio model

引用

mobile networks & APPLICATIONS 2006年第3期11卷 351-360页

作者： Hekmat, R Van Mieghem, P Delft Univ Technol NL-2600 GA Delft Netherlands

In this paper we study connectivity in wireless ad-hoc networks by modeling the network as an undirected geometric random graph. The novel aspect in our study is that for finding the link probability between nodes we use a radio model that takes into account statistical variations of the radio signal power around its mean value. We show that these variations, that are unavoidably caused by the obstructions and irregularities in the surroundings of the transmitting and the receiving antennas, have two distinct effects on the network. Firstly, they reduce the amount of correlation between links causing the geometric random graph tend to behave like a random graph with uncorrelated links. Secondly, these variations increase the probability of long links, which enhances the probability of connectivity for the network. Another new result in our paper is an equation found for the calculation of the giant component size in wireless ad-hoc networks, that takes into account the level of radio signal power variations. With simulations we show that for the planning and design of wireless ad-hoc networks or sensor networks the giant component size is a good measure for "connectivity".

关键词： connectivity giant component log-normal random graph ad-hoc networks

来源：评论

学校读者我要写书评

暂无评论

Relaying in mobile ad hoc networks: The Brownian motion mobility model

引用

wireless networks 2006年第5期12卷 561-571页

作者： Groenevelt, R. Altman, E. Nain, P. INRIA F-06902 Sophia Antipolis France

mobile ad hoc networks are characterized by a lack of a fixed infrastructure and by node mobility. In these networks data transfer can be improved by using mobile nodes as relay nodes. As a result, transmission power and the movement pattern of the nodes have a key impact on the performance. In this work we focus on the impact of node mobility through the analysis of a simple one-dimensional ad hoc network topology. Nodes move in adjacent segments with reflecting boundaries according to Brownian motions. Communications (or relays) between nodes can occur only when they are within transmission range of each other. We determine the expected time to relay a message and compute the probability density function of relaying locations. We also provide an approximation formula for the expected relay time between any pair of mobiles.

关键词： ad hoc network node mobility packet relaying stochastic model Brownian motion

来源：评论

学校读者我要写书评

暂无评论

Connectivity in wireless ad-hoc networks with a log-normal radio model

Connectivity in wireless ad-hoc networks with a log-normal r...

引用

2nd workshop on modeling and optimization in mobile, ad hoc and wireless networks

作者： Hekmat, R Van Mieghem, P Delft Univ Technol NL-2600 GA Delft Netherlands

关键词： connectivity giant component log-normal random graph ad-hoc networks

来源：评论

学校读者我要写书评

暂无评论

Relaying in mobile ad hoc networks: The Brownian motion mobility model

Relaying in mobile ad hoc networks: The Brownian motion mobi...

引用

2nd workshop on modeling and optimization in mobile, ad hoc and wireless networks

作者： Groenevelt, R. Altman, E. Nain, P. INRIA F-06902 Sophia Antipolis France

关键词： ad hoc network node mobility packet relaying stochastic model Brownian motion

来源：评论

学校读者我要写书评

暂无评论

Tightening the upper bound for the minimum energy broadcasting

引用

wireless networks 2008年第5期14卷 659-669页

作者： Flammini, Michele Klasing, Ralf Navarra, Alfredo Perennes, Stephane Univ Aquila Dept Comp Sci I-67100 Laquila Italy Univ Bordeaux 1 LaBRI CNRS F-33405 Talence France Univ Nice MASCOTTE Project I3S CNRS INRIA F-06108 Nice 2 France

In this paper we present a new upper bound on the approximation ratio of the Minimum Spanning Tree heuristic for the basic problem on ad-hoc networks given by the Minimum Energy Broadcast Routing (MEBR). We introduce a new analysis allowing to establish a 6.33-approximation ratio in the 2-dimensional case, thus decreasing the previously known 7.6 upper bound [4], almost closing the gap with the lower bound of 6 [12].

关键词： minimums panning tree approximation factor multi-hop ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Exploiting mobility for energy efficient data collection in wireless sensor networks

引用

mobile networks & APPLICATIONS 2006年第3期11卷 327-339页

作者： Jain, S Shah, RC Brunette, W Borriello, G Roy, S Univ Washington Dept Elect Engn Seattle WA 98195 USA Univ Calif Berkeley Berkeley CA 94704 USA

We analyze an architecture based on mobility to address the problem of energy efficient data collection in a sensor network. Our approach exploits mobile nodes present in the sensor field as forwarding agents. As a mobile node moves in close proximity to sensors, data is transferred to the mobile node for later depositing at the destination. We present an analytical model to understand the key performance metrics such as data transfer, latency to the destination, and power. Parameters for our model include: sensor buffer size, data generation rate, radio characteristics, and mobility patterns of mobile nodes. Through simulation we verify our model and show that our approach can provide substantial savings in energy as compared to the traditional ad-hoc network approach.

关键词： simulations stochastic processes system design

来源：评论

学校读者我要写书评

暂无评论

ad hoc networks beyond unit disk graphs

引用

wireless networks 2008年第5期14卷 715-729页

作者： Kuhn, Fabian Wattenhofer, Roger Zollinger, Aaron Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA Microsoft Res Mountain View CA 94043 USA Swiss Fed Inst Technol CH-8092 Zurich Switzerland

In this paper, we study an algorithmic model for wireless ad hoc and sensor networks that aims to be sufficiently close to reality as to represent practical realworld networks while at the same time being concise enough to promote strong theoretical results. The quasi unit disk graph model contains all edges shorter than a parameter d between 0 and 1 and no edges longer than 1. We show that-in comparison to the cost known for unit disk graphs-the complexity results of geographic routing in this model contain the additional factor 1/d(2). We prove that in quasi unit disk graphs flooding is an asymptotically message-optimal routing technique, we provide a geographic routing algorithm being most efficient in dense networks, and we show that classic geographic routing is possible with the same asymptotic performance guarantees as for unit disk graphs if d >= 1/root 2.

关键词： algorithmic analysis cost metrics geographic routing network models wireless ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Connectivity in one-dimensional ad hoc networks: A queueing theoretical approach

引用

wireless networks 2006年第5期12卷 573-587页

作者： Miorandi, Daniele Altman, Eitan CREATE NET I-38100 Trento Italy INRIA F-06902 Sophia Antipolis France

In this paper we analyze connectivity issues in one-dimensional ad hoc networks. Starting with a deterministic channel model, we show how an equivalent GI vertical bar G vertical bar infinity queueing model may be used to address network connectivity. In this way, we obtain exact results for the coverage probability, the node isolation probability and the connectivity distance for various node placement statistics. We then show how a GI vertical bar G vertical bar infinity model may be used to study broadcast percolation problems in ad hoc networks with general node placement in the presence of fading channels. In particular, we obtain explicit results for the case of nodes distributed according to a Poisson distribution operating in a fading/shadowing environment. In the latter case, heavy traffic theorems are applied to derive the critical transmission power for connectivity and broadcast percolation distance in highly dense networks. The impact of signal processing schemes able to exploit the diversity provided by small-scale fading by means of multiple antennas is considered. The analysis is then extended to the case of unreliable ad hoc networks, with an in-depth discussion of asymptotic results.

关键词： ad hoc networks connectivity GI|G|infinity broadcast percolation fading channels diversity techniques

来源：评论

学校读者我要写书评

暂无评论

A game-theoretic look at simple relay channel

引用

wireless networks 2006年第5期12卷 545-560页

作者： Sagduyu, Yalin Evren Ephremides, Anthony Univ Maryland Syst Res Inst College Pk MD 20742 USA Univ Maryland Dept Elect & Comp Engn College Pk MD 20742 USA

In this paper, we address the crosslayer problem of joint medium access control (MAC) and routing in ad hoc wireless networks from the novel perspective of stochastic dynamic games. As a starting point to understand the efficient modes of wireless network operation, we look at the basic problem of multi-hop communication over the simple topology of a single relay channel. A stochastic game is formulated for transmitter and relay nodes competing over collision channels to deliver packets to a common destination node using alternative paths. We rely on a reward mechanism to stimulate cooperation for packet forwarding and evaluate the conflicting multiple access and routing strategies of direct communication and relaying through a detailed foray into the questions of cooperation incentives, throughput, delay and energy-efficiency. Under the separate models of selfish and cooperative network operation, we study the interactions among the equilibrium strategies and present a detailed performance analysis based on multiple system parameters that involve the packet arrival rates, throughput rewards, delay and energy costs.

关键词： medium access control routing stochastic game theory relay channel ad hoc wireless networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：