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.
Dynamic ad hoc networks are mobile ad hoc networks (MANETs) where network characteristics, such as network density and node mobility, change significantly over time and space. Sometimes, dynamic ad hoc networks resemble a dense ad hoc network. At other times, they resemble a delay tolerant network. Many real networks follow the paradigm of dynamic ad hoc networks. Military networks, wildlife tracking...
IP address autoconfiguration poses a challenge for mobile ad hoc networks (MANETs) since it has to be done to ensure correct routing. Protocols for IP address autoconfiguration can be classified into two categories. In the stateless category, nodes in the network do not keep IP allocation information, thus duplicate address detection (DAD) is used to resolve possible address conflicts. Protocols in...
Routing is the foremost issue in mobile ad hoc networks (MANETs). In a wireless environment characterized by small bandwidth and limited computation resources, position- based routing is attractive because it requires little communication and storage overhead. To guarantee delivery and improve performance, most position-based routing protocols, e.g. GFG, forward a message in greedy mode until the...
Routing is the foremost issue in mobile ad hoc networks (MANETs). In a wireless environment characterized by small bandwidth and limited computational resources, position-based routing is attractive because it requires little communication and storage overhead. To guarantee delivery and improve performance, most position-based routing protocols, e.g. GFG, forward a message in greedy mode until the...
Recently, the use of a virtual backbone in various applications in mobile ad hoc networks (MANETs) has become popular. These applications include topology management, point and area coverage, and routing protocol design. In a MANET, one challenging issue is to construct a virtual backbone in a distributed and localized way while balancing several conflicting objectives: small approximation ratio,...
In existing query-based routing protocols in wireless sensor networks (WSNs), a node either keeps precise route information to desired events, such as in event flooding, or does not keep any route to desired events such as in query flooding. In this paper, we propose a routing protocol, called Hint-based Routing by Scope Decay Bloom Filter (HR-SDBF), that employs probabilistic hints. In HR-SDBF, each...
In this paper, we embed an incentive-compatible, efficient, and individual rational payment scheme into our cost- and stability-based routing protocol in ad hoc networks which consist of selfish nodes. Unlike traditional routing protocols in ad hoc networks, which only elicit cost information from selfish nodes, our protocol motivates selfish nodes to report truthfully both their stability and cost...
Any cast is a communication paradigm that was first introduced to the suit of routing protocols in IPv6 networks. In anycast, a packet is intended to be delivered to one of the nearest group hosts, k-anycast, however, is proposed to deliver a packet to any threshold k members of a set of hosts. In this paper, we propose three k-anycast routing schemes for mobile ad hoc networks. Our research work...
Compared to the traditional wireless network, the multi-hop ad hoc wireless network is self-configurable, dynamic, and distributed. During the past few years, many routing protocols have been proposed for this particular network environment. While in wired and optical networks, multi-protocol label switching (MPLS) has clearly shown its advantages in routing and switching such as flexibility, high...
Clustering provides an effective way for prolonging the lifetime of a wireless sensor network. Current clustering algorithms usually utilize two techniques, selecting cluster heads with more residual energy and rotating cluster heads periodically, to distribute the energy consumption among nodes in each cluster and extend the network lifetime. However, they rarely consider the hot spots problem in...
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.