<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>Conference Paper</title>
<link href="http://hdl.handle.net/123456789/19" rel="alternate"/>
<subtitle/>
<id>http://hdl.handle.net/123456789/19</id>
<updated>2026-04-04T12:05:06Z</updated>
<dc:date>2026-04-04T12:05:06Z</dc:date>
<entry>
<title>Energy Efficient Cluster Based Routing Algorithm for Wireless Sensors Networks</title>
<link href="http://hdl.handle.net/123456789/7759" rel="alternate"/>
<author>
<name>Khalid Mahmood Awan</name>
</author>
<author>
<name>Ahmad Ali</name>
</author>
<author>
<name>Farhan Aadil</name>
</author>
<author>
<name>Kashif Naseer Qureshi</name>
</author>
<id>http://hdl.handle.net/123456789/7759</id>
<updated>2018-11-29T09:49:16Z</updated>
<published>2018-01-01T00:00:00Z</published>
<summary type="text">Energy Efficient Cluster Based Routing Algorithm for Wireless Sensors Networks
Khalid Mahmood Awan; Ahmad Ali; Farhan Aadil; Kashif Naseer Qureshi
Sensor based smart devices are becoming integral part of our life. With the advancement in sensor devices various automated systems based on sensors have been emerged. These systems automatically perform tasks on the basis of information provided by sensors to actuators that control the behavior of devices accordingly. Due to limited resources, energy constraints and interference in wireless sensor networks (WSNs) to obtain the longer performance from sensor nodes is challenging for researchers. Energy is very scarce resource in WSNs that need to be preserved for longer working of WSN. Transmitting data to the base station by sensor nodes simultaneously can create congestion in WSNs. Clustering effectively transmit data from all nodes towards BS as data is collected by cluster heads from all other nodes. Cluster heads then transmit collected data towards base station. A new algorithm is proposed in this paper, which uses clustering technique to form unequal sized clusters of sensor nodes to transmit data to the base station. This distributed algorithm calculates the residual energy of nodes, distance from base station and number of nodes in order to increase the life time of sensor networks. Results show that the proposed algorithm performs better and improves the network life time and lessens the energy utilization
</summary>
<dc:date>2018-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>An Energy and Link Aware Next Node Selection Protocol for Body Area Networks</title>
<link href="http://hdl.handle.net/123456789/7757" rel="alternate"/>
<author>
<name>Kashif Naseer Qureshi</name>
</author>
<author>
<name>Faisal Bashir</name>
</author>
<author>
<name>Abdul Hanan Abdullah</name>
</author>
<id>http://hdl.handle.net/123456789/7757</id>
<updated>2018-11-29T07:36:02Z</updated>
<published>2018-01-01T00:00:00Z</published>
<summary type="text">An Energy and Link Aware Next Node Selection Protocol for Body Area Networks
Kashif Naseer Qureshi; Faisal Bashir; Abdul Hanan Abdullah
Wireless Body Area Networks (WBANs) are designed for sensing the patient vital signs and forward the data to medical doctors or medical centers for further process. The small size intelligent sensor nodes are planted inside or outside the human body for various real-time healthcare and fitness applications. Due to body movement and interference in networks, the data communication has suffered to fulfill the quality of services requirements in terms of in time data delivery and energy consumption. In this paper, we propose an Energy and Link Aware Routing Protocol (ELA-RP) for next hop selection. Proposed protocol calculates the neighbor nodes parameters including energy level and link quality. It further balances the energy consumption and minimizes the data delay and maximizes the data delivery in the network. Extensive simulations experiments were performed to analyze the performance of proposed protocol with existing protocol. Simulation results indicated that proposed protocol has better mechanism to handle data routing and better in terms of energy consumption, data delivery and average delay.
</summary>
<dc:date>2018-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Term-Based Approach for Linking Digital News Stories</title>
<link href="http://hdl.handle.net/123456789/7758" rel="alternate"/>
<author>
<name>Muzammil Khan</name>
</author>
<author>
<name>Arif Ur Rahman</name>
</author>
<author>
<name>Muhammad Daud Awan</name>
</author>
<id>http://hdl.handle.net/123456789/7758</id>
<updated>2018-11-29T09:44:54Z</updated>
<published>2018-01-01T00:00:00Z</published>
<summary type="text">Term-Based Approach for Linking Digital News Stories
Muzammil Khan; Arif Ur Rahman; Muhammad Daud Awan
The World Wide Web has become a platform for news publication in the past few years. Many television channels, magazines and newspapers have started publishing digital versions of the news stories online. It is observed that recommendation systems can automatically process lengthy articles and identify similar articles to readers based on a predefined criteria i.e. collaborative filtering, content-based filtering approach. The paper presents a content-based similarity measure for linking digital news stories published in various newspapers during the preservation process. The study compares similarity of news articles based on human judgment with a similarity value computed automatically using common ratio measure for stories. The results are generalized by defining a threshold value based on multiple experimental results using the proposed approach.
</summary>
<dc:date>2018-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Promoting Collaborative Construction Process Management by Means of a Normalized Workload Approach</title>
<link href="http://hdl.handle.net/123456789/7764" rel="alternate"/>
<author>
<name>Christoph P. Schimanski</name>
</author>
<author>
<name>Carmen Marcher</name>
</author>
<author>
<name>Patrick Dallasega</name>
</author>
<author>
<name>Elisa Marengo</name>
</author>
<author>
<name>Camilla Follini</name>
</author>
<author>
<name>Arif U. Rahman</name>
</author>
<author>
<name>Andrea Revolti</name>
</author>
<author>
<name>Werner Nutt</name>
</author>
<author>
<name>Dominik T. Matt</name>
</author>
<id>http://hdl.handle.net/123456789/7764</id>
<updated>2018-11-29T13:29:59Z</updated>
<published>2018-01-01T00:00:00Z</published>
<summary type="text">Promoting Collaborative Construction Process Management by Means of a Normalized Workload Approach
Christoph P. Schimanski; Carmen Marcher; Patrick Dallasega; Elisa Marengo; Camilla Follini; Arif U. Rahman; Andrea Revolti; Werner Nutt; Dominik T. Matt
The research project »COCkPiT« - Collaborative Construction Process Management - aims at developing methodologies and tools to enhance time and budget control in construction projects, with a focus on small and medium-sized companies. The hypothesis is that the interplay of the three main phases of project management - planning, scheduling, and monitoring - can be improved by collecting highly detailed information early on in each phase, and making it available to the other phases at a high frequency. COCkPiT builds upon previous experiences in façade installation, where significant time and cost savings have been obtained by applying a normalized workload approach based on a collaborative process planning routine, an approach which is currently hardly supported by commercial project management tools. Thus, the objective of COCkPiT is to develop a methodology that supports i) collaborative process modelling as a basis for ii) a short-term rolling wave planning considering iii) real-time measurement of the progress on-site, to create highly reliable schedules and accurate forecasts. The focus of this paper is to present the conceptual fundamentals of integrating the modules of modelling, scheduling and monitoring, as well as involving the lean construction community to current considerations regarding the implementation in a self-containing IT-solution.
</summary>
<dc:date>2018-01-01T00:00:00Z</dc:date>
</entry>
</feed>
