Wireless Network Dynamic Topology Routing Protocol Based on Aggregation Tree Model

2006 ◽  
Author(s):  
Guozhen Tan ◽  
Ningning Han ◽  
Yi Liu ◽  
Jialin Li ◽  
Hao Wang
Keyword(s):  
Wireless Network ◽  
Routing Protocol ◽  
Network Dynamic ◽  
Tree Model ◽  
Dynamic Topology ◽  
Aggregation Tree

Comparison of Packet Delivery Fraction of On-demand Routing Protocol based on different Terrain-Area in MANET

2017 ◽  
Vol MCSP2017 (01) ◽  
pp. 38-41
Author(s):  
Hari Shankar Sahu ◽  
Rupanita Das
Keyword(s):  
Wireless Network ◽  
Routing Protocol ◽  
Rapid Growth ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Wireless Ad Hoc Network ◽  
Packet Delivery ◽  
On Demand ◽  
Telecommunication Technology ◽  
Demand Routing

Now a days telecommunication technology leads to a rapid growth of number of users, these number of users nothing but number of nodes in MANET.A wireless ad hoc network is a decentralized type of wireless network. The mobility of nodes effect on the performance of the network. Due to mobility of nodes the link breaks number of times which effect on the packet delivery. Therefore to analyze the performance, packet delivery fraction (PDF)can be used. This paper describe the packet delivery fraction of on demand routing protocol AODV and DSR on different terrain areas using GLOMOSIM.

scholarly journals A Hop Count Based Heuristic Routing Protocol for Mobile Delay Tolerant Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Lei You ◽  
Jianbo Li ◽  
Changjiang Wei ◽  
Chenqu Dai ◽  
Jixing Xu ◽  
...  
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Delay Tolerant Networks ◽  
Network Partitioning ◽  
Heuristic Function ◽  
Hop Count ◽  
Dynamic Topology ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Delay Tolerant

Routing in delay tolerant networks (DTNs) is a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the traditional mobile ad hoc networks (MANETs) cannot work well due to the failure of its assumption that most network connections are available. In this paper, we propose a hop count based heuristic routing protocol by utilizing the information carried by the peripatetic packets in the network. A heuristic function is defined to help in making the routing decision. We formally define a custom operation for square matrices so as to transform the heuristic value calculation into matrix manipulation. Finally, the performance of our proposed algorithm is evaluated by the simulation results, which show the advantage of such self-adaptive routing protocol in the diverse circumstance of DTNs.

Immensely Discriminate Routing in Wireless Networks

2017 ◽  
Vol 8 (3) ◽  
pp. 712
Author(s):  
Sujatha V ◽  
E. A. Mary Anitha
Keyword(s):  
Wireless Networks ◽  
Wireless Network ◽  
Routing Protocol ◽  
Real Life ◽  
Internet Access ◽  
Multimedia Traffic ◽  
Multihop Routing ◽  
Routing Schemes ◽  
Scalable Routing

Wireless networks are predictable to grant essential Internet access multimedia traffic service also increasingly such networks have been emerged in real life. However, the application scenarios is indeterminate as well as largely scalable routing is very difficult. Thus require efficient routing schemes in wireless network. In this paper, we propose Immensely Discriminate Routing protocol is used for multihop routing in wireless network. Here, node distance, node link, node trust and node quality of service is evaluated the next hop. This parameters are determined an efficient path in the wireless network.

scholarly journals A New SDN-Based Routing Protocol for Improving Delay in Smart City Environments

Smart Cities ◽  
2020 ◽  
Vol 3 (3) ◽  
pp. 1004-1021
Author(s):  
Lamia EL-Garoui ◽  
Samuel Pierre ◽  
Steven Chamberland
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Smart City ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
End To End Delay ◽  
Dynamic Topology ◽  
New Challenges ◽  
Real Time Applications ◽  
Entire Network

The smart city is an ecosystem that interconnects various devices like sensors, actuators, mobiles, and vehicles. The intelligent and connected transportation system (ICTS) is an essential part of this ecosystem that provides new real-time applications. The emerging applications are based on Internet-of-Things (IoT) technologies, which bring out new challenges, such as heterogeneity and scalability, and they require innovative communication solutions. The existing routing protocols cannot achieve these requirements due to the surrounding knowledge supported by individual nodes and their neighbors, displaying partial visibility of the network. However, the issue grew ever more arduous to conceive routing protocols to satisfy the ever-changing network requirements due to its dynamic topology and its heterogeneity. Software-Defined Networking (SDN) offers the latest view of the entire network and the control of the network based on the application’s specifications. Nonetheless, one of the main problems that arise when using SDN is minimizing the transmission delay between ubiquitous nodes. In order to meet this constraint, a well-attended and realistic alternative is to adopt the Machine Learning (ML) algorithms as prediction solutions. In this paper, we propose a new routing protocol based on SDN and Naive Bayes solution to improve the delay. Simulation results show that our routing scheme outperforms the comparative ones in terms of end-to-end delay and packet delivery ratio.

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.

Binary Tree Model-Based Mobile Ad Hoc Network Dynamic Address Allocation Mechanism Research

2014 ◽  
Vol 644-650 ◽  
pp. 2881-2885
Author(s):  
Jian Lan Liu ◽  
Li Zhu
Keyword(s):  
Ad Hoc Network ◽  
Binary Tree ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Network Dynamic ◽  
Allocation Mechanism ◽  
Tree Model ◽  
Node Number ◽  
Model Based ◽  
Mobile Ad Hoc

Mobile Ad Hoc network is a multihop temporary network composed of a set of mobile intelligent terminals with no center. According to the related questions of mobile Ad Hoc network address configuration, on the basis of the existing application in mobile Ad Hoc network address automatic configuration mechanism, this paper discusses Binary Tree Model-based Dynamic Address Allocation Mechanism. The mechanism dynamically configures a unique address for the nodes according to their relative positions in network topology, reduces control overhead, and with the help of node number, processes network merger and division to effectively address resource management. It has good scalability, and is suitable for mobile Ad Hoc network.

Sign in / Sign up

Export Citation Format

Share Document