scholarly journals MULTICAST STATE DISTRIBUTION BY JOINS USING MULTIPLE SHORTEST PATHS

2005 ◽  
Vol 06 (02) ◽  
pp. 115-129
Author(s):  
DAMIEN MAGONI ◽  
PASCAL LORENZ
Keyword(s):  
Routing Protocol ◽  
Shortest Paths ◽  
Multicast Tree ◽  
Tree Size ◽  
Crucial Issue ◽  
State Distribution ◽  
State Information ◽  
Multicast Protocols ◽  
Unicast Routing ◽  
Simulation Results

The lack of resources in routers will become a crucial issue with the deployment of state storing protocols. In particular, single or any source multicast protocols will most probably take over large amounts of resources for maintaining multicast tree information. The aim of this paper is to study the possibility and benefit of using multiple shortest paths in order for a new member to reach a multicast tree. Such a mechanism would not reduce the overall amount of state information in the network but it would distribute this amount more evenly among all routers. The idea is to use alternate shortest paths provided by the underlying unicast routing protocol to avoid saturated routers, that is, routers that can not or do not want to store any more multicast state information. As the simulation results are very sensitive to the topology, we have used subgraphs of an Internet map. We have then simulated our multipath join mechanism and have found that depending on the tree size, the use of our mechanism can increase successful join attempts by up to 55% when the network is half saturated.

Research and Improvement about LEACH Routing Protocol for Wireless Sensor Networks

2012 ◽  
Vol 241-244 ◽  
pp. 1028-1032
Author(s):  
Li Wang ◽  
Qi Lin Zhu
Keyword(s):  
Routing Protocol ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Selection Algorithm ◽  
Energy Factor ◽  
Random Cluster ◽  
Simulation Results ◽  
Node Energy

In recent years, as the development of wireless sensor network, people do some deep researches on cluster-based protocol, most around the prolongation of the lifetime of WSN and decline of energy consumed by the sensors. This paper analyses of classical clustering routing protocol based on LEACH, aiming at the node energy foot presents energy improved clustering routing algorithm, the random cluster head selection algorithm of threshold to be changed, lowering the threshold, in the original threshold increases the node's remaining energy factor, reduces the communication load of cluster nodes, and simulation. The simulation results show that the LEACH-E improved algorithm, energy saving, reducing balance node energy consumption, effectively prolongs the network lifetime.

A Small World Routing Protocol in Wireless Sensor Networks

2011 ◽  
Vol 474-476 ◽  
pp. 828-833
Author(s):  
Wen Jun Xu ◽  
Li Juan Sun ◽  
Jian Guo ◽  
Ru Chuan Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transmission ◽  
Small World ◽  
Wireless Sensor ◽  
Small World Network ◽  
Average Delay ◽  
Network Diameter ◽  
Simulation Results

In order to reduce the average path length of the wireless sensor networks (WSNs) and save the energy, in this paper, the concept of the small world is introduced into the routing designs of WSNs. So a new small world routing protocol (SWRP) is proposed. By adding a few short cut links, which are confined to a fraction of the network diameter, we construct a small world network. Then the protocol finds paths through recurrent propagations of weak and strong links. The simulation results indicate that SWRP reduces the energy consumption effectively and the average delay of the data transmission, which leads to prolong the lifetime of both the nodes and the network.

scholarly journals Evaluation of AODV and DYMO Routing Protocol using Generic, Micaz and Micamotes Energy Conservation Models in AWSN with Static and Mobile Scenario

2019 ◽  
Vol 20 (4) ◽  
pp. 653-662 ◽  
Author(s):  
Suresh Kumar ◽  
Kiran Dhull ◽  
Deepak Sharma ◽  
Payal Arora ◽  
Sandeep Dahiya
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Conservation ◽  
Routing Protocol ◽  
Energy Model ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
End To End Delay ◽  
Adhoc Networks ◽  
Simulation Results ◽  
Aodv Routing Protocol

