An optimized stable clustering algorithm for mobile ad hoc networks

Pathak, Sunil; Jain, Sonal

doi:10.1186/s13638-017-0832-4

Cited by 51 publications

(28 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on the weight‐dependent aggregation approach, a flexible algorithm is provided 152 . Due to this algorithm is a type of 2‐hop clustering algorithms, so it is more stable and flexible against topological changes when compared with the classical 1‐hop clustering methods 153 . Moreover, direct communication is only feasible for small network size, and for large scale networks, multi‐hop communication is suitable and more scalable 154 .…”

Section: Service Discovery and Cluster‐based Routing Protocolsmentioning

confidence: 99%

Service redundancy and cluster‐based routing protocols for wireless sensor and mobile ad hoc networks: A survey

Yagoub

Rodrigues

Khalifa

et al. 2020

Int J Communication

View full text Add to dashboard Cite

SummaryService discovery (SD) is the cornerstone of wireless and mobile systems. The discovery of effective service is the key to achieve a higher level of ubiquity, which ensures the availability of services to users and applications significantly, and the high use of services. The research in this field is limited, with a few SD protocols available for specific purposes specified in the 6LoWPAN region. This paper discusses the various issues and challenges facing the design and selection of the appropriate service discovery and cluster‐based mechanism. Moreover, attention has been drawn to the cross‐layer solution by discussing different clustering techniques used to solve the redundancy problems. Furthermore, the service discovery protocols and cluster‐based routing protocols are critically investigated considering the redundancy problem, methods, mechanisms, and architectures by categorizing them into different categories, comparing them with fundamental parameters in the WSNs and MANETs environments. In addition, a modern form is proposed to show the life cycle of the service discovery process, and a new figure has been designed to clarify to the researchers various of the open issues related to the service discovery and cluster‐based routing protocols, corresponding objectives and the techniques of solving problems. Through the discussion of the scientific papers under survey, important results and valuable recommendations were reached. The survey is concluded with a summary, open research issues, outlook, and directions for future research on the topic.

show abstract

Section: Service Discovery and Cluster‐based Routing Protocolsmentioning

confidence: 99%

Service redundancy and cluster‐based routing protocols for wireless sensor and mobile ad hoc networks: A survey

Yagoub

Rodrigues

Khalifa

et al. 2020

Int J Communication

View full text Add to dashboard Cite

show abstract

“…The modified protocol was defined for improving the effectiveness of cooperative communication in vehicular network. In [16] proposed the cluster stability based routing method for improving the uplink connections in vehicular network and in [17][18][19][20][21][22] clustering algorithm for MANETs was discussed in terms of clustering overhead, stable cluster head, reduced cluster head changes and quality of services. The intelligent cluster formation method was defined by the author for improving the connectivity and reliability of the network.…”

Section: Related Workmentioning

confidence: 99%

Multilevel Prioritization based Effective and Reliable Communication Model for Vehicular Network

Dr. Kavita*,

Gagandeep

2019

IJRTE

View full text Add to dashboard Cite

Vehicular network always suffers from the issue of heavy traffic and load that increases the communication delay and loss. In this paper, a multi level prioritization method is applied within the existing GPSR protocol for effective route generation and improving the functionality of vehicular network. The proposed model is divided in two sub stages. In first stage, the prioritizations to the vehicle nodes are assigned. The priority assignment is done based on the role, behavior, communication characteristics of vehicle. Once the priorities are assigned, the communication is performed in the network. The rules are defined for considering the priority nodes as the intermediate node or not. The proposed prioritization based communication model is also sensitive to unbalanced load and network attack issue. Based on these considerations, the vehicle priority can be changed. The proposed protocol is defined as an improvement to GPSR protocol. The proposed work is simulated in NS2 environment. The simulation results show that the improved protocol enhanced the packet communication and reduced the packet loss and communication delay effectively.

show abstract

“…Pathak. S. [28] has proposed an optimize clustering algorithm to prevent cluster head changes by using the concept of backup node. In OSCA the node with highest priority will elected as cluster head and node with second largest priority will be elected as backup node.…”

Section: Cluster Based Routing For Manetmentioning

confidence: 99%

Modifying the MANET Routing algorithm by GBR CNR-Efficient Neighbor Selection Algorithm

Goyal¹,

Sharma²

2019

IJITEE

View full text Add to dashboard Cite

In today’s worlds, Mobile Ad-Hoc Network (MANET) plays most important role in the field networks technology in the world. The MANET has been rapidly rising and becoming significant from the last decade. A MANET is a kind of wireless network which has been set-up without requirement of fixed infrastructure where mobile nodes are connected over wireless link. Due to moving nature of the devices, the network topology is unstable and will change dynamically. That’s why stable routing in MANET cannot work properly. In this research paper, a new routing algorithm is proposed to get better routing performance in the MANET. The proposed algorithm designed based on the number of neighbors in the network. Planned algorithm is the improvement of GBR-CNR-LN (GBR-CNR with less neighbors) by calculating the stay time between the selected neighbor nodes and the transmission nodes. If the stay time of sender node is more than the packet transmission time then the selected node is the efficient neighbor selection. The algorithm is implemented and results are analyzed. The results of this paper show the usefulness of the proposed algorithm. The Evaluation of AODV protocol was carried out using Python and outcome of this evaluation showed that proposed Algorithm gave better results than GBR-CNR with less neighbor in terms of End-to-End delay, Number of control message transferred(Routing Overhead) and Network Load. The proposed Algorithm (GC-ENS) decrease Average End-to-End delay 52.54 %, reduce Average Routing Overhead 60.54% and decline the Average load on Network 61.17%.

show abstract

An optimized stable clustering algorithm for mobile ad hoc networks

Cited by 51 publications

References 23 publications

Service redundancy and cluster‐based routing protocols for wireless sensor and mobile ad hoc networks: A survey

Service redundancy and cluster‐based routing protocols for wireless sensor and mobile ad hoc networks: A survey

Multilevel Prioritization based Effective and Reliable Communication Model for Vehicular Network

Modifying the MANET Routing algorithm by GBR CNR-Efficient Neighbor Selection Algorithm

Contact Info

Product

Resources

About