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.
To satisfy requirements from various applications in the smart grid, transmitting data robustly and reliably has become one of the most crucial tasks. However, existing routing protocols like CTP, LEACH, HWMP cannot be directly applied to the smart grid system. In this paper, we propose RH-HWMP, which provides robust data transmission for the neighbor area network (NAN) in the smart grid. The main...
When two nodes in an opportunistic network meet, a utility function is generally employed to select the data that have to be exchanged between them, in order to maximize the chance of message delivery and to minimize congestion. The utility function computes weighted sums of various parameters, such as node centrality, similarity, trust, etc. Most of the existing solutions pre-compute the weights...
An opportunistic network (OPPNET) is an alternative to a mobile ad-hoc network (MANET) in which no complete path is needed. If a complete path is unavailable, the source node sends the message through relay nodes until the message arrives at its destination. Friendship-Based Routing (FBR) is routing scheme for an OPPNET which uses the inter-contact time of each node to find a good relay node. Unfortunately,...
In Opportunistic networks (OppNets), due to high mobility, short radio range, intermittent links, unstable topology, sparse connectivity, to name a few, routing is a very challenging task since it relies on cooperation between the nodes. This paper focuses on using the concept of centrality to alleviate this task. Unlike other nodes in the network, central nodes are those that are more likely to act...
In an Opportunistic Network (Oppnet), the transmission of messages between mobile devices is achieved in a store-carry-and-forward fashion since nodes store the incoming messages in their buffer and wait until a suitable next hop node is encountered that can carry the message closer to the destination. In such environment, due to the delay-tolerant nature of the network, designing a routing protocol...
Clustering is a widely used solution to provide routing scalability in wireless ad hoc networks. The design of clustering schemes is a complex problem due to the dynamic nature of this type of networks. This work proposes a Social-aware Clustering Scheme (SoCS) based on link history to improve the performance of clustering management operations. Each node maintains a history of past links with neighbour...
In Opportunistic Networks, information forwarding takes place when nodes are in communication range. Absence of knowledge on network topology prior information forwarding poses a compelling challenge in Opportunistic Networks. In these networks, disconnected mobile peers use mobility to opportunistically and dynamically connect to each other in order to disseminate heterogeneous information towards...
Mobile social networks (MSNs) where people contact each other through mobile devices have become increasingly popular. In this paper, we study a special kind of MSNs formed impromptu when people gather together at conferences, social events, etc. Multicast is an important routing service which supports the dissemination of messages to a group of users. Most of the existing related multicast algorithms...
Delay-, disruption-, and disconnection-tolerant networks (DTNs) implement the store-carry-forward (SCF) paradigm for message delivery, which can be used for data transmission when an end-to-end connection may never be reached. A number of SCF routing schemes have been developed to increase performance in various scenarios. In this paper, using the ONE Simulator, we investigate four SCF-based DTN routing...
A mobile Social Network (MSN) is a type of wireless networks formed by people moving around carrying mobile devices. In this paper, we specifically study the MSNs that are formed impromptu, e.g. when people gather together for a conference, event, or festival. We refer to them as Impromptu Mobile Social Networks (IMSNs), which allow people to communicate in a lightweight fashion based on contact opportunities...
Data dissemination in opportunistic networks poses a series of challenges, since there is no central entity aware of all the nodes' subscriptions. Each individual node is only aware of its own interests and those of a node that it is contact with, if any. Thus, dissemination is generally performed using epidemic algorithms that flood the network, but they have the disadvantage that the network overhead...
A Delay Tolerant Network (DTN) is a type of wireless mobile network that does not guarantee continuous network connectivity. One application can be found in the social communication networks that are becoming ever more ubiquitous with the development of more portable, affordable, and powerful mobile devices. In such a network, people move around and contact each other based on their common interests...
In Opportunistic Networks (OppNets), the existence of an end-to-end connected path between the sender and the receiver is not possible. Thus routing in this type of networks is different from the traditional Mobile Adhoc Networks (MANETs). MANETs assume the existence of a fixed route between the sender and the receiver before the start of the communication and till its completion. Routes are constructed...
Without the assumption of contemporaneous end to end connectivity in challenged wireless networks, Delay Tolerant Networking (DTN) routing is an important research area. The contribution in this paper is to take advantage of the proposed DTN geographic replication to overcome the limitation of topology based utility replication, since message replication is prevented due to the local maximum problem...
This work is focused on explore different heuristics that may be applied to provide a link-based cost for energy-aware multihop routing for wireless environments which integrate heterogeneous devices that are carried or owned by Internet end-users. We propose to analyze based on simulations of the different heuristics when applied to both distance-vector and link-state approaches, namely the AODV...
Rapidly changing link conditions make it difficult to accurately estimate the quality of wireless links and predict the fate of future transmissions. In particular bursty links pose a major challenge to online link estimation due to strong fluctuations in their transmission success rates at short time scales. Therefore, the prevalent approach in routing algorithms is to employ a long term link estimator...
Multi-path routing is effective to enhance network availability, by selecting multiple failure-independent paths for reaching one destination in the hope to survive individual path failures. Researchers suggest to select IP-layer topologically disjoint paths, assuming that they are failure-independent and can hardly fail simultaneously. Unfortunately, failure correlations lurking behind the IP-layer...
In a large and complex outsourcing organization, with millions of incidents being handled by hundreds of geographically dispersed workgroups, each workgroup is typically measured on the number of incidents it receives, the percentage it resolves, and the average duration for each incident it processes. Incidents that are misrouted will take longer to be resolved. This can lead to the situation where...
The Disruption Tolerant Networks (DTNs) are especially useful in providing mission critical services such as in emergency networks or battlefield scenarios. However, DTNs are vulnerable to insider attacks, in which the legitimate nodes are compromised and the adversary nodes launch blackhole attacks by dropping packets in the networks. The traditional approaches of securing routing protocols can not...
We concentrate on content-based retrieval in unstructured P2P networks consisting of thousands of peers that unpredictably join and leave the network. Such environments with permanent churning of peers require self-organizing mechanisms that should deal with sudden peer failures, arrivals of new peers, and continual changes of data or network topology. In this paper, we propose a self-organizing search...
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.