Figure 3 - uploaded by P. Polydorou
Content may be subject to copyright.
2 Putting the mobile ad hoc network into a coordinate system. The location of a node can be defined by its x, y coordinate values
Source publication
In this paper we propose a novel routing protocol for mobile ad hoc networks called the Dynamical Managing Location Information Scheme (DULIS), which can be used in ad hoc networks with rapidly changing network topology. The DULIS enables efficient management of the location information and reduces the overhead traffic caused by the periodic locati...
Similar publications
Ad hoc networks require efficient dynamic routing protocols to tackle the issues raised by their change-prone network topology
and the fact that packets typically traverse multiple hops to reach their destinations. Ad hoc networks combine arbitrary
mobile hosts with wireless communication capabilities, which come together into a temporary network...
Mobile ad-hoc network and its several aspects are gaining popularity day-by-day in the research field as new technology is emerging in its way to renovate the field as a companion of wireless sensor networks. While working on several routing protocols of mobile ad-hoc network I became familiar with two prominent on-demand routing protocols for mobi...
Quality of service (QoS) enhancement is one of the prominent research areas in a mobile ad hoc network in which a variety of routing protocols is introduced. However, those routing protocols do not support efficiently, the multiple routes in the network, as congestion occurs owing to multiple routes. Hence, the infrastructure-less and dynamic natur...
In general, the conventional routing approaches in mobile ad hoc networks (MANETs) provide a route between the source and the target with a minimum hop count. Dynamic source routing (DSR) as a typical prototype of routing protocols relies on the minimum hop count parameter to provide the path without considering any other factors such as energy con...
Gossip-Based Sleep Protocol (GSP) is a routing protocol in the flooding family with overhead generated by duplicate packets. GSP does not have other sources of overhead or additional information requirements common in routing protocols, such as routing packets, geographical information, addressing or explicit route computation. Because of its simpl...
