Mobile Ad Hoc Networks (MANETs) have created ample interest in recent times owing to their various advantages compared to the networks that require basic infrastructure for them to work. This paper elaborates various ...
详细信息
Personal rapid transit (PRT) is getting attention as a new form of transportation. It is energy efficient and provides the high level of passenger service. In this study, the dynamic PRT dispatching and routing proble...
详细信息
With the purpose of refining cluster head election and node single-hop in LEACH protocol under the environment of wireless sensor network energy heterogeneous, we propose a new routing algorithm named LEACH-3M. This a...
详细信息
We introduce a new cost model to analyze end-to-end online routing algorithms in dynamic wavelength routed mesh networks. This model leads to the design of simple and efficient routing algorithms with congestion aware...
详细信息
ISBN:
(纸本)9781557528841
We introduce a new cost model to analyze end-to-end online routing algorithms in dynamic wavelength routed mesh networks. This model leads to the design of simple and efficient routing algorithms with congestion awareness. (C) 2010 Optical Society of America
Cluster-based protocol is a kind of important routing in wireless sensor networks. However, due to the uneven distribution of cluster heads in classical clustering algorithm, some nodes may run out of energy too early...
详细信息
Cluster-based protocol is a kind of important routing in wireless sensor networks. However, due to the uneven distribution of cluster heads in classical clustering algorithm, some nodes may run out of energy too early, which is not suitable for large-scale wireless sensor networks. In this paper, a distributed clustering algorithm based on fuzzy weighted attributes is put forward to ensure both energy efficiency and extensibility. On the premise of a comprehensive consideration of all attributes, the corresponding weight of each parameter is assigned by using the direct method of fuzzy engineering theory. Then, each node works out property value. These property values will be mapped to the time axis and be triggered by a timer to broadcast cluster headers. At the same time, the radio coverage method is adopted, in order to avoid collisions and to ensure the symmetrical distribution of cluster heads. The aggregated data are forwarded to the sink node in the form of multihop. The simulation results demonstrate that clustering algorithm based on fuzzy weighted attributes has a longer life expectancy and better extensibility than LEACH-like algorithms.
The traditional single-hop LEACH protocols have too high mortality of nodes that are far from the sink nodes. And improved multi-hop LEACH protocols lead nodes that near the sink node are easy to failure because of fo...
详细信息
In order to reduce the communication overhead among sensor nodes, a routing algorithm is proposed based on zoning management nodes. The algorithm defines the calculation method of the network partition radius after no...
详细信息
We introduce three adaptive routing algorithms for the hierarchical interconnection network TESH (tori-connected meshes) and evaluate their hardware costs and delays. TESH, which consists of a hierarchical torus inter...
详细信息
ISBN:
(纸本)9781424483891
We introduce three adaptive routing algorithms for the hierarchical interconnection network TESH (tori-connected meshes) and evaluate their hardware costs and delays. TESH, which consists of a hierarchical torus interconnection between meshes as a basic module, is one of the k-ary n-cube networks, for which many adaptive routing algorithms have already been proposed. Adaptive routings for TESH have also been proposed in previous work.
The paper proposed a novel methods in order to solve the congestion and routing oscillation, which based on crossover and mutation of the ant colony algorithm to achieve dynamic QoS routing realization. The algorithm ...
详细信息
ISBN:
(纸本)9780878492510
The paper proposed a novel methods in order to solve the congestion and routing oscillation, which based on crossover and mutation of the ant colony algorithm to achieve dynamic QoS routing realization. The algorithm expanded the scope of the search path selection adaptively adjust the strategy and the amount of information to determine the probability of renewal strategy, which can better adapt to dynamic network environment, you can make the shortest possible path of choice to meet the real-time applications, while avoiding link load is heavy, maintaining the distribution of network load balance. The simulation results show that the routing algorithm has better convergence speed and stability, which can more effectively address congestion and routing oscillation, its performance compared with traditional methods have been noticeably elevated, indicating it has a better multimedia network environment flexibility.
Cooperative diversity has emerged as a promising approach to improving reception reliability by realizing spatial diversity gains for nodes with single antenna. We consider here cooperative ad-hoc wireless networks wh...
详细信息
ISBN:
(纸本)9780984589333
Cooperative diversity has emerged as a promising approach to improving reception reliability by realizing spatial diversity gains for nodes with single antenna. We consider here cooperative ad-hoc wireless networks where communications between two nodes can be assisted by a single relay using two time slots. This paper continues our investigation of PHY techniques and cross-layer routing algorithms in such networks. Specifically, we investigate here the optimal relay location for cooperative link in networks with infinite node density. By using this result, we analyze the error performance bound for routing algorithms in infinitely dense networks. Furthermore, we study the performance bounds for regularly dense networks with linear topology. Theoretical analysis shows that the proposed routing algorithm performs close to the optimal error performance.
暂无评论