On the Impact of Caching and a Model for Storage-Capacity Measurements for Energy Conservation in Asymmetrical Wireless Devices

Traffic and channel-data rate combined with the stream oriented methodology can provide a scheme for offering optimized and guaranteed QoS. In this work a stream oriented modeled scheme is proposed based on each node's self-scheduling energy management. This scheme is taking into account the overall packet loss in order to form the optimal effective -for the end-to-end connection- throughput response. The scheme also -quantitatively- takes into account the asymmetrical nature of wireless links and the caching activity that is used for data revocation in the ad-hoc based connectivity scenario. Through the designed middleware and the architectural layering and through experimental simulation, the proposed energy-aware management scheme is thoroughly evaluated in order to meet the parameters' values where the optimal throughput response for each device/user is achieved.Comment: IEEE Communication Society (COMSOC), 16th International Conference on Software, Telecommunications and Computer Networks (SoftCOM 2008), September 25 & 26 2008, "Dubrovnik", September 27, Split and Dubrovnik, pp. 243-24

A Resource Intensive Traffic-Aware Scheme for Cluster-based Energy Conservation in Wireless Devices

Wireless traffic that is destined for a certain device in a network, can be exploited in order to minimize the availability and delay trade-offs, and mitigate the Energy consumption. The Energy Conservation (EC) mechanism can be node-centric by considering the traversed nodal traffic in order to prolong the network lifetime. This work describes a quantitative traffic-based approach where a clustered Sleep-Proxy mechanism takes place in order to enable each node to sleep according to the time duration of the active traffic that each node expects and experiences. Sleep-proxies within the clusters are created according to pairwise active-time comparison, where each node expects during the active periods, a requested traffic. For resource availability and recovery purposes, the caching mechanism takes place in case where the node for which the traffic is destined is not available. The proposed scheme uses Role-based nodes which are assigned to manipulate the traffic in a cluster, through the time-oriented backward difference traffic evaluation scheme. Simulation study is carried out for the proposed backward estimation scheme and the effectiveness of the end-to-end EC mechanism taking into account a number of metrics and measures for the effects while incrementing the sleep time duration under the proposed framework. Comparative simulation results show that the proposed scheme could be applied to infrastructure-less systems, providing energy-efficient resource exchange with significant minimization in the power consumption of each device.Comment: 6 pages, 8 figures, To appear in the proceedings of IEEE 14th International Conference on High Performance Computing and Communications (HPCC-2012) of the Third International Workshop on Wireless Networks and Multimedia (WNM-2012), 25-27 June 2012, Liverpool, U

A Gossip-based optimistic replication for efficient delay-sensitive streaming using an interactive middleware support system

While sharing resources the efficiency is substantially degraded as a result of the scarceness of availability of the requested resources in a multiclient support manner. These resources are often aggravated by many factors like the temporal constraints for availability or node flooding by the requested replicated file chunks. Thus replicated file chunks should be efficiently disseminated in order to enable resource availability on-demand by the mobile users. This work considers a cross layered middleware support system for efficient delay-sensitive streaming by using each device's connectivity and social interactions in a cross layered manner. The collaborative streaming is achieved through the epidemically replicated file chunk policy which uses a transition-based approach of a chained model of an infectious disease with susceptible, infected, recovered and death states. The Gossip-based stateful model enforces the mobile nodes whether to host a file chunk or not or, when no longer a chunk is needed, to purge it. The proposed model is thoroughly evaluated through experimental simulation taking measures for the effective throughput Eff as a function of the packet loss parameter in contrast with the effectiveness of the replication Gossip-based policy.Comment: IEEE Systems Journal 201

Total order in opportunistic networks

