View PDF

Jatin Gupta et al, Int. Journal of Information Technology & Mechanical Engineering - IJITME,
Vol.1 Issue. 4, July- 2014, pg. 34-38
ISSN: 2349-2865
Long Lived Associativity Based Routing
Protocol Based on RSSI
Jatin Gupta1, Nivit Gill2
1
2
M-Tech Student, Punjabi University Regional Centre for IT & Management., Mohali, India
Assistant Professor, Punjabi University Regional Centre for IT & Management., Mohali, India
Abstract
Wireless mobile ad-hoc networks are gaining the importance in field of Wireless Networks research. In an ad-hoc mobile network
where mobile hosts (MHs) are acting as routers and where routes are made inconsistent by MHs’ movement, we employ an
associativity-based routing scheme where a route is selected based on nodes having associativity states that imply degree of stability.
In Manets to adopt an efficient and secure routing mechanism is one of the major issues for the network. The paper discuss the tuning
of ABR (Associativity based routing protocol) whose routing is based on the concept of link stability. This paper proposes long lived
ABR scheme which is based on RSSI (Received signal strength indication) instead of links stability. The protocol is free from loops,
deadlock and packet duplicates which helps to enhance the performance of long lived ABR in contract with ABR protocol .
Keywords- ABR, LONG LIVED ABR, OPNET, RSSI, ROUTING
1. Introduction
An ad-hoc mobile network is a collection of mobile nodes that are dynamically and randomly located in such a manner
that the interconnections between nodes are capable of changing on a continual basis. In order to facilitate
communication within the network, a routing protocol is used to discover routes between nodes. The primary goal of
such an ad-hoc network routing protocol is correct and efficient route establishment between a pair of nodes so that
messages may be delivered in a timely manner. Route construction and maintenance should be done with a minimum of
overhead and bandwidth consumption [1].
a)
Associativity Based Routing Protocol (ABR): In Associativity Based Routing (ABR) protocol, routing is based
on the degree of association stability. It is free from loops, deadlock, and packet duplicates. In ABR, a route is
selected based on associativity states of nodes. The routes thus selected are liked to be long-lived. All nodes
generate periodic beacons to signify its existence. When a neighbour node receives a beacon, it updates its
associativity tables. For every beacon received, node increments its associativity tick with respect to the node
from which it received the beacon. Association stability means connection stability of one node with respect to
another node over time and space. A high value of associativity tick with respect to a node indicates a low state
of node mobility, while a low value of associativity tick may indicate a high state of node mobility.
Associativity ticks are reset when the neighbours of a node or the node itself move out of proximity. The
fundamental objective of ABR is to find longer-lived routes for ad hoc mobile networks. The three phases of
ABR are Route discovery, Route reconstruction (RRC) and Route deletion [2].
b) Long Lived Associativity Based Routing Protocol (ABR): The Long Lived Associativity Based Routing (ABR)
protocol defines a new scheme of routing which is based on RSSI. The RSSI strength is based on the
transmitting power of nodes. The nodes with higher transmitting powers are selected for routing, so that the
© 2014, IJITME All Rights Reserved, www.ijitme.org
34
Jatin Gupta et al, Int. Journal of Information Technology & Mechanical Engineering - IJITME,
Vol.1 Issue. 4, July- 2014, pg. 34-38
ISSN: 2349-2865
network remains long lived. There is fixed reception-power threshold for packets, packets with a power less than
the threshold are not sensed and decoded by the receiver. The packets whose received power is higher than
threshold are considered as valid packets. They are sensed by the MAC and they can be received successfully
unless they get bit errors due to interference, background noise and/or colliding with other valid packets.
2. Related Work
The operation complexity and communication complexity as defined in [1] were compared for both the ABR and the
EABR, where the values represent the worst–case analysis. EABR proofed to be better in route reconstruction, which
is attributed to the novel way in which the EABR reconstruct the route after movement of any node and the active
role of the moved node in route reconstruction phase.
The author conclude [2], AODV performs worst in terms of load and throughput. ABR’s performance was
consistently good in terms of load and throughput. TODV’s performance was consistent for the three parameters. In
summary, we can say that OLSR was best as compared to AODV, TODV, and ABR in type of traffic taken into
consideration for simulation because of its maximum throughput.
The author state that the mobility has negative effect on routing [3]. ABR perform better than AODV, in term of
overheads, throughput, network reliability and lifetime. In [4], the author proposed new opportunistic routing
algorithm for sensor networks, ODEUR, was presented. This algorithm has proved to be a promising routing
approach for multi-sink wireless sensor networks. It has outperformed the AODV algorithm, especially in terms of a
guaranteed reception of sensor data at the sink(s). The algorithm has most advantages if it is used in a scenario with
frequently intermittent connectivity and where short end-to-end delays are less important than a guaranteed reception
of the sensor data.
In [5], the author proposed a very simple method of eliminating faulty distance estimates by filtering the measured
RSSI through optimized SD and packet loss limits. We conducted experiments with CC2431 radio nodes to collect
enough RSSI measurements for model parameter estimation. We devised an optimizer to find optimized model
parameters and limits. Then we used the experimental data to verify the optimized model and found that our method
does help reducing the average distance error by effectively identifying and eliminating those estimates which
introduce the most error. The author [8], suggest evaluating the protocol performance during the cases when the
associativity interlock property is violated, the routing protocol is implemented within a migration-based ad-hoc
mobile simulator. From the results obtained out of 113 ad-hoc mobile networks simulations, we found that the reconstructed route can be shorter than its original route and the number of localised query operations are less than its
worst possible value. In addition, as the route neighbouring factor is increased, the probability of localised query
successes also increased. We have also proposed a new dynamic cell size adjustment scheme for ABR, which
provides further improvement in throughput and reduction in transmission power in a manner that is independent of
the underlying MAC layer protocols.
3. Simulation Study
The routing in long lived ABR is based on the energy factor of each node, the packets are routed to the nodes which
has most left over energy. The nodes generate beacon after regular interval, each beacon packet has RSSI related to
energy factor. The initial RSSI in network is 0, which increase as the routing in network proceeds and the energy
factor starts to decrease which is initially full for nodes. The packets are only routed to the node with most energy.
The node generate beacon signal with transmitting power, which must be greater than the threshold power of
© 2014, IJITME All Rights Reserved, www.ijitme.org
35
Jatin Gupta et al, Int. Journal of Information Technology & Mechanical Engineering - IJITME,
Vol.1 Issue. 4, July- 2014, pg. 34-38
ISSN: 2349-2865
network, otherwise packet is discarded. The RSSI of beacon signal provide the information about the power of
nodes. The packets are routed to the nodes with more power. In this way the power of all the nodes almost end at
same time, instead of dead nodes in between the lifetime of the network. The proposed scheme enhances the overall
performance of the network in term of throughput, delay, packets discarded and end to end delay. The "Slot Based
Processing", is used in addition to a single central server (with its own queue) N additional servers - each with a
queue - are used to process packets. N is determined by the number of slots that have been configured. The "slot
info" model attribute controls the number of slots used by an IP process instance. With multiple servers "Slot Based
Processing" has the potential to deliver greater packet throughput.
4. Results
a) Load- Fig. 1 is representing the delay for long lived ABR and ABR protocol with various nodes. The long
lived ABR with 50 nodes representing the best value for load, where as the ABR with 75 nodes showing
much poor result in comparison with long lived ABR. The simulation study also shown that the load
increase with the network size for ABR but for long lived ABR load decrease with increase in network
size.
Fig.1 Representing load
b) Delay- Fig. 2 representing the delay , the simulation shown that the long lived ABR with 50 nodes perform
best in term of delay and delay for long lived ABR with 75 nodes is very little bit higher than the delay
shown by 50 nodes. The delay shown by the ABR routing protocol is much higher and it increase with
network size.
© 2014, IJITME All Rights Reserved, www.ijitme.org
36
Jatin Gupta et al, Int. Journal of Information Technology & Mechanical Engineering - IJITME,
Vol.1 Issue. 4, July- 2014, pg. 34-38
ISSN: 2349-2865
Fig. 2 Representing Delay
c) Throughput- Fig. 3 representing the throughput for ABR and long lived ABR. The long lived
ABR with 75 nodes perform much better than other in term of throughput which is represented by
green colour. The worst throughput shown by ABR routing protocol which is represented by red
colour.
Fig. 3 Representing Throughput
© 2014, IJITME All Rights Reserved, www.ijitme.org
37
Jatin Gupta et al, Int. Journal of Information Technology & Mechanical Engineering - IJITME,
Vol.1 Issue. 4, July- 2014, pg. 34-38
ISSN: 2349-2865
5. Conclusion
The simulation study has shown that the performance of long lived ABR is much better than the traditional ABR
protocol in term of load, delay and throughput. The routing in long lived ABR is based on the RSSI signal strength
received which help to determine the power left in a node. The node with higher battery are used to forward the
packets in this way the network nodes end at same time almost which enhance the performance. The network is not
following any greedy approach for routing but routing based on the stability of the network. The packets move
toward the sink nodes and the route the packet to desired node with high energy. In this way the overall performance
of the ABR protocol is improved and it became long lived ABR protocol. In, future there is scope to incorporate the
vulnerability factor along with battery power, to achieve a secured routing model.
References
[1] Said Abu Shaar, Fawaz A. and Ayman Murad, “Analysis of Enhanced Associativity Based Routing Protocol”,
Journal of Computer Science 2 (12): 853-858, 2006.
[2] Ekta Nehra and Jasveer singh, “Performance Comparison of AODV, TODV, OLSR and ABR using OPNET”,
IJARCSSE, Volume 3, Issue 5, May 2013.
[3] Djamel Djenouri, “Adhoc network routing protocol and mobility”, The arab journal of IT, Vol 3, No. 2, 2009.
[4] Bernd-Ludwig Wenning, Arturas and Andreas Timm, “Opportunistic Distance-aware Routing in Multi-Sink
Mobile Wireless Sensor Networks”, ICT-MobileSummit 2008 Conference Proceedings, Stockholm 2008.
[5] A. Faheem, R. Virrankoski and M. Elmusrati, “Improving RSSI based distance estimation for 802.15.4 wireless
sensor networks” University of Vaasa Finland, 2010.
[6] Balaji V and V. Duraisamy, “Improved AODV on Link Quality Metrics”, International Journal of Advances in
Engineering & Technology, Nov. 2012.
[7] Nadia Qasim, Fatin Said and Hamid Aghvami, “Mobile Ad Hoc Networks Simulations Using Routing Protocols
for Performance Comparisons”, Proceedings of the World Congress on Engineering 2008 Vol I WCE 2008, July
2 - 4, 2008, London, U.K.
[8] Dusan Stevanovic and NatalijaVlajic, “Performance of IEEE 802.15.4 in Wireless Sensor Networks with a
Mobile Sink Implementing Various Mobility Strategies”, Dept. of Computer Science and Engineering York
University October 17, 2008.
[9] Abdul Sattar Malik and Suhail A. Qureshi, “Analyzing the Factors Affecting Network Lifetime for Cluster-based
Wireless Sensor Networks”, Pak. J. Engg. & Appl. Sci. Vol. 6, Jan., 2010 (p. 9-16).
[10] E. Jovanov, A. Milenkovic, C. Otto, and P. C. de Groen, “A wireless body area network of intelligent motion
sensors for computer assisted physical rehabilitation,” Journal of Neuroengineering and Rehabilitation, vol. 2,
March 2005.
[11] Stephanie Lindsey Cauligi S. Raghavendra, “PEGASIS: Power-Efficient Gathering in Sensor Information
Systems”, Computer Systems Research Department The Aerospace Corporation Los Angeles, CA 90009-2957.
[12] J. Kulik, W. Rabiner, and H. Balakrishnan. Adaptive Protocols for Information Dissemination in Wireless
Sensor Networks. In Proceedings of Mobicom’ 99, 1999.
© 2014, IJITME All Rights Reserved, www.ijitme.org
38

Download Report