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.
In wireless sensor networks, an important challenge often faced in geographic greedy forwarding is the local minimum phenomenon which is caused by holes. For solving this problem, most hole-avoiding protocols route packets along the perimeter of holes or forbidden regions. Thus, sensor nodes on the perimeter of holes and forbidden regions exhaust their energy faster than others, which enlarge the...
Geographic routing is a scalable routing scheme for wireless networks, where nodes make local routing decisions using position information. Cooperative transmissions utilize spatial diversity to combat fading in wireless channels. In this paper, we incorporate cooperative transmissions into geographic routing, and propose the Location-Aware Cooperative Routing (LACR). In LACR, a node that receives...
This paper presents an efficient routing protocol on a Dynamic Cluster-based Wireless Sensor Network (WSN). The cluster-based architecture presented here is constructed dynamically. Unlike some previous routing protocol that finds the route on cluster-based architecture which is a spanning tree of graph G, our proposed protocol finds route on G. The cluster-based architecture is dynamic, thus it is...
Opportunistic routing employs transmission coordination mechanism (TCM) to reduce the total number of packet transmissions so as to improve end-to-end throughput. Existing paradigms use batch map to record the progress of packets transmitted in batch mode towards to destination, and then achieve distributed transmission coordination by exchanging batch map among candidate forwarders. However, the...
This paper presents an improved clustering routing protocol, ILEACH which based on the characteristic of limited energy of wireless sensor networks to prolong the lifetime of the whole networks. It takes nodes' residual energy into consideration during the process of cluster heads being elected. The constraint threshold of distance is used to optimize cluster scheme. Furthermore, it also constructs...
Unlike traditional wireless routing protocols which use a single fixed path, opportunistic routing explicitly takes advantage of the broadcast nature of wireless communications by using a set of forwarders to opportunistically perform packet forwarding. A key issue in the design of opportunistic routing protocols is the forwarder list selection problem. In this paper we establish a general theory...
Multipoint Video Conferencing (MVC) where multiple participants can be simultaneous sources of video requires low-delay, low packet loss and multipoint interaction synchronization. However, the synchronization issue is ignored by existing application-level multicast schemes and usually, it is addressed by a dedicated synchronizing controller at each peer. The controller needs to implement complicated...
In Mobile Ad hoc NETworks (MANETs), random access and dynamic routing are two critical techniques for mobile nodes to convey information without centralized scheduling. Conventionally, random access and dynamic routing are implemented at the Medium Access Control (MAC) and the network layer, respectively. However, the current MAC protocol Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA)...
In the ad hoc network of high mobility currently, there exists the problem of the high delay. This paper proposes to apply particle swarm optimization (PSO) strategy to improve this problem. Firstly, we present a hybrid particle swarm optimization (HPSO) algorithm combining genetic algorithm (GA), which is suitable to be used in a routing protocol, and then establish an on-demand routing protocol...
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.