Improving network coding in wireless ad hoc networks

Kok, Gin-Xian; Chow, Chee-Onn; Ishii, Hiroshi

doi:10.1016/j.adhoc.2015.04.002

Cited by 11 publications

(8 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Kok et al [22] proposed improved general network coding condition (IGCC). However, IGCC includes five rules and rules vary under different scenarios, which is a bit complex for node to implement coding opportunity discovery procedure.…”

Section: Related Work and Motivationsmentioning

confidence: 99%

See 1 more Smart Citation

Research on network coding aware energy efficient routing for wireless sensor networks

Shao

Wang

Gao

2018

J Wireless Com Network

View full text Add to dashboard Cite

Wireless sensor nodes in wireless sensor networks are generally battery powered and it is usually hard to change their batteries. Therefore, energy saving has always been the basic critical problem of wireless sensor networks. In recent years, network coding has become a promising technology to improve network throughput, reduce transmission number, and save energy, which has great potential to solve the energy efficiency problem of wireless sensor networks. In addition, some network coding aware routings have been proposed. However, the network coding condition of existing network coding aware routings may experience the problem of false-coding effect in some scenarios, and usually neglect node energy, which greatly influences the energy efficiency performance. Therefore, existing network coding aware routings are not suitable for wireless sensor networks. This paper proposes network coding aware energy efficient routing (NAER) for wireless sensor networks. In NAER, universal network coding condition is presented and proved to avoid false-coding problem. Besides, combined with the coverage control and topology control mechanism at lower layer, cross layer coding opportunity discover mechanism is presented to increase coding opportunities. In addition, a network coding aware energy efficient routing metric (NERM) is presented, which takes coding opportunity, node energy, and link quality into account jointly. Simulation results demonstrate that NAER improves the accuracy of coding discovery mechanism, increases the number of coding opportunities, saves node's energy consumption, and prolongs network lifetime.

show abstract

Section: Related Work and Motivationsmentioning

confidence: 99%

“…In addition, the above routings in [16][17][18][19][20][21][22][23] do not consider the node energy consumption, which is critical for energy constraint wireless sensor networks. Therefore, theses routings are not suitable for wireless sensor networks.…”

Section: Related Work and Motivationsmentioning

confidence: 99%

Research on network coding aware energy efficient routing for wireless sensor networks

Shao

Wang

Gao

2018

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…Network coding and interference are jointly investigated by Peng et al 21 and Hou et al 22 But Peng et al 21 exploits the classical coding topologies as ROCX to detect coding opportunities, and the network coding condition is not considered by Peng et al 21 The improved generalized coding condition (IGCC) was proposed. 23 But the overheard packets in IGCC must be native packets. And IGCC includes five rules and is hard to be realized.…”

Section: Introductionmentioning

confidence: 99%

Common network coding condition and traffic matching supported network coding aware routing for wireless multihop network

Wang

Shao

Gao

et al. 2019

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Network coding-based routing has been widely considered as a promising technology to improve the network throughput of wireless multihop network. However, existing network coding aware routings have the problem of failure decoding and usually neglect the transmission scheduling, which degrades the gain of network coding. In this article, a common network coding condition and traffic matching supported network coding aware routing is proposed for wireless multihop network. In this, common network coding condition is proposed to avoid the problem of failed decoding. In addition, traffic matching mechanism is presented to promote the occurrence of network coding. Besides, a coding and load aware routing metric, which jointly considers the network coding opportunity and node load, is designed to evaluate the discovered paths. Extensive simulations on NS2 demonstrate that CTNR increases the number of coding opportunities and network coding occurrence, and improves network throughput.

show abstract

“…To break through the coding structures in a two-hop region, DCAR [6] proposes a k-hop (k > 2) model (shown in Figure 3), in which, the overhearing and decoding for flow a ⊕ b occur multiple hops away from its encoding node R and the coding structure formed in this model is called the generalized coding structure. FORM [7] and NCRT [14] are also typical network coding methods that support the generalized coding structure. FORM [7] makes adjustments to the coding conditions of DCAR, so that not only the original flows but also the encoded flows can be involved in the coding opportunity detection, which means FORM supports multilayer coding.…”

mentioning

confidence: 99%

“…FORM [7] makes adjustments to the coding conditions of DCAR, so that not only the original flows but also the encoded flows can be involved in the coding opportunity detection, which means FORM supports multilayer coding. NCRT [14] improves the weakness of the generalized coding conditions of FORM to further increase the coding opportunities. In this paper, CARTA also supports the generalized coding structure and multilayer coding.…”

mentioning

confidence: 99%

CARTA: Coding-Aware Routing via Tree-Based Address

Yang

2020

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Network coding-aware routing has become an effective paradigm to improve network throughput and relieve network congestion. However, to detect coding opportunities and make routing decision for a data flow, most existing XOR coding-aware routing methods need to consume much overhead to collect overhearing information on its possible routing paths. In view of this, we propose low-overhead and dynamic Coding-Aware Routing via Tree-based Address (CARTA) for wireless sensor networks (WSNs). In CARTA, a Multi-Root Multi-Tree Topology (MRMTT) with a tree-based address allocation mechanism is firstly constructed to provide transmission paths for data flows. Then, a low-overhead coding condition judgment method is provided to detect real-time coding opportunities via tree address calculation in the MRMTT. Further, CARTA defines routing address adjustments caused by encoding and decoding to ensure the flows’ routing paths can be adjusted flexibly according to their real-time coding opportunities. It also makes additional constraints on congestion and hop count in the coding condition judgment to relieve network congestion and control the hop counts of routing paths. The simulation results verify that CARTA can utilize more coding opportunities with less overhead on coding, and this is ultimately beneficial for promoting network throughout and balancing energy consumption in WSNs.

show abstract

Improving network coding in wireless ad hoc networks

Cited by 11 publications

References 25 publications

Research on network coding aware energy efficient routing for wireless sensor networks

Research on network coding aware energy efficient routing for wireless sensor networks

Common network coding condition and traffic matching supported network coding aware routing for wireless multihop network

CARTA: Coding-Aware Routing via Tree-Based Address

Contact Info

Product

Resources

About