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.
Biking has been more and more popular recently where public bicycle systems have been adopted in many cities around the world. However, to develop and design a successful public bicycle system is challenging. This work proposes a novel problem called Station Decision Problem for Bicycle Ad Hoc Networks. The problem is to find minimum number of stations while satisfying reach ability and richness conditions...
In the design of mobile ad hoc networks, a challenging problem is how to route information reliably and efficiently from one node to another in moderate to high level of mobility. In this paper, we propose a new routing protocol, called link effective available time (LEAT) routing. First, we propose a method to find the link available time during an epoch by measuring the distances between the two...
Wireless Sensor Networks have been proposed for a multitude of location-dependent application. Solutions in range-free localization are being pursued as a cost-effective alternative to more expensive range-based approaches. In this paper, we present an improved midnormal-based localization algorithm. Compared with its former scheme MBLA, our scheme performs with less compute overhead and improve the...
This paper describes the Authentication Test Theory of strand space firstly and the theory is expended because of the demands of mobile ad hoc network routing protocol security analysis. By analyzing the existing security DSR routing protocol leaks, a new Ariadne-S protocol model is proposed based on Ariadne routing protocol. And finally it is proved that the returning routing information from the...
For the design of mobile ad hoc networks, particularly those consisting of low-cost devices, we propose a new routing algorithm, called ranging-based link availability routing (RBLAR). In order to reduce link breakages during data services, we propose a new link cost, i.e., the unavailability of a link. In order to reduce the cost and complexity of the implementation, we propose to use only ranging...
MANET consists of wireless mobile nodes that could be self-configured. These nodes aren't supported by any established infrastructure. So it is commonly susceptible to various attacks. The relevant researches for MANETs currently focus on solving various security problems. In this article, we first briefly survey previous works regarding key management of MANETs, and then simply introduce the security...
Recreational cycling is a popular leisure activity in which the cyclist mostly is involved for a whole day at a time. This makes safety and comfort some of the most important factors to be attended to, especially when cycling in group. Group recreational cycling (GRC) is a new kind of tourism involving a courier and a number of tourists. Beside safety and comfort, tracking the cyclists, monitoring...
Usually, the radio channel allocation (RCA) problems of wireless LANs (WLANs) are solved by using various heuristic methods. However, it is not clear that the minmax problem is an NP-hard problem or not. In this paper, we consider WLANs with multiple APs that can be deployed in an ad hoc network. First, we propose a distributed heuristic algorithm (DHA) for RCA, which allocates channels in terms of...
Due to the high flexibility, mobility and low cost features, wireless ad hoc networks are widely used. A particularly challenging problem is how to feasibly detect and defend the major attacks against routing protocols of such networks that have susceptible links and dynamic topology. Most of the existing secure routing protocols for ad hoc networks either avoid the most challenging internal attacks...
In this paper, we propose a new energy-efficient routing algorithm for mobile ad hoc sensor networks. The network architecture is based on a two-tier energy-efficient clustering scheme. The number of active nodes is estimated in real-time based on signal power a node received from others. Each node tries to become a cluster head (CH) in an optimal probability that minimizes the total clustering energy...
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.