Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userFormalising the Optimised Link State Routing Protocol
198
0
0.0
(
0
)
Added by
EPTCS
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Routing protocol specifications are traditionally written in plain English. Often this yields ambiguities, inaccuracies or even contradictions. Formal methods techniques, such as process algebras, avoid these problems, thus leading to more precise and verifiable descriptions of protocols. In this paper we use the timed process algebra T-AWN for modelling the Optimised Link State Routing protocol (OLSR) version 2.
rate research
Read More
We propose a process algebra for link layer protocols, featuring a unique mechanism for modelling frame collisions. We also formalise suitable liveness properties for link layer protocols specified in this framework. To show applicability we model and analyse t
Wireless Sensors Networks (WSNs) have a big application in heterogeneous networks. In this paper, we propose and evaluate Advanced Low-Energy Adaptive Clustering Hierarchy (Ad-LEACH) which is static clustering based heterogeneous routing protocol. The complete network field is first divided into static clusters and then in each cluster separate Ad-LEACH protocol is applied. Our proposed protocol is inherited from LEACH with a cluster head selection criteria of Distributed Energy-Efficient Clustering (DEEC). This enables Ad-LEACH to cope with the heterogeneous nature of nodes. Due to small static clusters, each node reduces its broadcast message power because it only has to cover a small area. We perform simulations in MATLAB to check the efficiency of Ad-LEACH. The Simulation results show that Ad-LEACH outperforms LEACH and DEEC in energy efficiency as well as throughput.
In this paper, we propose a new Quality Link Metric (QLM), ``Inverse Expected Transmission Count (InvETX) in Optimized Link State Routing (OLSR) protocol. Then we compare performance of three existing QLMs which are based on loss probability measurements; Expected Transmission Count (ETX), Minimum Delay (MD), Minimum Loss (ML) in Static Wireless Multi-hop Networks (SWMhNs). A novel contribution of this paper is enhancement in conventional OLSR to achieve high efficiency in terms of optimized routing load and routing latency. For this purpose, first we present a mathematical framework, and then to validate this frame work, we select three performance parameters to simulate default and enhanc
Multicasting is effective when its group members are sparse and the speed is low. On the other hand, broadcasting is effective when the group members dense and the speed are high. Since mobile ad hoc networks are highly dynamic in nature, either of the above two strategies can be adopted at different scenarios. In this paper, we propose an ant agent based adaptive, multicast protocol that exploits group members desire to simplify multicast routing and invoke broadcast operations in appropriate localized regimes. By reducing the number of group members that participate in the construction of the multicast structure and by providing robustness to mobility by performing broadcasts in densely clustered local regions, the proposed protocol achieves packet delivery statistics that are comparable to that with a pure multicast protocol but with significantly lower overheads. By our simulation results, we show that our proposed protocol achieves increased Packet Delivery Fraction (PDF) with reduced overhead and routing load.
In this research work, we advise gateway based energy-efficient routing protocol (M-GEAR) for Wireless Sensor Networks (WSNs). We divide the sensor nodes into four logical regions on the basis of their location in the sensing field. We install Base Station (BS) out of the sensing area and a gateway node at the centre of the sensing area. If the distance of a sensor node from BS or gateway is less than predefined distance threshold, the node uses direct communication. We divide the rest of nodes into two equal regions whose distance is beyond the threshold distance. We select cluster heads (CHs)in each region which are independent of the other region. These CHs are selected on the basis of a probability. We compare performance of our protocol with LEACH (Low Energy Adaptive Clustering Hierarchy). Performance analysis and compared statistic results show that our proposed protocol perform well in terms of energy consumption and network lifetime.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
