[go: up one dir, main page]

Mahdi et al., 2018 - Google Patents

An energy-aware and load-balancing routing scheme for wireless sensor networks

Mahdi et al., 2018

View PDF
Document ID
4520560062208094906
Author
Mahdi O
Al-Mayouf Y
Ghazi A
Wahab A
Idris M
Publication year
Publication venue
Indonesian Journal of Electrical Engineering and Computer Science

External Links

Snippet

Energy and memory limitations are considerable constraints of sensor nodes in wireless sensor networks (WSNs). The limited energy supplied to network nodes causes WSNs to face crucial functional limitations. Therefore, the problem of limited energy resource on …
Continue reading at www.researchgate.net (PDF) (other versions)

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H04W40/14—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on stability
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/08—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on transmission power
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/246—Connectivity information discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organizing networks, e.g. ad-hoc networks or sensor networks
    • H04W84/20—Master-slave selection or change arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/123—Evaluation of link metrics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/248—Connectivity information update
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/121—Minimizing delay
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/48—Routing tree calculation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/04—Interdomain routing, e.g. hierarchical routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W28/00—Network traffic or resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/10—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network
    • H04L67/104—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network for peer-to-peer [P2P] networking; Functionalities or architectural details of P2P networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W4/00—Mobile application services or facilities specially adapted for wireless communication networks
    • H04W4/02—Mobile application Services making use of the location of users or terminals, e.g. OMA SUPL, OMA MLP or 3GPP LCS
    • H04W4/023—Mobile application Services making use of the location of users or terminals, e.g. OMA SUPL, OMA MLP or 3GPP LCS using mutual or relative location information between multiple location based services [LBS] targets or of distance thresholds

Similar Documents

Publication Publication Date Title
Mahdi et al. An energy-aware and load-balancing routing scheme for wireless sensor networks
Zhang et al. A novel multicast routing method with minimum transmission for WSN of cloud computing service
Popescu et al. Surveying position based routing protocols for wireless sensor and ad-hoc networks
Petrioli et al. ALBA-R: Load-balancing geographic routing around connectivity holes in wireless sensor networks
Sinwar et al. Analysis and comparison of ant colony optimization algorithm with DSDV, AODV, and AOMDV based on shortest path in MANET
Acs et al. A taxonomy of routing protocols for wireless sensor networks
Tabatabaei et al. Reliable routing algorithm based on clustering and mobile sink in wireless sensor networks
Farzinvash et al. A distributed and energy-efficient approach for collecting emergency data in wireless sensor networks with mobile sinks
Din et al. Beaconless traffic-aware geographical routing protocol for intelligent transportation system
Okazaki et al. Ant-based dynamic hop optimization protocol: A routing algorithm for mobile wireless sensor networks
Izaddoost et al. Energy efficient data transmission in IoT platforms
Syarif et al. Operator calculus approach for route optimizing and enhancing wireless sensor network
Manikannu et al. A survey of energy efficient routing and optimization techniques in wireless sensor networks
Meghanathan A location prediction-based reactive routing protocol to minimize the number of route discoveries and hop count per path in mobile ad hoc networks
Tashtoush et al. A novel multipath load balancing approach using Fibonacci series for mobile ad hoc networks
Gulati et al. Load Balanced and Link Break Prediction Routing Protocol for Mobile Ad Hoc Networks.
Eslaminejad et al. Classification of Energy-Efficient Routing Protocols for Wireless Sensor Networks.
Raja et al. Modified GPSR based optimal routing Algorithm for reliable communication in WSNs
Feng et al. RBMulticast: Receiver based multicast for wireless sensor networks
Hsiu et al. A maximum-residual multicast protocol for large-scale mobile ad hoc networks
Wang et al. Maximizing network lifetime online by localized probabilistic load balancing
Padyal et al. Continuous neighbour discovery approach for improvement of routing performance in WSN
Won et al. Energy efficient and robust multicast routing for large scale sensor networks
Puccinelli et al. Reactive sink mobility in wireless sensor networks
Balasubramaniyan et al. A new fuzzy based clustering algorithm for wireless mobile Ad-Hoc sensor networks