|
|
Protocol and publication year |
Architecture |
Metric for link/path selection |
Multipath support |
Service diff. |
Hole bypassing |
Security |
Location aware |
Data delivery model |
Cross-layer support |
Scalability |
Mobility |
Energy efficiency |
Load balancing |
Reliability |
Congestion support |
Reduce packet drops |
Priority |
Adjust TX power |
Avoid interpath interference |
Simulator/software |
Compared with |
Strengths |
Weaknesses |
|
SAR [44]
IEEE-2000 | Flat | () Delay
() Remaining energy | √ | √ | — | — | — | Query | — | — | √ | √ | √ | — | — | — | √ | — | — | Parsec
[75] | Classic shortest path algorithm | ) Multipath
() Energy efficient | () Not scalable
() Unreliable
() Packet priorities are
constant |
RAP [20]
IEEE-2002 | Flat | () Distance
() Delay | — | — | — | — | √ | Query,
event | — | √ | — | — | — | — | — | — | √ | — | — | GloMoSim [76] | DSR [77]
GPSR [74] | () Real-time
() Deadline aware
() Scalable | () No multipath support
() Depleting bandwidth
quickly |
SPEED [21]
IEEE-2003 | Flat | () Distance
() Delay | — | √ | — | — | √ | Query | — | √ | — | — | √ | — | √ | √ | — | — | — | GloMoSim [76] | AODV [78]
DSR [77] | () Soft real-time guarantee
() Congestion control support
() Scalable | () Constant speed
() Unreliable
() No priority |
Politis et al.
[45]
Springer 2008 | Hierarchical | () Remaining energy
() Bandwidth | √ | — | — | — | — | — | — | — | — | √ | √ | √ | — | — | √ | — | — | — | Self-baseline scheduling | () Optimized video QoS
() High PSNR
() Energy efficient | () More complexity
() No comparison with previous schemes |
McTPGF
[22]
IEEE 2010 | Flat | () Distance
() Sleeping delay | — | — | √ | — | √ | — | — | √ | — | √ | √ | — | — | — | — | — | — | NetTopo
[71] | TPGF [19] | () Low delay
() Improve N/W lifetime
() Scalable | () Clock drift problem
() Require knowledge of entire topology |
MPMP [23]
Springer 2010 | Flat | () Distance
() Delay | √ | √ | √ | — | √ | — | √ | √ | — | — | — | √ | — | — | √ | — | — | NetTopo
[71] | TPGF [19] | () Context-aware
() End-to-end delay guarantee
() Scalable | () No congestion control
() Less N/W lifetime |
EA-TPGF
[24]
IEEE 2013 | Flat | () Distance
() Residual energy | √ | — | √ | — | √ | — | — | √ | — | √ | √ | — | — | — | — | — | — | NetTopo
[71] | TPGF [19] | () Improve N/W lifetime
() Scalable | () High delay
() More number of hops
() No congestion control |
CQR [64]
IEEE 2010 | Flat | () Bandwidth
() Transmission radius | √ | — | — | — | — | Event | — | — | — | — | √ | — | — | — | — | — | √ | — | GQR
[79, 80] | () Bandwidth efficient
() Higher admission rate
() Low delivery cost | () More iterations to converge |
Haiping and Ruchuan [25]
IEEE 2010 | Hierarchical | () Remaining energy
() Distance
| — | — | — | — | √ | — | — | √ | — | √ | √ | √ | — | — | √ | — | — | MATLAB
[81] | ASCENT [82]
GAF [83] | () Improve N/W lifetime
() Efficient load balancing
() Layered architecture | () No congestion support
() High delay |
MPDT [46]
IEEE 2010 | Flat | () Remaining energy
() Number of active paths through node | √ | — | √ | √ | — | — | — | — | — | √ | √ | √ | — | √ | — | — | — | Qualnet
[84] | Conventional protocol | () Improve N/W lifetime
() Secure
() Efficient load balancing | () High delay
() Extra overhead |
MREEP [26]
IEEE 2011 | Flat | () Hop count
() Distance | — | — | — | — | √ | Event | — | — | — | √ | — | √ | √ | — | √ | — | — | Opnet
[85] | REEP [86] | () Supports real- time and nonreal-time traffic
() Improve N/W lifetime
() Energy efficient | () Restricted applications
() Table-driven
() Not scalable |
CBRP-L [47]
IEEE 2011 | Hierarchical | () Link delay
() Residual energy | — | — | — | — | √ | — | — | √ | — | √ | √ | √ | √ | — | — | — | — | NS-2
[87] | CBRP [88] | () Improve N/W lifetime
() Congestion control
support | () Extra overhead
() More complexity |
MHDMwTS
[67]
IEEE 2011 | Flat | () Hop count
() Delay | √ | — | — | — | — | Event | — | — | — | √ | √ | √ | √ | — | — | — | — | OMNet++
[89] | MHC [90] | () Congestion control support
() Reliable
() Improve N/W lifetime | () Clock synchronization problem
() Performance drops with higher data rates |
PEMuR [48]
Elsevier 2011 | Hierarchical | () Residual energy
() Required energy | — | — | — | — | — | Event | — | √ | — | √ | √ | — | — | — | √ | — | — | TRUE TIME
[91] | TEEN [92] | () Optimized video QoS
() High PSNR
() Energy efficient | () Contention-free and error-free assumption for channel
() Extra overhead |
GEAM [49]
Elsevier 2013 | Flat | () Residual energy
() Transmission radius | √ | — | √ | — | √ | Event | — | √ | — | — | √ | √ | — | — | — | — | √ | NS-2
[87] | TPGF [19]
GPSR [74]
NI [93] | () Interference-free transmission
() Efficient load balancing | () High delay
() More energy consumption
() More hop counts |
PASPEED [27]
IEEE 2014 | Flat | () Distance
() Delay | — | — | √ | — | √ | — | — | — | — | √ | — | √ | — | √ | √ | √ | — | Castalia [94]
Evalvid [95] | GPSR [74]
SPEED [21] | () Energy efficient
() Less delay
() Less control packets overhead | () Clock synchronization problem
() No load balancing |
ADRS [28]
IEEE 2015 | Flat | () Distance
() Inclination angle | √ | — | √ | √ | √ | — | — | — | — | — | √ | √ | — | — | — | — | — | OMNet++
[89] | Shortest path algorithm | () Improve N/w lifetime
() Dynamic
() Providing source location secrecy | () Higher latency
() No priority |
|
