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.
A Connected Dominating Set (CDS) is a subset V′ of V for the graph G(V, E) and induces a connected sub graph, such that each node in V - V′ is at least adjacent to one node in V′. CDSs have been proposed to formulate virtual backbones in wireless ad-hoc sensor networks to design routing protocols for alleviating the serious broadcast storms problem. It...
A Connected Dominating Set (CDS) performs a vital role in wireless ad-hoc sensor networks, which can establish a virtual backbone and thus leads to less maintenance overhead and information exchanges in wireless communications. In this paper, our algorithm first finds a prior CDS and then uses the Minimum-Weight Spanning Tree (MST) to optimize the result. Our algorithm applies effective degree, the...
In order to understand the message propagation performance in Mobile ad-hoc Networks (MANETs), various methods and models have been proposed in the literature by applying a common pair wise meeting rate between mobile nodes. In this paper, based on this classical meeting rate, we develop an Ordinary Differential Equations (ODEs) based analytical frame-work aiming at depicting the propagation process...
A Connected Dominating Set (CDS) is a subset V′ of V for the graph G(V, E) and induces a connected sub graph, such that each node in V -- V′ is at least adjacent to one node in V′. CDSs have been proposed to formulate virtual backbones in wireless ad-hoc sensor networks to design routing protocols for alleviating the serious broadcast storms problem. It...
To improve cooperative efficiency in mobile ad hoc networks, a relay-optimized cooperative MAC (RO-CMAC) protocol is proposed in this paper. In the protocol, an optimal relay is selected through two or three contention phases in case of low data rate of direct transmission from a sender to its recipient. In the first phase, all relays with the highest data rates to the sender and its recipient are...
The social-based forwarding scheme has recently been shown to be an effective solution to improve the performance of opportunistic routing. Most of the current works focus on the globally defined node centrality, resulting in a bias towards the most popular nodes. However, these nodes may not be appropriate relay candidates for some target nodes, because they may have low importance relative to these...
In this paper, we study a new full duplex relaying (FDR) network in which the relay has a buffer and works in decode-and-forward (DF) protocol. We investigate the performance of three models in terms of throughput, i.e., Full duplex relay without buffer-aided (conventional FDR), full duplex relay with unlimited buffer, and full duplex relay with limited buffer, respectively, and derive the closed-form...
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.