Hierarchically Segmented Routing Protocol for MANETs

With the rapid advances in wireless and semiconductor technologies mobile connectivity became cheap and ubiquitous.One of the major challenges facing Mobile Ad-Hoc Networks (also known as MANETs) is the absence of a proper routing protocol that provides good scalability, low overhead, low end-to-end delays, seamless connectivity and good quality of service.In this paper we propose a Hierarchically Segmented Routing (HSR) approach to solve this problem, based on the two well know routing protocols; the DSR and CGSR.The paper provides a comparative analysis of the proposed HSR protocol using a stochastic network simulation. I.INTRODUCTIONWireless device are becoming ubiquitous, with the ever increasing advances in wireless and mobile computing.Improved protocols must be developed to support these new mobile devices/ MANETs and to see that these devices do not overload the existing infrastructure network.The aim of this endeavor is to provide anytime, anywhere connectivity for unlimited mobile devices without overloading the associated infrastructure networks.Most protocols in place suffer from low quality of service and overload the network with a large percentage of overhead (control data) when compared to the data packets.Any improvement in the routing protocol should be an extendible architecture to support high number of mobile units and at the same time ensure a good quality of service.Mobile routing protocols have been attracting the attention of a major section of the research community as is evident from the large number of ongoing projects at various universities and institutions on this topic.Numerous achitectures have been proposed such as the ExScal project in OSU [1], the Terminodes project in Switzerland [2], and the Roofnet project at MIT [3], the Waypoint Routing Protocol [4].