Ad hoc Networking

By Stefano Basagni, Marco Conti, Silvia Giordano, Ivan Stojmenovic. 2004

1,675 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/d7275c449990749af2472c581c49d26c7b53cedb

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility (2007, background): “Conventional Internet routing protocols (e.g. RIP and OSPF) as well as mobile ad-hoc network routing schemes, such as DSR, AODV, etc. [11], assume that a complete path exists between a source and a destination, and try to discover minimum cost paths before any useful data is sent.”
Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case (2008, background): “Further, ad hoc networks have yet to .nd much application outside the research or military community, while some dire issues regarding their scalability properties have been identi.ed [2].”
A cone-based distributed topology-control algorithm for wireless multi-hop networks (2005, background): “A Cone-Based Distributed Topology-Control Algorithm for Wireless Multi-Hop Networks Li (Erran) Li, Member, IEEE, Joseph Y. Halpern, Senior Member, IEEE, Paramvir Bahl, Senior Member, IEEE, Yi-Min Wang, and Roger Wattenhofer Abstract The topology of a wireless multi-hop network can be controlled…”
Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks (2003, background): “N recent years, mobile ad hoc networks have received much attention due to their potential applications and the proliferation of mobile devices [1], [2].”
A key management scheme for wireless sensor networks using deployment knowledge (2004, methodology): “To ﬁnd such a secure path for nodes i and j , the easiest way is to use ﬂooding [22], a common technique used in multihop wireless networks.”
Threshold Ring Signatures and Applications to Ad-hoc Groups (2002, background): “The highly dynamic nature of such groups raises new challenges for networking [22].”
QoS routing for mobile ad hoc networks (2002, unknown): “Let T N”
Great expectations: the value of spatial diversity in wireless networks (2004, background): “A variety of routing algorithms have been developed based on route quality and degree of mobility [204, 181, 243].”
Random key-assignment for secure Wireless Sensor Networks (2003, background): “…in a battleﬁeld; (2) collect data from a ﬁeld in order to reveal the presence of a toxic gas; (3) facilitate rescue operations in wide open hostile areas; (4) fulﬁll perimeter surveillance duties; (5) operate for commercial purpose in severe environmental constrained scenarios (for instance,…”
Security and Cooperation in Wireless Networks (2007, background): “As for mobile ad hoc networks, the routing protocols are discussed in [312].”
Sensor relocation in mobile sensor networks (2005, background): “Since many existing techniques on grid (cluster) maintenance [6], [9], [19] can be directly applied, we will not address these issues in this paper.”
On the minimum node degree and connectivity of a wireless multihop network (2002, background): “Both topology attributes depend on the spatial distribution of the nodes and their transmission range.”
Adaptive routing for intermittently connected mobile ad hoc networks (2005, background): “As a consequence, much ad hoc network research has focused on the investigation of fundamental algorithms for routing [1] on which almost everything else relies.”