The document outlines a scalable data search system designed for large-scale mobile wireless networks utilizing client-server architecture. It discusses the approximation of coverage in sensor networks, dynamic routing for efficient communication, and system requirements for implementation. The findings aim to enhance planning and design tools for wireless sensor networks through computational geometry approaches.

1. A SCALABLE AND MOBILITY-RESILIENT DATA SEARCH SYSTEM FOR
1
LARGE-SCALE MOBILE WIRELESS NETWORKS
ABSTRACT
Client-server computing or networking is a distributed application architecture
that partitions tasks or workloads between service providers (servers) and service
requesters, called clients. Often clients and servers operate over a computer network
on separate hardware. A server machine is a high-performance host that is running one
or more server programs which share its resources with clients. The principal result is
an approximation to the proportion of the sensing area that is covered by at least one
sensing node, given the expected number of nodes per unit area in a two-dimensional
Poisson process. Random Geometric Graphs (RGGs) have been a very influential and
well-studied model of large networks, such as sensor networks, where the network
nodes are represented by the vertices of the RGG, and the direct connectivity between
nodes is represented by the edges. Dynamic Routing is a module for selecting (based
on multiple criteria) the best gateway/destination to be used for delivering a certain
call. The relationship between this approximation and non coverage by the sensors is
also examined. These results will have applications in planning and design tools for
wireless sensor networks, and studies of coverage employing
computational geometry.

2. EXISTING SYSTEM
2
 The implementation stage involves careful planning, investigation of the
existing system and it’s constraints on implementation, designing of methods
to achieve changeover and evaluation of changeover methods.
 The probability of a specified region being completely covered is also
approximated.
 A different setting to be studied is for the case when the connectivity radii are
different for different vertices.
 It would also be interesting to obtain further information about the
connectivity/disconnectivity periods like their variance or their distribution.
PROPOSED SYSTEM
 The proposed system Client-server computing or networking is a distributed
application architecture that partitions tasks or workloads between service
providers (servers) and service requesters, called clients.
 A client also shares any of its resources; Clients therefore initiate
communication sessions with servers which await (listen to) incoming
requests.
 The relationship between this approximation and non coverage by the sensors
is also examined.
 These results will have applications in planning and design tools for wireless
sensor networks, and studies of coverage employing computational geometry.
 Dynamic Routing is a module for selecting (based on multiple criteria) the
best gateway/destination to be used for delivering a certain call. Least Cost
Routing (LCR) is a special case of dynamic routing - when the rules are
ordered based on costs.

3. 3
SYSTEM REQUIREMENTS
SOFTWARE REQUIREMENTS
 Platform : JAVA (JDK 1.5)
 Front End : JAVA Swing
 IDE : NETBEANS 6.9
 Operating System : Microsoft Windows 2000 or XP
HARDWARE REQUIREMENTS
 Processor : Pentium IV Processor
 RAM : 512 MB
 Monitor : 14” VGA COLOR MONITOR
 Keyboard : 104 Keys