The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In underwater sensor networks (UWSNs), information transmission is extremely challenging because of the underwater channel. Underwater acoustic channel suffers from long propagation delay and low bandwidth is inclined to packet losses. Hence, the design of an energy efficient communication system is challenging under the water. In this paper, we present an energy efficient clustered multi-hop routing...
Flexibility and extendibility of Software Defined Networks allows development of diverse network management and flow monitoring techniques. Yet, there are inherent tradeoffs between the quality of flow monitoring and the required network resources. In particular, collecting flow statistics, at the level of specific source-destination addresses (and, moreover, specific protocols and ports), requires...
Egress selection in an Internet Service Provider (ISP) is the process of selecting an egress router to route interdomain traffic across the ISP such that a traffic engineering objective is achieved. In traditional ISP networks, traffic through the ISP is carried through the network and exits via an egress that is closest to the source in an attempt to minimize network resources for transit traffic...
Mobile entities are unrestricted to form communication grid without any predefined substructure in MANET. Though it offers great resilience, but extra challenges for MANETs to guard against malevolent attacks are also fetched. Various tactics have been anticipated to discourse probable challenges to network operation, but they rely on unbending solutions, which are operative only in anticipated set-ups...
Physical unclonable functions (PUFs) have become commercially available for anti-counterfeiting and authentication applications. PUF circuits are built on ASICs but can be implemented on FPGAs. For many electronic products, FPGAs are used in order to shorten development periods and reduce costs. Therefore, implementing PUFs on FPGAs can improve security in nearly all electronic products. However,...
Ancient Bagan is one of the culture heritage region of Myanmar and most tourist attraction areas. The trip planning mobile application of Ancient Bagan region is developed for providing efficient access to location-based information requires on the trip anywhere and anytime. The spatial index structure is an important role for retrieving the two dimensional geographical location effectively and efficiently...
Although IEEE 802.11p technology is standardized for road safety and efficiency applications, the channel congestion problem is its key weakness necessitating distributed congestion control (DCC) algorithms on different layers of the communication stack. In this paper, we propose DCC-enabled Contention based Forwarding scheme targeting multi-hop dissemination of Decentralised Event Notification Messages...
Information-Centric Networking (ICN) introduces a paradigm shift from a host centric communication model for Future Internet architectures. It supports the retrieval of a particular content regardless of the physical location of the content. Emergency network in a disaster scenario or disruptive network presents a significant challenge to the ICN deployment. In this paper, we present a Content dIstribution...
Dragonfly network is widely used in modern high-performance computing systems. On this network, however, interference caused by network sharing can lead to significant network congestion and degraded performance. In this work, we present a comparative analysis of intra-application interference on applications with nearest neighbor communication, considering various placement strategies. Our results...
A Flying Ad-hoc Network (FANET) is a wireless ad-hoc network specifically designed for the communication of Unmanned Aerial Vehicles (UAVs). Multicast routing is one of the vital aspects in wireless ad-hoc networks. Research works have been proposed to tackle the challenges in multicast routing in ad-hoc network environments with multi-hop communication. Nevertheless, the conventional multicast routing...
Most home sensor devices nowadays is based on low data rate and on-demand routing protocol such as Ad hoc On-demand Distance Vector (AODV). This routing protocol has less overhead and good efficiency in term of delivery ratio and bandwidth. AODV has two phases the route discover phase which discover route to the destination devices based on the shortest and the freshest hop, and the data delivery...
Nowadays in wireless network the energy consumption and sensor node energy renewable is major challenge. Which make sensor network weak and more critical. The problem of node reachability is considered and Amended Ant colony optimization technique is proposed for optimization. The proposed technique is used for the search of estimated solutions to distinct and endless optimization problems and for...
We consider the problem of group secret key generation through a multi-hop network modeled by a pair-wise independent network and propose a low complexity scheme which can guarantee strong secrecy. We assume that the legitimate transmitter only has the knowledge of the maximum number of precoded keys known to any helpers, where the precoded keys are the output of a precoder at the transmitter to be...
Byzantine attacks are constant threats in many applications such as disaster management, and battlefield applications. In this paper, we introduce a monitoring scheme in the link state routing protocol to secure the packets' route against Byzantine attacks. The goal of our proposed scheme is to guarantee communication among connected benign nodes in the network. Specifically, each node monitors the...
In order to adapt to the characteristics of high mobility, low density in Internet of Things, this paper proposes a novel P2P service discovery algorithm based on Markov. The Markov is used to achieve the prediction of the meeting time interval between any two nodes, and to construct a two-stage prediction model of meeting time interval. This paper uses the model to improve the Spay and Wait routing...
In this paper, we introduce the mixture communication method of single-flit and wormhole routing. In the method, a buffer memory is shared in each link and virtual channels are assigned. We also evaluated the dynamic communication performance with various amount of buffers. As a result, it was shown that the communication performance could be predicted from the packet length.
We consider a parallel-server system with K homogeneous servers where incoming tasks, arriving at rate λ, are dispatched by n dispatchers. Servers are FCFS queues and dispatchers implement a size-based policy such that the servers are equally loaded. We compare the performance of a system with n> 1 dispatchers and of a system with a single dispatcher. Every dispatcher handles a fraction 1/n of...
Balancing the load in content addressing schemes for route-restricted networks represents a challenge with a wide range of applications. Solutions based on greedy embeddings maintain minimal state information and enable efficient routing, but any such solutions currently result in either imbalanced content addressing, overloading individual nodes, or are unable to efficiently account for network dynamics...
The backpressure algorithm has been widely used as a distributed solution to the problem of joint rate control and routing in multi-hop data networks. By controlling a parameter V in the algorithm, the backpressure algorithm can achieve an arbitrarily small utility optimality gap. However, this in turn brings in a large queue length at each node and hence causes large network delay. This phenomenon...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.