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.
MANET (mobile ad hoc network) technology has become increasingly attractive for real-world applications in the past decade. Dynamic and intermittent connectivity caused by node mobility poses a huge challenge to the operation of MANETs that require end-to-end paths for communication. The attacks against critical nodes could result in a more degraded network service. In this paper, we evaluate the...
With the rapid advancement of wireless technology and the exponential increase of wireless devices in the past decades, there are more consumer applications for MANETs (mobile ad hoc networks) in addition to the traditional military uses. A resilient and robust MANET is essential to high service quality for applications. The dynamically changing topologies of MANETs pose a huge challenge to normal...
In order to understand the role of critical nodes in mobile ad hoc networks (MANETs), dynamic topologies are modelled as time-varying graphs and network topologies within a certain time window are aggregated as a weighted static graph. Critical node behaviour has been previously studied by evaluating how end-to-end throughput is impacted by the removal of high centrality nodes. However, different...
This paper presents a summary of work aimed at making current multihop routing in mobile ad hoc networks more sensitive to node mobility and ultimately improve routing performance in the face of node mobility. We discuss the various existing mobility tracking parameters, how they capture node mobility and also their shortfalls. We propose some mobility tracking schemes(heuristics) based on one of...
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...
We investigate the performance of a new distributed protocol for setting up and maintaining a backbone for multi-hop mobile networks with multiple radio interfaces. Our solution, termed MM-Backs, is effective in producing backbones with limited size, while being robust and reliable in the face of node mobility. We compare our protocol with a solution for mobile backbones running in single-radio networks...
In this contribution, we present SHARC, a Sharper Heuristic for Assignment of Robust Communities. This algorithm performs distributed network partitioning into communities using epidemic propagation of community labels and the computation of a neighborhood similarity metric. Due to its decentralized nature, SHARC is scalable and well suited for networks where no global knowledge nor node coordination...
In this paper we propose a connectivity index that allows each node to estimate how well it is connected to the rest of the network. We use this index to select the supernodes (SNs) that create a P2P overlay over ad hoc network. We show that applying this index to select the SNs, despite its simplicity, leads to a high robustness in the overlay network and decrease the overlay disconnection probability...
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.