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.
Opportunistic Networks (OppNets) are a sub-class of wireless Delay Tolerant Networks (DTNs) that can be utilized in areas of sporadic network connectivity. OppNets consist of a network of mobile devices that cooperate with each other to forward messages from the source to the destination. However, in a practical real-world setting, nodes behave selfishly and do not choose to be cooperative all throughout...
Opportunistic networks (Oppnets) use the Store, Carry, and Forward technique for routing of messages. This technique can increase the prospects of message delivery but it is resource intensive as messages are kept in node's buffer until an appropriate next hop node is find out. This may lead to increased overhead and buffer overflow that causes congestion. In view of this, a scheme based on centrality...
In Opportunistic Networks (Oppnets), a permanent fixed path is never assumed to be available between the source and destination. Nodes are not aware of changing network topology. So, static routing is not possible here and dynamic routing is best suited for such networks. In this paper, a Cloud Computing Based Routing Protocol (CCBRP) has been proposed for infrastructure-based Oppnets. It uses the...
Opportunistic Networks (Oppnets) are the recent evolution of Mobile Ad hoc Networks (MANETs), where an end to end path from the source to the destination does not exist, or exists for a very small amount of time. That is, the connections between the nodes are often intermittent, and the power of the nodes may go up or down. This paper aims at improving the forwarding strategy in the Epidemic routing...
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...
Mobile Ad-hoc Network (MANET) is a readily deployable wireless network suitable as a communication backbone during emergency response operations. These networks are infrastructure less. The goal of this paper is to simulate the scenarios for emergency situations. Various routing protocols have been proposed for MANETs like AODV, DSDV, LAR, DYMO, TORA etc. They are classified as proactive (table driven),...
Mobile Ad-hoc Network (MANET) is infrastructure less networks which can be rapidly deployed. This property makes MANET suitable in disaster management and such emergency situations. To analyse such scenarios, the node movements have been modelled variously as random waypoint, random walk, Manhattan grid model etc. Reference Point Group Mobility (RPGM) model is used in situations where nodes move in...
A mobile ad hoc network (MANET) is an infrastructure less and self-configuring network of mobile devices which dynamically form a network without the help of any centralized administration. Frequently changing network topology needs efficient dynamic routing protocols. The performance of any routing protocol depends on the duration of interconnection among the nodes in the network for transferring...
This paper presents a minimum spanning tree based graph theoretic approach (MSTB-GT), feeder routing in power distribution network including DGs. Graph theoretic is found to be much simpler and effective solution that significantly reduces the complexities of existing search algorithms and provides the optimal radial path while minimizing the cost. The proposed technique is tested for different topologies...
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.