Based on analysis of relationships between solution qualities and number of initial dynamic points in elastic net algorithm, we propose an improved elastic network algorithm (IENA) introduced in a heuristic cloning st...
详细信息
In wireless sensor networks, virtual backbone construction based on connected dominating set is a competitive issue for routing efficiency and topology control. Assume that a sensor networks is defined as a connected ...
详细信息
ISBN:
(纸本)9781424499199
In wireless sensor networks, virtual backbone construction based on connected dominating set is a competitive issue for routing efficiency and topology control. Assume that a sensor networks is defined as a connected unit disk graph (UDG). The problem is to find a minimum connected dominating set of given UDG with minimum routing cost for each node pair. We present a constant approximation scheme which produces a connected dominating set D, whose size |D| is within a factor α from that of the minimum connected dominating set and each node pair exists a routing path with all intermediate nodes in D and with length at most 5 · d(u,v), where d(u,v) is the length of shortest path of this node pair. A distributed algorithm is also provided with analogical performance. Extensive simulation shows that our distributed algorithm achieves significantly than the latest solution in research direction.
A network of many sensors and a base station that are deployed over a region is *** sensor has a transmission range,an interference range and a carrier sensing range,which are r,αr and βr,*** this paper,we study the...
详细信息
A network of many sensors and a base station that are deployed over a region is *** sensor has a transmission range,an interference range and a carrier sensing range,which are r,αr and βr,*** this paper,we study the minimum latency conflict-aware many-to-one data aggregation scheduling problem:Given locations of sensors along with a base station,a subset of all sensors,and parameters r,α and β,to find a schedule in which the data of each sensor in the subset can be transmitted to the base station with no conflicts,such that the latency is *** designe an algorithm based on maximal independent sets,which has a latency bound of(a+19b)R + Δb-a + 5 time slots,where a and b are two constant integers relying on α and β,Δ is the maximum degree of network topology,and R is the trivial lower bound of *** Δ contributes to an additive factor instead of a multiplicative one,thus our algorithm is nearly a constant(a+19b)-ratio.
Video has become popular in our daily life for both professional and consumer applications. Both low level video processing and high level semantic video analysis are critically computational tasks in application doma...
详细信息
in wireless sensor network, sensory readings are often noisy due to the imprecision of measuring hardware and the disturbance of deployment environment, so it is often inaccurate if we use individual sensor readings t...
详细信息
in this paper, we analyse the data access characteristics of a typical XML information retrieval system and propose a new query aware buffer replacement algorithm based on prediction of Minimum Reuse Distance (MRD for...
详细信息
In this paper,we consider skyline queries in a mobile and distributed environment,where data objects are distributed in some sites(database servers)which are interconnected through a high-speed wired network,and queri...
详细信息
In this paper,we consider skyline queries in a mobile and distributed environment,where data objects are distributed in some sites(database servers)which are interconnected through a high-speed wired network,and queries are issued by mobile units(laptop,cell phone,etc.)which access the data objects of database servers by wireless *** inherent properties of mobile computing environment such as mobility,limited wireless bandwidth,frequent disconnection,make skyline queries more *** show how to efficiently perform distributed skyline queries in a mobile environment and propose a skyline query processing approach,called efficient distributed skyline based on mobile computing(EDS-MC).In EDS-MC,a distributed skyline query is decomposed into five processing phases and each phase is elaborately designed in order to reduce the network communication,network delay and query response *** conduct extensive experiments in a simulated mobile database system,and the experimental results demonstrate the superiority of EDS-MC over other skyline query processing techniques on mobile computing.
knowledge management (KM) technologies and applications are fundamental to the success of KM programs. This paper aims to find out linkages between newly-developed KM theories and various technologies and their releva...
详细信息
XML Retrieval is becoming the focus study of the field of Information Retrieval and database. Summarization of the results which come from the XML search engines will alleviate the read burden of user's. However, ...
详细信息
暂无评论