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.
Caching of popular content on wireless nodes is recently proposed as a means to reduce congestion in the backbone of cellular networks and to improve Quality of Service. From a network point of view, the goal is to offload as many users as possible from the backbone network to the wireless caches while at the same time offering good service to cache-unrelated users. Aggressive offloading can lead...
Mobile ad hoc networks (MANETs) play a significant role for communication whenever infrastructure is not available. In MANET, the group communication-based applications use the multicast routing protocol, where there is a single sender node and a group of receiver nodes. The benefits of multicast routing protocols are the capability to reduce the communication costs and saving the network resources...
Cluster structure is one of the most important structures that have received increasing attention over recent years. This paper presents a modification to the structure of the cluster tree Wireless Sensor Network (WSN) dividing clusters into sub-groups. Each group of these sub-groups operates like a tree from a small number of nodes. The results from the implemented adjustments indicate a significant...
This study investigates a light-weight data reduction technique for speeding-up shortest path and distance queries on large graphs. We propose a notion of routing proxies (or simply proxies), each of which represents a small subgraph, referred to as deterministic routing areas (DRAs). We show that routing proxies hold good properties for speeding-up shortest path and distance queries, and there exists...
Mobile ad hoc networks (MANET) is a type of networks that consists of autonomous nodes connecting directly without a top-down network architecture or central controller. Absence of base stations in MANET force the nodes to rely on their adjacent nodes in transmitting messages. The dynamic nature of MANET makes the relationship between nodes untrusted due to mobility of nodes. A malicious node may...
Future power networks are supposed to contain various power sources in mesh-like structures, including distributed generations such as solar panels, wind power generations, and electric vehicles (EVs) that work not only as transportation but as huge batteries. These power sources have their own characteristics such as cost, stability, amounts of CO2 emission, etc. Hence it is desired to use them efficiently...
In this work, an end-to-end indoor routing and guiding solution, ‘InLocW’ (InLoc - Wearable) is discussed. The initial location fix of the user is obtained using an infrastructure of BLE beacons. Primary focus is on continuous calculation of instantaneous walking direction (a primary arrow displayed on the smartwatch) based on user's current location estimated by a particle filter which runs in the...
Packet integrity or modification attacks commonly happen in Opportunistic Networks (OppNets). In this paper, we propose a technique that uses Merkle trees to protect the integrity of the packets transferred in a network. When adopting the technique in an OppNet, nodes will be able to verify that data transferred from node to node is received unchanged and in its original state. Using a solid trust...
Nowadays Mobile Ad Hoc Networks has become a popular research subject due to its characteristics. Generally Mobile Ad Hoc Networks have given the low physical security for mobile devices. With this problem there are many chances that the intruders may attack the nodes over the function. Using Intrusion Detection Techniques we can find the intruders before it may attack the nodes. Intrusion Detection...
In geographical network systems, face routing is the unique recovery solution for local minimum problem. A node in local minimum could not choose its neighbor node closer to the destination. Since the face routing is based on novel graph named planar graph, the nodes search a link between adjacent nodes in the graph and send their data via the link. During the planarization of the topology, many links...
Opportunistic Mobile Social Networks (MSNs) are a type of delay-tolerant networks that are composed of mobile nodes with social characteristics. Most of current research on forwarding algorithms for MSNs leverages the properties of social networks, such as community and centrality. However, the fundamental property, interaction, has not received sufficient attention. The effects of interactions consist...
In this paper, we present L-SCN, a new routing architecture for Service-Centric Networking (SCN), which makes use of a two-layer forwarding scheme composed of inter-domain and intra-domain communication. Unlike existing SCN routing architectures relying on a flat organization, our design splits the network into domains. Nodes within a domain possess significant knowledge about existing services and...
Electromagnetic-based Wireless Nano Sensor Networks (EM-WNSNs) working in the TeraHertz (THz) band are developing fast because of the high sensing resolution that benefits a wide range of applications. In EM-WNSNs, nano sinks that aggregate data from nano sensors to the Internet of Things (IoT) gateway collectively form a backhaul tier of EM-WNSNs. Unlike the data tier composed of densely deployed...
Aggregating common-path network flows (in the network interior) helps in improving the applications delivery performance. From the network edge perspective, the sender and receiver-ends of the respective applications need to have a typical one-to-one mapping. An aggregation framework in the network therefore needs an effective forking to maintain the one-to-one mapping of the flows. In this demo,...
In the past decades, various concepts of peer-to-peer (P2P) systems have been realized in desktop applications for stationary PCs. Last recent years show that computers have evolved to handy devices which can be used nearly everywhere, not only at home. For this reason, location-based services which allow to associate peers in a network with geographical positions, e.g. to track a device in emergency...
Empowered by the orthogonal frequency division multiplexing (OFDM) technology, elastic optical networks (EONs) have emerged as a promising solution for future high-speed networks. Routing and spectrum allocation (RSA) is one of the key challenges to the design of EONs. An adaptive RSA is required to meet the robustness objective of EONs. The relative cost concept can be used to implement an adaptive...
The exponential growth of internet traffic over the last twenty years presents a real challenge to ISP looking to ensure a reliable and efficient service to their customers. Network traffic is far from being straightforward to predict and a deep understanding of the routing domains is a first requirement to achieve proper management of the traffic. This paper focuses on the monitoring and characterization...
In mobile ad hoc networks (MANETs), when information about the location of the destination node is known, efficient communication can be achieved by using location-based routing protocols. Even in location-based routing protocols, with omnidirectional antennas there is some redundant route discovery by blind flooding of route request packets outside the area between the source and destination. These...
In this paper we demonstrate how limiting the number of copies each message that a node can send out as seen in Spray And Wait can be combined with probabilistic protocols such as Prophet, ProphetV2, and one that we created called Sparse. By limiting the number of copies that each node can send out we allow the routing protocols to scale much better than before when the number of nodes and messages...
Content-centric networking (CCN) is considered to be the future Internet which moves from host-to-host model to transfer data model based on content name. Network data caching is a characteristic of CCN whose effectiveness depends on the content caching policies in the nodes. Leave copy everywhere (LCE) is the default policy in CCN which caches all content at all nodes leading to poor caching performance...
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.