Access Restriction

Author Caduff, Otmar
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Location Service ♦ Whole Network ♦ Maximal Speed ♦ Proposed Solution ♦ Reasonable Service ♦ Example Show ♦ Location Information ♦ Present Possible Solution ♦ Publish Algorithm ♦ Main Idea ♦ Upper Bound ♦ Geographic Position ♦ Pioneering Work ♦ Simulation Move ♦ Nearby Neighbourhood
Abstract In most geographic routing algorithms, the position of the destination of a message has to be known by the sender. This is what location services are for: they provide lookup and publish algorithms to exchange information about geographic positions of nodes in a network. The papers [1] and [2] present possible solutions. The main idea of both papers is to distribute location information of a given node over the whole network, denser in the nearby neighbourhood, sparser with growing distances. 2. Evaluation: GLS The work by Li et al. [1] is oriented rather practically. To me, this pioneering work was quite inspiring to read. The proposed solution is promising, which is also shown by the simulation. On the other side, I missed some points: the authors don’t give upper bounds for the speeds the nodes can move in order to still have a reasonable service; nodes in the simulation move at speeds of at most 10 m/s. Also, the nodes in the simulation are distributed evenly over the whole network, which might be unlikely in reality. Simulations with a focus on such restrictions have been made; [3] for example shows that queries are much more likely to fail if the maximal speed of the nodes is increased to 50 m/s.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study