A scalable solution to minimum cost forwarding in large sensor networks

By Fan Ye, Alvin Chen, Songwu Lu, Lixia Zhang. Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495), 2001

549 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/60c03222af52c78a4a15892d1848da81644dba53

How researchers see this paper

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

In Computer Networks and Communications

Citations in the corpus

Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance (2003, methodology): “Techniques to improve packet forwarding in sensor networks are proposed in [27] (using minimum cost paths) and in [28] (using multicast trees).”
An Industrial Perspective on Wireless Sensor Networks — A Survey of Requirements, Protocols, and Challenges (2014, background): “MMSPEED, SPIN [120], and Directed Diffusion based Highly resilient, energy efﬁcient multipath routing protocol [121], are some of the important routing protocols that use multipath routing.”
Security and Cooperation in Wireless Networks (2007, background): “The principle of routing in the model is finding the minimum energy path towards the base station [386].”
Secure routing in wireless sensor networks: attacks and countermeasures (2003, methodology): “Refer to the appendix for security analysis of minimum cost forwarding [41], clustering protocols such as”
Energy-Efficient Routing Protocols in Wireless Sensor Networks: A Survey (2013, methodology): “2) A Scalable Solution to Minimum-Cost Forwarding (SSMCF) in Large Sensor Networks: Fan Ye et al. [34] at 2001, studied the problem of minimum cost messages delivery from any given source to the interested client user (called a sink) along the minimum-cost path in a large sensor network.”
Overview of Data Routing Approaches for Wireless Sensor Networks (2012, methodology): “Flat-based or Data Centric routing: Examples of this class are Sensor Protocols for Information via Negotiation (SPIN) [8], Minimum Cost Forwarding (MCF) [9], Directed Diffusion (DD) [10] or those mentioned in [11–12].”
Energy Efficient Routing in Wireless Sensor Networks (2003, background): “Minimum Cost Forwarding Algorithm for Large Sensor Networks is proposed in [11].”
Multipath Routing in Wireless Sensor Networks: Survey and Research Challenges (2012, background): “Directed Diffusion [14], Sensor Protocols for Information via Negotiation (SPIN) [15], Rumor Routing [16], Minimum Cost Forwarding Algorithm (MCFA) [17], and Energy-Aware Routing (EAR) [18] can be included in this category.”
A Survey on Routing Protocols for Large-Scale Wireless Sensor Networks (2011, background): “The routing protocols belonging in this category include Sensor Protocols for Information via Negotiation (SPIN [2,3]), Directed Diffusion (DD [4]), Rumor Routing [5], Gradient-based routing (GBR [6]), Energy-Aware Routing (EAR [7]), and the Minimum Cost Forwarding Algorithm (MCFA [8]), etc.”
Energy efficient schemes for wireless sensor networks with multiple mobile base stations (2003, methodology): “In the first round, we propose to select the base station locations randomly and use a modified Minimum Cost Forwarding (MCF) routing protocol 3 [5].”
Routing techniques in wireless sensor networks: a survey (2004, background): “† Minimum Cost Forwarding Algorithm (MCFA): The MCFA algorithm [18] exploits the fact that the direction of routing is always known, that is, towards the ﬂxed external base-station.”