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.
Reliability and predictability of the timing behavior have shown to be major issues for wireless sensor network deployments. Real-time requirements presented by several applications can be fulfilled by implementing communication schemes that lower possible sources of non-determinism of the timing behavior, assuming that the nodes are synchronized. The predictability of current synchronization protocols,...
In structured peer-to-peer (p2p) systems, distributed hash tables (DHTs) often partition the ID space into disjoint intervals with each interval assigned to the corresponding node. While nodes join and leave dynamically, one of the hard challenges posed by DHTs is load balancing across the ID space. Tries are known to be a viable data structure such that a balanced trie implies balanced intervals...
We consider service enhancement in a wireless environment in which clients try to obtain service from a set of servers. Each client desires a minimum overall service success probability, which is achieved by establishing multiple independent connections with multiple servers. Given the service success probability of each potential client-server connection, our problem is to assign the connections...
This paper presents GConf, a peer-to-peer Gossip-based delay sensitive N-to-N information dissemination protocol, intended for applications such as real-time multiparty conferencing. Through 3-way gossip-based exchanges with randomly selected peers, information frames can be spread throughout the whole community within a delay of 1.5 round-trip-times. The non-delivery probability can be improved exponentially...
Efficient information dissemination is one of the challenging tasks in most ad-hoc network application domains, be it in wireless sensor networks, mobile ad-hoc networks, or vehicular ad-hoc networks. It is obvious, that flooding has a high communication overhead, leading to channel congestion and packet collisions. Therefore, more efficient dissemination mechanisms were investigated and proposed...
Excellent P2P network infrastructure should support scalability and efficient search simultaneity. The intelligent routing mechanisms have flexible query expression but hold low scalability and recall rate. Contrastively, DHTs are scalable but either difficult to organize or too expensive for maintenance. A new structured P2P model is proposed in which resource storages are organized by match path...
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.