Adhoc Wireless Sensor Networks (AWSN’s) have found an increasing utility in various applications. In AWSN, sensor nodes are arranged in a topology which is suitable to the requirement of the nature of task. As the sensors are not connected in a fixed manner, their networking, location and functioning keeps on changing based on the situation due to which these are called Adhoc networks. The biggest challenge is to keep the sensors working for longer life by conserving their energy. Therefore, a suitable routing protocol needs to be selected to meet the energy conservation requirement at different nodes. In the present paper, we have evaluated the three energy conservation models i.e. Generic, Micaz and Micamotes for AODV and DYMO routing protocol. The evaluation is carried out using the parameter metrices: (i) Average End-to-End Delay (AEED), (ii) Throughput (iii) Energy consumed in Transmit mode and Receive mode. Based on the simulation results, it has been observed that Micamotes energy model using AODV routing protocol performs better in terms of energy consumption upto 42.99% and 29.90 % in transmit and upto 59.24% and 33.96 % in receive mode respectively as compared to Generic and Micaz energy model.

Research on Route Protocol and Architecture for WSN Based on IPv6

2012 ◽  
Vol 616-618 ◽  
pp. 2233-2238 ◽  
Author(s):  
Rui Ting Lu ◽  
Xiang Zhen Li ◽  
Jia Hui Wang ◽  
Feng Jie Sun
Keyword(s):  
Load Balancing ◽  
Routing Protocol ◽  
Network Performance ◽  
Experimental Result ◽  
Routing Overhead ◽  
On Demand ◽  
End To End Delay ◽  
Simulation Results ◽  
Demand Routing ◽  
Route Protocol

WSN based on IPv6 is a new network integrated IPv6 and WSN. The related technologies of WSN based on IPv6 was researched, and an architecture of WSN based on IPv6 was proposed according to 6LoWPAN protocol in this article. Efficient and stable route protocol is a main focus to ensure network performance. Refer to on-demand routing protocol DSR, a Load-Balancing route protocol for WSN based on IPv6 was designed. An implementation of this protocol was programmed in NS2, and its simulation results were analyzed. The experimental result shows that this protocol could effectively reduce end-to-end delay and routing overhead, improving the network performance.

scholarly journals R-bUCRP: A Novel Reputation-Based Uneven Clustering Routing Protocol for Cognitive Wireless Sensor Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-9
Author(s):  
Mingchuan Zhang ◽  
Ruijuan Zheng ◽  
Ying Li ◽  
Qingtao Wu ◽  
Liang Song
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Selfish Nodes ◽  
Simulation Results ◽  
Establishment Phase ◽  
Optimal Cluster

Energy of nodes is an important factor that affects the performance of Wireless Sensor Networks (WSNs), especially in the case of existing selfish nodes, which attracted many researchers’ attention recently. In this paper, we present a reputation-based uneven clustering routing protocol (R-bUCRP) considering both energy saving and reputation assessment. In the cluster establishment phase, we adopt an uneven clustering mechanism which controls the competitive scope of cluster head candidates to save the energy of WSNs. In the cluster heads election phase, the residual energy and reputation value are used as the indexes to select the optimal cluster head, where the reputation mechanism is introduced to support reputation assessment. Simulation results show that the proposed R-bUCRP can save node energy consumption, balance network energy distribution, and prolong network lifetime.

Energy-Efficient Routing Protocol on Mobile Sink in Wireless Sensor Network

2013 ◽  
Vol 787 ◽  
pp. 1050-1055 ◽  
Author(s):  
Zhi Gui Lin ◽  
Hui Qi Zhang ◽  
Xu Yang Wang ◽  
Fang Qin Yao ◽  
Zhen Xing Chen
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Model Simulation ◽  
Cluster Head ◽  
Mobile Sink ◽  
High Energy ◽  
Residual Energy ◽  
Energy Efficient Routing ◽  
Simulation Results

To the disadvantages, such as high energy consumption and the energy consumption imbalance, we proposed an energy-efficient routing protocol on mobile sink (MSEERP) in this paper. In the MSEERP, the network is divided into several square virtual grids based on GAF, each grid is called a cluster, and the cluster head election method of GAF is improved. In addition, the MSEERP introduces a mobile sink in the network, the sink radios in limited number of hops and uses control moving strategy, namely the sink does not collect the information until it moves to a cluster with highest residual energy. We applied NS2 to evaluate its performance and analyze the simulation results by the energy model. Simulation results show that the MSEERP balances the energy consumption of the network, saves nodes energy and extends the network lifetime.

scholarly journals A new metric for routing in military wireless network

2014 ◽  
Vol 05 (02) ◽  
pp. 1450001
Author(s):  
Haibo Jiang ◽  
Yaofei Ma ◽  
Dongsheng Hong ◽  
Zhen Li
Keyword(s):  
Wireless Network ◽  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Transmission Delay ◽  
Wireless Ad Hoc Network ◽  
A Algorithm ◽  
Shortest Path Routing ◽  
Frequency Selection ◽  
Simulation Results

