Javascript must be enabled to continue!
Performance Enhancement of Routing Protocols in Mobile Ad hoc Networks
View through CrossRef
This paper proposes to use virtual backbone structure to handle control messages in ad hoc networks. This structure is effective in reducing the overhead of disseminating control information. In the first part, the approach to build the virtual backbone on the setup phase is presented. The construction of backbone is based on the Minimum Connected Dominating Set (MCDS). The novelty is in the way on finding the MCDS. A Linear Programming approach is used to build a Minimum Dominating Set (MDS). Then, a spanning tree algorithm is applied to provide the MCDS. A theoretical analysis based on probabilistic approach is developed to evaluate the size of MCDS. Different techniques of diffusion in ad hoc networks are presented and compared. The flooding technique is simple and efficient, but it is expensive in term of bandwidth consumption and causes broadcast storm problem. Simulation results show that technique using virtual backbone performs flooding and it is compared to MPR (Multipoint Relay). The second part of this paper presents a distributed procedure to maintain the backbone when the mobility of terminals is introduced. A maintenance procedure will be executed by the node which changes its position. This procedure is distributed and guarantees the node connectivity to the backbone. The authors believe that the maintenance of the backbone with small size will be more effective. Simulation results show the performance of this procedure when mobility and scalability are considered.
Title: Performance Enhancement of Routing Protocols in Mobile Ad hoc Networks
Description:
This paper proposes to use virtual backbone structure to handle control messages in ad hoc networks.
This structure is effective in reducing the overhead of disseminating control information.
In the first part, the approach to build the virtual backbone on the setup phase is presented.
The construction of backbone is based on the Minimum Connected Dominating Set (MCDS).
The novelty is in the way on finding the MCDS.
A Linear Programming approach is used to build a Minimum Dominating Set (MDS).
Then, a spanning tree algorithm is applied to provide the MCDS.
A theoretical analysis based on probabilistic approach is developed to evaluate the size of MCDS.
Different techniques of diffusion in ad hoc networks are presented and compared.
The flooding technique is simple and efficient, but it is expensive in term of bandwidth consumption and causes broadcast storm problem.
Simulation results show that technique using virtual backbone performs flooding and it is compared to MPR (Multipoint Relay).
The second part of this paper presents a distributed procedure to maintain the backbone when the mobility of terminals is introduced.
A maintenance procedure will be executed by the node which changes its position.
This procedure is distributed and guarantees the node connectivity to the backbone.
The authors believe that the maintenance of the backbone with small size will be more effective.
Simulation results show the performance of this procedure when mobility and scalability are considered.
Related Results
ACM SIGCOMM computer communication review
ACM SIGCOMM computer communication review
At some point in the future, how far out we do not exactly know, wireless access to the Internet will outstrip all other forms of access bringing the freedom of mobility to the way...
Optimizing IETF multimedia signaling protocols and architectures in 3GPP networks : an evolutionary approach
Optimizing IETF multimedia signaling protocols and architectures in 3GPP networks : an evolutionary approach
Signaling in Next Generation IP-based networks heavily relies in the family of multimedia signaling protocols defined by IETF. Two of these signaling protocols are RTSP and SIP, wh...
[RETRACTED] Rhino XL Male Enhancement v1
[RETRACTED] Rhino XL Male Enhancement v1
[RETRACTED]Rhino XL Reviews, NY USA: Studies show that testosterone levels in males decrease constantly with growing age. There are also many other problems that males face due ...
Analisa Perbandingan Kinerja Protokol Routing Rip Dan Ospf Menggunakan IPv4
Analisa Perbandingan Kinerja Protokol Routing Rip Dan Ospf Menggunakan IPv4
Abstrak - Penelitian bertujuan untuk dapat membandingkan kinerja protokol routing RIP dan OSPF menggunakan IPv4 bertujuan untuk dapat melakukan perbaingan dua metode touting yaitu ...
Routing Security in Wireless Sensor Networks
Routing Security in Wireless Sensor Networks
Since routing is a fundamental operation in all types of networks, ensuring routing security is a necessary requirement to guarantee the success of routing operation. Securing rout...
PENGARUH MODEL JARINGAN TERHADAP OPTIMASI ROUTING OPEN SHORTEST PATH FIRST (OSPF)
PENGARUH MODEL JARINGAN TERHADAP OPTIMASI ROUTING OPEN SHORTEST PATH FIRST (OSPF)
ABSTRAK Routing merupakan proses mengirim data dari satu network ke network lain. Dengan dynamic routing maka mekanisme routing dilakukan secara dinamis dengan menentukan jarak ter...
An Analysis of the Effectiveness of MANET Routing Algorithms using Machine Learning
An Analysis of the Effectiveness of MANET Routing Algorithms using Machine Learning
Mobile Ad Hoc Networks (MANETs) are a dynamic and self-configuring
wireless communication system that is essential in a wide range of applications,
including military operations an...
Analisa dan Perbandingan Kinerja Routing Protocol OSPF dan EIGRP dalam Simulasi GNS3
Analisa dan Perbandingan Kinerja Routing Protocol OSPF dan EIGRP dalam Simulasi GNS3
Router is the network equipment for route the packet from one network segment to another in a bigscale network. Router can route packet because there is a routing table in router c...

