共查询到20条相似文献,搜索用时 21 毫秒
1.
Joo-Han Song Wong V.W.S. Leung V.C.M. 《Selected Areas in Communications, IEEE Journal on》2004,22(7):1374-1383
In this paper, we consider a mobile ad hoc wireless access network in which mobile nodes can access the Internet via one or more stationary gateway nodes. Mobile nodes outside the transmission range of the gateway can continue to communicate with the gateway via their neighboring nodes over multihop paths. On-demand routing schemes are appealing because of their low routing overhead in bandwidth restricted mobile ad hoc networks, however, their routing control overhead increases exponentially with node density in a given geographic area. To control the overhead of on-demand routing without sacrificing performance, we present a novel extension of the ad hoc on-demand distance vector (AODV) routing protocol, called LB-AODV, which incorporates the concept of load-balancing (LB). Simulation results show that as traffic increases, our proposed LB-AODV routing protocol has a significantly higher packet delivery fraction, a lower end-to-end delay and a reduced routing overhead when compared with both AODV and gossip-based routing protocols. 相似文献
2.
Network architecture based on opportunistic Delay Tolerant Network (DTN) is best applicable for post-disaster scenarios, where the controlling point of relief work is any fixed point like a local school building or a hospital, whose location is known to everyone. In this work, 4-tier network architecture for post-disaster relief and situation analysis is proposed. The disaster struck area has been divided into clusters known as Shelter Points (SP). The architecture consists of mobile Relief Workers (RW) at tier 1, Throw boxes (TB) at tier 2 placed at fixed locations within SPs. Data Mules (DM) like vehicles, boats, etc. operate at tier 3 that provide inter-SP connectivity. Master Control Station (MCS) is placed at tier 4. The RWs are provided with smart-phones that act as mobile nodes. The mobile nodes collect information from the disaster incident area and send that information to the TB of its SP, using DTN as the communication technology. The messages are then forwarded to the MCS via the DMs. Based on this architecture, a novel DTN routing protocol is proposed. The routing strategy works by tracking recent direction of movement of mobile nodes by measuring their consecutive distances from the destination at two different instants. If any node moves away from the destination, then it is very unlikely to carry its messages towards the destination. For a node, the fittest node among all its neighbours is selected as the next hop. The fittest node is selected using parameters like past history of successful delivery and delivery latency, current direction of movement and node’s recent proximity to the destination. Issues related to routing such as fitness of a node for message delivery, buffer management, packet drop and node energy have been considered. The routing protocol has been implemented in the Opportunistic Networks Environment (ONE) simulator with customized mobility models. It is compared with existing standard DTN routing protocols for efficiency. It is found to reduce message delivery latency and improve message delivery ratio by incurring a small overhead . 相似文献
3.
Haojun Huang Guangmin Hu Fucai Yu 《International Journal of Communication Systems》2013,26(1):100-113
Energy efficiency has become an important design consideration in geographic routing protocols for wireless sensor networks because the sensor nodes are energy constrained and battery recharging is usually not feasible. However, numerous existing energy‐aware geographic routing protocols are energy‐inefficient when the detouring mode is involved in the routing. Furthermore, most of them rarely or at most implicitly take into account the energy efficiency in the advance. In this paper, we present a novel energy‐aware geographic routing (EAGR) protocol that attempts to minimize the energy consumption for end‐to‐end data delivery. EAGR adaptively uses an existing geographic routing protocol to find an anchor list based on the projection distance of nodes for guiding packet forwarding. Each node holding the message utilizes geographic information, the characteristics of energy consumption, and the metric of advanced energy cost to make forwarding decisions, and dynamically adjusts its transmission power to just reach the selected node. Simulation results demonstrate that our scheme exhibits higher energy efficiency, smaller end‐to‐end delay, and better packet delivery ratio compared to other geographic routing protocols. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
4.
This paper compares ad hoc on‐demand distance vector (AODV), dynamic source routing (DSR) and wireless routing protocol (WRP) for MANETs to distance vector protocol to better understand the major characteristics of the three routing protocols, using a parallel discrete event‐driven simulator, GloMoSim. MANET (mobile ad hoc network) is a multi‐hop wireless network without a fixed infrastructure. Following are some of our key findings: (1) AODV is most sensitive to changes in traffic load in the messaging overhead for routing. The number of control packets generated by AODV became 36 times larger when the traffic load was increased. For distance vector, WRP and DSR, their increase was approximately 1.3 times, 1.1 times and 7.6 times, respectively. (2) Two advantages common in the three MANET routing protocols compared to classical distance vector protocol were identified to be scalability for node mobility in end‐to‐end delay and scalability for node density in messaging overhead. (3) WRP resulted in the shortest delay and highest packet delivery rate, implying that WRP will be the best for real‐time applications in the four protocols compared. WRP demonstrated the best traffic scalability; control overhead will not increase much when traffic load increases. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
5.
Jipeng Zhou Liangwen Liu Guofang Liao Jianzhu Lu 《Wireless Personal Communications》2013,71(4):3115-3130
Using location information to help routing is often proposed as a means to achieve scalability in large mobile ad hoc networks (MANETs). One of the biggest challenge in geographic routing protocols is the design of efficient distributed location services that can locate the positions of mobile nodes. The accurate positioning of mobile nodes in MANETs is important to location service scheme since they are related to efficiency of routing protocols. We propose a grid-based predictive Location Service (GPLS) scheme and a hole-tolerant grid-based predictive Location Service (GPLS-H) scheme. In proposed location service scheme GPLS and GPLS-H, the network is partitioned into grids and grids are divided into groups by using a HASH function, which guarantees the uniform distribution of location servers of a node in the network. The main contribution of this paper is that the proposed location service scheme GPLS and GPLS-H provide accurate location query capability by means of location prediction of mobile nodes and GPLS-H can tolerate the “holes” in grid networks. The simulation results show that the location service scheme GPLS and GPLS-H have better performance than CRLS and SLURP in query success ratio, query delay and location availability. 相似文献
6.
Y. Mallikarjuna Rao M. V. Subramanyam K. Satya Prasad 《International Journal of Communication Systems》2018,31(11)
Wireless mesh networks (WMNs) have been the recent advancements and attracting more academicians and industrialists for their seamless connectivity to the internet. Radio resource is one among the prime resources in wireless networks, which is expected to use in an efficient way especially when the mobile nodes are on move. However, providing guaranteed quality of service to the mobile nodes in the network is a challenging issue. To accomplish this, we propose 2 clustering algorithms, namely, static clustering algorithm for WMNs and dynamic clustering algorithm for WMNs. In these algorithms, we propose a new weight‐based cluster head and cluster member selection process for the formation of clusters. The weight of the nodes in WMN is computed considering the parameters include the bandwidth of the node, the degree of node connectivity, and node cooperation factor. Further, we also propose enhanced quality of service enabled routing protocol for WMNs considering the delay, bandwidth, hopcount, and expected transmission count are the routing metrics. The performance of the proposed clustering algorithms and routing protocol are analyzed, and results show high throughput, high packet delivery ratio, and low communication cost compared with the existing baseline mobility management algorithms and routing protocols. 相似文献
7.
Lei Shi Baoxian Zhang Hussein T. Mouftah Jian Ma 《International Journal of Communication Systems》2013,26(10):1341-1355
Introduction of mobile sinks into a wireless sensor network can largely improve the network performance. However, sink mobility can cause unexpected changes of network topology, which may bring excessive protocol overhead for route maintenance and may offset the benefit from using mobile sinks. In this paper, we propose an efficient data‐driven routing protocol (DDRP) to address this problem. The design objective is to effectively reduce the protocol overhead for data gathering in wireless sensor networks with mobile sinks. DDRP exploits the broadcast feature of wireless medium for route learning. Specifically, each data packet carries an additional option recording the known distance from the sender of the packet to target mobile sink. The overhearing of transmission of such a data packet will gratuitously provide each listener a route to a mobile sink. Continuous such route‐learning among nodes will provide fresh route information to more and more nodes in the network. When no route to mobile sink is known, random walk routing simply is adopted for data packet forwarding. Simulation results show that DDRP can achieve much lower protocol overhead and longer network lifetime as compared with existing work while preserving high packet delivery ratio. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
8.
The growing popularity of multimedia applications and services needs to support several quality of service metrics such as high throughput, low energy, and jitter, which is a challenging task in mobile ad hoc networks. Because of limited bandwidth, energy constraints, dynamic topology, transmission errors, and fluctuating link stability, the links between adjacent nodes are often not reliable and may break because of node mobility. Link breakage initiates the process of rerouting either at the sender node (the node at which the link breaks) or at the source node. In either case, it leads to packet loss, delivery delays, and increased control overheads. Hence, to attain a minimum quality of service, routing protocols must address the dynamic network topology. Uncertain and varying movement of nodes necessitates stability of the links between such nodes. The objective of this paper is to propose 2 protocols, the first based on link stability and the other based on route stability. Link stability identifies a stable link from the available links to the next hop and determines a stable end‐to‐end route. The probability of successful transmission of periodic packets is used as a link stability metric to assess the stable path. Acknowledgment ‐free packets are used to check connectivity in the network. Increased probability of successful transmission implies that the selected link is sustained for longer duration and can deliver packets more reliably or, as a consequence, results in a stable link to deliver a better data rate. With a stable link, there is a reduced possibility of retransmissions, reduced end‐to‐end delay, reduced control overheads, and enhanced data delivery ratio. Selection of the most stable route for data transmission improves the performance. Experimental results from simulations performed on EXata/Cyber v2.0 simulator reveal that our proposed protocols are an improvement over the existing protocols in terms of packet delivery ratio, average end‐to‐end delay, and average route lifetime, even without route optimization with the minor increase in control packets. A case study of the application of proposed protocols is also presented. 相似文献
9.
Improving protocol robustness in ad hoc networks through cooperative packet caching and shortest multipath routing 总被引:1,自引:0,他引:1
A mobile ad hoc network is an autonomous system of infrastructure-less, multihop, wireless mobile nodes. Reactive routing protocols perform well in this environment due to their ability to cope quickly against topological changes. This paper proposes a new routing protocol named CHAMP (caching and multiple path) routing protocol. CHAMP uses cooperative packet caching and shortest multipath routing to reduce packet loss due to frequent route failures. We show through extensive simulation results that these two techniques yield significant improvement in terms of packet delivery, end-to-end delay and routing overhead. We also show that existing protocol optimizations employed to reduce packet loss due to frequent route failures, namely local repair in AODV and packet salvaging in DSR, are not effective at high mobility rates and high network traffic. 相似文献
10.
Huachun Zhou Hongke Zhang Yajuan Qin Hwang-Cheng Wang Han-Chieh Chao 《Mobile Networks and Applications》2010,15(4):530-542
This paper specifies a global mobility management architecture and protocol procedure called GPMIP, which is based on Proxy Mobile IPv6. In GPMIP, mobility management is performed by the network entity rather than individual mobile nodes. The benefit is the elimination of the wireless link data delivery tunnel overhead between a mobile node and the access router. To compare with the well known Hierarchical Mobile IPv6 mobility management protocol, the location update, packet delivery, and total cost functions generated by a mobile node during its average domain residence time are formulated for each protocol based on fluid flow mobility model. Then, the impacts of various system parameters on the cost functions are analyzed. The analytical results indicate that the proposed global mobility management protocol can guarantee lower total costs. Furthermore, a qualitative comparison between GPMIP and some other global management protocols is also investigated. 相似文献
11.
Most existing designs of ad hoc networks are based on the assumption of non-adversarial environments, where each node in the network is cooperative and well-behaved. When misbehaving nodes exist in the network, the performance of current routing protocols degrades significantly. Since ad hoc networks, consisting of autonomous nodes, are open and distributed in nature, maintaining a fault-free network environment is extremely difficult and expensive. In this paper, we propose a new routing service named best-effort fault-tolerant routing (BFTR). The design goal of BFTR is to provide packet routing service with high delivery ratio and low overhead in presence of misbehaving nodes. Instead of judging whether a path is good or bad, i.e., whether it contains any misbehaving node, BFTR evaluates the routing feasibility of a path by its end-to-end performance (e.g. packet delivery ratio and delay). By continuously observing the routing performance, BFTR dynamically routes packets via the most feasible path. BFTR provides an efficient and uniform solution for a broad range of node misbehaviors with very few security assumptions. The BFTR algorithm is evaluated through both analysis and extensive simulations. The results show that BFTR greatly improves the ad hoc routing performance in the presence of misbehaving nodes. 相似文献
12.
针对传统的AODV路由协议采用扩展环路由搜索算法导致的路由开销较大,没有考虑节点能量的问题,提出一种新的算法。此算法在路由请求过程中能够根据以前搜索中得到的信息,让多余的节点处于静默状态,不参与下一次的路由发现。并且综合考虑节点能量,尽可能地让低能量节点处于静默状态,从而达到均衡节点能量使用的目的。仿真结果表明改进算法有效延长了网络生存时间,提高了包投递率。 相似文献
13.
Atta ur Rehman Khan Sajjad A. Madani Khizar Hayat Samee Ullah Khan 《International Journal of Communication Systems》2012,25(4):529-542
This paper presents two new routing protocols for mobile sensor networks, viz. power‐controlled routing (PCR) and its enhanced version, i.e. Enhanced Power‐Controlled Routing (EPCR). In both the protocols, fixed transmission power is employed in the clustering phase but when ordinary nodes are about to send their data to their respective cluster‐heads, they change their transmission power according to their distance from their cluster‐head. While in PCR, the nodes are associated with the cluster‐head on the basis of weight, in EPCR it is done on the basis of distance. In addition to the protocols, we are suggesting a packet loss recovery mechanism for the PCR and EPCR. Both protocols work well for both mobile and static networks and are designed to achieve high network lifetime, high packet delivery ratio, and high network throughput. These protocols are extensively simulated using mass mobility model, with different speeds and different number of nodes to evaluate their performance. Simulation results show that both PCR and EPCR are successful in achieving their objectives by using variable transmission powers and smart clustering. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
14.
Quanjun Chen Salil S. Kanhere Mahbub Hassan 《Wireless Communications and Mobile Computing》2013,13(15):1406-1421
In multihop wireless networks, delivering a packet to all nodes within a specified geographic distance from the source is a packet forwarding primitive (geography‐limited broadcasting), which has a wide range of applications including disaster recovery, environment monitoring, intelligent transportation, battlefield communications, and location‐based services. Geography‐limited broadcasting, however, relies on all nodes having continuous access to precise location information, which may not be always achievable. In this paper, we consider achieving geography‐limited broadcasting by means of the time‐to‐live (TTL) forwarding, which limits the propagation of a packet within a specified number of hops from the source. Because TTL operation does not require location information, it can be used universally under all conditions. Our analytical results, which are validated by simulations, confirm that TTL‐based forwarding can match the performance of the traditional location‐based geography‐limited broadcasting in terms of the area coverage as well as the broadcasting overhead. It is shown that the TTL‐based approach provides a practical trade‐off between geographic coverage and broadcast overhead. By not delivering the packet to a tiny fraction of the total node population, all of which are located near the boundary of the target area, TTL‐based approach reduces the broadcast overhead significantly. This coverage‐overhead trade‐off is useful if the significance of packet delivery reduces proportionally to the distance from the source. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
15.
Eric Astier Abdelhakim Hafid Sultan Aljahdali 《Wireless Communications and Mobile Computing》2012,12(9):822-836
Mesh‐based multicast routing protocols for mobile ad hoc networks (MANETs) build multiple paths from senders to receivers to deliver packets even in the presence of links breaking. This redundancy results in high reliability/robustness but may significantly increase packet overhead. This paper proposes a mesh‐based multicast protocol, called centered protocol for unified multicasting through announcements (CPUMA), that achieves comparable reliability as existing mesh‐based multicast protocols, however, with significantly much less data overhead. In CPUMA, a distributed core‐selection and maintenance algorithm is used to find the source‐centric center of a shared mesh. We leverage data packets to center the core of each multicast group shared mesh instead of using GPS or any pre‐assignment of cores to groups (the case of existing protocols). The proposed centering scheme allows reducing data packet overhead and creating forwarding paths toward the nearest mesh member instead of the core to reduce latency. We show, via simulations, that CPUMA outperforms existing multicast protocols in terms of data packet overhead, and latency while maintaining a constant or better packet delivery ratio, at the cost of a small increase in control overhead in a few scenarios. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
16.
17.
Jie Hao Zheng Yao Kui Huang Baoxian Zhang Cheng Li 《Wireless Communications and Mobile Computing》2016,16(5):538-549
Routing in a low duty‐cycled wireless sensor network (WSN) has attracted much attention recently because of the challenge that low duty‐cycled sleep scheduling brings to the design of efficient distributed routing protocols for such networks. In a low duty‐cycled WSN, a big problem is how to design an efficient distributed routing protocol, which uses only local network state information while achieving low end‐to‐end (E2E) packet delivery delay and also high packet delivery efficiency. In this paper, we study low duty‐cycled WSNs wherein sensor nodes adopt pseudorandom sleep scheduling for energy saving. The objective of this paper is to design an efficient distributed routing protocol with low overhead. For this purpose, we design a simple but efficient hop‐by‐hop routing protocol, which integrates the ideas of multipath routing and gradient‐based routing for improved routing performance. We conduct extensive simulations, and the results demonstrate the high performance of the proposed protocol in terms of E2E packet delivery latency and packet delivery efficiency as compared with existing protocols. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
18.
Teck Meng Lim Chai Kiat Yeo Lee F. Quang Vinh Le 《Mobile Computing, IEEE Transactions on》2009,8(6):849-863
Mobile IP enables IP mobility support for mobile node (MN), but it suffers from triangular routing, packet redirecting, increase in IP header size, and the need for new infrastructure support. This paper details an alternative to enable terminal mobility support for MN. This scheme does not suffer from triangular routing effect and does not require dedicated infrastructure support such as home agent. It also does not increase the size of the IP header and does not require redirection of packets. These benefits are enabled with a tradeoff, which requires modifications on MN and its correspondent node. It uses an innovative IP-to-IP address mapping method to provide IP address transparency for applications and taps on the pervasiveness of SIP as a location service. From our analysis, we show that TMSP is much more efficient than mobile IP in terms of the number of hops as well as overhead. Our prototype implementation also shows that TMSP provides seamless communication for both TCP and UDP connections and the computational overhead for TMSP has minimal impact on packet transmission. 相似文献
19.
In recent research, link stability is getting tremendous attention in mobile adhoc networks (MANETs), because of several impediments that occur in a reliable and robust network. Link stability metric is used to improve network performance in terms of end-to-end delay, data success delivery ratio (DSDR) and available route time (ART). Energy consumption, bandwidth and communication delay of major concern in ad hoc networks. A high mobility of MANET nodes reduces the reliability of network communication. In a dynamic networks, high mobility of the nodes makes it very difficult to predict the dynamic routing topology and hence cause route/link failures. Multicast in MANETs is an emerging trend that effectively improves the performance while lowering the energy consumption and bandwidth usage. Multicast routing protocol transmits a packet to multicast a group at a given time instant to achieve a better utilization of resources. In this paper, node mobility is considered to map better their movement in the network. So, the links with long active duration time can be identified as a stable link for route construction. Variation in signal strength is used to identify whether the direction of the node is towards or away from estimating node. We consider signal strength as QoS metric to calculate link stability for route construction. Efforts are made to identify the link with highly probable longer lifetime as the best suitable link between two consecutive nodes. We predict the movement time of nodes that define the route path to the node destination. Exata/cyber simulator is used for network simulation. The simulation results of the proposed routing protocol are compared with on-demand multicast routing protocol and E-ODMRP, which works on minimum hop count path. Analysis of our simulation results has shown improvement of various routing performance metrics such as DSDR, ART, routing overhead and packet drop ratio. 相似文献
20.
Liang Dong 《Wireless Networks》2012,18(8):949-965
In delay-tolerant mobile ad hoc networks, motion of network nodes, network sparsity and sporadic density can cause a lack of guaranteed connectivity. These networks experience significant link delay and their routing protocols must take a store-and-forward approach. In this paper, an opportunistic routing protocol is proposed, along with its compatible media access control, for non-real-time services in delay-tolerant networks. The scheme is mobility-aware such that each network node needs to know its own position and velocity. The media access control employs a four-fold handshake procedure to probe the wireless channel and cooperatively prioritize candidate nodes for packet replication. It exploits the broadcast characteristic of the wireless medium to utilize long-range but unreliable links. The routing process seizes opportunities of node contacts for data delivery. It takes a multiple-copy approach that is adaptive with node movements. Numerical results in mobile ad hoc networks and vehicular ad hoc networks show superior performance of the proposed protocol compared with other routing protocols. The mobility-aware media access control and routing scheme exhibits relatively small packet delivery delay and requires a modest amount of total packet replications/transmissions. 相似文献