scholarly journals Adaptive mobile visualization - the chameleon framework

2015 ◽  
Vol 12 (2) ◽  
pp. 445-464 ◽  
Author(s):  
Paulo Pombinho ◽  
Maria Carmo ◽  
Ana Afonso

The evolution of mobile devices and the development of high speed wireless networks have supported a widespread use of these devices with increasingly more complex applications. This reality has fostered the research in the field of information visualization in mobile devices. However, the limited screen space, resource constraints and interaction restrictions impose difficulties to developers and users of these applications. An approach to address these problems is to adapt the visualization to the user context. However, these proposals are normally designed in an ad-hoc fashion and are difficult to generalize. In addition, existing solutions are focused only in some subset of possible characteristics of the user context or only address a very specific domain and related adaptations. The objective of this paper is to present the design of a framework for adaptive mobile visualization (AMV) applications, denominated Chameleon, and the development and evaluation of prototypes that use this conceptual-based framework.

Author(s):  
M.A. Sánchez-Acevedo ◽  
E. López-Mellado ◽  
F. Ramos-Corchado

Self-organization is a phenomenon in nature which has been studied in several areas, namely biology, thermodynamics, cybernetics, computing modeling, and economics. Systems exhibiting self-organization have well defined characteristics such as robustness, adaptability, and scalability, which make self-organization an attractive field of study for two kinds of applications: a) maintaining the communication among mobile devices in wireless networks, and b) coordination of swarms of mobile robots. In ad hoc networks, there is not necessarily an underlying infrastructure in which the nodes can maintain communicated with other nodes; so due to this feature, it is necessary to provide efficient self-organization algorithms for routing, managing, and reconfiguring the network. Furthermore, self-organization in nature provide clear examples about how complex behaviors can arise from only local interaction between entities, namely the ants colony, feather formation, and flock of birds. Based on the above mentioned examples, several algorithms have been proposed to accomplish robot formations using only local interactions. Due to resource constraints in mobile devices, selforganization requires simple algorithms for maintaining and adapting wireless networks. The use of resources for establishing robot formations can be reduced by improving simple rules to accomplish the formation. This article first presents a brief overview of several works developed in ad hoc networks; then, delves deeper into the key algorithms; and finally, challenges arising in this area are discussed.


Author(s):  
Biju Issac

Wireless networks and the subsequent mobile communication are growing by leaps and bounds in the past years and the demand for connection without cables is certainly high. Nowadays, wireless networks are quite common and can be found on university campuses, corporate offices and in public places like hotels, airports, coffee shops and so forth. Not only are mobile devices getting smaller and cheaper, they are also becoming more efficient and powerful, capable of running applications and network services. This is causing the uncontrollable growth of mobile computing as we are witnessing today. Among the many number of applications and services that are executed by mobile devices, network and data services are in high demand. Brief descriptions of some selective wireless technologies that help mobile computing, like IEEE 802.11 networks (with infrastructure mode and ad-hoc mode), Bluetooth, HomeRF, WiMAX and cellular technologies are given below.


Author(s):  
Tonghong Li

Mobile ad hoc networks (MANETs) are becoming popular due to the abundance of mobile devices, the speed and the convenience of deployment, and the independence of network infrastructure (Chin, 2002; Royer, 1999). It is desired that MANETs be interconnected to fixed IP networks so that the Internet services can be offered to MANET nodes. In such scenarios, commonly known as hybrid ad hoc networks, mobile nodes (MNs) are viewed as an easily deployable extension to the existing infrastructure. Gateways (GWs) are installed, which can be used by MNs to communicate with nodes in the fixed network.


Electronics ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 225 ◽  
Author(s):  
Jiaqi Liu ◽  
Shiyue Huang ◽  
Hucheng Xu ◽  
Deng Li ◽  
Nan Zhong ◽  
...  

As a special mobile ad-hoc network, Vehicular Ad-hoc Networks (VANETs) have the characteristics of high-speed movement, frequent topology changes, multi-hop routing, a lack of energy, storage space limitations, and the possible selfishness of the nodes. These characteristics bring challenges to the design of the incentive mechanism in VANETs. In the current research on the incentive mechanism of VANETs, the mainstream is the reward-based incentive mechanism. Most of these mechanisms are designed based on the expected utility theory of traditional economics and assume that the positive and negative effects produced by an equal amount of gain and loss are equal in absolute value. However, the theory of loss aversion points out that the above effects are not equal. Moreover, this will lead to a deviation between the final decision-making behavior of nodes and the actual optimal situation. Therefore, this paper proposed a Loss-Aversion-based Incentive Mechanism (LAIM) to promote the comprehensive perception and sharing of information in the VANETs. This paper designs the incentive threshold and the threshold factor to motivate vehicle nodes to cooperate. Furthermore, based on the number of messages that the nodes face, the utility function of nodes is redesigned to correct the assumption that a gain and a loss of an equal amount could offset each other in traditional economics. The simulation results show that compared with the traditional incentive mechanism, the LAIM can increase the average utility of nodes by more than 34.35%, which promotes the cooperation of nodes.


Sign in / Sign up

Export Citation Format

Share Document