Efficient content delivery in mobile ad-hoc networks using CCN

Kim, Do-hyung; Kim, Jong-Hwan; Moon, Cheoleun; Choi, Jeong-Hwan; Yeom, Ikjun

doi:10.1016/j.adhoc.2015.06.007

Cited by 32 publications

(16 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Kim et al [9] proposed an NDN-based WMN packet delivery scheme using unicast transmission, called AIRDrop. To overcome the hidden terminal problem, the authors argued that AIRDrop uses the Request to Send/Clear to Send (RTS/CTS) mechanism to control link layer access in order to avoid collisions.…”

Section: Caching In Wireless Mesh Networkmentioning

confidence: 99%

See 1 more Smart Citation

PIF and ReCiF: Efficient Interest-Packet Forwarding Mechanisms for Named-Data Wireless Mesh Networks

Mascarenhas

Moraes

2018

Information

View full text Add to dashboard Cite

In this paper, we propose three mechanisms to reduce the broadcast storm problem in wireless mesh networks based on the Named-Data Network (NDN) architecture. The goal of our mechanisms is to reduce the number of content requests forwarded by nodes and consequently, increase the network efficiency. The first proposed mechanism, called Probabilistic Interest Forwarding (PIF), randomly forwards content requests. The second mechanism, called Retransmission-Counter-based Forwarding (ReCIF), decides to forward content requests based on the number of retransmissions by adding a counter to the header of requests. The third mechanism, called ReCIF+PIF, combines the features of PIF and ReCIF to suppress content requests. We compare the performance of our mechanisms with both the NDN default forwarding mechanism and the Listen First Broadcast Later (LFBL) mechanism. Our proposals outperform the default NDN forwarding mechanism by up to 21% regarding the data delivery rate in dense networks and provide a 25% lower delivery delay than the default NDN. Our mechanisms accomplish this performance by only reducing the number of content requests forwarded by nodes. One of our mechanisms, PIF, outperforms LFBL regarding the data delivery rate and delivery delay by up to 263% and 55%, respectively, for high network contention levels.

show abstract

Section: Caching In Wireless Mesh Networkmentioning

confidence: 99%

“…Several architectures have been proposed in the literature to deploy the ICN paradigm both in the Internet and in wireless networks [9,10]. Named-Data Networking (NDN) [11] is one of these architectures.…”

Section: Introductionmentioning

confidence: 99%

PIF and ReCiF: Efficient Interest-Packet Forwarding Mechanisms for Named-Data Wireless Mesh Networks

Mascarenhas

Moraes

2018

Information

View full text Add to dashboard Cite

show abstract

“…Nodes in green color copies the payload in its cache and unicast to other nodes.This research investigated different routing protocols of CCN and concluded that some of them overcome delay through greedy path selection, 11-13 whereas other achieves energy efficiency. 1,14,[5][6][7][8][9][10][15][16][17][18][19][20][21][22] The authors of other works 9,10,18,19,23 discuss about the selection procedure of the communication channels in the cognitive area networks with high reliability. Some routing protocols provide both performance parameters but uses broadcasting on broken edges.…”

mentioning

confidence: 99%

“…Some routing protocols provide both performance parameters but uses broadcasting on broken edges. 19,24,25 We propose unique Energy Efficient Greedy Routing Protocol (EEGRP) that minimizes flooding by using uniquely designed routing table (RT) entries in the network and achieves high energy efficiency with minimum delay.This research is further divided in four sections. In Section 2, the literature review of research papers from 2001 to 2017 summarized and compiled in Figure 2.…”

mentioning

confidence: 99%

CCN: A novel energy efficient greedy routing protocol for green computing

Siddiqa

Qureshi

Shah

et al. 2018

Concurrency and Computation

View full text Add to dashboard Cite

Summary We proposed a novel Energy Efficient Greedy Routing Protocol (EEGRP) in CCN for MANETs to achieve the gaps in the existing infrastructure of Green Cloud Computing. Initially, the consumer node broadcasts the interest packet; each relay node verifies if it is already satisfied, and then it drops the packet. Otherwise, the provider node selects shortest path to unicast data packet within minimum delay. Each relay node receives a data packet, stores its content in content store, and forwards it to next node according to path mention in the hop‐count field. If the data packet custodian node does not find path mention in the hop‐count field, then it searches the routing table entries to choose the second best path to unicast the data packet. EEGRP is implemented in three scenarios using ns2 and compare its performance with AIRDrop routing protocol on bases of three performance parameters like packet delivery ratio, delay, and energy consumption. EEGRP achieves high PDR with minimum delay and less energy consumption as compared to AIRDrop. Therefore, EEGRP is feasible to use on green computing and cloud technology. This can save energy issue to secure energy for Green Computing and Cloud before moving to full‐scale virtualization and Cloud services.

show abstract

“…hop distance and link quality) are utilized for the selection of forwarder node. Authors of previous work [6] presented an efficient content distribution scheme, called AIRDrop that conveys the data packet in a unicast manner. This scheme utilizes the extra data structures (i.e.…”

Section: Introductionmentioning

confidence: 99%

Location-Aware Forwarding and Caching in CCN-Based Mobile Ad Hoc Networks

Rehman

Kim

2016

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYContent centric network (CCN) is conceived as a good candidate for a futuristic Internet paradigm due to its simple and robust communication mechanism. By directly applying the CCN paradigm in wireless multihop mobile ad hoc networks, we experience various kind of issues such as packet flooding, data redundancy, packet collisions, and retransmissions etc., due to the broadcast nature of the wireless channel. To cope with the problems, in this study, we propose a novel location-aware forwarding and caching scheme for CCN-based mobile ad hoc networks. Extensive simulations are performed by using simulator, named ndnSIM. Experiment results show that proposed scheme does better as compared to other schemes in terms of content retrieval time and the number of Interest retransmissions triggered in the network.

show abstract

Efficient content delivery in mobile ad-hoc networks using CCN

Cited by 32 publications

References 25 publications

PIF and ReCiF: Efficient Interest-Packet Forwarding Mechanisms for Named-Data Wireless Mesh Networks

PIF and ReCiF: Efficient Interest-Packet Forwarding Mechanisms for Named-Data Wireless Mesh Networks

CCN: A novel energy efficient greedy routing protocol for green computing

Location-Aware Forwarding and Caching in CCN-Based Mobile Ad Hoc Networks

Contact Info

Product

Resources

About