This document discusses using small-world network concepts for routing in opportunistic networks. It analyzes three real-world datasets representing contact graphs and finds they exhibit small-world properties with high clustering and short path lengths. The document proposes a simple routing algorithm that applies these findings and concludes it outperforms other algorithms in simulations by taking temporal contact factors into account.
New prediction method for data spreading in social networks based on machine ...TELKOMNIKA JOURNAL
Information diffusion prediction is the study of the path of dissemination of news, information, or topics in a structured data such as a graph. Research in this area is focused on two goals, tracing the information diffusion path and finding the members that determine future the next path. The major problem of traditional approaches in this area is the use of simple probabilistic methods rather than intelligent methods. Recent years have seen growing interest in the use of machine learning algorithms in this field. Recently, deep learning, which is a branch of machine learning, has been increasingly used in the field of information diffusion prediction. This paper presents a machine learning method based on the graph neural network algorithm, which involves the selection of inactive vertices for activation based on the neighboring vertices that are active in a given scientific topic. Basically, in this method, information diffusion paths are predicted through the activation of inactive vertices byactive vertices. The method is tested on three scientific bibliography datasets: The Digital Bibliography and Library Project (DBLP), Pubmed, and Cora. The method attempts to answer the question that who will be the publisher of thenext article in a specific field of science. The comparison of the proposed method with other methods shows 10% and 5% improved precision in DBL Pand Pubmed datasets, respectively.
Delay Tolerant Networking routing as a Game Theory problem – An OverviewCSCJournals
This paper explores the theoretical approach to improve existing Delay and Disruption Tolerant Networking routing algorithms using Game Theory. Game Theory is a systematic study of strategic interaction among rational individuals. DTN deals with networks in challenged environment. DTN focuses on deep space to a broader class of heterogeneous networks that may suffer disruptions, affected by design decisions such as naming and addressing, message formats, data encoding methods, routing, congestion management and security. DTN is part of the Inter Planetary Internet with primary application being deep space networks. The hypothesis behind modeling DTN routing as a game is based on understanding that routing is also a strategic interaction between the DTN nodes. This brings cognitive abilities leading to automated routing decisions.
AN INTRODUCTION TO WIRELESS MOBILE SOCIAL NETWORKING IN OPPORTUNISTIC COMMUNI...ijdpsjournal
Next generation networks will certainly face requesting access from different parts of the
network. The heterogeneity of communication and application software’s changing situations in
the environment, from the users, the operators, the business requirements as well as the
technologies. Users will be more and more mobile, protocols, etc. will increase and render the
network more complex to manage. Opportunistic communication has emerged as a new
communication paradigm to cope with these problems. Opportunistic networksexploits the
variation of channel conditions, provides an additional degree of freedom in the time domain and
increase network performance.The limited spectrum and the inefficiency in the spectrum usage
require such a new communication to exploit the existing wireless spectrum opportunistically by
allocation of spectrum based on best opportunity among all possibilities
The purpose of the present scientific contribution is to investigate from the business economics standpoing the emerging phenomenon of company networks. In particular, through the analysis of the theory of networks will be proposed the principal categories of business networks, and even before this the concept of the network will be defined. The proposed research, qualitatively, represents the point of departure for the study of the network phenomenon in light of the current economic phase termed “economy of knowledge”. Moreover, the research questions are the following: From where does the theory of networks arise? Do company networks consider themselves equal to knowledge networks?
New prediction method for data spreading in social networks based on machine ...TELKOMNIKA JOURNAL
Information diffusion prediction is the study of the path of dissemination of news, information, or topics in a structured data such as a graph. Research in this area is focused on two goals, tracing the information diffusion path and finding the members that determine future the next path. The major problem of traditional approaches in this area is the use of simple probabilistic methods rather than intelligent methods. Recent years have seen growing interest in the use of machine learning algorithms in this field. Recently, deep learning, which is a branch of machine learning, has been increasingly used in the field of information diffusion prediction. This paper presents a machine learning method based on the graph neural network algorithm, which involves the selection of inactive vertices for activation based on the neighboring vertices that are active in a given scientific topic. Basically, in this method, information diffusion paths are predicted through the activation of inactive vertices byactive vertices. The method is tested on three scientific bibliography datasets: The Digital Bibliography and Library Project (DBLP), Pubmed, and Cora. The method attempts to answer the question that who will be the publisher of thenext article in a specific field of science. The comparison of the proposed method with other methods shows 10% and 5% improved precision in DBL Pand Pubmed datasets, respectively.
Delay Tolerant Networking routing as a Game Theory problem – An OverviewCSCJournals
This paper explores the theoretical approach to improve existing Delay and Disruption Tolerant Networking routing algorithms using Game Theory. Game Theory is a systematic study of strategic interaction among rational individuals. DTN deals with networks in challenged environment. DTN focuses on deep space to a broader class of heterogeneous networks that may suffer disruptions, affected by design decisions such as naming and addressing, message formats, data encoding methods, routing, congestion management and security. DTN is part of the Inter Planetary Internet with primary application being deep space networks. The hypothesis behind modeling DTN routing as a game is based on understanding that routing is also a strategic interaction between the DTN nodes. This brings cognitive abilities leading to automated routing decisions.
AN INTRODUCTION TO WIRELESS MOBILE SOCIAL NETWORKING IN OPPORTUNISTIC COMMUNI...ijdpsjournal
Next generation networks will certainly face requesting access from different parts of the
network. The heterogeneity of communication and application software’s changing situations in
the environment, from the users, the operators, the business requirements as well as the
technologies. Users will be more and more mobile, protocols, etc. will increase and render the
network more complex to manage. Opportunistic communication has emerged as a new
communication paradigm to cope with these problems. Opportunistic networksexploits the
variation of channel conditions, provides an additional degree of freedom in the time domain and
increase network performance.The limited spectrum and the inefficiency in the spectrum usage
require such a new communication to exploit the existing wireless spectrum opportunistically by
allocation of spectrum based on best opportunity among all possibilities
The purpose of the present scientific contribution is to investigate from the business economics standpoing the emerging phenomenon of company networks. In particular, through the analysis of the theory of networks will be proposed the principal categories of business networks, and even before this the concept of the network will be defined. The proposed research, qualitatively, represents the point of departure for the study of the network phenomenon in light of the current economic phase termed “economy of knowledge”. Moreover, the research questions are the following: From where does the theory of networks arise? Do company networks consider themselves equal to knowledge networks?
Maximizing p2 p file access availability in mobile ad hoc networks though rep...LeMeniz Infotech
Maximizing p2 p file access availability in mobile ad hoc networks though replication for efficient file sharing
Do Your Projects With Technology Experts
To Get this projects Call : 9566355386 / 99625 88976
Visit : www.lemenizinfotech.com / www.ieeemaster.com
Mail : projects@lemenizinfotech.com
TOP 10 AD HOC NETWORKS PAPERS: RECOMMENDED READING – NETWORK RESEARCHIJCNCJournal
The high-level contribution of this paper is a detailed simulation based analysis about the impact of mobility models on the performance of node-disjoint and link-disjoint multi-path routing algorithms for mobile ad hoc networks (MANETs).
Advancement in VANET Routing by Optimize the Centrality with ANT Colony Approachijceronline
In a wireless ad hoc network, an opportunistic routing strategy is a strategy where there is no predefined rule for choosing the next node to destination (as it is the case in conventional schemes such as OLSR, DSR or even Geo-Routing). A popular example of opportunistic routing is the “delay tolerant” forwarding to VANET network when a direct path to destination does not exist. Conventional routing in this case would just “drop” the packet. With opportunistic routing, a node acts upon the available information, In this thesis optimize the routing by centrality information then refine by ant colony metaheuristics. In this method validate our approach on different parameter like overhead, throughput.
Evaluating content-centric communication over power line communication infras...Khaled Ben Driss
"Evaluating content-centric networking over PLC infrastructure for smart grids" (ci-joint), cet article sera présenté à la conférence AWICT du 07 au 09 Octobre 2015 (http://www.awict.net/)
TOP 10 AD HOC NETWORKS PAPERS: RECOMMENDED READING – NETWORK RESEARCHIJCNCJournal
The high-level contribution of this paper is a detailed simulation based analysis about the impact of mobility models on the performance of node-disjoint and link-disjoint multipath routing algorithms for mobile ad hoc networks (MANETs).
Top Ten Read Articles - International Journal of Wireless & Mobile Networks (...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
Effects of mobility models and nodes distribution on wireless sensors networksijasuc
Wireless sensor networks (WSN) is an important future technology, in several applications in military,
health, environment and industries. Currently the integration of social and sensor is very important by
considering the characteristics of social networks in designing wireless sensor networks WSN for
improvement such as (number of messages from source to destination, radius of coverage, connectivity, and
spreading). This area has not received much attention and few researches focus on the performance
evaluation. In this paper we have studied the impact of different mobility and distribution models which is a
variable one should define which model is best for the infrastructure given their differences, also study
include the exact effect of nodes distribution and analyzed by calculation the number of messages of 12
cases to get a real performance evaluation under different conditions and same routing techniques. This
work provides us a greater understanding and clear an idea of the effect of mobility plus distribution.
SHADOWING EFFECTS ON ROUTING PROTOCOL OF MULTIHOP AD HOC NETWORKSijasuc
Two-ray ground reflection model has been widely used as the propagation model to investigate the
performance of an ad hoc network. But two-ray model is too simple to represent a real world network. A
more realistic model namely shadowing propagation model has been used in this investigation. Under
shadowing propagation model, a mobile node may receive a packet at a signal level that is below a
required threshold level. This low signal level affects the routing protocol as well as the medium access
control protocol of a network. An analytical model has been presented in this paper to investigate the
shadowing effects on the network performance. The analytical model has been verified via simulation
results. Simulation results show that the performance of a network becomes very poor if shadowing
propagation model is used in compare to the simple two-ray model. Two solutions have also been proposed
in this paper to overcome the effects of shadowing. One solution is a physical layer solution and the other
one is a Medium Access Control (MAC) layer solution. Simulation results show that these two solutions
reduce the shadowing effect and improve network performance.
An IoT platform is a fusion of physical resources such as connectors, wireless networks, smart phones and computer technologies viz; protocols, web service technologies, etc. the heterogeneity of used technologies generates a high cost at interoperability level. This paper presents a generic meta-model of IoT interoperability based on different organizational concepts such as service, compilation, activity and architectures. This model called M2IOTI, defines a very simple description of the IoT interoperability. M2IOTI is a meta-model of IoT interoperability by which one can build a model of IoT interoperability with different forms of organizations. We show that this meta-model allows for connected objects heterogeneity in semantic technologies, activities, services and architectures, in order to offer a high level at IoT interoperability. We also introduce the concept PSM which uses the same conceptual model to describe each interoperability model already existed. Such as conceptual, behavioral, semantic and dynamic models. We have also proposed a PIM model that regroups all the common concepts between the PSMs interoperability models.
Design of an Efficient Communication Protocol for 3d Interconnection NetworkIJMTST Journal
Three-dimensional integrated circuits (3D ICs) provide better device integration, reduced signal delay and reduced interconnect power. They additionally give better layout flexibility by permitting heterogeneous integration, by taking the advantage of intrinsic capability of reducing the wire length in 3D ICs, 3D NOC Bus Hybrid mesh layout was suggested. This layout provides an apparently significant stage to implement economical multicast routings for 3D networks-on-chip. A unique multicast partitioning and routing strategy for the 3D NOC-Bus Hybrid mesh architectures to improve the system performance and to decrease the power consumption is being proposed. The planned design exploits the useful attribute of a single-hop (bus-based) interlayer communication of the 3D stacked mesh design to supply superior hardware multicast support. Finally customized partitioning approach and an effective routing method is given to decrease the average hop count and network latency. Compared to the recently designed 3D NOC architectures being capable of supporting hardware multicasting, huge simulations with traffic profiles reveals design exploitation, which is the planned multicast routing strategy will facilitate significant performance enhancements.
A Deep Learning Model to Predict Congressional Roll Call Votes from Legislati...mlaij
Developments in natural language processing (NLP) techniques, convolutional neural networks (CNNs), and long-short- term memory networks (LSTMs) allow for a state-of-the-art automated system capable of predicting the status (pass/fail) of congressional roll call votes. The paper introduces a custom hybrid model labeled "Predict Text Classification Network" (PTCN), which inputs legislation and outputs a prediction of the document's classification (pass/fail). The convolutional layers and the LSTM layers automatically recognize features from the input data's latent space. The PTCN's custom architecture provides elements enabling adaptation to the input's variance from adjustment to the kernel weights over time. On the document level, the model reported an average evaluation of 67.32% using 10-fold crossvalidation. The results suggest that the model can recognize congressional voting behaviors from the associated legislation's language. Overall, the PTCN provides a solution with competitive performance to related systems targeting congressional roll call votes.
Network of Excellence in Internet Science (JRA1, Towards a Theory of Internet...i_scienceEU
The Network of Excellence in Internet Science aims to achieve a deeper multidisciplinary understanding of the Internet as a societal and technological artefact.
More information: http://internet-science.eu/
Twitter: @i_scienceEU
An information-theoretic, all-scales approach to comparing networksJim Bagrow
My presentation at NetSci 2018 on Portrait Divergence, a new approach to comparing networks that is simple, general-purpose, and easy to interpret.
The preprint: https://arxiv.org/abs/1804.03665
The code: https://github.com/bagrow/portrait-divergence
COMMUNITY DETECTION USING INTER CONTACT TIME AND SOCIAL CHARACTERISTICS BASED...ijasuc
Delay Tolerant Networks (DTNs) where the node connectivity is opportunistic and end-to-end path between
any pair of source and destination is not guaranteed most of the time. Hence the messages are transferred
from source to destination via intermediate nodes on hop to hop basis using store-carry-forward paradigm.
Due to quick advancement in hand held devices such as smart phone and laptop with support of wireless
communication interface carried by human being, it is possible in coming days to use DTNs for message
dissemination without setting up infrastructure. The routing task becomes challenging in DTNs due to
intermittent network connectivity and the connection opportunity arises only when node comes in
transmission range of each other. The performance of the routing protocols depend on the selection of
appropriate relay node which can deliver the message to final destination in case of source and destination
do not meet at all. Many social characteristics are exhibited by the human being like friendship,
community, similarity and centrality which can be exploited by the routing protocol in order to take the
forwarding decisions. Literature shows that by using these characteristics, the performance of DTN routing
protocols have been improved in terms of delivery probability. The existing routing schemes used
community detection using aggregated contact duration and contact frequency which does not change over
the time period. We propose community detection through Inter Contact Time (ICT) between node pair
using power law distribution where the members of community are added and removed dynamically. We
also considered single copy of each message in entire network to reduce the network overhead. The
proposed routing protocol named Social Based Single Copy Routing (SBSCR) selects the suitable relay
node from the community members only based on the social metrics such as similarity and friendship
together. ICTs show power law nature in human mobility which is used to detect the community structure at
each node. A node maintains its own community and social metrics such as similarity and friendship with
other nodes. Whenever node has to select the relay node then it selects from its community with higher
value of social metric. The simulations are conducted using ONE simulator on the real traces of campus
and conference environments. SBSCR is compared with existing schemes and results show that it
outperforms in terms of delivery probability and delivery delay with comparable overhead ratio.
Community Detection Using Inter Contact Time and Social Characteristics Based...jake henry
Delay Tolerant Networks (DTNs) where the node connectivity is opportunistic and end-to-end path between
any pair of source and destination is not guaranteed most of the time. Hence the messages are transferred
from source to destination via intermediate nodes on hop to hop basis using store-carry-forward paradigm.
Due to quick advancement in hand held devices such as smart phone and laptop with support of wireless
communication interface carried by human being, it is possible in coming days to use DTNs for message
dissemination without setting up infrastructure. The routing task becomes challenging in DTNs due to
intermittent network connectivity and the connection opportunity arises only when node comes in
transmission range of each other. The performance of the routing protocols depend on the selection of
appropriate relay node which can deliver the message to final destination in case of source and destination
do not meet at all. Many social characteristics are exhibited by the human being like friendship,
community, similarity and centrality which can be exploited by the routing protocol in order to take the
forwarding decisions. Literature shows that by using these characteristics, the performance of DTN routing
protocols have been improved in terms of delivery probability. The existing routing schemes used
community detection using aggregated contact duration and contact frequency which does not change over
the time period. We propose community detection through Inter Contact Time (ICT) between node pair
using power law distribution where the members of community are added and removed dynamically. We
also considered single copy of each message in entire network to reduce the network overhead. The
proposed routing protocol named Social Based Single Copy Routing (SBSCR) selects the suitable relay
node from the community members only based on the social metrics such as similarity and friendship
together. ICTs show power law nature in human mobility which is used to detect the community structure at
each node. A node maintains its own community and social metrics such as similarity and friendship with
other nodes. Whenever node has to select the relay node then it selects from its community with higher
value of social metric. The simulations are conducted using ONE simulator on the real traces of campus
and conference environments. SBSCR is compared with existing schemes and results show that it
outperforms in terms of delivery probability and delivery delay with comparable overhead ratio.
COMMUNITY DETECTION USING INTER CONTACT TIME AND SOCIAL CHARACTERISTICS BASED...ijasuc
Delay Tolerant Networks (DTNs) where the node connectivity is opportunistic and end-to-end path between
any pair of source and destination is not guaranteed most of the time. Hence the messages are transferred
from source to destination via intermediate nodes on hop to hop basis using store-carry-forward paradigm.
Due to quick advancement in hand held devices such as smart phone and laptop with support of wireless
communication interface carried by human being, it is possible in coming days to use DTNs for message
dissemination without setting up infrastructure. The routing task becomes challenging in DTNs due to
intermittent network connectivity and the connection opportunity arises only when node comes in
transmission range of each other. The performance of the routing protocols depend on the selection of
appropriate relay node which can deliver the message to final destination in case of source and destination
do not meet at all. Many social characteristics are exhibited by the human being like friendship,
community, similarity and centrality which can be exploited by the routing protocol in order to take the
forwarding decisions. Literature shows that by using these characteristics, the performance of DTN routing
protocols have been improved in terms of delivery probability. The existing routing schemes used
community detection using aggregated contact duration and contact frequency which does not change over
the time period. We propose community detection through Inter Contact Time (ICT) between node pair
using power law distribution where the members of community are added and removed dynamically. We
also considered single copy of each message in entire network to reduce the network overhead. The
proposed routing protocol named Social Based Single Copy Routing (SBSCR) selects the suitable relay
node from the community members only based on the social metrics such as similarity and friendship
together. ICTs show power law nature in human mobility which is used to detect the community structure at
each node. A node maintains its own community and social metrics such as similarity and friendship with
other nodes. Whenever node has to select the relay node then it selects from its community with higher
value of social metric. The simulations are conducted using ONE simulator on the real traces of campus
and conference environments. SBSCR is compared with existing schemes and results show that it
outperforms in terms of delivery probability and delivery delay with comparable overhead ratio.
Maximizing p2 p file access availability in mobile ad hoc networks though rep...LeMeniz Infotech
Maximizing p2 p file access availability in mobile ad hoc networks though replication for efficient file sharing
Do Your Projects With Technology Experts
To Get this projects Call : 9566355386 / 99625 88976
Visit : www.lemenizinfotech.com / www.ieeemaster.com
Mail : projects@lemenizinfotech.com
TOP 10 AD HOC NETWORKS PAPERS: RECOMMENDED READING – NETWORK RESEARCHIJCNCJournal
The high-level contribution of this paper is a detailed simulation based analysis about the impact of mobility models on the performance of node-disjoint and link-disjoint multi-path routing algorithms for mobile ad hoc networks (MANETs).
Advancement in VANET Routing by Optimize the Centrality with ANT Colony Approachijceronline
In a wireless ad hoc network, an opportunistic routing strategy is a strategy where there is no predefined rule for choosing the next node to destination (as it is the case in conventional schemes such as OLSR, DSR or even Geo-Routing). A popular example of opportunistic routing is the “delay tolerant” forwarding to VANET network when a direct path to destination does not exist. Conventional routing in this case would just “drop” the packet. With opportunistic routing, a node acts upon the available information, In this thesis optimize the routing by centrality information then refine by ant colony metaheuristics. In this method validate our approach on different parameter like overhead, throughput.
Evaluating content-centric communication over power line communication infras...Khaled Ben Driss
"Evaluating content-centric networking over PLC infrastructure for smart grids" (ci-joint), cet article sera présenté à la conférence AWICT du 07 au 09 Octobre 2015 (http://www.awict.net/)
TOP 10 AD HOC NETWORKS PAPERS: RECOMMENDED READING – NETWORK RESEARCHIJCNCJournal
The high-level contribution of this paper is a detailed simulation based analysis about the impact of mobility models on the performance of node-disjoint and link-disjoint multipath routing algorithms for mobile ad hoc networks (MANETs).
Top Ten Read Articles - International Journal of Wireless & Mobile Networks (...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
Effects of mobility models and nodes distribution on wireless sensors networksijasuc
Wireless sensor networks (WSN) is an important future technology, in several applications in military,
health, environment and industries. Currently the integration of social and sensor is very important by
considering the characteristics of social networks in designing wireless sensor networks WSN for
improvement such as (number of messages from source to destination, radius of coverage, connectivity, and
spreading). This area has not received much attention and few researches focus on the performance
evaluation. In this paper we have studied the impact of different mobility and distribution models which is a
variable one should define which model is best for the infrastructure given their differences, also study
include the exact effect of nodes distribution and analyzed by calculation the number of messages of 12
cases to get a real performance evaluation under different conditions and same routing techniques. This
work provides us a greater understanding and clear an idea of the effect of mobility plus distribution.
SHADOWING EFFECTS ON ROUTING PROTOCOL OF MULTIHOP AD HOC NETWORKSijasuc
Two-ray ground reflection model has been widely used as the propagation model to investigate the
performance of an ad hoc network. But two-ray model is too simple to represent a real world network. A
more realistic model namely shadowing propagation model has been used in this investigation. Under
shadowing propagation model, a mobile node may receive a packet at a signal level that is below a
required threshold level. This low signal level affects the routing protocol as well as the medium access
control protocol of a network. An analytical model has been presented in this paper to investigate the
shadowing effects on the network performance. The analytical model has been verified via simulation
results. Simulation results show that the performance of a network becomes very poor if shadowing
propagation model is used in compare to the simple two-ray model. Two solutions have also been proposed
in this paper to overcome the effects of shadowing. One solution is a physical layer solution and the other
one is a Medium Access Control (MAC) layer solution. Simulation results show that these two solutions
reduce the shadowing effect and improve network performance.
An IoT platform is a fusion of physical resources such as connectors, wireless networks, smart phones and computer technologies viz; protocols, web service technologies, etc. the heterogeneity of used technologies generates a high cost at interoperability level. This paper presents a generic meta-model of IoT interoperability based on different organizational concepts such as service, compilation, activity and architectures. This model called M2IOTI, defines a very simple description of the IoT interoperability. M2IOTI is a meta-model of IoT interoperability by which one can build a model of IoT interoperability with different forms of organizations. We show that this meta-model allows for connected objects heterogeneity in semantic technologies, activities, services and architectures, in order to offer a high level at IoT interoperability. We also introduce the concept PSM which uses the same conceptual model to describe each interoperability model already existed. Such as conceptual, behavioral, semantic and dynamic models. We have also proposed a PIM model that regroups all the common concepts between the PSMs interoperability models.
Design of an Efficient Communication Protocol for 3d Interconnection NetworkIJMTST Journal
Three-dimensional integrated circuits (3D ICs) provide better device integration, reduced signal delay and reduced interconnect power. They additionally give better layout flexibility by permitting heterogeneous integration, by taking the advantage of intrinsic capability of reducing the wire length in 3D ICs, 3D NOC Bus Hybrid mesh layout was suggested. This layout provides an apparently significant stage to implement economical multicast routings for 3D networks-on-chip. A unique multicast partitioning and routing strategy for the 3D NOC-Bus Hybrid mesh architectures to improve the system performance and to decrease the power consumption is being proposed. The planned design exploits the useful attribute of a single-hop (bus-based) interlayer communication of the 3D stacked mesh design to supply superior hardware multicast support. Finally customized partitioning approach and an effective routing method is given to decrease the average hop count and network latency. Compared to the recently designed 3D NOC architectures being capable of supporting hardware multicasting, huge simulations with traffic profiles reveals design exploitation, which is the planned multicast routing strategy will facilitate significant performance enhancements.
A Deep Learning Model to Predict Congressional Roll Call Votes from Legislati...mlaij
Developments in natural language processing (NLP) techniques, convolutional neural networks (CNNs), and long-short- term memory networks (LSTMs) allow for a state-of-the-art automated system capable of predicting the status (pass/fail) of congressional roll call votes. The paper introduces a custom hybrid model labeled "Predict Text Classification Network" (PTCN), which inputs legislation and outputs a prediction of the document's classification (pass/fail). The convolutional layers and the LSTM layers automatically recognize features from the input data's latent space. The PTCN's custom architecture provides elements enabling adaptation to the input's variance from adjustment to the kernel weights over time. On the document level, the model reported an average evaluation of 67.32% using 10-fold crossvalidation. The results suggest that the model can recognize congressional voting behaviors from the associated legislation's language. Overall, the PTCN provides a solution with competitive performance to related systems targeting congressional roll call votes.
Network of Excellence in Internet Science (JRA1, Towards a Theory of Internet...i_scienceEU
The Network of Excellence in Internet Science aims to achieve a deeper multidisciplinary understanding of the Internet as a societal and technological artefact.
More information: http://internet-science.eu/
Twitter: @i_scienceEU
An information-theoretic, all-scales approach to comparing networksJim Bagrow
My presentation at NetSci 2018 on Portrait Divergence, a new approach to comparing networks that is simple, general-purpose, and easy to interpret.
The preprint: https://arxiv.org/abs/1804.03665
The code: https://github.com/bagrow/portrait-divergence
COMMUNITY DETECTION USING INTER CONTACT TIME AND SOCIAL CHARACTERISTICS BASED...ijasuc
Delay Tolerant Networks (DTNs) where the node connectivity is opportunistic and end-to-end path between
any pair of source and destination is not guaranteed most of the time. Hence the messages are transferred
from source to destination via intermediate nodes on hop to hop basis using store-carry-forward paradigm.
Due to quick advancement in hand held devices such as smart phone and laptop with support of wireless
communication interface carried by human being, it is possible in coming days to use DTNs for message
dissemination without setting up infrastructure. The routing task becomes challenging in DTNs due to
intermittent network connectivity and the connection opportunity arises only when node comes in
transmission range of each other. The performance of the routing protocols depend on the selection of
appropriate relay node which can deliver the message to final destination in case of source and destination
do not meet at all. Many social characteristics are exhibited by the human being like friendship,
community, similarity and centrality which can be exploited by the routing protocol in order to take the
forwarding decisions. Literature shows that by using these characteristics, the performance of DTN routing
protocols have been improved in terms of delivery probability. The existing routing schemes used
community detection using aggregated contact duration and contact frequency which does not change over
the time period. We propose community detection through Inter Contact Time (ICT) between node pair
using power law distribution where the members of community are added and removed dynamically. We
also considered single copy of each message in entire network to reduce the network overhead. The
proposed routing protocol named Social Based Single Copy Routing (SBSCR) selects the suitable relay
node from the community members only based on the social metrics such as similarity and friendship
together. ICTs show power law nature in human mobility which is used to detect the community structure at
each node. A node maintains its own community and social metrics such as similarity and friendship with
other nodes. Whenever node has to select the relay node then it selects from its community with higher
value of social metric. The simulations are conducted using ONE simulator on the real traces of campus
and conference environments. SBSCR is compared with existing schemes and results show that it
outperforms in terms of delivery probability and delivery delay with comparable overhead ratio.
Community Detection Using Inter Contact Time and Social Characteristics Based...jake henry
Delay Tolerant Networks (DTNs) where the node connectivity is opportunistic and end-to-end path between
any pair of source and destination is not guaranteed most of the time. Hence the messages are transferred
from source to destination via intermediate nodes on hop to hop basis using store-carry-forward paradigm.
Due to quick advancement in hand held devices such as smart phone and laptop with support of wireless
communication interface carried by human being, it is possible in coming days to use DTNs for message
dissemination without setting up infrastructure. The routing task becomes challenging in DTNs due to
intermittent network connectivity and the connection opportunity arises only when node comes in
transmission range of each other. The performance of the routing protocols depend on the selection of
appropriate relay node which can deliver the message to final destination in case of source and destination
do not meet at all. Many social characteristics are exhibited by the human being like friendship,
community, similarity and centrality which can be exploited by the routing protocol in order to take the
forwarding decisions. Literature shows that by using these characteristics, the performance of DTN routing
protocols have been improved in terms of delivery probability. The existing routing schemes used
community detection using aggregated contact duration and contact frequency which does not change over
the time period. We propose community detection through Inter Contact Time (ICT) between node pair
using power law distribution where the members of community are added and removed dynamically. We
also considered single copy of each message in entire network to reduce the network overhead. The
proposed routing protocol named Social Based Single Copy Routing (SBSCR) selects the suitable relay
node from the community members only based on the social metrics such as similarity and friendship
together. ICTs show power law nature in human mobility which is used to detect the community structure at
each node. A node maintains its own community and social metrics such as similarity and friendship with
other nodes. Whenever node has to select the relay node then it selects from its community with higher
value of social metric. The simulations are conducted using ONE simulator on the real traces of campus
and conference environments. SBSCR is compared with existing schemes and results show that it
outperforms in terms of delivery probability and delivery delay with comparable overhead ratio.
COMMUNITY DETECTION USING INTER CONTACT TIME AND SOCIAL CHARACTERISTICS BASED...ijasuc
Delay Tolerant Networks (DTNs) where the node connectivity is opportunistic and end-to-end path between
any pair of source and destination is not guaranteed most of the time. Hence the messages are transferred
from source to destination via intermediate nodes on hop to hop basis using store-carry-forward paradigm.
Due to quick advancement in hand held devices such as smart phone and laptop with support of wireless
communication interface carried by human being, it is possible in coming days to use DTNs for message
dissemination without setting up infrastructure. The routing task becomes challenging in DTNs due to
intermittent network connectivity and the connection opportunity arises only when node comes in
transmission range of each other. The performance of the routing protocols depend on the selection of
appropriate relay node which can deliver the message to final destination in case of source and destination
do not meet at all. Many social characteristics are exhibited by the human being like friendship,
community, similarity and centrality which can be exploited by the routing protocol in order to take the
forwarding decisions. Literature shows that by using these characteristics, the performance of DTN routing
protocols have been improved in terms of delivery probability. The existing routing schemes used
community detection using aggregated contact duration and contact frequency which does not change over
the time period. We propose community detection through Inter Contact Time (ICT) between node pair
using power law distribution where the members of community are added and removed dynamically. We
also considered single copy of each message in entire network to reduce the network overhead. The
proposed routing protocol named Social Based Single Copy Routing (SBSCR) selects the suitable relay
node from the community members only based on the social metrics such as similarity and friendship
together. ICTs show power law nature in human mobility which is used to detect the community structure at
each node. A node maintains its own community and social metrics such as similarity and friendship with
other nodes. Whenever node has to select the relay node then it selects from its community with higher
value of social metric. The simulations are conducted using ONE simulator on the real traces of campus
and conference environments. SBSCR is compared with existing schemes and results show that it
outperforms in terms of delivery probability and delivery delay with comparable overhead ratio.
COMMUNICATIONS OF THE ACM November 2004Vol. 47, No. 11 15.docxmonicafrancis71118
COMMUNICATIONS OF THE ACM November 2004/Vol. 47, No. 11 15
N
etworks are hot. The
Internet has made it pos-
sible to observe and mea-
sure linkages
representing relationships of
all kinds. We now recognize
networks everywhere: air
traffic, banking, chemical
bonds, data communications,
ecosystems, finite element
grids, fractals, interstate
highways, journal citations,
material structures, nervous
systems, oil pipelines, orga-
nizational networks, power
grids, social structures, trans-
portation, voice communica-
tion, water supply, Web
URLs, and more.
Several fields are collabo-
rating on the development of
network theory, measurement,
and mapping: mathematics
(graph theory), sociology (net-
works of influence and communi-
cation), computing (Internet), and
business (organizational net-
works). This convergence has pro-
duced useful results for risk
assessment and reduction in com-
plex infrastructure networks,
attacking and defending networks,
protecting against network con-
nectivity failures, operating busi-
nesses, spreading epidemics
(pathogens as well as computer
viruses), and spreading innova-
tion. Here, I will survey the fun-
damental laws of networks that
enable these results.
Defining a Network
A network is usually defined as a
set of nodes and links. The nodes
represent entities such as persons,
machines, molecules, documents,
or businesses; the links represent
relationships between pairs of
entities. A link can be directed
(one-way relationship) or undi-
rected (mutual relationship). A
hop is a transition from one node
to another across a single link
separating them. A path is a series
of hops. Networks are very gen-
eral: they can represent any kind
of relation among entities.
Some common network
topologies (interconnection pat-
terns) have their own names:
clique or island (a connected sub-
network that may be isolated
from other cliques), hierarchical
network (tree structured), hub-
and-spoke network (a special
node, the hub, connected directly
to every other node), and multi-
hub network (several hubs con-
nected directly to many nodes).
Some network topologies are
planned, such as the electric grid,
the interstate highway system, or
Network Laws
M
IC
H
A
EL
S
LO
A
N
Peter J. Denning
Many networks, physical and social, are complex and scale-invariant.
This has important implications from the spread of epidemics and
innovations to protection from attack.
The Profession of IT
16 November 2004/Vol. 47, No. 11 COMMUNICATIONS OF THE ACM
the air traffic system; others are
unplanned. In his seminal papers
about the Internet, Paul Baran
proposed that a planned, distrib-
uted network would be more
resilient to failures than a hub-
and-spoke network.
A host of physical systems eas-
ily fit a network model. Perhaps
less obvious is that human social
networks also fit the model. The
individuals of an organization are
linked by their relationships—
who emails whom, who seeks
advice from whom, or who influ-
ences w.
ANALYSE THE PERFORMANCE OF MOBILE PEER TO PEER NETWORK USING ANT COLONY OPTIM...ijcsity
A mobile peer-to-peer computer network is the one in which each computer in the network can act as a
client or server for the other computers in the network. The communication process among the nodes in the
mobile peer to peer network requires more no of messages. Due to this large number of messages passing,
propose an interconnection structure called distributed Spanning Tree (DST) and it improves the efficiency
of the mobile peer to peer network. The proposed method improves the data availability and consistency
across the entire network and also reduces the data latency and the required number of message passes for
any specific application in the network. Further to enhance the effectiveness of the proposed system, the
DST network is optimized with the Ant Colony Optimization method. It gives the optimal solution of the
DST method and increased availability, enhanced consistency and scalability of the network. The
simulation results shows that reduces the number of message sent for any specific application and average
delay and increases the packet delivery ratio in the network.
Present new mechanisms for modelling multiple interfaces on a node, support for interference-limited links and a frame-work for modelling complex applications running on the nodes. Furthermore, provide an overview of concrete use cases where the simulator has been successfully exploited to study a variety of aspects related to opportunistic, message-based communications. Node movement is implemented by movement models. These are either synthetic models or existing movement traces. Connectivity between the nodes is based on their location, communication range and the bit-rate. The routing function is implemented by routing modules that decide which messages to forward over existing contacts. Finally, the messages themselves are generated either through event generators that generate random traffic between the nodes, or through applications that generate traffic based on application interactions. The main functions of the simulator are the modelling of node movement, inter-node contacts using various interfaces, routing, message handling and application interactions. Result collection and analysis are done through visualization, reports and post-processing tools.
Dear Student,
DREAMWEB TECHNO SOLUTIONS is one of the Hardware Training and Software Development centre available in
Trichy. Pioneer in corporate training, DREAMWEB TECHNO SOLUTIONS provides training in all software
development and IT-related courses, such as Embedded Systems, VLSI, MATLAB, JAVA, J2EE, CIVIL,
Power Electronics, and Power Systems. It’s certified and experienced faculty members have the
competence to train students, provide consultancy to organizations, and develop strategic
solutions for clients by integrating existing and emerging technologies.
ADD: No:73/5, 3rd Floor, Sri Kamatchi Complex, Opp City Hospital, Salai Road, Trichy-18
Contact @ 7200021403/04
phone: 0431-4050403
An efficient approach on spatial big data related to wireless networks and it...eSAT Journals
Abstract
Spatial big data acts as a important key role in wireless networks applications. In that spatial and spatio temporal problems contains the distinct role in big data and it’s compared to common relational problems. If we are solving those problems means describing the three applications for spatial big data. In each applications imposing the specific design and we are developing our work on highly scalable parallel processing for spatial big data in Hadoop frameworks by using map reduce computational model. Our results show that enables highly scalable implementations of algorithms using Hadoop for the purpose of spatial data processing problems. Inspite of developing these implementations requires specialized knowledge and user friendly.
Keywords: Spatial Big Data, Hadoop, Wireless Networks, Map reduce
DATA AGGREGATION AND PRIVACY FOR POLICE PATROLSijasuc
With a widespread growth in the potential applications of Wireless Sensor Networks, the need for reliable
security mechanisms for them has increased manifold. This paper proposes a scheme, Privacy for Police
Patrols (PPP), to provide secure data aggregation that relies on multilevel routing. Privacy factors have
been identified and implemented. Aggregates are prepared and the summary of information is gathered
and stored in a repository. The above defined approaches are integrated in police patrol applications and
preliminary results are obtained.
Sybian Technologies Pvt Ltd
Final Year Projects & Real Time live Projects
JAVA(All Domains)
DOTNET(All Domains)
ANDROID
EMBEDDED
VLSI
MATLAB
Project Support
Abstract, Diagrams, Review Details, Relevant Materials, Presentation,
Supporting Documents, Software E-Books,
Software Development Standards & Procedure
E-Book, Theory Classes, Lab Working Programs, Project Design & Implementation
24/7 lab session
Final Year Projects For BE,ME,B.Sc,M.Sc,B.Tech,BCA,MCA
PROJECT DOMAIN:
Cloud Computing
Networking
Network Security
PARALLEL AND DISTRIBUTED SYSTEM
Data Mining
Mobile Computing
Service Computing
Software Engineering
Image Processing
Bio Medical / Medical Imaging
Contact Details:
Sybian Technologies Pvt Ltd,
No,33/10 Meenakshi Sundaram Building,
Sivaji Street,
(Near T.nagar Bus Terminus)
T.Nagar,
Chennai-600 017
Ph:044 42070551
Mobile No:9790877889,9003254624,7708845605
Mail Id:sybianprojects@gmail.com,sunbeamvijay@yahoo.com
Sybian Technologies Pvt Ltd
Final Year Projects & Real Time live Projects
JAVA(All Domains)
DOTNET(All Domains)
ANDROID
EMBEDDED
VLSI
MATLAB
Project Support
Abstract, Diagrams, Review Details, Relevant Materials, Presentation,
Supporting Documents, Software E-Books,
Software Development Standards & Procedure
E-Book, Theory Classes, Lab Working Programs, Project Design & Implementation
24/7 lab session
Final Year Projects For BE,ME,B.Sc,M.Sc,B.Tech,BCA,MCA
PROJECT DOMAIN:
Cloud Computing
Networking
Network Security
PARALLEL AND DISTRIBUTED SYSTEM
Data Mining
Mobile Computing
Service Computing
Software Engineering
Image Processing
Bio Medical / Medical Imaging
Contact Details:
Sybian Technologies Pvt Ltd,
No,33/10 Meenakshi Sundaram Building,
Sivaji Street,
(Near T.nagar Bus Terminus)
T.Nagar,
Chennai-600 017
Ph:044 42070551
Mobile No:9790877889,9003254624,7708845605
Mail Id:sybianprojects@gmail.com,sunbeamvijay@yahoo.com
Sybian Technologies Pvt Ltd
Final Year Projects & Real Time live Projects
JAVA(All Domains)
DOTNET(All Domains)
ANDROID
EMBEDDED
VLSI
MATLAB
Project Support
Abstract, Diagrams, Review Details, Relevant Materials, Presentation,
Supporting Documents, Software E-Books,
Software Development Standards & Procedure
E-Book, Theory Classes, Lab Working Programs, Project Design & Implementation
24/7 lab session
Final Year Projects For BE,ME,B.Sc,M.Sc,B.Tech,BCA,MCA
PROJECT DOMAIN:
Cloud Computing
Networking
Network Security
PARALLEL AND DISTRIBUTED SYSTEM
Data Mining
Mobile Computing
Service Computing
Software Engineering
Image Processing
Bio Medical / Medical Imaging
Contact Details:
Sybian Technologies Pvt Ltd,
No,33/10 Meenakshi Sundaram Building,
Sivaji Street,
(Near T.nagar Bus Terminus)
T.Nagar,
Chennai-600 017
Ph:044 42070551
Mobile No:9790877889,9003254624,7708845605
Mail Id:sybianprojects@gmail.com,sunbeamvijay@yahoo.com
Broadcasting Scenario under Different Protocols in MANET: A Surveyrahulmonikasharma
A wireless network enables people to communicate and access applications and information without wires. This provides freedom of movement and the ability to extend applications to different parts of a building, city, or nearly anywhere in the world. Wireless networks allow people to interact with e-mail or browse the Internet from a location that they prefer. Adhoc Networks are self-organizing wireless networks, absent any fixed infrastructure. broadcasting of data through proper channel is essential. Various protocols are designed to avoid the loss of data. In this paper an overview of different broadcast protocols are discussed.
Characterization of directed diffusion protocol in wireless sensor networkijwmn
Wireless sensor network (WSN) has enormous applications in many places for monitoring the environments
of importance. Sensor nodes are capable of sensing, computing, and communicating. These sensor nodes
are energy constraint and operated by batteries. Since energy consumption is an important issue of WSN,
there have been many energy-efficient protocols proposed for the WSN. Directed diffusion (DD) is a datacentric
protocol that focuses on the energy efficiency of the networks. Since the first proposal of DD
protocol by Deborah, there have been various versions of DD protocols proposed by many scientists across
the globe. These upgraded versions of DD protocols add on various features to the original DD protocol
such as energy, scalability, network lifetime, security, reliability, and mobility. In this paper, we discuss
and classify various characteristics of themost populardirected diffusion protocols that have been proposed
over couple of years.
Similar to Six Degrees of Separation to Improve Routing in Opportunistic Networks (20)
Users Approach on Providing Feedback for Smart Home Devices – Phase IIijujournal
Smart Home technology has accomplished extraordinary success in making individuals' lives more straightforward and relaxing. Technology has recently brought about numerous savvy and refined frame works that advanced clever living innovation. In this paper, we will investigate the behavioral intention of user's approach to providing feedback for smart home devices. We will conduct an online survey for a sample of three to five students selected by simple random sampling to study the user's motto for giving feedback on smart home devices and their expectations. We have observed that most users are ready to actively share their input on smart home devices to improve the product's service and quality to fulfill the user’s needs and make their lives easier.
Users Approach on Providing Feedback for Smart Home Devices – Phase IIijujournal
Smart Home technology has accomplished extraordinary success in making individuals' lives more
straightforward and relaxing. Technology has recently brought about numerous savvy and refined frame
works that advanced clever living innovation. In this paper, we will investigate the behavioral intention of
user's approach to providing feedback for smart home devices. We will conduct an online survey for a
sample of three to five students selected by simple random sampling to study the user's motto for giving
feedback on smart home devices and their expectations. We have observed that most users are ready to
actively share their input on smart home devices to improve the product's service and quality to fulfill the
user’s needs and make their lives easier.
October 2023-Top Cited Articles in IJU.pdfijujournal
International Journal of Ubiquitous Computing (IJU) is a quarterly open access peer-reviewed journal that provides excellent international forum for sharing knowledge and results in theory, methodology and applications of ubiquitous computing. Current information age is witnessing a dramatic use of digital and electronic devices in the workplace and beyond. Ubiquitous Computing presents a rather arduous requirement of robustness, reliability and availability to the end user. Ubiquitous computing has received a significant and sustained research interest in terms of designing and deploying large scale and high performance computational applications in real life. The aim of the journal is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
ACCELERATION DETECTION OF LARGE (PROBABLY) PRIME NUMBERSijujournal
In order to avoid unnecessary applications of Miller-Rabin algorithm to the number in question, we resort
to trial division by a few initial prime numbers, since such a division take less time. How far we should go
with such a division is the that we are trying to answer in this paper?For the theory of the matter is fully
resolved. However, that in practice we do not have much use.Therefore, we present a solution that is
probably irrelevant to theorists, but it is very useful to people who have spent many nights to produce
large (probably) prime numbers using its own software.
A novel integrated approach for handling anomalies in RFID dataijujournal
Radio Frequency Identification (RFID) is a convenient technology employed in various applications. The
success of these RFID applications depends heavily on the quality of the data stream generated by RFID
readers. Due to various anomalies found predominantly in RFID data it limits the widespread adoption of
this technology. Our work is to eliminate the anomalies present in RFID data in an effective manner so that
it can be applied for high end applications. Our approach is a hybrid approach of middleware and
deferred because it is not always possible to remove all anomalies and redundancies in middleware. The
processing of other anomalies is deferred until the query time and cleaned by business rules. Experimental
results show that the proposed approach performs the cleaning in an effective manner compared to the
existing approaches.
UBIQUITOUS HEALTHCARE MONITORING SYSTEM USING INTEGRATED TRIAXIAL ACCELEROMET...ijujournal
Ubiquitous healthcare has become one of the prominent areas of research inorder to address the
challenges encountered in healthcare environment. In contribution to this area, this study developed a
system prototype that recommends diagonostic services based on physiological data collected in real time
from a distant patient. The prototype uses WBAN body sensors to be worn by the individual and an android
smart phone as a personal server. Physiological data is collected and uploaded to a Medical Health
Server (MHS) via GPRS/internet to be analysed. Our implemented prototype monitors the activity, location
and physiological data such as SpO2 and Heart Rate (HR) of the elderly and patients in rehabilitation. The
uploaded information can be accessed in real time by medical practitioners through a web application.
ENHANCING INDEPENDENT SENIOR LIVING THROUGH SMART HOME TECHNOLOGIESijujournal
The population of elderly folks is ballooning worldwide as people live longer. But getting older often
means declining health and trouble living solo. Smart home tech could keep an eye on old folks and get
help quickly when needed so they can stay independent. This paper looks at a system combining wireless
sensors, video watches, automation, resident monitoring, emergency detection, and remote access. Sensors
track health signs, activities, appliance use. Video analytics spot odd stuff like falls. Sensor fusion and
machine learning find normal patterns so wonks can see unhealthy changes and send alerts. Multi-channel
alerts reach caregivers and emergency folks. A LabVIEW can integrate devices and enables local and
remote oversight and can control and handle emergency responses. Benefits seem to be early illness clues,
quick help, less burden on caregivers, and optimized home settings. But will old folks use all this tech? Can
we prove it really helps folks live longer and better? More research on maximizing reliability and
evaluating real-world impacts is needed. But designed thoughtfully, smart homes could may profoundly
improve the aging experience.
HMR LOG ANALYZER: ANALYZE WEB APPLICATION LOGS OVER HADOOP MAPREDUCEijujournal
In today’s Internet world, log file analysis is becoming a necessary task for analyzing the customer’s
behavior in order to improve advertising and sales as well as for datasets like environment, medical,
banking system it is important to analyze the log data to get required knowledge from it. Web mining is the
process of discovering the knowledge from the web data. Log files are getting generated very fast at the
rate of 1-10 Mb/s per machine, a single data center can generate tens of terabytes of log data in a day.
These datasets are huge. In order to analyze such large datasets we need parallel processing system and
reliable data storage mechanism. Virtual database system is an effective solution for integrating the data
but it becomes inefficient for large datasets. The Hadoop framework provides reliable data storage by
Hadoop Distributed File System and MapReduce programming model which is a parallel processing
system for large datasets. Hadoop distributed file system breaks up input data and sends fractions of the
original data to several machines in hadoop cluster to hold blocks of data. This mechanism helps to
process log data in parallel using all the machines in the hadoop cluster and computes result efficiently.
The dominant approach provided by hadoop to “Store first query later”, loads the data to the Hadoop
Distributed File System and then executes queries written in Pig Latin. This approach reduces the response
time as well as the load on to the end system. This paper proposes a log analysis system using Hadoop
MapReduce which will provide accurate results in minimum response time.
SERVICE DISCOVERY – A SURVEY AND COMPARISONijujournal
With the increasing number of services in the internet, companies’ intranets, and home networks: service
discovery becomes an integral part of modern networked system. This paper provides a comprehensive
survey of major solutions for service discovery. We cover techniques and features used in existing systems.
Although a few survey articles have been published on this object, our contribution focuses on comparing
and analyzing surveyed solutions according eight prime criteria, which we have defined before. This
comparison will be helpful to determine limits of existing discovery protocols and identify future research
opportunities in service discovery.
SIX DEGREES OF SEPARATION TO IMPROVE ROUTING IN OPPORTUNISTIC NETWORKSijujournal
Opportunistic Networks are able to exploit social behavior to create connectivity opportunities. This
paradigm uses pair-wise contacts for routing messages between nodes. In this context we investigated if the
“six degrees of separation” conjecture of small-world networks can be used as a basis to route messages in
Opportunistic Networks. We propose a simple approach for routing that outperforms some popular
protocols in simulations that are carried out with real world traces using ONE simulator. We conclude that
static graph models are not suitable for underlay routing approaches in highly dynamic networks like
Opportunistic Networks without taking account of temporal factors such as time, duration and frequency of
previous encounters.
International Journal of Ubiquitous Computing (IJU)ijujournal
International Journal of Ubiquitous Computing (IJU) is a quarterly open access peer-reviewed journal that provides excellent international forum for sharing knowledge and results in theory, methodology and applications of ubiquitous computing. Current information age is witnessing a dramatic use of digital and electronic devices in the workplace and beyond. Ubiquitous Computing presents a rather arduous requirement of robustness, reliability and availability to the end user. Ubiquitous computing has received a significant and sustained research interest in terms of designing and deploying large scale and high performance computational applications in real life. The aim of the journal is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
PERVASIVE COMPUTING APPLIED TO THE CARE OF PATIENTS WITH DEMENTIA IN HOMECARE...ijujournal
The aging population and the consequent increase in the incidence of dementias is causing many
challenges to health systems, mainly related to infrastructure, low services quality and high costs. One
solution is to provide the care at house of the patient, through of home care services. However, it is not a
trivial task, since a patient with dementia requires constant care and monitoring from a caregiver, who
suffers physical and emotional overload. In this context, this work presents an modelling for development of
pervasive systems aimed at helping the care of these patients in order to lessen the burden of the caregiver
while the patient continue to receive the necessary care.
A proposed Novel Approach for Sentiment Analysis and Opinion Miningijujournal
as the people are being dependent on internet the requirement of user view analysis is increasing
exponentially. Customer posts their experience and opinion about the product policy and services. But,
because of the massive volume of reviews, customers can’t read all reviews. In order to solve this problem,
a lot of research is being carried out in Opinion Mining. In order to solve this problem, a lot of research is
being carried out in Opinion Mining. Through the Opinion Mining, we can know about contents of whole
product reviews, Blogs are websites that allow one or more individuals to write about things they want to
share with other The valuable data contained in posts from a large number of users across geographic,
demographic and cultural boundaries provide a rich data source not only for commercial exploitation but
also for psychological & sociopolitical research. This paper tries to demonstrate the plausibility of the idea
through our clustering and classifying opinion mining experiment on analysis of blog posts on recent
product policy and services reviews. We are proposing a Nobel approach for analyzing the Review for the
customer opinion
International Journal of Ubiquitous Computing (IJU)ijujournal
International Journal of Ubiquitous Computing (IJU) is a quarterly open access peer-reviewed journal that provides excellent international forum for sharing knowledge and results in theory, methodology and applications of ubiquitous computing. Current information age is witnessing a dramatic use of digital and electronic devices in the workplace and beyond. Ubiquitous Computing presents a rather arduous requirement of robustness, reliability and availability to the end user. Ubiquitous computing has received a significant and sustained research interest in terms of designing and deploying large scale and high performance computational applications in real life. The aim of the journal is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
USABILITY ENGINEERING OF GAMES: A COMPARATIVE ANALYSIS OF MEASURING EXCITEMEN...ijujournal
Usability engineering and usability testing are concepts that continue to evolve. Interesting research studies
and new ideas come up every now and then. This paper tests the hypothesis of using an EDA-based
physiological measurements as a usability testing tool by considering three measures; which are observers‟
opinions, self-reported data and EDA-based physiological sensor data. These data were analyzed
comparatively and statistically. It concludes by discussing the findings that has been obtained from those
subjective and objective measures, which partially supports the hypothesis.
SECURED SMART SYSTEM DESING IN PERVASIVE COMPUTING ENVIRONMENT USING VCSijujournal
Ubiquitous Computing uses mobile phones or tiny devices for application development with sensors
embedded in mobile phones. The information generated by these devices is a big task in collection and
storage. For further, the data transmission to the intended destination is delay tolerant. In this paper, we
made an attempt to propose a new security algorithm for providing security to Pervasive Computing
Environment (PCE) system using Public-key Encryption (PKE) algorithm, Biometric Security (BS)
algorithm and Visual Cryptography Scheme (VCS) algorithm. In the proposed PCE monitoring system it
automates various home appliances using VCS and also provides security against intrusion using Zigbee
IEEE 802.15.4 based Sensor Network, GSM and Wi-Fi networks are embedded through a standard Home
gateway.
PERFORMANCE COMPARISON OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijujournal
Routing protocols have an important role in any Mobile Ad Hoc Network (MANET). Researchers have
elaborated several routing protocols that possess different performance levels. In this paper we give a
performance evaluation of AODV, DSR, DSDV, OLSR and DYMO routing protocols in Mobile Ad Hoc
Networks (MANETS) to determine the best in different scenarios. We analyse these MANET routing
protocols by using NS-2 simulator. We specify how the Number of Nodes parameter influences their
performance. In this study, performance is calculated in terms of Packet Delivery Ratio, Average End to
End Delay, Normalised Routing Load and Average Throughput.
Optical Character Recognition (OCR) is a technique, used to convert scanned image into editable text
format. Many different types of Optical Character Recognition (OCR) tools are commercially available
today; it is a useful and popular method for different types of applications. OCR can predict the accurate
result depends on text pre-processing and segmentation algorithms. Image quality is one of the most
important factors that improve quality of recognition in performing OCR tools. Images can be processed
independently (.png, .jpg, and .gif files) or in multi-page PDF documents (.pdf). The primary objective of
this work is to provide the overview of various Optical Character Recognition (OCR) tools and analyses of
their performance by applying the two factors of OCR tool performance i.e. accuracy and error rate.
Optical Character Recognition (OCR) is a technique, used to convert scanned image into editable text
format. Many different types of Optical Character Recognition (OCR) tools are commercially available
today; it is a useful and popular method for different types of applications. OCR can predict the accurate
result depends on text pre-processing and segmentation algorithms. Image quality is one of the most
important factors that improve quality of recognition in performing OCR tools. Images can be processed
independently (.png, .jpg, and .gif files) or in multi-page PDF documents (.pdf). The primary objective of
this work is to provide the overview of various Optical Character Recognition (OCR) tools and analyses of
their performance by applying the two factors of OCR tool performance i.e. accuracy and error rate.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to
different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high
throughput for the network and increase the chance for multi path routing. This is because the multiple
channel availability for transmission decreases the probability of the most elegant problem called as
interference problem which is either of interflow and intraflow type. For avoiding the problem like
interference and maintaining the constant network performance or increasing the performance the WMN
need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting
several packets ready for transmission and sending them to the intended recipient through the channel,
while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different
available multiple paths is most the important factor in the both case for a routing algorithm. Hence the
most challenging factor is to determine a forwarding strategy which will provide the schedule for each
node for transmission within the channel. In this research work we have tried to implement two forwarding
strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We
have implemented Global State Routing (GSR) which will consider the packet forwarding concept and
Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding
and packet aggregation. After the successful implementation the network performance has been measured
by means of simulation study.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Generative AI Deep Dive: Advancing from Proof of Concept to ProductionAggregage
Join Maher Hanafi, VP of Engineering at Betterworks, in this new session where he'll share a practical framework to transform Gen AI prototypes into impactful products! He'll delve into the complexities of data collection and management, model selection and optimization, and ensuring security, scalability, and responsible use.
Welocme to ViralQR, your best QR code generator.ViralQR
Welcome to ViralQR, your best QR code generator available on the market!
At ViralQR, we design static and dynamic QR codes. Our mission is to make business operations easier and customer engagement more powerful through the use of QR technology. Be it a small-scale business or a huge enterprise, our easy-to-use platform provides multiple choices that can be tailored according to your company's branding and marketing strategies.
Our Vision
We are here to make the process of creating QR codes easy and smooth, thus enhancing customer interaction and making business more fluid. We very strongly believe in the ability of QR codes to change the world for businesses in their interaction with customers and are set on making that technology accessible and usable far and wide.
Our Achievements
Ever since its inception, we have successfully served many clients by offering QR codes in their marketing, service delivery, and collection of feedback across various industries. Our platform has been recognized for its ease of use and amazing features, which helped a business to make QR codes.
Our Services
At ViralQR, here is a comprehensive suite of services that caters to your very needs:
Static QR Codes: Create free static QR codes. These QR codes are able to store significant information such as URLs, vCards, plain text, emails and SMS, Wi-Fi credentials, and Bitcoin addresses.
Dynamic QR codes: These also have all the advanced features but are subscription-based. They can directly link to PDF files, images, micro-landing pages, social accounts, review forms, business pages, and applications. In addition, they can be branded with CTAs, frames, patterns, colors, and logos to enhance your branding.
Pricing and Packages
Additionally, there is a 14-day free offer to ViralQR, which is an exceptional opportunity for new users to take a feel of this platform. One can easily subscribe from there and experience the full dynamic of using QR codes. The subscription plans are not only meant for business; they are priced very flexibly so that literally every business could afford to benefit from our service.
Why choose us?
ViralQR will provide services for marketing, advertising, catering, retail, and the like. The QR codes can be posted on fliers, packaging, merchandise, and banners, as well as to substitute for cash and cards in a restaurant or coffee shop. With QR codes integrated into your business, improve customer engagement and streamline operations.
Comprehensive Analytics
Subscribers of ViralQR receive detailed analytics and tracking tools in light of having a view of the core values of QR code performance. Our analytics dashboard shows aggregate views and unique views, as well as detailed information about each impression, including time, device, browser, and estimated location by city and country.
So, thank you for choosing ViralQR; we have an offer of nothing but the best in terms of QR code services to meet business diversity!
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
Le nuove frontiere dell'AI nell'RPA con UiPath Autopilot™UiPathCommunity
In questo evento online gratuito, organizzato dalla Community Italiana di UiPath, potrai esplorare le nuove funzionalità di Autopilot, il tool che integra l'Intelligenza Artificiale nei processi di sviluppo e utilizzo delle Automazioni.
📕 Vedremo insieme alcuni esempi dell'utilizzo di Autopilot in diversi tool della Suite UiPath:
Autopilot per Studio Web
Autopilot per Studio
Autopilot per Apps
Clipboard AI
GenAI applicata alla Document Understanding
👨🏫👨💻 Speakers:
Stefano Negro, UiPath MVPx3, RPA Tech Lead @ BSP Consultant
Flavio Martinelli, UiPath MVP 2023, Technical Account Manager @UiPath
Andrei Tasca, RPA Solutions Team Lead @NTT Data
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...
Six Degrees of Separation to Improve Routing in Opportunistic Networks
1. International Journal of UbiComp (IJU), Vol.4, No.3, July 2013
DOI:10.5121/iju.2013.4302 11
SIX DEGREES OF SEPARATION TO IMPROVE
ROUTING IN OPPORTUNISTIC NETWORKS
Carlos O. Rolim1
, Valderi R. Q. Leithardt1
, Anubis G. Rossetto1
,
Tatiana F. M. dos Santos2
, Adriano M. Souza2
, Cláudio F. R. Geyer1
1
Institute of Informatics – Federal University of Rio Grande do Sul (UFRGS)
P.O. Box 15.064 – 91.501-970 – Porto Alegre – RS – Brazil
{carlos.oberdan, valderi.quietinho, agmrossetto, geyer}@inf.ufrgs.br
2
Postgraduate Program in Production Engineering – Federal University of Santa Maria
(UFSM) – 97105-900 – Santa Maria – RS – Brazil
taty.nanda@gmail.com, amsouza@ufsm.br
ABSTRACT
Opportunistic Networks are able to exploit social behavior to create connectivity opportunities. This
paradigm uses pair-wise contacts for routing messages between nodes. In this context we investigated if the
“six degrees of separation” conjecture of small-world networks can be used as a basis to route messages in
Opportunistic Networks. We propose a simple approach for routing that outperforms some popular
protocols in simulations that are carried out with real world traces using ONE simulator. We conclude that
static graph models are not suitable for underlay routing approaches in highly dynamic networks like
Opportunistic Networks without taking account of temporal factors such as time, duration and frequency of
previous encounters.
KEYWORDS
Opportunistic Networks, Routing Algorithm, Data Dissemination, Complex Networks, Small-World
Networks, Graphs
1. INTRODUCTION
In everyday life improvements of mobile devices with wireless technologies, such as IEEE
802.11, WiMAX, Bluetooth, and other short range radio solutions (sensor devices), lead to a
myriad of new ubiquitous applications ranging from simple messaging systems to cyber-physical
environments that may even encompass an entire city [1].
Making this prospect a reality, raises a number of challenges. One of these concerns the use of
mobile computing as an underlying technology to supply collaboratively sensed data and social
networking metadata for these ubiquitous services. In wide-scale urban scenarios, only using
wireless infrastructures (e.g. cellular, WLAN, or WiMAX networks) to provide services is not
satisfactory, as it is very unlikely that wireless infrastructures alone will be able to provide
enough bandwidth and coverage for the huge number of devices spread throughout the
environment [2]. Another important consideration is that current mobile computing applications
are infrastructure-centric, which forces users to be acutely aware of their connectivity
environment, with many applications only working when the networking infrastructure is
available.
An alternative way of overcoming these limitations is the use of Opportunistic Networks.
Opportunistic Networks are a recent mobile networking paradigm stemming from research into
conventional Mobile Ad Hoc NET-works (MANET) [3]. In this paradigm, nodes are assumed to
2. International Journal of UbiComp (IJU), Vol.4, No.3, July 2013
12
be mobile, and the forwarding of messages is based on the Store-Carry and Forward concept.
Opportunistic Networks represent the first attempt to close the gap between human and network
behavior by adopting a user-centric approach to networking and exploiting user nodes’ mobility
as an opportunity—rather than a challenge—to improve data forwarding [4].
A problem in this context is how to route data between nodes in a suitable way (i.e. with high
delivery rate, low latency and low overhead). There are several initiatives which can be taken
to meet these requirements. The proposed solutions involve adopting different approaches,
ranging from “naïve” (i.e. the use of “blindly” flooding techniques to reach the destination node)
to “intelligent” (i.e. with an emphasis on social factors in routing messages). However, to the best
of our knowledge, none of the existing studies has attempted to apply small-world network
concepts [5] for this purpose. The idea of incorporating this class of complex networks in
Opportunistic Networks is driven by the most recent studies of human mobility and social
contacts; these are using graph models to better understand and represent the degree of social
connection between people [6]. Hence, this paper aims to investigate the question of whether the
“six degrees of separation” conjecture of small-world networks can be used as a basis for routing
improvements in Opportunistic Networks.
In summary, the contributions made by this paper are twofold: first there is a demonstration that
static graph models are not suited to underlay routing approaches in highly dynamic networks
(like Opportunistic Networks which do not take account of temporal factors such as time,
duration and frequency of encounters). Second it shows that the application of these findings in a
simple routing algorithm can surpass the performance of other algorithms in terms of the number
of messages, delivery and overhead. In addition to being original, these features signal the
direction for further research in this area.
The rest of this paper is structured as follows: The next section provides information about
Opportunistic Networks and some related initiatives, with a focus on routing; Section III provides
a brief outline of small-networks and some concepts used in this work; Section IV describes our
study and examines the existence of small-world networks in some selected real traces; Section V
analyzes the results of the experiments; and, finally we conclude this paper in Section VI.
2. ROUTING IN OPPORTUNISTIC NETWORKS
Opportunistic networking is a technology with good prospects of fulfilling the ubiquitous vision
[7]. This new paradigm is sometimes referred to in the literature as delay-tolerant networks
(DTN). The DTN architecture and protocols are currently under study and being defined by the
Internet Research Task Force’s Delay Tolerant Networking Research Group. Opportunistic
Networks is a general concept as it does not assume any compatibility with the Internet
architecture, nor any a priori knowledge regarding the network topology, areas of disconnection,
or future link availability [4]. Opportunistic Networks seeks to simplify the complexity at the
network layer by removing the assumption of physical end-to-end connectivity while providing
connectivity opportunities for pervasive devices when no direct access to the Internet is available.
Pervasive devices, equipped with different wireless networking technologies (e.g. Bluetooth), are
frequently out of range from a network but are in the range of other networked devices, and
sometimes cross areas where some type of connectivity is available (e.g. Wi-Fi hotspots). Thus,
they can opportunistically exploit their mobility and contacts for data delivery [7]. As a result, a
new type of DTN has emerged called Pocket Switched Networks (PSN). PSN is a networking
paradigm, which uses human mobility and a store-and-forward strategy to solve the
communication problem outside the connectivity islands [8]. In this paper we will employ the
term Opportunistic Network because it includes more general concepts.
3. International Journal of UbiComp (IJU), Vol.4, No.3, July 2013
13
The current widely used approaches in this area range from special-purpose networks — like the
Sámi Network Connectivity project — to general-purpose networking — like the Haggle project.
In specific fields, it should be noted that there are ongoing attempts, mainly in the area of data
dissemination and routing protocols employing different underlying techniques. There is no
consensus among researchers about how to classify these protocols, but the most commonly used
criteria for classification are the role of contextual information and the social factors for routing.
Thus, protocols shift from being “naïve” (i.e. using no or slight contextual information) to
“intelligent” (i.e. using contextual information such as location, history, connectivity or social
information for intelligent decision- making). In this way, [9] classified protocols into three
classes: context-oblivious, mobility-based, and socially relevant/context-aware. As it is not within
the scope of this article, we will not explain and separate it into categories. However the
following initiatives should be cited: Epidemic, Spray&Wait (and the Spray variants like
Spray&Focus, Fuzzy-Spray and others), Prophet, BubbleRap, MobySpace, AFRON, CAR,
HiBOp, Propicman and the most recent Prophet improvement called DRAFT. All of these
represent attempts to optimize message routing (see [10] for further information).
After conducting an investigation we found that the most recent and influential studies are using
some kind of socially-aware factors. This led us to explore in greater depth how the social
interactions are represented and analyzed. We found that the two most widely used classes of
complex networks for this purpose are scale-free networks and small-world networks. Scale-free
networks are networks where degree distribution of links between nodes follows a mathematical
function called power law. In contrast, small-world networks are networks that follow the “six
degrees of separation” conjecture [5]. The scope of this paper will be confined to small-world
networks because it was evident that none of the studies in the literature was concerned with this
area and this stimulated us to make further investigations. In the next section we will examine
related concepts to provide the reader with a general background of this subject.
3. SMALL-WORLD NETWORKS
Complex networks are graphs with non-trivial features like those that occur in simple networks
such as lattices or random graphs. Real examples of this graph can be cited like biological,
technological and social networks. This scientific area is relatively new and a good deal of work
is being carried out using basically two classes of complex networks: scale-free networks and
small-world networks. In this paper, we will avoid dealing with the former because we intend to
exploit the “hub” features of these networks in future work.
In 1967, the psychologist Stanley Milgram and his colleagues carried out an experiment with 296
individuals in Nebraska and Boston. Everyone was given a letter which had to be sent to a target
individual in Massachusetts. When sending this letter each person had to follow the instruction:
“If you know the target person, give the letter to him, otherwise give it to someone whom you
think is closer to the target.” In the course of many trials, 64 letters reached the target, through 5.2
intermediaries [5]. Since this experiment, this amount has become known in popular culture as
the “six degrees of separation” and indicates the degree of separation between two nodes. This
principle is also often spoken of as small-world phenomenon. Watts & Strogatz [11] studied
networks with low degrees of separation by carrying out a set of rewiring experiments on graphs,
and observed that a small world network can be found between a highly ordered network and a
randomly connected network just by varying the randomness p of the network connections
between regularity (p = 0) and disorder (p =1) (Figure 1).
4. International Journal of UbiComp (IJU), Vol.4, No.3, July 2013
14
Figure 1. Family of graphs varying randomness p of the network connections [11]
A small-world network is characterized by a clustering coefficient C and a path length L. Small-
world networks can be represented by directed or undirected graphs. Owing to the “undirected
nature” of Opportunistic Networks, we will only examine concepts of small-world networks as
undirected graphs (for more information see a good review and tutorial conducted by [12]).
Let kn be the degree (number of neighbors) of node n, and en be the number of edges (connected
pairs) among the nodes directly connected to node n. In undirected networks, the clustering
coefficient Cn of node n is defined as
Cn =
2
( − 1)
.Since en is never larger than
( − 1)
2, the clustering coefficient is a
fraction between 0 and 1.If the neighborhood is fully connected (forms a clique), the clustering
coefficient is 1 and a value close to 0 means that there are hardly any connections in the
neighborhood. The average clustering coefficient (also known as the clustering coefficient of the
graph or clustering coefficient for the whole network) is given by Watts and Strogatz as the
average of the local clustering coefficients of all the nodes, that is Č = ∑ .
The length of a path is the number of edges forming it. There may be multiple paths connecting
two given nodes. The shortest path length, also called distance, between two nodes n and m is
denoted by L(n,m). The average shortest path length is a measure of efficiency, that is the average
number of stops needed to reach two distant nodes in the graph. It is represented by
L(G) = 1
∗ ( − 1) ∗ ∑ ∑ ( , ) [12]. The lower the result, the more efficient is the
network in providing ease of circulation. In comparison, the diameter is the maximum length of
all possible shortest paths.
According to [11], [13] two properties distinguish a small world network. First, the average
clustering coefficient C is larger than for a corresponding random network with the same number
of connections and nodes. The clustering coefficient expected for a regular rectangular grid
network is zero while for a random network the probability p of connection of two nodes is the
same for neighboring nodes as for distant nodes. Second, the average path length L scales like
logN, where N is the number of nodes. For regular (grid) networks L scales as Nd where d is the
dimension of the space and for random networks L scales as logN. As result, C is large and L is
small in a small-world network. In other words, small-world networks have a low path length and
high clustering coefficient. These striking features have led us to analyze the application of
small-world concepts in Opportunistic Networks as an alternative for routing messages.
4. SMALL-WORLD CONCEPTS IN OPPORTUNISTIC NETWORKS
After introducing the small-world networks, we seek to understand how this class of graph can be
used in Opportunistic Networks. First we will use some tools in the field of social network
analysis to determine if selected real-world scenarios can be characterized as small-world
networks. We selected three real mobility traces for our analysis from Dartmouth College´s
5. International Journal of UbiComp (IJU), Vol.4, No.3, July 2013
15
CRAWDAD public repository covering different scenarios from sparse (campus) to dense
(conference) and collated in different contexts and through different methods. The selected
dataset consisted of MIT´s Reality, Infocom’06 and SIGCOM’09. These are public and well-
known by the academic community in the area of Opportunistic Networks. All the datasets
provide traces representing contacts between nodes. We define a contact as the period of time
during which two devices are in mutual radio transmission range and can exchange data. The
details of these datasets are listed below:
- Reality: The MIT´s Reality Mining trace logged contact communication, proximity, location,
and activity information from 100 subjects at MIT over the course of the 2004-2005 academic
year. According to the authors, this data represents over 350,000 hours (~40 years) of continuous
data on human behavior. This valuable supply of data on complex social systems has implications
for a variety of fields. The data is collected using smartphones by Bluetooth scans with a scanning
interval of 5 minutes. We obtained data from between 4,294,800 and 21,276,000 seconds with 97
devices.
- Infocom: This trace contains the contacts between participants in an Infocom’06 workshop. It
includes Bluetooth sightings by groups of users carrying Intel motes (iMote), a small battery
operated Bluetooth v1.1 radio with approximately 30 meter range for four days at the IEEE
Infocom Conference in Grand Hyatt Miami. The devices perform a device discovery every 120±5
seconds. In our case, we used data collected between 5,497 and 34,2915 seconds with 77 mobile
devices (20-97), plus 21 static devices.
- SIGCOMM: The trace contains data collected by an opportunistic mobile social application
called MobiClique. The application was used by 76 people during the SIGCOMM 2009
conference in Barcelona, Spain. The application uses Bluetooth for opportunistic contact
discovery and data communications. The device discovery is performed every 120±10 seconds.
The experimental devices have a Class 2 Bluetooth v2.1 radio with a range of 10 to 20 meters.
The data sets include traces of Bluetooth device proximity, opportunistic message creation and
dissemination, and the social profiles (friends and interests) of the participants. In our tests we
used a proximity trace set that contains all the nearby Bluetooth devices reported by the periodic
Bluetooth device discoveries between 21 and 349,811 seconds. We filtered the user_ids below
100 to get only the experimental devices (user_ids >= 100 are external Bluetooth devices seen
during the experiment).
We started our analysis by trying to obtain a better understanding of the selected dataset
scenarios. By using Gephi software, we visualized and analyzed the network graphs. Table 1
shows the results of our analysis. The graphical representation of contact graphs from
each dataset is shown in Figure 2. From the graphical representation we can see
Table 1. Resuls of graph analysis.
Reality Infocom SIGCOMM
Year 2004-2005 2006 2009
Setting Campus Conference Conference
Total nodes 96 98 76
Edges 305 4414 3730
Total Communities 4 3 6
Diameter 2 2 2
Radius: 1 1 2
Density 0.677 0,929 0,731
Average Node Degree 64,271 90,082 49,079
Number of Shortest Paths 9120 9506 5700
Average Path Length 1.3241 1.071 1,269
Average Clustering Coefficient 0,817 0,951 0,782
6. International Journal of UbiComp (IJU), Vol.4, No.3, July 2013
16
communities formed by node contacts and also note that all the scenarios have some common
feature like a small diameter and radius, that characterizes a large number of node contacts. In
Table 1, attention should be paid to the Average Path Length and Average Clustering Coefficient.
As we pointed out earlier, a small-world network has a low path length and high clustering
coefficient. In the case of the graphs above, when they were analyzed, they all had a low Average
Path Length (rounded down to ~ 1) and a high Average Clustering Coefficient (rounded up to ~
1) that are characteristics of small-world networks topologies. Hence, we can conclude that small-
world concepts can be applied in these kinds of scenarios.
(a) (b) (c)
Figure 2. Diagrams of different datasets (a) Infocom (b) Reality (c) SIGCOMM
5. SIMULATION AND EXPERIMENTAL RESULTS
This section will demonstrate how our experiments can apply small-world concepts in the
scenarios outlined above for message routing. It starts with a brief description of a simulation
setup, and describes some measurement parameters to make inferences about the performance of
route protocols. Following this, it shows our attempt to employ small-world concepts for routing
and ends with the simulation results.
5.1 Simulation setup
Our simulations were carried out by using ONE (Opportunistic Network Environment) Simulator
and the trace datasets mentioned earlier, as input. Owing to the different duration length of the
collected data (SIGCOMM:349811 seconds = 4.04 days; Reality:16981816 seconds = 196.5 days;
Infocom:337418 seconds = 3.9 days) we adopted the small duration length of three scenarios for
simulation time, in all of the experiments: 3.9 days round up = 4 days = 345600 seconds. We ran
each simulation scenario with the total number of nodes included in each dataset to maintain
contact fidelity. We assumed Bluetooth devices with a radio range of 20 meters and transmission
speed of 2 Mbit/s. On average, the nodes generated one message per minute (total of 5760
messages) in all of the experiments and the message lifetime was set to 24 hours (1440 seconds).
We used message sizes that were uniformly distributed between 100 KB (text message) and 2 MB
(digital photo).
One comment should be made about the duration of the contacts on the traces file: to simulate
contacts, ONE requires the timestamps when two nodes enter and leave their mutual radio
transmission range. In traces this is represented by the timestamp plus an indication about
whether the connection goes up or down. The Reality and Infocom dataset provide this data, but
the original SIGCOMM trace only provides the timestamp of the start connection and not when it
goes down. Without this information ONE cannot infer the duration of the contact. To overcome
7. International Journal of UbiComp (IJU), Vol.4, No.3, July 2013
17
this, we pre-processed the trace file and inserted missing lines to reflect contacts between nodes
(as required by the simulator). We adopted random duration periods ranging from 5 to 30
seconds. In making a comparison of our small-world approach with other works, we selected
some current routing algorithms which could be used in simulations. The selected algorithms
were Epidemic, Prophet, DRAFT and BubbleRap. These were chosen because they represent the
different classes of protocols (as outlined in Section 2) and have been extensively studied by
researchers.
Some of the chosen protocols do not need configuration parameters, such as Epidemic. In others,
we have to set it to run simulations. For Prophet we set secondsInTimeUnit = 30. For DRAFT we
set familiarThreshold = 120, degrade = 0.5 and framesize = 3600. For Bubblerap we set K = 5,
familiarThreshold = 700, centralityTimeWindow = 21600 and epoch_count = 16 (i.e. simulation
time of 345600 seconds / centralityTimeWindow 21600 = 16).
5.2 Evaluation metrics
In the case of evaluation we adopt same performance metrics used by [8] and supported by ONE
Simulator:
• Create: Number of messages created during simulation - does not include replicated
messages;
• Relayed: number of successful transmissions between nodes;
• Delivered: number of successfully delivered messages;
• Overhead ratio: an assessment of bandwidth efficiency. Uses the formula
(Number of Relayed Messages – Number of Delivered messages) / Number of Delivered Messages
• Latency_med: median of average message delay
• Hopcount_avg: Average number of hops between source and destination nodes.
5.3 Research evolution
To support the argument that each node is separated by, at most, six hops (six degree conjecture)
we formulate a quite simple algorithm called Small-World:
Algorithm: Small-World
Given: every node n ϵ N
for t = 1;…;T:
if node ni find a node nj then
if buffer of node ni have a message mk with destination to node nk then
if distance djk of nj to nk < 6 then
forward mk to nj
remove mk from ni buffer
endif
endif
endif
endfor
It strictly obeys the small-world assumption and we think it could route messages between the
nodes. The simulation results (Table 2) were disappointing. Small-World only delivered 0.45% to
3.2% of 5760 messages in all the scenarios.
8. International Journal of UbiComp (IJU), Vol.4, No.3, July 2013
18
Table 2. Simulation results from the simple approach.
Infocom Reality Sigcomm
Epidemic
313 17 154 Delivered
1460382
4664,7572
11339
666
124361
806,539
Relayed
Overhead
Prophet
637 36 196 Delivered
937740
1471,1193
20722
574,6111
61082
310,6429
Relayed
Overhead
DRAFT
439 27 152 Delivered
1002289
2282,1185
17747
656,2963
25044
163,7632
Relayed
Overhead
BubbleRap
469 27 137 Delivered
126135
267,9446
1841
67,1852
20892
151,4964
Relayed
Overhead
Small-World
185 26 118 Delivered
1239121
4346,7929
10019
384,3462
78151
661,2966
Relayed
Overhead
The poor performance of our first attempt encouraged us to think about how to improve it. Thus,
we decided to assign a weight to each graph edge to represent the number of contacts between
two nodes. When one node encounters another and there is an edge between them, the edge
weight will be incremented by one; else (if there is no edge) it will be created with the initial
weight = 1. In view of this, we changed our first approach so that we could forward a message
just as if the weight of the edge was greater than κ (we used κ = 3 to represent the fact that these
nodes had previously encountered each other three times). We called this modification ¨Weighted
Small-World¨ and the pseudo-code was as follows:
Algorithm: Weighted Small-World
Given: every node n ϵ N
for t = 1;…;T:
if node ni find a node nj then
update edgeWeightij
if buffer of node ni have a message mk with destination to node nk then
if distance djk of nj to nk < 6 and edgeWeightik > κ then
forward mk to nj
remove mk from ni buffer
endif
endif
endif
endfor
Table 3. Results of the comparison between the two approaches.
Infocom Reality Sigcomm
Small-World
185 26 118 Delivered
4346,7929 384,3462 661,2966 Overhead
Weighted
Small-World
299 29 126 Delivered
5014,194 838,2069 611,1984 Overhead
In Table 3, only the results of Small-World and Weighted Small-World are shown, to make a
comparison. We can note a slight improvement in the performance of the weighted version
compared with the former, but it is still far from the other protocols used in the simulations.
9. International Journal of UbiComp (IJU), Vol.4, No.3, July 2013
19
After some experiments with simulations, we discovered that used scenarios are highly dynamic
and the patterns of the movements of humans lead to vertices in the graph with obsolete edges
between them. These edges that was biasing the distance calculation used by our previous Small-
World approaches, resulting in a poor performance. This occurs because the graph representation
does not take account of temporal factors such as time, duration and frequency of previous
encounters. A similar assessment of spatio-temporal clusters was previously carried out by [8]
and later exploited by the DRAFT protocol [14]. We used this observation to guide our further
steps. However, instead of detecting lost spatio-temporal clusters by allowing clusters to decay
over time (as used in DRAFT), we formulated an improvement of our previous attempt called
Temporal Small World. Our strategy was the same as that used in Weighted Small-World
(weighted edges according to number of contacts) but we kept removing the obsolete edges (i.e.
the nodes that had not encountered each other in some time interval). The pseudo-code of
Temporal Small World can be represented as a variation of Weighted Small-World with some
added stages to store the time of contact between two nodes and include a loop to periodically
update the edges:
Algorithm: Temporal Small-World
Given: every node n ϵ N
for t = 1;…;T:
if node ni find a node nj then
update edgeWeightij
update edgeTimeij
if buffer of node ni have a message mk with destination to node nk then
if distance djk of nj to nk < 6 and edgeWeightik > κ then
forward mk to nj
remove mk from ni buffer
endif
endif
endif
for each vertice v of G
for each edge e with vertice j adjacent to v
if edgeTime evj > maxAge τ then
remove edges evj and ejv .
endif
endfor
endfor
endfor
5.4 Experimental Results
We conducted a set of experiments to test the performance of our Temporal Small-World
proposal. Our first experiment was to understand the implication of value of maxAge τ in
expiration of obsolete edges and how it would have an impact on the routing performance. In the
simulations, we tested τ with values of 1800, 3600, 21600 and 86400 seconds (i.e. 30 minutes, 1
hour, 6 hours and 24 hours). The results are shown in Table 4.
10. International Journal of UbiComp (IJU), Vol.4, No.3, July 2013
20
Table 4. Impact of the variation of τ
τ (in seconds) Infocom Reality Sigcomm
1800
486 29 177 Delivered
787028
1618,3992
980
32,7931
27327
153,3898
Relayed
Overhead
3600
458 33 166 Delivered
1003633
2190,3384
6617
199,5152
36395
218,2470
Relayed
Overhead
21600
363 31 166 Delivered
1354832
3731,3196
19467
626,9677
36395
218,2470
Relayed
Overhead
84600
311 33 135 Delivered
1770544
5692,0675
24987
756,1818
74665
552,0741
Relayed
Overhead
As can be seen, the best performance in all of the scenarios was with lower τ values. This fact
indicates our initial belief that obsolete edges really have an impact on message routing. The
improvement in performance can be witnessed by the number of messages delivered. In the
Infocom scenario, we increased the number of delivered messages from 118 in our first attempt to
adopt the original Small-World approach to 486 with Temporal Small-World (+ 24%) but with
+40% of overhead.
After this, we carried out some simulations and plotted the performance of Temporal Small-
World with other selected protocols (Figure 3). It should be highlighted that although it produced
+40% of overhead, when this criterion was adopted, Temporal Small-World was better than
Epidemic and DRAFT in all the scenarios and either worse or better than Prophet and BubleRap,
but in all cases with relatively similar results.
(a) Infocom (b) Reality
(c) SIGCOMM
Figure 3. Performance of different protocols in selected scenarios: (a)Infocom (b)Reality
(c)SIGCOMM
11. International Journal of UbiComp (IJU), Vol.4, No.3, July 2013
21
With regard to the number of delivered messages, the results demonstrate that Temporal Small-
World had the second best ratio in all the scenarios (Prophet was the first). What caught our
attention was the number of relayed messages of Prophet that ranged from 19% (Infocom) to
213% (Reality) and was more than Temporal Small-World in all the scenarios. We recall that to
relay messages, mobile devices use battery power for processing and data transmission; thus a
high value of this indicator could influence the battery life of these devices. Another finding is the
low number of relayed messages of BubbleRap that vary between 24% to 84%, which is less than
Temporal Small-World. We believe that this ratio can be attributed to the strategy of only
relaying messages to members of community of interest. However, we argue that this indicator
could be better investigated in the light of issues arising from battery and community detection in
future research studies.
In the final analysis, we believe that Temporal Small-World can overcome the Prophet results
with fine tuning of max age τ and number of previously encountered κ variables. Nevertheless,
owing to the wide range of factors involved in human mobility, this task could be better
performed by some statistical or machine learning method that was able to predict the most
suitable value.
6. CONCLUSION AND FUTURE WORK
Opportunistic Networks are able to exploit social behavior to build connectivity opportunities.
This study analysed the feasibility of applying the concepts of small-world networks to improve
routing.
We proposed a simple approach based on small-world networks called Temporal Small World for
routing and showed how it could outperform some popular protocols by means of simulations. It
can be concluded that static graph models are not well suited to underlay routing approaches in
highly dynamic networks like Opportunistic Networks without taking account of temporal factors
such as time, duration and frequency of encounters.
In future work, we will investigate which technique can be used to fine tune max age τ and the
number of previously encountered κ variables. We believe that a prediction of these values using
contextual information could improve the performance of our algorithm.
REFERENCES
[1] S. K. Das, “Pervasive computing vs. cyber-physical systems: A perspective from smart
environments,” in 2012 IEEE International Conference on Pervasive Computing and
Communications Workshops, 2012, pp. 105–105.
[2] M. Conti, S. Giordano, M. May, and A. Passarella, “From opportunistic networks to opportunistic
computing,” IEEE Communications Magazine, vol. 48, no. 9, pp. 126–139, Sep. 2010.
[3] C. Boldrini, M. Conti, and A. Passarella, “Design and performance evaluation of ContentPlace, a
social-aware data dissemination system for opportunistic networks,” Computer Networks, vol. 54,
no. 4, pp. 589–604, Mar. 2010.
[4] M. Conti and M. Kumar, “Opportunities in Opportunistic Computing,” Computer, vol. 43, no. 1,
pp. 42–50, Jan. 2010.
[5] S. Milgram and J. Travers, “The Small World Problem - An Experimental Study of the Small
World Problem,” Psychology Today, vol. 2, no. 4, pp. 60–67, 1967.
[6] D. Karamshuk, C. Boldrini, M. Conti, and A. Passarella, “Human mobility models for opportunistic
networks,” IEEE Communications Magazine, vol. 49, no. 12, pp. 157–165, Dec. 2011.
12. International Journal of UbiComp (IJU), Vol.4, No.3, July 2013
22
[7] H. Anh Nguyen and S. Giordano, “Routing in Opportunistic Networks,” in Ubiquitous
Developments in Ambient Computing and Intelligence, K. Curran, Ed. IGI Global, 2011, pp. 179–
193.
[8] P. Hui, “People are the network: experimental design and evaluation of social-based forwarding
algorithms,” Cambridge, 2008.
[9] H. A. Nguyen and S. Giordano, “Context information prediction for social-based routing in
opportunistic networks,” Ad Hoc Networks, vol. 10, no. 8, pp. 1557–1569, Nov. 2012.
[10] C. Boldrini, J. Y. Le Boudec, A. Chaintreau, and M. Conti, “Deliverable 2.2: Final specification of
forwarding paradigms in Haggle,” 2008.
[11] D. J. Watts and S. H. Strogatz, “Collective dynamics of ‘small-world’ networks.,” Nature, vol. 393,
no. 6684, pp. 440–2, Jun. 1998.
[12] B. J. Prettejohn, M. J. Berryman, and M. D. McDonnell, “Methods for generating complex
networks with selected structural properties for simulations: a review and tutorial for
neuroscientists.,” Frontiers in computational neuroscience, vol. 5, p. 11, Jan. 2011.
[13] D. Simard, L. Nadeau, and H. Kröger, “Fastest learning in small-world neural networks,” Physics
Letters A, vol. 336, no. 1, pp. 8–15, Feb. 2005.
[14] M. Orlinski and N. Filer, “The rise and fall of spatio-temporal clusters in mobile ad hoc networks,”
Ad Hoc Networks, Mar. 2013.