Search

Your search keyword '"Sardar, Humaira"' showing total 6 results
Start Over Author "Sardar, Humaira"
6 results on '"Sardar, Humaira"'

2. LOC algorithm

Author

Kashif Ashraf Khan, Sardar, primary, Loo, Jonathan, primary, Lasebae, Aboubaker, primary, Awais Azam, Muhammad, primary, Adeel, Muhammad, primary, Kausar, Rehana, primary, and Sardar, Humaira, primary

Published
2014
Full Text
View/download PDF

4. Hybrid content forwarding technique for Bluetooth communication environment.

Author

Khan, Sardar Kashif Ashraf, Loo, Jonathan, Azam, Muhammad Awais, Sardar, Humaira, Adeel, Muhammad, and Tokarchuk, Laurissa N

Abstract

In opportunistic networks, content forwarding is an exciting challenge due to no direct knowledge of routes to intended destinations. Forwarding decision is often based on node's local information or information provided by the encountering nodes to reduce the communication cost. This paper presents an orthodox yet unexplored approach for efficient content forwarding in Bluetooth communication environment. The new approach combines the characteristics of two different routing techniques, 1) social centrality based forwarding techniques used in opportunistic networks where nodes are sparsely exists, 2) traditional mobile ad-hoc networks (MANETs) protocols where proximity of nodes are close enough to form ad-hoc networks; hence named as Hybrid Content Forwarding Technique (HCF). The experimental results have shown that HCF not only improves the overall delivery ratio and delay but also reduces communication cost. Moreover, HCF efficiently adapts its forwarding technique according to network conditions. [ABSTRACT FROM PUBLISHER]

Published
2012

5. Enhanced Lobby Influence: Knowledge based content forwarding algorithm for opportunistic communication networks.

Author

Khan, Sardar Kashif Ashraf, Loo, Jonathan, Azam, Muhammad Awais, Sardar, Humaira, Adeel, Muhammad, and Tokarchuk, Laurissa N.

Abstract

Content transfer without any prior knowledge of the routes, always causes a challenge in opportunistic networks. Content forwarding in these networks have repercussions in the form of communication cost. Enhancement in content forwarding in opportunistic networks can be realized by targeting key nodes that show high degree of influence, popularity or knowledge inside the network. Based on these observations, this paper presents an improved version of Lobby Influence algorithm called Enhanced Lobby Influence. The forwarding decision of Enhanced Lobby Influence not only depends on the intermediate node selection criteria as defined in Lobby Influence but also based on the knowledge of previously direct content delivery of intended recipient. The experimental results have shown that the new algorithm performed extremely well against its predecessor Lobby Influence and illustrates that not only it reduces the communication cost but at the same time makes content delivery efficient for intended recipients. [ABSTRACT FROM PUBLISHER]

Published
2012

6. LOC algorithm.

Author

Khan, Sardar Kashif Ashraf, Loo, Jonathan, Lasebae, Aboubaker, Azam, Muhammad Awais, Adeel, Muhammad, Kausar, Rehana, and Sardar, Humaira

Abstract

Purpose -- This paper aims to propose an algorithm, location-aware opportunistic content forwarding (LOC), to improve message directivity using direction vectors in opportunistic networks. The LOC is based on the assumption that if approximate location of the destination node is known, then overall message delivery and cost can be improved. Efficient message delivery with low communication cost is a major challenge in current opportunistic networks. In these networks, nodes do not have prior knowledge of their recipients, and message forwarding can be achieved by selecting suitable forwarder based on some forwarding criteria, as compared to its ancestor mobile ad hoc networks. Design/methodology/approach -- In this paper, the authors tested LOC in two sets of mobility models, synthetic movement model and real mobility data sets. In the first set, working day movement is used as synthetic movement model, where proposed algorithm is compared against Lobby Influence (LI) and Epidemic algorithms. In the second set of experiments, the new algorithm is tested in three mobility data sets, namely, Cambridge, Reality and Sassy, and results compared against LI algorithm. The reason of using various movement models is to establish strengths and weaknesses of the proposed algorithm in different scenarios. Findings -- The experimental results show that the new algorithm performed extremely well in different scenarios, not only in terms of overall message delivery but also successfully managed to reduce the communication cost. Originality/value -- The new contribution increases the overall energy and storage efficiency of nodes by targeting relevant forwarding nodes in the network. [ABSTRACT FROM AUTHOR]

Published
2014
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results