Opportunistic network applications are usually assumed to work only with unordered immutable messages, like photos, videos, or music files, while applications that depend on ordered or mutable messages, like chat or shared contents editing applications, are ignored. In this paper, we examine how total ordering can be achieved in an opportunistic network. By leveraging on existing dissemination and causal order algorithms, we propose a commutative replicated data type algorithm on the basis of Logoot for achieving total order without using tombstones in opportunistic networks where message delivery is not guaranteed by the routing layer. Our algorithm is designed to use the nature of the opportunistic network to reduce the metadata size compared to the original Logoot, and even to achieve in some cases higher hit rates compared to the dissemination algorithms when no order is enforced. Finally, we present the results of the experiments for the new algorithm by using an opportunistic network emulator, mobility traces, and Wikipedia pages.Peer ReviewedPostprint (author's final draft

Development of mobile IoT solutions: approaches, architectures, and methodologies

Modern Living, as we know it, has been impacted meaningfully by the Internet of Things (IoT). IoT consists of a network of things that collect data from machines (e.g., mobile devices) and people. Mobile application development is a flourishing tendency, given the increasing popularity of smartphones. Nowadays, users are accessing their desired services on the smartphone by means of dedicated applications as the latter offers a more customized and prompt service. In addition, companies are also looking to persuade users by offering interactive and effective mobile applications. Mobile application developers are using IoT to develop better applications. However, there is no generalized consensus on the selection of best architecture or even the most suitable communications protocols to be used on an IoT application development. Therefore, this article aims at presenting approaches, architectures, and methodologies relevant to the development of mobile IoT solutions

Computing paradigms in emerging vehicular environments: a review

Determining how to structure vehicular network environments can be done in various ways. Here, we highlight vehicle networks' evolution from vehicular ad-hoc networks (VANET) to the internet of vehicles (IoVs), listing their benefits and limitations. We also highlight the reasons in adopting wireless technologies, in particular, IEEE 802.11p and 5G vehicle-to-everything, as well as the use of paradigms able to store and analyze a vast amount of data to produce intelligence and their applications in vehicular environments. We also correlate the use of each of these paradigms with the desire to meet existing intelligent transportation systems' requirements. The presentation of each paradigm is given from a historical and logical standpoint. In particular, vehicular fog computing improves on the deficiences of vehicular cloud computing, so both are not exclusive from the application point of view. We also emphasize some security issues that are linked to the characteristics of these paradigms and vehicular networks, showing that they complement each other and share problems and limitations. As these networks still have many opportunities to grow in both concept and application, we finally discuss concepts and technologies that we believe are beneficial. Throughout this work, we emphasize the crucial role of these concepts for the well-being of humanity

An on Demand Path Marking and Capacity Reservation Method using Split Agent

Different schemes for large scale networks hosting distributed applications have been recently adopted for network path marking based on adaptive behavior of swarm-based agents. Topologically complex networks must use efficient routing methods in order to route data traffic from a source to a destination. In this paper the Split Agent-based Routing Technique (SART) is applied to a network in which a certain amount of data traffic is injected to mark different paths. Split Agent-based Routing Technique (SART) [Split agent-based routing in interconnected networks] is a variant of swarm-based routing [Ant-based Load Balancing in Telecommunications Networks, Ant based probabilistic routing with pheromone and antipheromone mechanisms] where agents are split after their departure to the next node on a hop-by-hop basis at the same time performing path marking. Packets that are delay sensitive are marked as prioritized. Agents recognize these packets as being a part of, and try to influence the two way routing tables. Thorough examination has been done for the performance and path recoverability using SART algorithm for marking any requested path, taking into account a number of metrics. It is shown that the split agent scheme offers an efficient on demand path marking and path-capacity reservation in a decentralized manner (particularly efficient for large scale networks). SART method undoubtedly represents a solution for significant network optimization particularly for the equal share of network resources. Also it is shown that this scheme offers a way to increase overall performance

Segmented File Sharing with Recursive Epidemic Placement Policy for Reliability in Mobile Peer-to-Peer Devices

Peer-to-Peer applications have become highly popular in today's pervasive environments due to the spread of different file sharing platforms. In such a multiclient environment, if users have mobility characteristics, asymmetry in communication causes a degradation of reliability. This work proposes an approach based on the advantages of epidemic selective resource placement through mobile Infostations. Epidemic Placement Policy combines the strengths of both proactive multicast group establishment and hybrid Infostation concept. With epidemic selective placement we face the flooding problem locally (in geographic region/landscape) and enable end to end reliability by forwarding requested packets to epidemically ‘selected’ mobile users in the network on a recursive basis. The selection of users is performed based on their remaining capacity, weakness of their signal and other explained mobility limitations. Examination through simulation is performed for the response and reliability offered by epidemic placement policy which reveals the robustness and reliability in file sharing among mobile peers

Performance evaluation of an on demand tunable resource allocation apparatus using constrained active network

Resource allocation strategy must offer a robust way for the best assignment of resources to network while at the same time enabling equal share of network resources. This work proposes an active network conceptual model suited for the network resource allocation problem. This constrained active network allocates network resources to each demand performing capacity allocation and bandwidth reservation. Swarm-based active packets continuously communicate with active nodes by using the Split Agent Routing Technique (SART) and inform active nodes about available resources on previously visited node(s) and links. This apparatus enables adaptation of the system to new conditions (bandwidth reservation/capacity allocation). It also enables additional information to be passed to neighboring nodes for which information is embodied in transmitted packets. Thorough examination is made, for the performance of the proposed scheme in the network and the QoS offered, taking into account a number of performance metrics. Simulation results show that this swarm-based active network scheme offers a decentralized control and an efficient way to increase overall performance enabling at the same time optimized throughput