The stability and reliability of routing protocols in existence can note be well adapted to mobile ad hoc network, which is always shorted for MANET In this paper, a novel routing algorithm is proposed and evaluated t...
详细信息
ISBN:
(纸本)9780769536057
The stability and reliability of routing protocols in existence can note be well adapted to mobile ad hoc network, which is always shorted for MANET In this paper, a novel routing algorithm is proposed and evaluated to reduce the overhead as well as to enhance the network stability for MANET The thought of design came into being based on the way of ants foraging and work dividing. By making a selective global correction on pheromone intensity, we gain a more efficient routing selection mechanism. The results show that, as compared with AODV routing protocol, routing algorithm with selective global correction (ACRA-SGC) presented in this paper can not only reduce the end-to-end delay, but also. enhance the stability and raise the efficiency of communication, by exerting the function of each node in MANET
In this paper, I propose an online wireless network routing algorithm for energy efficiency and network reliability. Based on the cooperative game model, my proposed algorithm can provide adaptable routing strategy to...
详细信息
ISBN:
(纸本)9781424445264
In this paper, I propose an online wireless network routing algorithm for energy efficiency and network reliability. Based on the cooperative game model, my proposed algorithm can provide adaptable routing strategy to enhance the network performance.
The 800 megabit H1PP1 data channel has been defined by ANSI X3T9.3 for the purpose of connecting supercomputers, large scale peripheral systems, high performance workstations, and network layer routers. In addition to...
详细信息
A new routing algorithm is proposed for FPGA to improve the increasing transformation cost of pseudo-Boolean Satisfiability algorithm in the routing process, which combined advantages of pseudo-Boolean Satisfiability ...
详细信息
ISBN:
(纸本)9783037853849
A new routing algorithm is proposed for FPGA to improve the increasing transformation cost of pseudo-Boolean Satisfiability algorithm in the routing process, which combined advantages of pseudo-Boolean Satisfiability and geometric routing algorithm. In the routing process, one of geometric routing algorithm-VPR5.0 was chosen firstly for FPGA routing. If not successful, then use pseudo-Boolean Satisfiability algorithm. Technique of static symmetry-breaking is also adding to carry out pretreatment of pseudo-Boolean constraints, detecting and breaking the symmetries in the routing flow. The purpose was to prune search path, and the cost was consequently reduced. Preliminary experiments results show that the hybrid approach can reduce the runtime observably, speed up the solving process, and have no adverse affect on overall program.
This paper presents a simple routing protocol based on topology control that improves the lifetime of a Wireless Sensor Network in the usual convergecast pattern, by allowing the nodes to choose between two predefined...
详细信息
ISBN:
(纸本)9780769531090
This paper presents a simple routing protocol based on topology control that improves the lifetime of a Wireless Sensor Network in the usual convergecast pattern, by allowing the nodes to choose between two predefined power-levels to forward data towards the sink The proposed protocol takes advantage of non-homogeneous topologies, where the nodes are grouped in clouds. Nodes will only use the highest power to establish a link when necessary, like for bridging the distance between two clouds. Within the clouds, only low-power links are used. The underlying distributed algorithm is shown to converge and finds, for each node of the network an efficient path to the sink provided the network is potentially connected at the higher of the two available transmission powers. We also propose a simple routing information refreshing technique that adds robustness to the proposed algorithm.
One of the promising applications of wireless sensor networks (WSNs) is monitoring of the human body for health concerns. For this purpose, a large number of small sensors are implanted in the human body. These sensor...
详细信息
ISBN:
(纸本)9781479935802
One of the promising applications of wireless sensor networks (WSNs) is monitoring of the human body for health concerns. For this purpose, a large number of small sensors are implanted in the human body. These sensors altogether provide a network of wireless sensors (WBANs) and monitor the vital signs and signals of the human body;these sensors will then send this information to the doctor. The most important application of the WBAN is the implementation of the monitoring network for patient safety in the hospital environment. In this case, supporting patients' mobility is one of the basic needs, which has been underestimated in recent studies. The problem that involves providing the required energy for the units used in this type of network is challenging;for this reason, sent/ received units with very low power consumption and with a very small radius are used in order to save energy. The resulting small sending range, leads to the lack of support for patients' mobility. In this paper, the AD HOC mode is suggested for use to establish a network and a multi-path routing algorithm, for the purpose of importing patients' mobility in hospital setting. The results of the simulation show that in addition to supporting patients' mobility, the use of the proposed idea instead of previously presented protocols, reduces delays in data transmission and energy consumption;and it also increases the delivery rate depending on the destination and the lifetime of the network, while on the other hand, it increases routing overhead.
In this paper we have presented a new fault-tolerant Irregular Modified Alpha Multi-stage Interconnection Network (MALN-2). MALN-2 is a double switch fault-tolerant interconnection network with more alternate paths wi...
详细信息
ISBN:
(纸本)9783642321115
In this paper we have presented a new fault-tolerant Irregular Modified Alpha Multi-stage Interconnection Network (MALN-2). MALN-2 is a double switch fault-tolerant interconnection network with more alternate paths with full accessibility. It is better than existing Modified Alpha Network. The paper also presents the fault-tolerant routing Algorithm for the proposed irregular Interconnection Network.
The scale of network and bandwidth of link have been limited by current routing technologies in hybrid wireless Ad-hoc networks, so we present a new routing algorithm. In the routing algorithm, the routing information...
详细信息
ISBN:
(纸本)9781424446605
The scale of network and bandwidth of link have been limited by current routing technologies in hybrid wireless Ad-hoc networks, so we present a new routing algorithm. In the routing algorithm, the routing information is treated as a resource, and it can be stored and searched in a distributed way with Chord. The routing of data packet prefers to forward by infrastructure. In comparison with OLSR, the algorithm can not only improve the network throughput by average 25%, but also save the delay of End-to-End by average 30%. And with the increasing of network scale, the benefit will be more significant.
routing in communication networks involves the indirection from a persistent name (or ID) to a locator and delivering packets based upon the, locator. In a large-scale, highly dynamic network, the ID-to-locator mappin...
详细信息
ISBN:
(纸本)9781595936813
routing in communication networks involves the indirection from a persistent name (or ID) to a locator and delivering packets based upon the, locator. In a large-scale, highly dynamic network, the ID-to-locator mappings are both large in number, and change often. Traditional routing protocols require high overhead to keep these indirections up-to-date. In this paper, we propose Weak State routing (WSR), a routing mechanism for large-scale highly dynamic networks. WSR's novelty is that it uses random directional walks biased occasionally by weak indirection state information in intermediate nodes. The indirection state information is weak, i.e. interpreted not as absolute truth, but as probabilistic hints. Nodes only have partial information about the region a destination node is likely to be. This method allows us to aggregate information about a number of remote locations in a geographic region. In other words, the state information maps a set-of-IDs to a geographical region. The intermediate nodes receiving the random walk use a method similar to longest-prefix-match in order to prioritize their mappings to decide how to bias and forward the random walk. WSR can also be viewed as an unstructured distributed hashing technique. WSR displays good rare-object recall with scalability properties similar to structured DHTs, albeit with more tolerance to dynamism and without constraining the degree distribution of the underlying network. Through simulations, we show that WSR offers a high packet delivery ratio, more than 98%. The control packet overhead incurred in the network scales as O(N) for N-node networks. The number of mappings stored in the network appears to scale as Theta(N-3/2). We compare WSR with Dynamic Source routing (DSR) and geographic forwarding (GPSR) combined with Grid Location Service (GLS). Our results indicate that WSR delivers more packets with less overhead at the cost of increased path length.
In today's service provider networks MPLS Traffic Engineering (MPLS TE) is one of the fastest growing implementation. MPLS adoption in service provider networks has increased manifold due to its inherent TE capabi...
详细信息
ISBN:
(纸本)9789537044107
In today's service provider networks MPLS Traffic Engineering (MPLS TE) is one of the fastest growing implementation. MPLS adoption in service provider networks has increased manifold due to its inherent TE capabilities. A purpose of traffic engineering in a network is to setting up paths between the edge nodes of the network to meet traffic demands while optimizing network performance. It is known that total traffic throughput in a network, or resource utilization, can be maximized if a traffic demand is split over multiple paths. MPLS networks can use native TE mechanisms to minimize network congestion and improve network performance. MPLS TE also relay on class of routing algorithms called online routing algorithms to avoid occurrence of congestion and to optimize network resource utilization, but primary objective is to try to minimize the probability of blocking future requests for creation of the new LSP's on the network.
暂无评论