Content-centric networking (CCN) is designed for efficient dissemination of information. Several architectures are proposed CCN recently, but mobility issues not considered sufficiently. We classify traffic types into real-time and non real-time. examine problems each type, suggest the possible hand-off schemes over CCN. Then, we analyze delay performance in terms simulation study. believe that can be merged as a part easily, since they comply with inherent nature rules

An analytic model and results for the performance of multibuffered packet-switching interconnection networks in multiprocessor systems are presented. The single-buffered delta is first modeled using state transition diagram a buffer. then extended to account multiple buffers. compared simulation results. data manipulator analyzed demonstrate generality model.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Many routing algorithms, proposed for ad-hoc wireless networks, are based on source scheme. When a route is broken in routing, recovery and maintenance procedures executed. However these consume many resources. To minimize breaking, it important to find that endures longer time. Shortest path has short lifetime especially highly dense due the edge effect discovered this paper Some protocols such as SSA ABR considering link stability try finding more stable route. In paper, we will focus of...

In this paper, we address the problem of packet transmission from multiple sources to mobile sinks in large-scale sensor network. Each sink needs periodically update its location information into Due sinks, frequent updates are needed and causes enormous consumption limited battery power node. Several routing protocols, such as TTDD SEAD, suggest hierarchical approach for supporting sinks. These approaches, however, build grid structure or tree per event which much well, so they not suitable...

Recommendation systems become popular in our daily life. It is well known that the more release of users' personal data, better quality recommendation. However, such services raise serious privacy concerns for users. In this paper, focusing on matrix factorization-based recommendation systems, we propose first privacy-preserving factorization using fully homomorphic encryption. On inputs encrypted ratings, protocol performs over data and returns outputs so system knows nothing rating values...

To reduce the number of unnecessary handover in hierarchical macro/femto-cell networks, it is necessary to avoid macro → femto cell handovers temporary femtocell visitors who stay for a relatively short time. In this paper, we propose smart decision algorithm exploiting future mobility pattern prediction scheme prevent such visitors. Our simulation result shows that proposed effectively reduces handovers.

Wireless sensor networks offer many beneficial applications in various fields. However, because devices are limited their resources and susceptible to a variety of novel attacks, even few malicious adversaries can easily spread deceitful data make the be confusion without great efforts. Therefore, it is essential distinguish forged illegal nodes from innocent legal networks. In this paper, resilient wireless networks, we propose trust evaluation model which identify trustworthiness order...

Summary Content‐centric networking (CCN) has been recently proposed as an alternative to traditional IP‐based networking. In CCN, content is accessed by name instead of a host identifier (locational identifier). This new type access methodology rapidly and efficiently disseminates in combination with the in‐network caching mechanism. For practical use many network properties studied are being revisited, types CCN architecture components designed. Although mobility essential aspect future...

Improvements in wireless sensor network (WSN) technology have resulted a large number of applications. WSNs been mainly used for monitoring applications, but they are also applicable to target tracking, health care, and with multimedia data. Nodes generally deployed environments where the exhausted batteries nodes difficult charge or replace. The primary goal communication protocols is maximize energy efficiency order prolong lifetime. In this paper, various medium access control (MAC)...

IEEE 802.16e uses EAP-based authentication and key management for link layer security. Due to the lack of ability support mobility, however, becomes a principal impediment achievement an efficient secure handover in mobile WiMAX networks. In this paper, overview procedures latest standard is given their security flaws are analyzed. Possible solutions networks also proposed paper. The protocol guarantees backward/forward secrecy while gives little burden over previous protocols.

In this paper, we propose an efficient multihop broadcast protocol for asynchronous duty-cycled wireless sensor networks (EMBA) where each node independently wakes up according to its own schedule. EMBA adopts two techniques of the forwarder's guidance and overhearing messages ACKs. A transmits with neighbor nodes. The presents how forwards message nodes by using unicast transmissions. This technique significantly reduces redundant transmissions collisions. ACKs helps reduce number...

