Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ljubica Blazevic

dblp:12/2151 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 5 · 4 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Routing and switching · 93% Wireless networking · 7%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Routing and switching
geographic routing
0.112005
A Location-Based Routing Method for Mobile Ad Hoc Networks · IEEE Trans. Mob. Comput. 2005
Routing and switching › routing protocol
hybrid routing
0.112005
A Location-Based Routing Method for Mobile Ad Hoc Networks · IEEE Trans. Mob. Comput. 2005
Routing and switching › ad hoc network routing
mobile ad hoc network routing
0.112005
A Location-Based Routing Method for Mobile Ad Hoc Networks · IEEE Trans. Mob. Comput. 2005
Routing and switching
routing protocol
0.112005
A Location-Based Routing Method for Mobile Ad Hoc Networks · IEEE Trans. Mob. Comput. 2005
Wireless networking
mobile ad hoc networks
0.012005
A Location-Based Routing Method for Mobile Ad Hoc Networks · IEEE Trans. Mob. Comput. 2005

Methods — techniques the papers use, named apart from their topics

simulation · 0.1
YearPublicationVenuePosition
2005 A Location-Based Routing Method for Mobile Ad Hoc Networks
abstract
Using location information to help routing is often proposed as a means to achieve scalability in large mobile ad hoc networks. However, location-based routing is difficult when there are holes in the network topology and nodes are mobile or frequently disconnected to save battery. Terminode routing, presented here, addresses these issues. It uses a combination of location-based routing (terminode remote routing, TRR), used when the destination is far, and link state-routing (terminode local routing, TLR), used when the destination is close. TRR uses anchored paths, a list of geographic points (not nodes) used as loose source routing information. Anchored paths are discovered and managed by sources, using one of two low overhead protocols: friend assisted path discovery and geographical map-based path discovery. Our simulation results show that terminode routing performs well in networks of various sizes. In smaller networks; the performance is comparable to MANET routing protocols. In larger networks that are not uniformly populated with nodes, terminode routing outperforms, existing location-based or MANET routing protocols.
Ljubica Blazevic, Jean-Yves Le Boudec, Silvia Giordano
IEEE Trans. Mob. Comput.1
2002 Anchored Path Discovery in Terminode Routing
Ljubica Blazevic, Silvia Giordano, Jean-Yves Le Boudec
NETWORKING1
2001 Self organized routing in wide area mobile ad-hoc networks
abstract
This paper considers the problem of routing in a wide area mobile ad-hoc network called terminode network. Our routing scheme is a combination of two protocols called terminode local routing (TLR) and terminode remote routing (TRR). TRR is activated when the destination is remote and uses location of the destination obtained either via location management or by location tracking. TLR acts when the packet gets close to the destination. The use of TRR results in a scalable solution that reduces dependence on the intermediate systems, while TLR allows us to reduce problems due to location inaccuracy. The paper describes TLR and TRR protocols and presents some simulation results.
Ljubica Blazevic, Silvia Giordano, Jean-Yves Le Boudec
GLOBECOM1
2001 Self organized terminode routing simulation
abstract
In this paper we simulated terminode routing. This routing scheme is designed for wide area networks, where a large part or all the nodes are mobile. Terminode routing is a combination of two protocols called Terminode Local Routing (TLR) and Terminode Remote Routing (TRR). TLR is used to route packets to close destinations. TRR is used to route to remote destinations and is composed of the following elements: Anchored Geodesic Packet Forwarding (AGPF), Anchored Path Discovery (APD), multipath routing and path maintenance. We performed simulations of the TLR and TRR protocols using the GloMoSim simulator. In order to do that, we have implemented a new mobility model that we call ``restricted random waypoint
Ljubica Blazevic, Silvia Giordano, Jean-Yves Le Boudec
MSWiM1
2000 Towards mobile ad-hoc WANs: terminodes
abstract
Terminodes are personal devices that provide functionality of both the terminals and the nodes of the network. A network of terminodes is an autonomous, fully self-organized, wireless network, independent of any infrastructure. It must be able to scale up to millions of units, without any fixed backbone or server. In this paper we present the main challenges and discuss the main technical directions.
Jean-Pierre Hubaux, Jean-Yves Le Boudec, Silvia Giordano, Maher Hamdi, Ljubica Blazevic, Levente Buttyán, Milan Vojnovic
WCNC5