No abstract

Most schemes in mobile social networks (MSNs) assume that nodes simply forward messages without considering selfishness. We therefore first devise social preference-based selfishness for MSNs by which nodes decide to drop or keep (forward) and replace messages to save buffer space according to the message preference and the communities of nodes. We then propose a novel cooperative forwarding scheme for social preference-based selfishness in MSNs, the social preferenceaware forwarding scheme (SPF) incorporates the proposed message forwarding scheme and a buffer replacement policy for the message preference. It takes advantage of social information with the home-cell community-based mobility model. Considering the contact probability and buffer replacement policy for the message preferences, SPF, therefore, efficiently delivers messages to the destination by reflecting the degree of selfishness to which nodes cooperatively manage their buffer spaces and how frequently and how recently they meet. Consequently, all nodes can cooperatively drop or keep (forward) and replace the messages in the buffer spaces for the message preferences in SPF. SPF outperforms Epidemic, PRoPHET, and SimBet in terms of delivery ratio, network traffic, buffer space, hop count, and replacement frequency.

No abstract

No abstract

To support mobile/wireless networking environment, we consider a mobile router which is connected via dual interfaces with WiBro (i.e., Mobile WiMAX) and high-speed downlink packet access (HSDPA) in a moving vehicle. The mobile router can support multihoming features using the extended version of mobile IP (MIP) protocol for multiple interfaces. In our multihoming environment, we propose the dynamic interface selection mechanism using policy routing to provide redundancy and fault tolerance. The proposed mechanism decides the preference of interfaces and checks the availability of selected interface in dynamic interface selection agent. Our proposal aims to achieve benefits of interface selection according to flow characteristics and automatic interface reestablishment against link failure, etc. We also show some experimental results.