共查询到20条相似文献,搜索用时 15 毫秒
1.
In this paper, we propose a comprehensive solution for power control in mobile ad hoc networks (MANETs). Our solution emphasizes the interplay between the MAC and network layers, whereby the MAC layer indirectly influences the selection of the next-hop by properly adjusting the power of route request packets. This is done while maintaining network connectivity. Channel-gain information obtained mainly from overheard RTS and CTS packets is used to dynamically construct the network topology. Unlike the IEEE 802.11 approach and previously proposed schemes, ours does not use the RTS/CTS packets to silence the neighboring nodes. Instead, collision avoidance information is inserted in the CTS packets and sent over an out-of-band control channel. This information is used to dynamically bound the transmission power of potentially interfering nodes in the vicinity of a receiver. By properly estimating the required transmission power for data packets, our protocol allows for interference-limited simultaneous transmissions to take place in the neighborhood of a receiving node. Simulation results indicate that, compared to the IEEE 802.11 approach, the proposed protocol achieves a significant increase in the channel utilization and end-to-end network throughput and a significant decrease in the total energy consumption. 相似文献
2.
A Mobile Ad hoc NETwork (MANET) is a group of mobile nodes that form a multihop wireless network. The topology of the network can change randomly due to unpredictable mobility of nodes and propagation characteristics. Previously, it was assumed that the nodes in the network were assigned IP addresses a priori. This may not be feasible as nodes can enter and leave the network dynamically. A dynamic IP address assignment protocol like DHCP requires centralized servers that may not be present in MANETs. Hence, we propose a distributed protocol for dynamic IP address assignment to nodes in MANETs. The proposed solution guarantees unique IP address assignment under a variety of network conditions including message losses, network partitioning and merging. Simulation results show that the protocol incurs low latency and communication overhead for an IP address assignment. 相似文献
3.
In large and dense mobile ad hoc networks, position-based routing protocols can offer significant performance improvement over topology-based routing protocols by using location information to make forwarding decisions. However, there are several potential security issues for the development of position-based routing protocols. In this paper, we propose a secure geographic forwarding (SGF) mechanism, which provides source authentication, neighbor authentication, and message integrity by using both the shared key and the TIK protocol. By combining SGF with the Grid Location Service (GLS), we propose a Secure Grid Location Service (SGLS) where any receiver can verify the correctness of location messages. We also propose a Local Reputation System (LRS) aiming at detecting and isolating both compromised and selfish users. We present the performance analysis of both SGLS and LRS, and compare them with the original GLS. Simulation results show that SGLS can operate efficiently by using effective cryptographic mechanisms. Results also show that LRS effectively detects and isolates message dropping attackers from the network. 相似文献
4.
Transmission-scheduling protocols can support contention-free link-level broadcast transmissions and delay sensitive traffic in mobile, multiple-hop packet radio networks. Use of transmission-scheduling protocols, however, can be very inefficient in mobile environments due to the difficulty in adapting transmission schedules. The paper defines a new adaptive and distributed protocol that permits a terminal to adapt transmission assignments to changes in topology using information it collects from its local neighborhood only. Because global coordination among all the terminals is not required and changes to transmission assignments are distributed to nearby terminals only, the protocol can adapt quickly to changes in the network connectivity. The two key parameters that affect the ability of the protocol to adapt to changes in connectivity are the rate of connectivity changes and the number of terminals near the connectivity changes. Using simulation, we determine the ranges for these parameters for which our adaptive protocol can maintain collision-free schedules with an acceptable level of overhead. The stability of the protocol is also characterized by showing that the protocol can quickly return to a collision-free transmission schedule after a period of very rapid changes in connectivity. Our channel-access protocol does not require a contention-based random-access phase to adapt the transmission schedules, and thus its ability to adapt quickly does not deteriorate with an increase in the traffic load. 相似文献
5.
The proper functioning of mobile ad hoc networks depends on the hypothesis that each individual node is ready to forward packets
for others. This common assumption, however, might be undermined by the existence of selfish users who are reluctant to act
as packet relays in order to save their own resources. Such non-cooperative behavior would cause the sharp degradation of
network throughput. To address this problem, we propose a credit-based Secure Incentive Protocol (SIP) to stimulate cooperation
among mobile nodes with individual interests. SIP can be implemented in a fully distributed way and does not require any pre-deployed
infrastructure. In addition, SIP is immune to a wide range of attacks and is of low communication overhead by using a Bloom
filter. Detailed simulation studies have confirmed the efficacy and efficiency of SIP.
This work was supported in part by the U.S. Office of Naval Research under Young Investigator Award N000140210464 and under
grant N000140210554.
Yanchao Zhang
received the B.E. degree in Computer Communications from Nanjing University of Posts and Telecommunications, Nanjing, China,
in July 1999, and the M.E. degree in Computer Applications from Beijing University of Posts and Telecommunications, Beijing,
China, in April 2002. Since September 2002, he has been working towards the Ph.D. degree in the Department of Electrical and
Computer Engineering at the University of Florida, Gainesville, Florida, USA. His research interests are network and distributed
system security, wireless networking, and mobile computing, with emphasis on mobile ad hoc networks, wireless sensor networks,
wireless mesh networks, and heterogeneous wired/wireless networks.
Wenjing Lou
is an assistant professor in the Electrical and Computer Engineering department at Worcester Polytechnic Institute. She obtained
her Ph.D degree in Electrical and Computer Engineering from University of Florida in 2003. She received the M.A.Sc degree
from Nanyang Technological University, Singapore, in 1998, the M.E degree and the B.E degree in Computer Science and Engineering
from Xi'an Jiaotong University, China, in 1996 and 1993 respectively. From Dec 1997 to Jul 1999, she worked as a Research
Engineer in Network Technology Research Center, Nanyang Technological University. Her current research interests are in the
areas of ad hoc and sensor networks, with emphases on network security and routing issues.
Wei Liu
received his B.E. and M.E. in Electrical and Information Engineering from Huazhong University of Science and Technology, Wuhan,
China, in 1998 and 2001. In August 2005, he received his PhD in Electrical and Computer Engineering from University of Florida.
Currently, he is a senior technical member with Scalable Network Technologies. His research interest includes cross-layer
design, and communication protocols for mobile ad hoc networks, wireless sensor networks and cellular networks.
Yuguang Fang
received a Ph.D. degree in Systems Engineering from Case Western Reserve University in January 1994 and a Ph.D degree in Electrical
Engineering from Boston University in May 1997. He was an assistant professor in the Department of Electrical and Computer
Engineering at New Jersey Institute of Technology from July 1998 to May 2000. He then joined the Department of Electrical
and Computer Engineering at University of Florida in May 2000 as an assistant professor, got an early promotion to an associate
professor with tenure in August 2003 and a professor in August 2005. He has published over 150 papers in refereed professional
journals and conferences. He received the National Science Foundation Faculty Early Career Award in 2001 and the Office of
Naval Research Young Investigator Award in 2002. He has served on many editorial boards of technical journals including IEEE
Transactions on Communications, IEEE Transactions on Wireless Communications, IEEE Transactions on Mobile Computing and ACM
Wireless Networks. He is a senior member of the IEEE. 相似文献
6.
The problem for dynamic IP address assignment is manifest in mobile ad hoc networks, especially in 4G all-IP-based heterogeneous
networks. Existing solutions are mainly riveted to decentralized algorithms, applying a large number of broadcast messages
to (1) maintain available IP address pools and (2) ensure no address duplication occurring. In this paper, we propose a ring-based
address autoconfiguration protocol to configure node addresses. This work aims at the decentralized ring-based address autoconfiguration
(DRAA) protocol, which has the advantage of low latency, low communication overhead and high uninterruptible connection. The
DRAA protocol is a low-latency solution because each node independently allocates partial IP addresses and does not need to
perform the duplicate addresses detection (DAD) during the node-join operation. Communication overhead is significantly lessened
in that DRAA protocol uses the logical ring, thus utilizing fewer control messages solely by means of uni-cast messages to
distribute address resources and to retrieve invalid addresses. Furthermore, if duplicate addresses are shown at network merging,
the DRAA protocol checks the number of both TCP connections and of nodes to allow duplicate nodes to rejoin the smaller network
so that lost connections are fast re-connected. To improve communication overhead and provide the evenness of address resources,
the centralized ring-based address autoconfiguration (CRAA) protocol is discussed. The CRAA protocol reduces larger numbers
of broadcast messages during network merging. The other contribution is that our CRAA protocol also has an even capability
so that address resources can be evenly distributed in each node in networks; this accounts for the reason our solution is
suitable for large-scale networks. Finally, the performance analysis illustrates performance achievements of RAA protocols.
The simulation result shows that the DRAA protocol has the shortest latency, that the CRAA protocol has the capability to
evenly distribute address resources and that both of DRAA and CRAA protocols are the good solutions which achieve low communication
overhead and high uninterruptible connection. 相似文献
7.
Using multiple channels in wireless networks improves spatial reuse and reduces collision probability and thus enhances network throughput. Designing a multi-channel MAC protocol is challenging because multi-channel-specific issues such as channel assignment, the multi-channel hidden terminal problem, and the missing receiver problem, must be solved. Most existing multi-channel MAC protocols suffer from either higher hardware cost or poor throughput. Some channel hopping multi-channel protocols achieve pretty good performance in certain situations but fail to adjust their channel hopping mechanisms according to varied traffic loads. In this paper, we propose a load-aware channel hopping MAC protocol (LACH) that solves all the multi-channel-specific problems mentioned above.LACH enables nodes to dynamically adjust their schedules based on their traffic loads. In addition to load awareness, LACH has several other attractive features: (1) Each node is equipped with a single half-duplex transceiver. (2) Each node’s initial hopping sequence is generated by its ID. Knowing the neighbor nodes’ IDs, a node can calculate its neighbors’ initial channel hopping sequences without control packet exchanges. (3) Nodes can be evenly distributed among available channels. Through performance analysis, simulations, and real system implementation, we verify that LACH is a promising protocol suitable for a network with time-varied traffic loads. 相似文献
8.
低开销的MANET网络按需路由协议 总被引:1,自引:0,他引:1
针对简单泛洪效率低的问题,提出了一个限制洪泛的高效的路由广播算法,通过Euclidean距离来限制路由发现过程中请求分组被转发的次数;研究了减少路由维护开销,并降低路由发现的频率的方法,提出了一个基于节点高度的路由修复与优化算法,该算法使用节点监听来对链路断裂的路由进行修复与优化.基于限制泛洪的高效的路由广播算法和路由修复优化算法,提出了一种新的低开销的MANET网络按需路由协议LOOR(low overhead on-demand routing).仿真结果表明,新协议增强了路由的顽健性,减少了路由跳数,降低了路由发现的频率,提高了数据分组递送率,并显著地降低了路由控制开销. 相似文献
9.
Flooding-based route discovery is widely assumed in existing routing protocols of wireless ad hoc networks. Network-wide flooding enables the discovery of optimal routes from sources to destinations; however, as all network nodes are required to participate in the relays of route request packets, substantial control overhead is inevitable. Some efficient broadcast schemes can suppress redundant packet relays, but they often suppress the discovery of optimal routes, too. In this article we propose to dynamically create a prerouting region between each source-destination pair and limit the propagations of route request packets only within this region. The prerouting region effectively restricts route discovery activities to the nodes that most likely constitute the optimal or near-optimal routes. Consequently, not only is route construction overhead significantly reduced; route optimality is also guaranteed. The article presents a region-based routing (REGR) protocol covering both new route formation cases and route update cases. Simulations show that our protocol is particularly beneficial to dense and large-scale mobile ad hoc networks. 相似文献
10.
Routing protocols are the binding force in mobile ad hoc network (MANETs) since they facilitate communication beyond the wireless
transmission range of the nodes. However, the infrastructure-less, pervasive, and distributed nature of MANETs renders them
vulnerable to security threats. In this paper, we propose a novel cluster-based trust-aware routing protocol (CBTRP) for MANETs
to protect forwarded packets from intermediary malicious nodes. The proposed protocol organizes the network into one-hop disjoint
clusters then elects the most qualified and trustworthy nodes to play the role of cluster-heads that are responsible for handling
all the routing activities. The proposed CBTRP continuously ensures the trustworthiness of cluster-heads by replacing them
as soon as they become malicious and can dynamically update the packet path to avoid malicious routes. We have implemented
and simulated the proposed protocol then evaluated its performance compared to the clustered based routing protocol (CBRP)
as well as the 2ACK approach. Comparisons and analysis have shown the effectiveness of our proposed scheme. 相似文献
11.
Timer-based broadcasting for power-aware routing in power-controlled wireless ad hoc networks 总被引:2,自引:0,他引:2
Sun-Ho Lee Eunjeong Choi Dong-Ho Cho 《Communications Letters, IEEE》2005,9(3):222-224
We propose a new cross-layer design method for minimizing the total consumed power in power-controlled wireless ad hoc networks. In contrast to previous research, we consider not only a power-aware routing algorithm, but also a MAC layer algorithm that is adequate to optimize its performance. Computer simulations show that the proposed scheme outperforms the conventional schemes with respect to the average total consumed power, while maintaining a similar average success rate. Moreover, the proposed scheme approximates the optimal solution calculated by CPLEX, and is scalable, since each node operates in a distributed manner. 相似文献
12.
Rui Teng 《Communications Magazine, IEEE》2006,44(11):124-132
In hybrid ad hoc networks, mobile nodes can communicate not only with each other in a self-organizing manner, but also with nodes on wired networks for extensive information retrieval and dissemination. In this article we consider efficient routing operations between any two nodes in an ad hoc network that is linked to wired networks by an access point. To build routes with low routing overhead efficiently, we develop a new routing scheme of region-based routing (RBR), which utilizes hop counts between mobile nodes and the access point to localize a route discovery within a limited topological region. Limiting the region of route discovery results in fewer routing messages and therefore reduces routing overhead. Simulation results show that the RBR scheme greatly reduces routing overhead while preserving a high rate of success for route discovery to the destination 相似文献
13.
Using directional antennas in wireless mobile ad hoc networks can greatly improve the transmission range as well as the spatial
reuse. However, it will also cause some problems such as deafness problem and hidden terminal problem, which greatly impair
the network performance. This paper first proposes a MAC protocol called Selectively Directional MAC (SDMAC) that can effectively
address these problems and significantly improve the network throughput. Then two improvements on SDMAC are proposed. The
first one is to improve the network throughput by scheduling the packets in the queue (a scheme called Q-SDMAC), thus the
head-of-line (HOL) blocking problem can be addressed. The second one is to relax the assumption that each node knows the relative
directions of its neighboring nodes and use caches to buffer those relative directions (a scheme named Q-SDMAC using cache).
Extensive simulations show that: (1) SDMAC can achieve much better performance than the existing MAC protocols using directional
antennas; (2) The network throughput can be significantly improved by scheduling the packets in the queue; (3) Using caches
can still achieve high network throughput when nodes are moving; and (4) Network throughput decreases when directional antennas
have side lobe gain.
相似文献
Yuguang Fang (Corresponding author)Email: |
14.
In IP‐based networks, IP address uniqueness is one of the most important requirements since a node has to participate in unicast communications and routing. Often nodes are assumed to have unique IP addresses configured a priori. However, this is not the case and cannot be achieved easily in mobile ad hoc networks (MANETs). Most of the existing dynamic address allocation schemes of MANET rely on network‐wide flooding for address solicitation and/or duplicate address detection. As a result, several types of security threats can be seen at the time of address allocation. In this paper, we present an ID‐based distributed dynamic IP configuration scheme that securely allocates IP addresses to the authorized nodes without flooding the entire network. Here each node acquires capability of generating unique IP addresses from its own IP address and can assign those addresses to the new nodes. The proposed scheme provides security against the associated threats with dynamic IP allocation protocol without the help of a trusted third party. It also efficiently handles the network partitioning and merging and reduces the chance of address conflicts. Performance analysis and simulation results are present to show that the proposed addressing scheme has low communication overhead and fairly low addressing latency with added security mechanisms compared to the similar existing dynamic address allocation schemes. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
15.
16.
The mobile ad hoc network (MANET) has recently been recognized as an attractive network architecture for wireless communication. Reliable broadcast is an important operation in MANET (e.g., giving orders, searching routes, and notifying important signals). However, using a naive flooding to achieve reliable broadcasting may be very costly, causing a lot of contention, collision, and congestion, to which we refer as the broadcast storm problem. This paper proposes an efficient reliable broadcasting protocol by taking care of the potential broadcast storm problem that could occur in the medium-access level. Existing protocols are either unreliable, or reliable but based on a too costly approach. Our protocol differs from existing protocols by adopting a low-cost broadcast, which does not guarantee reliability, as a basic operation. The reliability is ensured by additional acknowledgement and handshaking. Simulation results do justify the efficiency of the proposed protocol. 相似文献
17.
Zhenghua Fu Xiaoqiao Meng Songwu Lu 《Selected Areas in Communications, IEEE Journal on》2003,21(10):1615-1626
Transport protocol design for supporting multimedia streaming in mobile ad hoc networks is challenging because of unique issues, including mobility-induced disconnection, reconnection, and high out-of-order delivery ratios; channel errors and network congestion. In this paper, we describe the design and implementation of a transmission control protocol (TCP)-friendly transport protocol for ad hoc networks. Our key design novelty is to perform multimetric joint identification for packet and connection behaviors based on end-to-end measurements. Our NS-2 simulations show significant performance improvement over wired TCP friendly congestion control and TCP with explicit-link-failure-notification support in ad hoc networks. 相似文献
18.
Cooperative diversity is proposed to combat the detrimental effects of channel fading. In this paper, we investigate the effectiveness of cooperative diversity in interference limited ad hoc networks. The negative effects due to relay blocking on the network throughput are investigated. We show that the relay blocking problem is mainly dependent on the relay selection criterion. To overcome this problem, we propose a new cooperative diversity technique based on a modified IEEE 802.11 Medium Access Control (MAC) protocol. The throughput performance of the proposed MAC protocol is analyzed using a random structured network where nodes are assumed to be equipped with multiple antennas. In our simulations, we consider both single‐ and multiple‐relay scenarios over fading channels. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
19.
With the increasing popularity of multimedia, there is a growing tendency in mobile ad hoc networks (MANETs) to establish stable routes with long route lifetimes, low control overhead and high packet delivery ratios. According to recent analytical result, the lifetime of a route, which can reflect the route stability, depends on the length of the route and the lifetime of each link in the route. This paper presents a Greedy-based Backup Routing (GBR) protocol that considers both route length and link lifetime to achieve high route stability. In GBR, the primary path is constructed primarily based on a greedy forwarding mechanism, whereas the local-backup path for each link is established according to the link lifetime. Both analytical and simulation results demonstrate that GBR has excellent performance in terms of route lifetime, packet delivery ratio, and control overhead. 相似文献
20.
ATCP: TCP for mobile ad hoc networks 总被引:23,自引:0,他引:23
Transport connections set up in wireless ad hoc networks are plagued by problems such as high bit error rates, frequent route changes, and partitions. If we run the transmission control protocol (TCP) over such connections, the throughput of the connection is observed to be extremely poor because TCP treats lost or delayed acknowledgments as congestion. We present an approach where we implement a thin layer between Internet protocol and standard TCP that corrects these problems and maintains high end-to-end TCP throughput. We have implemented our protocol in FreeBSD, and we present results from extensive experimentation done in an ad hoc network. We show that our solution improves the TCP's throughput by a factor of 2-3 相似文献