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.
This paper is concerned with the time synchronization problem for a class of sensor networks where the underlying network topology switches among several topology candidates according to a Markovian switching process. A new kind of distributed synchronization algorithm based on average of the local time is provided and employed. To evaluate the energy consumption under different topology cases, a...
The personalized broadcast problem calls for a link schedule with the shortest makespan or slots to deliver all data located at a gateway destined for nodes in a multi-hop wireless network. In this paper, we address this fundamental problem with consideration for the multiple transmit or receive capability of nodes as well as their ability to boost the capacity of a link via spatial multiplexing or...
Recently, researchers have developed Wireless Mesh Networks (WMNs) where each router is capable of performing multiple transmissions or receptions concurrently; aka Multi Tx-Rx (MTR) WMNs. Consequently, each node is able to transmit (Tx) or receive (Rx) to/from its neighbors simultaneously. A fundamental problem in such WMNs is to derive a transmission schedule with minimal superframe length to maximize...
The routing protocol of structured peer-to-peer overlay networks influences the p2p network performances in route table maintenance, routing hops, and network churning. Current protocols we used usually maintain a O(logN) route table and O(logN) routing hops. To get better routing speed with less scale routing table, using O(1) node finger to get O(N) route path, a new protocol named CSSP was presented...
Performance of structured peer-to-peer overlay networks depends on the routing protocols. To get better routing speed with less scale routing table, using O (1) node finger to get O (N) route path, a new routing protocol named BCPP was presented. Structured by a bidirectional circle topology, this p2p network has a short routing table to record one super node, one successor node, one previous node...
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.