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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

100 篇 会议
3 篇 期刊文献

馆藏范围

103 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

38 篇 工学
- 33 篇 信息与通信工程
- 30 篇 计算机科学与技术...
- 24 篇 软件工程
- 10 篇 控制科学与工程
- 4 篇 动力工程及工程热...
- 4 篇 电气工程
- 3 篇 电子科学与技术（可...
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 安全科学与工程
14 篇 理学
- 14 篇 数学
- 5 篇 统计学（可授理学、...
- 1 篇 物理学
7 篇 管理学
- 5 篇 管理科学与工程(可...
- 4 篇 图书情报与档案管...
- 3 篇 工商管理
2 篇 经济学
- 2 篇 应用经济学
1 篇 法学
- 1 篇 社会学

主题

36 篇 mobile computing
27 篇 distributed comp...
27 篇 computer network...
22 篇 wireless sensor ...
18 篇 mobile ad hoc ne...
18 篇 ad hoc networks
18 篇 media access pro...
15 篇 intelligent netw...
13 篇 delay
12 篇 access protocols
11 篇 throughput
11 篇 sensor phenomena...
11 篇 directional ante...
10 篇 routing protocol...
10 篇 telecommunicatio...
9 篇 traffic control
9 篇 network topology
9 篇 energy consumpti...
9 篇 wireless mesh ne...
9 篇 broadcasting

机构

22 篇 obr center for d...
11 篇 obr center for d...
7 篇 obr center for d...
5 篇 obr center for d...
5 篇 obr center of di...
4 篇 obr center for d...
4 篇 obr center for d...
3 篇 obr center for d...
3 篇 research and tec...
2 篇 department of co...
2 篇 networking techn...
2 篇 department of co...
2 篇 obr research cen...
2 篇 obr research cen...
2 篇 obr center for d...
2 篇 mesh research an...
1 篇 obr center of di...
1 篇 obr research cen...
1 篇 univ cincinnati ...
1 篇 department of co...

作者

37 篇 d.p. agrawal
32 篇 agrawal dharma p...
25 篇 dharma p. agrawa...
9 篇 bin xie
9 篇 c. cordeiro
8 篇 h. gossain
6 篇 xiaodong wang
6 篇 cordeiro carlos
6 篇 gossain hrishike...
5 篇 chowdhury kaushi...
5 篇 jun yin
5 篇 yun wang
5 篇 qi zhang
5 篇 weihuang fu
5 篇 biswas ratnabali
4 篇 vivek jain
4 篇 demin wang
4 篇 younghwan yoo
4 篇 d. lal
4 篇 cavalcanti dave

语言

102 篇 英文
1 篇 中文

检索条件"机构=OBR Distributed and Mobile Computing"

共 103 条记录，以下是71-80 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Challenges in utilizing aggregate logical sensor units for wireless sensory information networks

Challenges in utilizing aggregate logical sensor units for w...

引用

IEEE International Symposium on Personal, Indoor and mobile Radio Communications (PIMRC)

作者： A. Kumar P.S. Dhekne D.P. Agrawal Mobile Information Networking Distributed Systems (MINDS) Lab CECS University of Louisville Louisville KY USA Computer Division Mod Lab Bhabha Atomic Research Centre Mumbai India OBR Research Center for Distributed and Mobile Computing ECECS University of Cincinnati Cincinnati OH USA

Historically, a large number of small and cheaper sensors are deployed to form a sensor network. This paper provides rationale behind using an aggregate logical sensor unit (ALSU) as a building block in a Wireless Sensory Information network (WSIN). In this architecture, a single ALSU is composed of many off-the-shelf sensor nodes in the manner similar to the Beowulf cluster concept. The highly capable, cost effective and flexible ALSUs built in this manner from several smaller physical sensor nodes, would enable high computation power and built-in reliability for sensor applications. The objective of this paper is to provide an alternative where energy and computation is not a limiting factor in order to achieve the operational objectives of WSIN applications. This paper highlights critical issues that need to be addressed in developing a framework where each ALSU could have the capability to perform required operations as dictated by an underlying application

关键词： Wireless sensor networks Intelligent networks Aggregates Computer networks mobile computing distributed computing Sensor systems Computer architecture Bandwidth Batteries

来源：评论

学校读者我要写书评

暂无评论

A new routing mechanism for integrating cellular networks, WLAN hot spots and MANETS

A new routing mechanism for integrating cellular networks, W...

引用

IEEE International Symposium on Personal, Indoor and mobile Radio Communications (PIMRC)

作者： C. Cavalcanti C. Cordeiro A. Kumar D. Agrawal OBR Center for Distributed and Mobile Computing Department of ECECS University of Cincinnati Cincinnati OH USA Wireless Communications and Networking Department Philips Research USA Briarcliff Manor NY USA Department of Computer Engineering and Computer Science University of Louisville Louisville KY USA

A growing need for ubiquitous connectivity has motivated the integration of various wireless technologies such as cellular systems, WLANs and MANETs. In this paper we introduce the integrated routing protocol (IRP) that exploits topology information obtained by cellular base stations and WLAN access points in the route discovery and maintenance in a heterogeneous wireless access network. IRP also provides connectivity to the cellular network and/or WLAN hotspots through the multi-hop routing by allowing out of coverage users to maintain routes to Gateway Nodes (GN). We provide a simulation study of IRP with two different link quality metrics, number of hops and a new integrated metric based on the expected transmission time (ETT). Our results show that IRP improves the network coverage and capacity and allows connectivity alternatives that are not supported by other integrated solutions

关键词： Routing Land mobile radio cellular systems Wireless LAN mobile ad hoc networks Cellular networks Computer networks distributed computing Pervasive computing Network topology Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Supporting MAC layer multicast in IEEE 802.11 based MANETs: Issues and solutions

Supporting MAC layer multicast in IEEE 802.11 based MANETs: ...

引用

Proceedings - 29th Annual IEEE International Conference on Local Computer Networks, LCN 2004

作者： Gossain, Hrishikesh Nandiraju, Nagesh Anand, Kumar Agrawal, Dharma P. OBR Center for Distributed and Mobile Computing Department of ECECS University of Cincinnati Cincinnati OH 45221-0030

In an IEEE 802.11 based mobile Ad Hoc Networks (MANETs) multicast packets are generally forwarded as one hop broadcast;mainly to reach all the multicast members in the neighborhood in a single transmission. Because of the broadcast property of the forwarding, packets suffer from increased instances of hidden terminal problem. Mobility of nodes makes things more difficult, and unlike unicast transmissions where MAC can detect the movement of a nexthop by making several retries, it is not possible in case of multicast forwarding. To address these issues, we propose a multicast aware MAC protocol (MMP) for MANETs. The basic objective of MMP is to provide a MAC layer support for multicast traffic. This is done by attaching an Extended Multicast Header (EMH) by the multicast agent, which provides the address of the nexthop nodes that are supposed to receive the multicast packet. The MAC layer in MMP uses the EMH field to support an ACK based data delivery. After sending the data packet, the transmitter waits for the ACK from each of its destinations in a strictly sequential order. A retransmission of the multicast packet is performed only if the ACK from any of the nodes in EMH is missing. We compare MMP with IEEE 802.11 and results show that MMP substantially improves the performance of multicast packet delivery in MANETs without creating much MAC overhead. In addition, MMP provides a better mechanism to detect the movement of its nexthop members. © 2004 IEEE.

关键词： Computer networks

来源：评论

学校读者我要写书评

暂无评论

Parallel cluster formation for secured communication in wireless ad hoc networks

Parallel cluster formation for secured communication in wire...

引用

2004 12th IEEE International Conference on Networks, ICON 2004 - Unity in Diversity

作者： Shah, Vivek Deng, Hongmei Agrawal, Dharma P. OBR Research Center for Distributed and Mobile Computing University of Cincinnati Cincinnati OH 45221-0030 United States

ISBN: (纸本)078038783X

Routing protocols in wireless ad hoc network are highly insecure and prone to various attacks owing to its inherent characteristics of open medium, dynamically changing topologies and distributed cooperation between the member nodes. Having a secure routing protocol in wireless ad hoc networks appears to be a problem that is not trivial to solve. In this paper we mainly consider the vulnerabilities of Cluster Based Routing Protocol (CBRP), which uses formation of clusters with a single cluster head. In CBRP, cluster head has the responsibility of maintaining the cluster member list, routing the packets from the cluster members and can also be a certification authority (CA) for distribution of certificates. However a single cluster head in CBRP can be a single point of failure and can also become malicious or selfish and as a result the whole system can become paralyzed. We propose a scheme and algorithm in which we distribute the cluster head service to a group of cluster heads called Council. Each Council node will have equal functionality and utilize the (k, n) threshold secret sharing scheme for performing the cluster head functionality. One of the main functionality of Council will be key distribution. A certificate will be formed by participation of at least k nodes out of n Council member. The cluster head functionality will now be able to work even when more than one (but limited to min {k, n-k+1}) cluster heads are compromised. Simulation results of our proposed algorithm for formation of such Council based clusters demonstrates that our scheme is more fault tolerant and efficient than CBRP. © 2004 IEEE.

关键词： Security of data

来源：评论

学校读者我要写书评

暂无评论

Probabilistic broadcasting based on coverage area and neighbor confirmation in mobile ad hoc networks

Probabilistic broadcasting based on coverage area and neighb...

引用

IEEE Global Telecommunications Conference Workshops, GLOBECOM 2004

作者： Kim, Jae-Soo Zhang, Qi Agrawal, Dharma P. Department of Computer Engineering Sangju National University Sangju Korea Republic of OBR Center for Distributed and Mobile Computing ECECS University of Cincinnati Cincinnati OH

Broadcasting is a fundamental and effective data dissemination mechanism for route discovery, address resolution and many other network services in ad hoc networks. While data broadcasting has many advantages, it also causes some problems such as the broadcast storm problem, which is characterized by redundant retransmission, collision, and contention. Although many approaches have been proposed to solve them, none of them guarantees the lowest bound. In this paper, we propose a probabilistic broadcasting based on coverage area and neighbor confirmation in mobile ad hoc networks. We use the coverage area of a node to adjust the rebroadcast probability. If a mobile node is located in the area closer to sender, which means it has small additional coverage and rebroadcast from this node can reach less additional nodes, so its rebroadcast probability will be set lower. On the other hand, if a mobile node is located in the area far from sender, which means that the additional coverage from this node is large, its rebroadcast probability will be set higher. The coverage area can be estimated from the distance between sender and receiver and the distance can be estimated by signal strength or global positional system. Our approach combines the advantages of probabilistic and area based approach. Simulation results show that our approach can improve the average performance of broadcasting in various network scenarios. Our approach is simple and can be easily implemented in MANET. © 2004 IEEE.

关键词： mobile telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

The deafness problems and solutions in wireless ad hoc networks using directional antennas

The deafness problems and solutions in wireless ad hoc netwo...

引用

IEEE Global Telecommunications Conference Workshops, GLOBECOM 2004

作者： Gossain, Hrishikesh Cordeiro, Carlos Cavalcanti, Dave Agrawal, Dharma P. OBR Center for Distributed and Mobile Computing Department of ECECS University of Cincinnati Cincinnati OH 45221-0030 Nokia Research Center Networking Technologies Lab. Tampere Finland

This paper addresses the issue of deafness in directional antennas for wireless ad hoc networks. Deafness is caused when a node X repeatedly attempts to communicate with node Y but is unsuccessful, because Y is presently tuned to some other antenna beam. In this paper, we first outline different factors which contribute to such deafness in directional antennas and its significant impact on network performance. We then propose two schemes to overcome deafness scenarios which are transparent to the underlying directional MAC protocol in use. In addition, we also claim that IEEE 802.11 Short Retry Limit (SRL) needs a special handling in directional environment because of the presence of deafness. We have done a detailed performance evaluation of our schemes with different directional MAC protocols running over switched beam antennas and the initial results are found to be very promising. © 2004 IEEE.

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Broadcasting over switched single beam antennas

Broadcasting over switched single beam antennas

引用

2004 12th IEEE International Conference on Networks, ICON 2004 - Unity in Diversity

作者： Joshi, Tarun Cordeiro, Carlos Vogety, Sasidhar Yin, Jun Gossain, Hrishikesh Agrawal, Dharma P. OBR Center for Distributed and Mobile Computing Department of ECECS University of Cincinnati Cincinnati OH 45221-0030 United States Nokia Research Center Networking Technologies Lab Tampere Finland

ISBN: (纸本)078038783X

In switched single beam directional antenna model, broadcasting is achieved by sequentially steering the antenna beam across all pre-defined directions resulting in a sweeping delay. In this paper we study suggested techniques to alleviate broadcast storm problems in ad hoc networks with directional antennas, point out their shortcomings, and propose two new schemes, namely, the New Enhanced Directional Flooding (NEDF) and the Probabilistic Relay Broadcasting (PRB). We thoroughly compare the performance of these protocols with present directional broadcast schemes including omni directional flooding over six, twelve and eighteen antenna beam models. The results indicate that directional broadcasting provides excellent connectivity in the regions of sparse density as compared to omni directional broadcasting. © 2004 IEEE.

关键词： Broadcasting

来源：评论

学校读者我要写书评

暂无评论

Parallel cluster formation for secured communication in wireless ad hoc networks

Parallel cluster formation for secured communication in wire...

引用

IEEE International Conference on Networks

作者： V. Shah Hongmei Deng D.P. Agrawal OBR Research Distributed and Mobile Computing University of Cincinnati Cincinnati OH USA

Routing protocols in wireless ad hoc network are highly insecure and prone to various attacks owing to its inherent characteristics of open medium, dynamically changing topologies and distributed cooperation between the member nodes. Having a secure routing protocol in wireless ad hoc networks appears to be a problem that is not trivial to solve. In this paper we mainly consider the vulnerabilities of cluster based routing protocol (CBRP), which uses formation of clusters with a single cluster head. In CBRP, cluster head has the responsibility of maintaining the cluster member list, routing the packets from the cluster members and can also be a certification authority (CA) for distribution of certificates. However a single cluster head in CBRP can be a single point of failure and can also become malicious or selfish and as a result the whole system can become paralyzed. We propose a scheme and algorithm in which we distribute the cluster head service to a group of cluster heads called council. Each council node will have equal functionality and utilize the (k, n) threshold secret sharing scheme for performing the cluster head functionality. One of the main functionality of council will be key distribution. A certificate will be formed by participation of at least k nodes out of n council member. The cluster head functionality will now be able to work even when more than one (but limited to min {k, n-k+1}) cluster heads are compromised. Simulation results of our proposed algorithm for formation of such council based clusters demonstrates that our scheme is more fault tolerant and efficient than CBRP.

关键词： Intelligent networks Communication system security Wireless communication Ad hoc networks Routing protocols Councils mobile ad hoc networks Network topology Clustering algorithms Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Analysis of leveled probabilistic routing in mobile ad hoc networks

Analysis of leveled probabilistic routing in mobile ad hoc n...

引用

IEEE International Conference on Communications (ICC)

作者： Qi Zhang D.P. Agrawal OBR Center for Distributed and Mobile Computing ECECS University of Cincinnati Cincinnati OH USA

In mobile ad hoc networks (MANET), some mobile hosts may be outside the range of the source node. In order to deliver the message to those hosts, intermediate nodes should relay the packets for them. Due to the node mobility, we cannot have a fixed group of mobile nodes perform the task of packet relaying. In this paper we propose a routing protocol based on the preassigned probability model. In this protocol, a mobile host probabilistically sends the relay packets (rebroadcasts) according to its neighborhood information. We exploit the "HELLO" message exchanges between immediate neighbors to obtain the neighborhood information. Using this method, we can reduce routing cost by minimizing the number of rebroadcasts in route discovery period without a significant impact on the network connectivity. Moreover, the chance of contention and collision among neighboring nodes is also reduced. As a result, the overall network performance is improved, while higher goodput and lower energy consumption is achieved. Our approach categorizes mobile hosts into four groups according to their neighborhood information. For each group of nodes, we assign a specified value of rebroadcasting probability. The mobile hosts with more neighbors are given higher rebroadcasting probability, while the mobile hosts with fewer neighbors have a lower rebroadcasting probability. Analytical results show that our approach outperforms the AODV protocol.

关键词： Intelligent networks mobile ad hoc networks Relays Routing protocols mobile computing Costs Ad hoc networks Computer networks distributed computing Energy consumption

来源：评论

学校读者我要写书评

暂无评论

Impact of selfish nodes on route discovery in mobile ad hoc networks

Impact of selfish nodes on route discovery in mobile ad hoc ...

引用

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

作者： Qi Zhang D.P. Agrawal OBR Center for Distributed and Mobile Computing ECECS University of Cincinnati Cincinnati OH USA

It is against our intuition that being selfish sometimes can be beneficial to both oneself and others. In a mobile ad hoc network (MANET), we show potential use of this concept by categorizing mobile hosts into normal nodes and selfish nodes. Normal nodes forward packets for other nodes while selfish nodes do not. The advantage of using selfish nodes is that the total rebroadcast traffic during flooding based route discovery can be reduced. The disadvantage, in theory, is that we may miss the optimal route and suffer from a low delivery rate. In this paper, we propose a probabilistic approach to set up a proper number of selfish nodes. Using a combination of gossiping and dominating set, we can reduce the route discovery cost by minimizing the number of rebroadcasts, while achieving higher delivery rate due to the reduction of rebroadcast traffic, thereby reducing the number of collisions. We compare our approach with AODV in terms of several metrics, including average number of rebroadcasts, average number of packet collisions, end-to-end delay, and throughput. Simulation results show that our approach outperforms the AODV protocol in most cases.

关键词： Intelligent networks mobile ad hoc networks Relays Routing protocols Costs Delay Road accidents mobile communication mobile computing Computer networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共11页 << < 2 3 4 5 6 7 8 9 10 11 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：