Charging support for ad hoc stub networks

Lamparter, Bernd; Paul, Krishna; Westhoff, Dirk

doi:10.1016/s0140-3664(03)00034-3

Cited by 58 publications

(40 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors of [5] and [6] propose similar charging schemes, where cooperative nodes get rewarded in a multihop cellular network environment. They both heavily rely on centralized accounting and security mechanisms.…”

Section: Related Workmentioning

confidence: 99%

Liveliness evaluation of a cooperation and accounting strategy in hybrid networks

Weyland

Staub

Braun

2004

2004 4th Workshop on Applications and Services in Wireless Networks, 2004. ASWN 2004.

View full text Add to dashboard Cite

Abstract-We propose a cooperation and accounting scheme for multi-hop cellular networks, which stimulates cooperation among nodes by making it a rewarding alternative to selfishness. The paper describes an architecture with highly decentralized security and accounting mechanisms. Our scheme charges senders and rewards forwarders, supports both sender-and receiverbased payments and coexists with ad hoc only traffic. We use of service stations deployed throughout the network to offer nodes a possibility to refill their money accounts. We present the results of simulation runs, where we investigated the liveliness of the proposed scheme. We find that the number of service stations and their distribution correlate in different ways.

show abstract

Section: Related Workmentioning

confidence: 99%

Liveliness evaluation of a cooperation and accounting strategy in hybrid networks

Weyland

Staub

Braun

2004

2004 4th Workshop on Applications and Services in Wireless Networks, 2004. ASWN 2004.

View full text Add to dashboard Cite

show abstract

“…In [3] rewards have been introduced as incentive for cooperation in mobile ad hoc networks. The authors of [4] and [5] extended this notion to the multi-hop cellular network environment. They both heavily rely on centralized accounting and security mechanisms.…”

Section: Introductionmentioning

confidence: 99%

Comparison of Incentive-Based Cooperation Strategies for Hybrid Networks

Weyland

Staub

Braun

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Today's public Wireless LANs are restricted to hotspots. With the current technology, providers can only target a small audience and in turn charge high prices for their service to generate revenue. Also, providers can not react appropriate to dynamic changes of the demand. With multi-hop cellular networks the coverage area can be increased and the installation costs and investment risks for the provider can be reduced. However, the individual customers play an important role in such networks and their participation must be encouraged. Therefore, we propose a cooperation and accounting scheme which introduces monetary rewards. We compare our scheme called CASHnet with the Nuglet scheme using simulations under the criteria of network liveliness as well as goodput, overhead and packet error rate.

show abstract

“…Our approach focuses on problems that are inherent to pure pervasive and ad-hoc networks. For example, our solution is suited to cooperation and motivation based schemes [7][3] [9] as well as secure routing methods. These schemes require a large number of authentication steps for which ZCK authentication is strong enough.…”

Section: Introductionmentioning

confidence: 99%

Zero Common-Knowledge Authentication for Pervasive Networks

Weimerskirch

Westhoff²

2004

Selected Areas in Cryptography

View full text Add to dashboard Cite

Abstract. Ad-hoc networks and even more intrinsic pervasive networks face huge security lacks. In the most general case entities need to build up a well-defined security association without any pre-established secret or common security infrastructure. Under these circumstances it turns out that without unrealistic assumptions authentication of previously unknown parties is not achievable. However, for a wide spectrum of scenarios much weaker authentication forms are reasonable, e.g., for routing protocols and other protocols aiming to intensify cooperation. Like in real world when foreign subjects meet for the very first time, inferring the opposites identity is impossible. Nevertheless even from this zero common-knowledge status some minor level of trust establishment is possible for both scenarios, in real world and on a technical level. In this paper we will present a very light-weight still provably secure authentication protocol not aiming at inferring the involved entities' identities but re-recognizing foreign communication partners whenever necessary. We do not make any assumptions to the scenario, and we also have no requirements for the devices' abilities. For the technical realization we propose extremely efficient security primitives applicable for nearly all types of restricted devices. Our solution is more efficient than a publickey operation by some orders of magnitude.

show abstract

Charging support for ad hoc stub networks

Cited by 58 publications

References 6 publications

Liveliness evaluation of a cooperation and accounting strategy in hybrid networks

Liveliness evaluation of a cooperation and accounting strategy in hybrid networks

Comparison of Incentive-Based Cooperation Strategies for Hybrid Networks

Zero Common-Knowledge Authentication for Pervasive Networks

Contact Info

Product

Resources

About