Learn More
— In this paper we propose new techniques to improve scheduling performance in time-slotted superframe based ad hoc networks. Such channel access technology is used in the IEEE 802.15.3 and 802.15.4 standards. Building on the performance analysis of previous proposals, we enhance the scheduling algorithms with flow state signaling and burst eligibility(More)
— Due to the scarce energy supplies of a wireless sensor network (WSN) it is necessary to design the architecture and operation of the network so as to optimize the energy consumption. Since in a multi-hop WSN a sensor spends most of its energy for relaying data packets it is important to shorten the distance a packet has to travel until reaching the sink.(More)
Optimizing energy consumption in wireless sensor networks is of paramount importance. There is a recent trend to deal with this problem by introducing mobile elements (sensors or sink nodes) in the network. The majority of these approaches assume time-driven scenarios and/or single-hop communication between participating nodes. However, there are several(More)
A sensor network consists of a large number of small, low-cost devices with sensing, processing and transmitting capabilities. The sensor nodes have limited battery power; therefore energy efficiency is a critical design issue. In this paper we propose to move the sink node, called Base Station (BS) so as to decrease the energy consumption of the whole(More)
Optimizing energy consumption in wireless sensor networks is of paramount importance. There is a recent trend to deal with this problem by introducing mobile elements (sensors or sink nodes) in the network. The majority of these approaches assume time-driven scenarios and/or single-hop communication between participating nodes. However, there are several(More)
Efficient handling of mobile nodes in a multicast environment is a non-trivial task. Solutions based on bi-directional tunneling introduce encapsulation and triangular routing. Those that use remote subscription need tree reconstruction, which is inefficient for rapidly moving nodes. In this paper we propose the M-HBH (Mobile Hop By Hop) multicast routing(More)
Despite its obvious suitability for distributed multimedia applications, multicasting has not yet found widespread application. Having analyzed shortcomings of today's approaches, we devise in the GCAP project a new end-to-end transport architecture for multimedia multicasting that supports partial order and partial reliability. In this paper, we argue(More)
Distributed Hash Table (DHT) algorithms structure peer-to-peer networks to provide nodes with fast and scal-able lookups. In recent DHT solutions, such as Chord and Kademlia, the contacts of a node in the overlay network are determined so as to keep up with a lookup cost of O(logN) in a network of N nodes. As opposed to these, one of the first DHT(More)