A Recovery Method for Greedy Routing Protocols in Web Communications

Abstract

Greedy Perimeter Stateless Routing (GPSR) protocol is an appropriate and the most well-known routing protocol for high mobile vehicular ad-hoc networks. The protocol includes two routing modes, the greedy mode and the recovery mode, and utilizes a neighbor list to make a route decision. However, not only does the neighbor list in the protocol involve stale neighbor information, but also the stale nodes inherit a higher selection priority in the greedy mode according to the routing policy; besides, the useful redundant route information can be eliminated during planarization in the recovery mode. To overcome those problems, we propose a new recovery mode, named as Greedy Border Superiority Routing (GBSR), along with an Adaptive Neighbor list Management (ANM) scheme. A node generates a border superior graph instead of generating a planar graph when the node faces the local maximum. Packets in the recovery mode can escape from the recovery mode as fast as possible using the graph. Here, GBSR protocol has the same assumption as that of GPSR, and does not require any additional information. With a network simulator, GBSR and ANM are evaluated using two vehicle mobility scenarios. GBSR shows higher network performance in comparison with GPSR protocol. In addition, we accomplish a nearly stale-free neighbor list using the ANM scheme.

Authors and Affiliations

Sheetal Kaushik , Neeraj Raheja

Keywords

Related Articles

A Survey on Security Issues in Mobile Ad-hoc Networks

Current technologies and security advances have made networks systems and applications very popular and widely used. The pervasive and practical aspects of wireless Mobile Ad Hoc Networks (MANET) made them very popular a...

Better Management of Defects for Improving Software Processes

Every software after development needs to get tested. No software can be built “Defect Free”. After testing defects are reported by the use of a tool called “Defect Tracking System”. Also Defects reported can be managed...

AN EMPIRICAL ANALYSIS OF CAUSAL RELATIONSHIP BETWEEN STOCK MARKET AND MACROECONOMIC VARIABLES IN INDIA

The present paper is aimed at studying the nature of the causal relationship between stock prices and macroeconomic variables in India, if any such relationship exists. For this purpose the techniques of unit– root tests...

  REVIEW OF ARTIFICIAL IMMUNE SYSTEM TO ENHANCE SECURITY IN MOBILE AD-HOC SYSTEMS

 Mobile Ad-hoc Networks consist of wireless host that communicate with each other. The routes in a Mobile Ad-hoc Network may consist of many hops through other hosts between source and destination. The hosts are not...

QUALITY CONCERNS AND QUALITY ASSURANCE IN THE ERA OF GLOBALIZATION VIS-À-VIS ICT AND ODL

Globalization is not a new phenomena but the present era of globalization driven by competitive global markets is out spacing the governance of markets and the repercussions on people. Globalization and the information r...

Download PDF file
  • EP ID EP87019
  • DOI -
  • Views 163
  • Downloads 0

How To Cite

Sheetal Kaushik, Neeraj Raheja (2012). A Recovery Method for Greedy Routing Protocols in Web Communications. International Journal of Computer Science and Management Studies (IJCSMS) www.ijcsms.com, 12(1), 45-51. https://europub.co.uk/articles/-A-87019