<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns="http://www.w3.org/2005/Atom">
<title>Proceedings papers</title>
<link href="http://dspace.library.iitb.ac.in/jspui/handle/100/1126" rel="alternate"/>
<subtitle/>
<id>http://dspace.library.iitb.ac.in/jspui/handle/100/1126</id>
<updated>2013-05-25T06:47:48Z</updated>
<dc:date>2013-05-25T06:47:48Z</dc:date>
<entry>
<title>On the path coverage by a non homogeneous sensor field</title>
<link href="http://dspace.library.iitb.ac.in/jspui/handle/100/2961" rel="alternate"/>
<author>
<name>MANOHAR, P</name>
</author>
<author>
<name>RAM, SS</name>
</author>
<author>
<name>MANJUNATH, D</name>
</author>
<id>http://dspace.library.iitb.ac.in/jspui/handle/100/2961</id>
<updated>2011-12-15T09:12:53Z</updated>
<published>2006-01-01T00:00:00Z</published>
<summary type="text">On the path coverage by a non homogeneous sensor field
MANOHAR, P; RAM, SS; MANJUNATH, D
We analyze the statistical properties of the coverage of a one-dimensional path induced by a two dimensional non homogeneous random sensor network. Sensor locations form a non homogeneous Poisson process and coverage area of each sensor is a circle of random i.i.d. radius. We first describe the one-dimensional coverage process on the line and describe an equivalent time-inhomogeneous Mt/Gt/8 queue whose busy period statistics will be equal to the coverage statistics of the line. We also obtain properties like conditional forward and backward hole-lengths. Additional results for the case of fixed coverage radius are obtained. We also obtain some numerical results for a deployment that has a 'Laplacian' intensity function.
</summary>
<dc:date>2006-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Model-based opportunistic channel access in Dynamic spectrum access networks</title>
<link href="http://dspace.library.iitb.ac.in/jspui/handle/100/2960" rel="alternate"/>
<author>
<name>SHARMA, M</name>
</author>
<author>
<name>SAHOO, A</name>
</author>
<author>
<name>NAYAK, KD</name>
</author>
<id>http://dspace.library.iitb.ac.in/jspui/handle/100/2960</id>
<updated>2011-12-15T09:12:53Z</updated>
<published>2009-01-01T00:00:00Z</published>
<summary type="text">Model-based opportunistic channel access in Dynamic spectrum access networks
SHARMA, M; SAHOO, A; NAYAK, KD
We propose a model-based channel access mechanism for cognitive radio-enabled secondary network, which opportunistically uses the channel of an unslotted primary network when the channel is sensed idle. We have considered IEEE 802.11 WLAN as a de facto primary network operating in ISM band. Our study focuses on a single WLAN channel that is used by WLAN clients and a WLAN server for a mix of Email, FTP, and HTTP-based web browsing applications. We model the occupancy of the channel by primary WLAN nodes as an alternating renewal process. The secondary node uses the model to estimate residual idle time duration after the channel is sensed idle, and opportunistically transmits frames in that duration. Our simulation results show that the performance of secondary network is sensitive to the channel sensing duration and that high secondary throughput can be achieved without affecting the primary network significantly by choosing appropriate value of channel sensing duration.
</summary>
<dc:date>2009-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Cloud computing over metropolitan area WDM networks : the Light-trails approach</title>
<link href="http://dspace.library.iitb.ac.in/jspui/handle/100/2959" rel="alternate"/>
<author>
<name>GOKHALE, P</name>
</author>
<author>
<name>KUMAR, R</name>
</author>
<author>
<name>DAS, T</name>
</author>
<author>
<name>GUMASTE, A</name>
</author>
<id>http://dspace.library.iitb.ac.in/jspui/handle/100/2959</id>
<updated>2011-12-15T09:12:53Z</updated>
<published>2010-01-01T00:00:00Z</published>
<summary type="text">Cloud computing over metropolitan area WDM networks : the Light-trails approach
GOKHALE, P; KUMAR, R; DAS, T; GUMASTE, A
Cloud computing and IT-service provisioning is critical for the growth of enterprises in being able to provision computationally intensive applications. A high-speed networks infrastructure is necessary for the proliferation of cloud computing to meet disparate IT application demands. Light-trails - a generalization of lightpath with ability to provision sub-wavelength demands, meet dynamic bandwidth needs and cater to optical multicasting in a low-cost platform are investigated as a candidate technology for cloud computing. A time-slotted light-trail system is assumed and an algorithm is proposed based on utility concepts. Scheduling connections over light-trails in a timely manner to meet the tasks of an IT-service are considered. Memory resource management as a constraint is further incorporated in the algorithm thereby making the IT application pragmatically reside over the light-trails infrastructure. An exhaustive simulations study showcases the benefits of light-trails for cloud computing - the results obtained are over a wide range of services with serial, parallel and mixed set of constituent tasks.
</summary>
<dc:date>2010-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Motion analysis marker for ease of image processing</title>
<link href="http://dspace.library.iitb.ac.in/jspui/handle/100/2958" rel="alternate"/>
<author>
<name>SETH, B</name>
</author>
<id>http://dspace.library.iitb.ac.in/jspui/handle/100/2958</id>
<updated>2011-12-15T09:12:53Z</updated>
<published>2009-01-01T00:00:00Z</published>
<summary type="text">Motion analysis marker for ease of image processing
SETH, B
High speed machines and mechanisms are often studied from a sequence of images obtained from high speed videography. The use of markers printed or attached on moving parts can greatly assist in tracking the moving parts. We present the design of a marker suitable for planar motion analysis of mechanism. The marker is designed to make the task of image processing computationally less intensive so as to make real time motion analysis practical. Rosenfeld equivalence table algorithm is used to segment the input image. The new geometry of marker facilitates automatic tracking and provides both position and orientation information. Hu invariant moments are used for recognition of the marker shape in the segmented image. Markers are uniquely identified on the basis of a text code that is placed in a designated location with respect to the marker geometry. In this method, the bounding box for the text code is computed. Knowing the orientation of the marker and therefore the text orientation, it is possible to transform the sub-image, containing the text, so that the text is aligned horizontally. This will permit a standard OCR routine to read the text code. The motion of various moving parts in image sequence can be easily inferred once the position and orientation of each of the marker is known.
</summary>
<dc:date>2009-01-01T00:00:00Z</dc:date>
</entry>
</feed>
