An Election Protocol in Mobile Ad Hoc Distributed Systems

Park, Sung-Hoon; Lee, Tae-Gyu; Seo, Hyung-Seok; Kwon, Seok-Jin; Han, Jong-Ho

doi:10.1109/itng.2009.61

Cited by 9 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…It is in fact a measure of the effectiveness of a routing protocol [14][15] [16]. In Figure, it shows that throughput of packet send and received during attacking mode in AODV-LE-ME is high as compare with AODV-LE scenario.…”

Section: Performance Parametermentioning

confidence: 99%

Enhanced AODV Routing Protocol Using Leader Election Algorithm

Hemant¹

2015

IJRITCC

View full text Add to dashboard Cite

Abstract-Failure of communication link in mobile ADHOC network is major issue. For the failure of link the performance of network is degraded. Due to mobility of mobile node brake the communication link and path of routing is failed. For the repairing of routing node used various algorithm such as leader election, distributed and selection algorithm. The failure of link decease the performance of routing protocol in mobile ad-hoc network, for the improvement of quality of service in mobile ad-hoc network various authors proposed a different model and method for prediction of link. The prediction of link decreases the failure rate of mobile node during communication. The leader election algorithm plays a major role in link failure prediction algorithm the process of link failure prediction implied in form of distributed node distribution. Proposed a new link stability prediction method based on current link-related or user-related information in shadowed environments. The modified protocol acquired the process of thresholds priority Oder on the basic of neighbor's node. The selection of neighbor node deepens on the mode operation in three sections. According to order of state create cluster of priority of group. After creation of group calculate average threshold value and compare each group value with minimum threshold value and pass the control message for communication. Through this process mode of activation state of node is minimized the time of route establishment and maintenance. The selection of proper node in minimum time and other node in sleep mode the consumption of power is reduces. We modified SBRP protocol for selection of node during on demand request node according to sleep and activation mode of communication. Each node locally assigned priority value of node. For the evaluation of performance used network simulator NS-2.35. And simulate two protocol one is AODV-LE protocol, these protocol patch are available for the simulation purpose. And another protocol is AODV-LE-ME. AODV-LE-ME protocol is modified protocol of leader election protocol for the selection of mobile node during the communication.

show abstract

Section: Performance Parametermentioning

confidence: 99%

Enhanced AODV Routing Protocol Using Leader Election Algorithm

Hemant¹

2015

IJRITCC

View full text Add to dashboard Cite

show abstract

“…Election protocols have to ensure that all nodes in the network refer to the same new coordinator after the current one has disconnected [20], [21]. The election is led by a single decision maker who needs global system view to consider the logical distance between each node and the new coordinator in its selection process [22].…”

Section: Related Workmentioning

confidence: 99%

“…Maintaining such a view is expensive and infeasible in true peer-to-peer networks [15]. Further, late binding involves only a subset of nodes which can communicate in a more targeted way than through controlled network flooding [20], [21]. Consensus protocols achieve an agreement among agents if the opinion of all agents stabilises.…”

Section: Related Workmentioning

confidence: 99%

Synchronising Service Compositions in Dynamic Ad Hoc Environments

Groba

Clarke

2012

2012 IEEE First International Conference on Mobile Services

View full text Add to dashboard Cite

Abstract-Service compositions in dynamic ad hoc environments face frequent changes in the network and service topology. Late service binding is a way to adapt to runtime changes but requires additional communication over error-prone and energy-constrained networks. In particular, synchronising parallel service flows relies on steady message exchange when mutually unknown service providers have to agree on a common merge node. Binding the merge node early through a single entity reduces the need for coordination. However, it compromises flexibility and may nonetheless increase communication as the decision entity has only partial view of the system. This paper proposes a multi-party late binding protocol as a solution for flexible, communication-aware service composition in dynamic ad hoc environments. The protocol integrates the discovery of unknown synchronisation partners with the exchange of binding suggestions to reduce communication. We embed this protocol in our model for opportunistic service composition and evaluate it against an early binding approach. Simulation results show that while being overall equally successful, late service binding outperforms early binding with respect to communication overhead and response time.

show abstract

“…Em (PARK et al, 2009) é proposto um algoritmo de eleição para ambientes de rede sem fio ad-hoc, o qual surgiu através da readaptação de um algoritmo para redes baseadas em enlaces físicos, que funciona de forma similar aos algoritmos de eleição convencionais já discutidos.…”

Section: Eleição Em Sistemas Distribuídosunclassified

Integrando grades móveis em uma arquitetura orientada a serviços

Segura¹

View full text Add to dashboard Cite

The increasing number of mobile devices, such as smartphones, tablets and laptops, as well as advances in their computing power have enabled us to consider them as resources, exploring the proximity. The use of near computing resources is growing year by year, being called as Fog computing, where the elements on the edge of the Internet are exploited, once the computer services providers could be unavailable or overloaded. Thus, this Master's project focuses on using mobile devices to provide computing services among them through a heuristic called Adapted Maximum Regret, which tries to minimize energy consumption and avoid untrustable devices. There is also top-level metaheuristic which interconnects different clusters of devices on the edge of the Internet with global information to guarantee Quality of Services (QoS). We conducted a set of experiments that showed us to avoid devices with a high degree of failures to save more energy when allocating tasks among them, as well as decreasing the applications response time and communication through adjusts in the selection algorithm of external agglomerates.

show abstract

An Election Protocol in Mobile Ad Hoc Distributed Systems

Cited by 9 publications

References 10 publications

Enhanced AODV Routing Protocol Using Leader Election Algorithm

Enhanced AODV Routing Protocol Using Leader Election Algorithm

Synchronising Service Compositions in Dynamic Ad Hoc Environments

Integrando grades móveis em uma arquitetura orientada a serviços

Contact Info

Product

Resources

About