共查询到20条相似文献,搜索用时 15 毫秒
1.
Internet Connectivity for Ad Hoc Mobile Networks 总被引:7,自引:0,他引:7
Sun Yuan Belding-Royer Elizabeth M. Perkins Charles E. 《International Journal of Wireless Information Networks》2002,9(2):75-88
The growing deployment rate of wireless LANs indicates that wireless networking is rapidly becoming a prevalent form of communication. As users become more accustomed to the use of mobile devices, they increasingly want the additional benefit of roaming. The Mobile IP protocol has been developed as a solution for allowing users to roam outside of their home networks while still retaining network connectivity. The problem with this solution, however, is that the deployment of foreign agents is expensive because their coverage areas are limited due to fading and interference. To reduce the number of foreign agents needed while still maintaining the same coverage, ad hoc network functionality can cooperate with Mobile IP such that multihop routes between mobile nodes and foreign agents can be utilized. In this work, we present a method for enabling the cooperation of Mobile IP and the Ad hoc On-Demand Distance Vector (AODV) routing protocol, such that mobile nodes that are not within direct transmission range of a foreign agent can still obtain Internet connectivity. In addition, we describe how duplicate address detection can be used in these networks to obtain a unique co-located care-of address when a foreign agent is not available. 相似文献
2.
Mobile Ad hoc Networks (MANETs) rely on the cooperation of nodes for packet routing and forwarding. Much of the existing work
in MANETs assume that mobile nodes (possibly owned by selfish users) will follow prescribed protocols without deviation. However,
a user may misbehave due to several advantages resulting from noncooperation, the most obvious being power saving. As such,
the network availability is severely endangered. Hence, enforcing the cooperation among nodes becomes a very important issue.
Several different approaches have been developed to detect non-cooperative nodes or deal with the non-cooperative behavior
of mobile nodes in MANETs. These protocols are first surveyed in details in this paper. It is found that the proposed approaches
have several concerns that prevent them from really enforcing the node cooperation in MANETs. Thus, a new scheme that can
stimulate and also enforce nodes to cooperate in a selfish ad hoc environment is presented. We also present a mechanism to
detect and exclude potential threats of selfish mobile nodes. The simulation results indicate that by using the proposed scheme,
MANETs can be robust against nodes’ misbehaving and the performance of the network is enhanced many folds when compared to
other existing schemes.
相似文献
Ahmed E. KamalEmail: |
3.
移动无线自组织网络正成为研究的热点,最近在网络通信中提出了一种为任播(anycasting)的通信模式,这里介绍了自组织网中任播的概念以及应用,说明了如何在网络层通过路由实现任播功能。 相似文献
4.
The network addresses of principals in a mobile ad hoc network (MANET) are conventionally assumed to be public information.
This may cause devastating consequences for MANETs deployed in hostile environments. For example, attackers can easily locate
a target principal based his known network address and then launch a pinpoint attack. This paper identifies address privacy as a new security requirement to prevent attackers from ascertaining network addresses of MANET principals. We further present
Swarms, the first solution to satisfying this requirement. Swarms eliminates the conventionally explicit one-on-one mappings between
MANET principals and network addresses and allows any two principals to communicate while blind to each other’s address. We
quantitatively measure the address privacy offered by Swarms via an entropy-based information-theoretic metric.
Yanchao Zhang received the BE degree in computer communications from the Nanjing University of Posts and Telecommunications, Nanjing, China, in July 1999, the ME degree in computer applications from the Beijing University of Posts and Telecommunications, Beijing, in April 2002, the PhD degree in electrical and computer engineering from the University of Florida, Gainesville, in August 2006. Since then, he has been an assistant professor in the Department of Electrical and Computer Engineering, New Jersey Institute of Technology. His research interests include network and distributed system security, wireless networking, and mobile computing. He is an Associate Editor of IEEE Transactions on Vehicular Technology and has served as a TPC member for many conferences, including INFOCOM, MOBIHOC, ICDCS, and IWQoS. He is a member of the IEEE and the ACM. Kui Ren is an assistant professor in the Electrical and Computer Engineering Department at Illinois Institute of Technology. He obtained his PhD degree in Electrical and Computer Engineering from Worcester Polytechnic Institute in 2007. He received his B. Eng and M. Eng both from Zhejiang University in 1998 and 2001, respectively. In the past, he has worked as a research assistant at Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences, at Institute for Infocomm Research, Singapore, and at Information and Communications University, South Korea. His research interests include network security & privacy and applied cryptography with current focus on security & privacy in cloud computing, lower-layer attack & defense mechanisms for wireless networks, and sensor network security. His research is sponsored by US National Science Foundation. He serves as TPC member for many conferences including INFOCOM, ICDCS, WiSec, AsiaCCS, MASS, IWQoS, Securecomm, etc. He is a member of IEEE and ACM. 相似文献
Kui RenEmail: |
Yanchao Zhang received the BE degree in computer communications from the Nanjing University of Posts and Telecommunications, Nanjing, China, in July 1999, the ME degree in computer applications from the Beijing University of Posts and Telecommunications, Beijing, in April 2002, the PhD degree in electrical and computer engineering from the University of Florida, Gainesville, in August 2006. Since then, he has been an assistant professor in the Department of Electrical and Computer Engineering, New Jersey Institute of Technology. His research interests include network and distributed system security, wireless networking, and mobile computing. He is an Associate Editor of IEEE Transactions on Vehicular Technology and has served as a TPC member for many conferences, including INFOCOM, MOBIHOC, ICDCS, and IWQoS. He is a member of the IEEE and the ACM. Kui Ren is an assistant professor in the Electrical and Computer Engineering Department at Illinois Institute of Technology. He obtained his PhD degree in Electrical and Computer Engineering from Worcester Polytechnic Institute in 2007. He received his B. Eng and M. Eng both from Zhejiang University in 1998 and 2001, respectively. In the past, he has worked as a research assistant at Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences, at Institute for Infocomm Research, Singapore, and at Information and Communications University, South Korea. His research interests include network security & privacy and applied cryptography with current focus on security & privacy in cloud computing, lower-layer attack & defense mechanisms for wireless networks, and sensor network security. His research is sponsored by US National Science Foundation. He serves as TPC member for many conferences including INFOCOM, ICDCS, WiSec, AsiaCCS, MASS, IWQoS, Securecomm, etc. He is a member of IEEE and ACM. 相似文献
5.
Liljana Gavrilovska 《Wireless Personal Communications》2006,37(3-4):271-290
Wireless ad hoc networks are temporary formed, infrastructureless networks. Due to the unstable channel conditions and network connectivity, their characteristics impose serious challenges in front of network designers. The layering approach to network design does not fit the ad hoc environment well. Therefore, various cross-layering approaches, where protocol layers actively interact, exchange inherent layer information and fine tune their parameters according to the network status are becoming increasingly popular. This paper presents an in-depth analysis of the latest cross-layering approaches for wireless ad hoc networks supported by several examples. A special emphasis is put on the link and network layer related cross-layer designs. Several link adaptation and efficient service discovery schemes are elaborated through analytical and simulation studies. Their performance shows the potentials of the cross-layering for boosting system characteristics in wireless ad hoc networks.
Liljana Gavrilovska currently holds a position of full professor at Faculty of Electrical Engineering, University “St. Cyril and Metodij” – Skopje, Macedonia. She is chief of Telecommunications Laboratory and teaches undergraduate courses in telecommunication networks, data transmission and switching and traffic theory, and graduate courses in wireless, mobile and personal networks, teletraffic engineering and planning, and broadband multiservices networks. In 2000 she joined the Center for PersonKommunikation, Aalborg University, Denmark, as a visiting professor and during 2001--2002 she held a position of associate research professor at the same university. Currently she holds a part-time position of associated research professor with Center for Teleinfrastructur (CTIF). Prof. Gavrilovska was involved in several EU (ACTS ASAP, IST PACWOMAN, MAGNET, TEMPUS) and national/international projects. She published numerous conference and journal papers and participated in several workshops. At the moment she is working on the book “Ad Hoc Networking Towards Seamless Communications” together with prof. R. Prasad. Her research interests include wireless and personal area networks, ad hoc networking, networking protocols, traffic analysis, QoS, and optimization techniques. She is a senior member of IEEE and serves as a Chair of Macedonian Communication Chapter. 相似文献
6.
7.
Geocasting is a variation on the notion of multicasting. A geographical area is associated with each geocast, and the geocast is delivered to the nodes within the specified geographical area. Thus, geocasting may be used for sending a message that is likely to be of interest to everyone in a specified area. In this paper, we propose three geocasting protocols for ad hoc networks, obtained as variations of a multicast flooding algorithm, and then evaluate these approaches by means of simulations. Proposed geocasting algorithms attempt to utilize physical location information to decrease the overhead of geocast delivery. 相似文献
8.
移动ad hoc网络(MANET)路由和分组转发功能需要节点间的相互合作,自私节点为节约能量而不参与合作,将会影响网络的正常工作.因此本文将针对自私节点危害和解决方法展开分析,并提出一种改进解决方法——基于可信任中心服务器和邻居监测的合作增强机制,该方法不但能够激励节点间的相互合作,而且有效地解决了自私节点改变用户身份的欺骗攻击.最后,仿真结果表明这种合作增强机制对自私节点安全问题是有效的,并且易于实用化. 相似文献
9.
移动ad hoc网络是由移动节点自组织形成的网络,由于其动态拓扑、无线通信的特点,容易遭受各种安全威胁.该文介绍了移动ad hoc网络安全研究的最新研究进展.首先从传输信道、移动节点、动态拓扑、安全机制、路由协议几方面,分析了移动ad hoc网络的安全弱点,然后将移动ad hoc网络安全方面的研究分为三个方向:密钥分配与管理、入侵检测、增强合作.对每个方向内一些典型安全方案也进行了分类论述,同时分析了各种方案的优点和缺点,并进行了综合比较.文中阐明了目前协议存在的一些问题并提出了相应的改进方法,最后指出了下一步研究方向. 相似文献
10.
ABRP: Anchor-based Routing Protocol for Mobile Ad Hoc Networks 总被引:2,自引:0,他引:2
Ad hoc networks, which do not rely on any infrastructure such as access points or base stations, can be deployed rapidly and
inexpensively even in situations with geographical or time constraints. Ad hoc networks are attractive in both military and
disaster situations and also in commercial uses like sensor networks or conferencing. In ad hoc networks, each node acts both
as a router and as a host. The topology of an ad hoc network may change dynamically, which makes it difficult to design an
efficient routing protocol. As more and more wireless devices connect to the network, it is important to design a scalable
routing protocol for ad hoc networks. In this paper, we present Anchor-based Routing Protocol (ABRP), a scalable routing protocol
for ad hoc networks. It is a hybrid routing protocol, which combines the table-based routing strategy with the geographic
routing strategy. However, GPS (Global Positioning System) (Kaplan, Understanding GPS principles and Applications, Boston:
Artech House publishers, 1996) support is not needed. ABRP consists of a location-based clustering protocol, an intra-cell
routing protocol and an inter-cell routing protocol. The location-based clustering protocol divides the network region into
different cells. The intra-cell routing protocol routes packets within one cell. The inter-cell routing protocol is used to
route packets between nodes in different cells. The combination of intra-cell and inter-cell routing protocol makes ABRP highly
scalable, since each node needs to only maintain routes within a cell. The inter-cell routing protocol establishes multiple
routes between different cells, which makes ABRP reliable and efficient. We evaluate the performance of ABRP using ns2 simulator.
We simulated different size of networks from 200 nodes to 1600 nodes. Simulation results show that ABRP is efficient and scales
well to large networks. ABRP combines the advantages of multi-path routing strategy and geographic routing strategy—efficiency
and scalability, and avoids the burden—GPS support. 相似文献
11.
在网络拓扑满足网络各种不同性能指标下,本文提出了一种新的转发策略和功率控制策略来估计ad hoc网络的吞吐量.实验结果证明:该方法能够有效的估算和提高ad hoc网络的吞吐量. 相似文献
12.
13.
14.
15.
A Mutual Exclusion Algorithm for Ad Hoc Mobile Networks 总被引:2,自引:0,他引:2
A fault-tolerant distributed mutual exclusion algorithm that adjusts to node mobility is presented, along with proof of correctness and simulation results. The algorithm requires nodes to communicate with only their current neighbors, making it well-suited to the ad hoc environment. Experimental results indicate that adaptation to mobility can improve performance over that of similar non-adaptive algorithms when nodes are mobile. 相似文献
16.
This paper presents the design and evaluation of a highly efficient on-demand multicast routing protocol for mobile ad hoc
networks (MANETs). The protocol, called Geography-aided Multicast Zone Routing Protocol (GMZRP), eliminates as much as possible
duplicate route queries by using a simple yet effective strategy for propagating the multicast route request (MRREQ) packets.
GMZRP is the first hybrid multicast protocol taking the advantages of both topological routing and geographical routing. It
partitions the network coverage area into small zones and guarantees that each geographic zone is queried only once. GMZRP
maintains a multicast forwarding tree at two levels of granularities, i.e., the zone granularity and the node granularity.
By doing this, it can easily handle route breakage since the zone level information can help recover the link failure at the
node level. The results of the performance evaluation of GMZRP using simulation show that, comparing with the well-known multicast
protocol ODMRP (On-Demand Multicast Routing Protocol), GMZRP has much lower protocol overhead in terms of query packets and,
meanwhile, achieves competing packet delivery ratio and shorter delivery latency.
相似文献
Xiaopeng FanEmail: |
17.
针对移动自组织网络中的路由建立和维护问题,研究了衡量路由稳定性的准则,以节点的不确定性特征作为路由选择的标准,提出了基于局部拓扑结构变化熵度量的稳定路由选择策略,并在此基础上设计了一种稳定路由协议。通过NS-2仿真软件对路由选择策略和路由协议进行了验证,仿真结果表明所提出的稳定路由选择策略和路由协议能够有效地提高移动自组织网络的性能。 相似文献
18.
19.
Dynamic Task-Based Anycasting in Mobile Ad Hoc Networks 总被引:2,自引:0,他引:2
Mobile ad hoc networks (MANETs) have received significant attention in the recent past owing to the proliferation in the numbers of tetherless portable devices, and rapid growth in popularity of wireless networking. Most of the MANET research community has remained focused on developing lower layer mechanisms such as channel access and routing for making MANETs operational. However, little focus has been applied on higher layer issues, such as application modeling in dynamic MANET environments. In this paper, we present a novel distributed application framework based on task graphs that enables a large class of resource discovery based applications on MANETs. A distributed application is represented as a complex task comprised of smaller sub-tasks that need to be performed on different classes of computing devices with specialized roles. Execution of a particular task on a MANET involves several logical patterns of data flow between classes of such specialized devices. These data flow patterns induce dependencies between the different classes of devices that need to cooperate to execute the application. Such dependencies yield a task graph (TG) representation of the application.We focus on the problem of executing distributed tasks on a MANET by means of dynamic selection of specific devices that are needed to complete the tasks. In this paper, we present simple and efficient algorithms for dynamic discovery and selection (instantiation) of suitable devices in a MANET from among a number of them providing the same functionality. This is carried out with respect to the proposed task graph representation of the application, and we call this process Dynamic Task-Based Anycasting. Our algorithm periodically monitors the logical associations between the selected devices, and in the event of a disruption in the application owing to failures in any component in the network, it adapts to the situation and dynamically rediscovers the affected parts of the task graph, if possible. We propose metrics for evaluating the performance of these algorithms and report simulation results for a variety of application scenarios differing in complexity, traffic, and device mobility patterns. From our simulation studies, we observed that our protocol was able to instantiate and re-instantiate TG nodes quickly and yielded high effective throughput at low to medium degrees of mobility and not much below 70% effective throughput for high mobility scenarios. 相似文献
20.
The main purposes of this article are to relieve broadcast problem, to immunize to some prerequisites, and to reduce the number of transmitted control packets. Broadcasting control packets network-wide is the most direct and common method for finding the required destination node in ad hoc mobile wireless networks; however, this causes a lot of waste of wireless bandwidth. To remedy the problem, routing protocols demanding some prerequisites are proposed; nonetheless, hardly can they be used if these prerequisites are missed or become stale. To efficiently reduce the number of transmitted control packets, our routing protocol partitions the network into interlaced gray districts and white districts by the aid of GPS and inhibits an intermediate node residing in a white district from re-transmitting the received control packets. However, a mobile node residing in a gray district is responsible for re-transmitting them till they reach the destination node. Our routing protocol does not demand any prerequisite except the use of GPS. Each mobile node can always obtain its own location information; furthermore, the information may neither be missed nor become stale. Our routing protocol is easy to be implemented, saves precious wireless bandwidth, and reduces almost half a number of control packets as compared with pure flooding routing protocols.Ying-Kwei Ho received the B.S. degree and M.S. degree in applied mathematics and in electrical engineering from the Chung-Cheng Institute of Technology in 1987 and 1993 respectively and the Ph.D. degree in computer engineering and science from the Yuan-Ze University, Taiwan, R.O.C. He joined the Army of Taiwan, R.O.C. in 1987 and worked as a software engineer. From 1993 to 1997, he was an instructor in the War Game Center of Armed Forces University, Taiwan, R.O.C. He is currently an assistant professor of the Department of Computer Science at Chung-Cheng Institute of Technology. His research interests include mobile computing, wireless network performance simulation and evaluation, and modeling and simulation.Ru-Sheng Liu received the B.S. degree in electrical engineering from the National Cheng-Kung University, Taiwan, in 1972 and the M.S. and Ph.D. degrees in computer science from the University of Texas at Dallas, Richardson, Texas, in 1981 and1985, respectively. He is currently an associate professor in the Department of Computer Engineering and Science at Yuan-Ze University, Chungli, Taiwan. His research interests are in the areas of mobile computing, internet technology, and computer algorithms. 相似文献