Wireless ad hoc network is generally employed in military and emergencies due to its flexibility and easy-to-use. It is suitable for military wireless network that has the characteristics of mobility and works effectively under severe environment and electromagnetic interfering conditions. However, military network cannot benefit from existing routing protocol directly; there exists quite many features which are only typical for military network. For example, there are several radios in the same vehicle. This paper presents a new metric for routing, which is employed in A* algorithm. The goal of the metric is to choose a route of less distance and less transmission delay between a source and a destination. Our metric is a function of the distance between the ends and the bandwidth over the link. Moreover, we take frequency selection into account since a node can work on multi-frequencies. This paper proposed the new metric, and experimented it based on A* algorithm. The simulation results show that this metric can find the optimal route which has less transmission delay compared to the shortest path routing.

Improved AODV Routing Protocol Based on SNR

2014 ◽  
Vol 610 ◽  
pp. 910-914
Author(s):  
Bin Wang ◽  
Hao Meng ◽  
Shen Yong Li
Keyword(s):  
Routing Protocol ◽  
Data Transmission ◽  
Transmission Rate ◽  
Transmission Efficiency ◽  
Network Delay ◽  
Paper Briefly ◽  
Low Snr ◽  
Data Throughput ◽  
Simulation Results ◽  
Aodv Routing Protocol

This paper briefly analyses the routing establishing process of AODV and points out its imperfection, proposes the AODV routing establishing principle based on SNR. The Network delay and data throughput of the improved AODV have all been improved as simulation results proves. Finally the conclusion was given, illustrating that the improvement avoids the bad influence to the transmission rate of the whole link, which brings by low SNR node, and increases the data transmission efficiency.

Research and Improvement of LEACH Routing Protocol

2015 ◽  
Vol 713-715 ◽  
pp. 2296-2299
Author(s):  
Xue Ming Zhai ◽  
Liang Yang ◽  
Lei Yang
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Load Balance ◽  
Network Routing ◽  
Base Station ◽  
Network Nodes ◽  
Cluster Heads ◽  
Load Imbalance ◽  
Ns2 Simulation ◽  
Simulation Results

LEACH is a classic wireless network routing protocol, the large energy consumption of LEACH cluster heads leads to the load imbalance of network nodes in order to shorten the life of network, the paper proposed an improved LEACH-M protocol to solve the problem, so that the shortest path between cluster heads and base station is formed, finally the NS2 simulation results show that the load balance of network is improved, and the lifetime of network is extended.

scholarly journals Hybrid Precoding Algorithm for Millimeter-Wave Massive MIMO Systems with Subconnection Structures

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Xue Zhang ◽  
Feng Zhao
Keyword(s):  
Channel State Information ◽  
Massive Mimo ◽  
Optimization Problem ◽  
Mimo Systems ◽  
High Energy ◽  
Channel State ◽  
State Information ◽  
Hybrid Precoding ◽  
Precoding Matrix ◽  
Simulation Results

In mmWave massive MIMO systems, traditional digital precoding is difficult to be implemented because of the high cost and energy consumption of RF chains. Fortunately, the hybrid precoding which combines digital precoding and analog precoding not only solves this problem successfully, but also improves the performance of the system effectively. However, due to the constant mode constraint introduced by the phase shifter in the analog domain, it is difficult to solve the hybrid precoding directly. There is a solution which divides the total optimization problem into two stages to solve, that is, first fix the digital precoding matrix, solve the analog precoding matrix, and then optimize the digital precoding matrix according to the obtained analog precoding matrix. In this paper, a high energy-efficient hybrid precoding scheme is proposed for the subconnection structure. In the first stage, the optimization problem can be decomposed into a series of subproblems by means of the independent submatrix structure of the analog precoding matrix. When the optimized analog precoding matrix is obtained, the digital precoding matrix can be solved by the minimum mean error (MMSE). Finally, the digital precoding matrix is normalized to satisfy the constraint conditions. The simulation results demonstrate that the performance of the proposed algorithm is close to that of fully digital precoding based on subconnection structure and better than that of the existing algorithms. In addition, this paper presents the simulation analysis of the algorithm performance under imperfect channel state information. Simulation results show that when the estimation accuracy of channel state information is 0.8, the spectral efficiency of the proposed algorithm can already be maintained at a good level.

Sign in / Sign up

Export Citation Format

Share Document