This paper presents a new trust evaluation scheme in an ad hoc network. To overcome the limited information about unfamiliar nodes and to reduce required memory space, we propose cluster-based scheme, which neighboring form cluster select one node as head. The head issues value certificate that can be referred by its non-neighbor nodes. In this way, of node's done very efficiently precisely. paper, present metric using some operations for forming managing cluster. An analysis proposed over...

A multistage interconnection network (MIN) for multiprocessor systems is proposed. The proposed MIN, called the B-network, uses backward links to provide paths requests blocked at switches or memory due contentions. gamma known contain a cube (specifically, inverse omega network) as substructure. B-network obtained from by preserving structure but reversing direction of all other links. These are used alternate path can be controlled simple destination tag control algorithm; packets...

The submesh allocation problem is to recognize and locate a free that can accommodate request for of specified size. In this paper, we propose new best-fit strategy mesh-connected multiprocessor systems. proposed maintains uses list an efficient allocation. For request, the selects which causes least amount potential processor fragmentation. As many large submeshes as possible are preserved later allocations. purpose, introduce novel function quantifying degree fragmentation submeshes. has...

Peer-to-peer systems and applications are distributed without any centralized control. The core operation in most peer-to-peer is efficient location of data items. current well-known like Napster Gnutella have scalability problem To solve the problem, some scalable lookup services show up, such as CAN, Chord, Pastry Tapestry. In this paper we propose a self organizing hierarchical virtual network infrastructure, called Grapes, for services. Hierarchical approach Grapes brings two benefits....

We study wormhole routed networks and their suitability for real-time traffic in a priority-driven paradigm. A traditional blocking flow control routing may lead to priority inversion the sense that high packets are blocked by low unlimited time. This uncontrolled causes frequent deadline missing. paper therefore proposes new called throttle preempt control, where can network resources held packets, if necessary. As result, this does not cause inversion. Our simulations show dramatically...

Two major goals of queue management are flow fairness and queue-length stability However, most prior works dealt with these independently. In this paper, we show that both can be effectively achieved at the same time. We propose a novel scheme realizes stability. proposed scheme, high-bandwidth flows identified via multilevel caching technique. Then, calculate base drop probability for resolving congestion stable queue, apply it to individual differently depending on their sending rates. Via...

SUMMARY In this paper, we propose a novel technique to deal with sudden bandwidth changes in transmission control protocol (TCP). the current Internet, may occur because of vertical handovers between heterogeneous access networks, routing path changes, cognitive ratio, and multi‐rate wireless local area network. The implementation TCP is designed optimized for stable networks does not adapt well upon changes. Consequently, it might suffer from packet losses burst decrement under‐utilization...

In IEEE-802.11-basedwireless mesh networks (WMNs), unfair bandwidth sharing may arise, because the carrier sense multiple access with collision avoidance protocol is designed to provide per-station fairness only in one hop.As hop count from a mobile client gateway node increases, throughput of drastically decreases.In this paper, we propose fair allocation scheme for multiradio multichannel WMNs.This provides among nodes WMN, regardless their distance node.To achieve fairness, first estimate...

Recently, heterogeneous networks with small cells have been widely used to increase the capacity of mobile systems. In such environments, accurate estimation mean cell sojourn time is critical for evaluating performance network and its applications. It especially important analyze times users as they reside in different tiers: either macro-cell-only or small-cell-covered areas. But because are deployed an irregular manner, it difficult derive analytical a area. this letter, we propose novel...

We focus on delivering radio engineers a practical design of macro-micro code division multiple access (CDMA) cellular overlays. First, we review our algorithmic approach to jointly deploy macrocells and microcells over today's big urban areas having spatially nonuniform traffic distributions. Next, identify several further issues related the optimal overlays enhance cell-deploying algorithm reflect these issues. The numerical results by extensive event-driven simulations show that resulting...

A novel high-performance packet-switching architecture, called the knockout switch, has been recently proposed. It is a nonblocking, cost-effective switch suitable for broadband packet switching. The authors give equations which can be used to derive loss probability and investigate under various uniform traffic patterns. They also compare with multistage nonuniform patterns.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>